-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathstring-parsing.js
188 lines (84 loc) · 2.14 KB
/
string-parsing.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
#!/usr/bin/env node
const fetch = require('node-fetch');
const Async = require('crocks/Async');
const Maybe = require('crocks/Maybe');
const Either = require('crocks/Either');
const Helpers = require('crocks/Helpers');
const { Rejected, Resolved } = Async;
const { Just, Nothing } = Maybe;
const { Left, Right } = Either;
const { pipe, liftA2 } = Helpers;
// This is a code excercise to show how
// using function composition can be not
// only more robust, but more reusable,
// reliable, and testable.
// What are pure functions?
// What can they look like in JS?
//Pure Functions
function pureA(a) { //Identity
return a;
}
const pureB = a => { //Constant
return 1;
}
const pureC = a => b => a + b
const impureA = a => {
console.log(a)
return a;
}
const impureB = url => {
return fetch(url);
}
//get the count of 'words' in this string
// (the letters represent the 'words')
let st = "a b c\nd e f\ng h i"
// Problem: write code to parse the string above and
// return the count of 'words' (in this case just letters)
//Simple solution:
st.replace('\n', ' ').split(' ').length
//What problems can arise from using this code?
var a = s.split('\n')
a.split()
const line = s => s.split('\n')
const word = s => s.split(' ')
const lift = a => a.reduce((acc, v) => [...acc, ...v ] , [] )
const map = f => a => a.map(f)
const length = arr => arr.length
console.log(lift(line(st).map(word)).length)
let a = pipe(
line,
map(word),
lift,
length
)(st)
console.log(a)
//get the lines
//then words
//
//lift
//count them
//let st = "a b c\nd e f\ng h i"
//console.log(st.split(' '))
// const lines = s => s.split('\n')
// const words = s => s.split(' ')
// const map = f => a => a.map(f)
// const length = a => a.length
// console.log(lines(st).map(words))
// const pipe2 =
// (p1, p2, v) => [v].map(p1).map(p2)[0]
// const liftArray =
// a => a.reduce((acc, v) => [...acc, ...v], [])
// console.log(
// pipe(
// lines,
// map(words),
// liftArray,
// length)
// (st)
// )
// console.log(
// pipe2(
// lines,
// map(words),
// st)
// )