This repository has been archived by the owner on Mar 28, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy patheither.js
448 lines (367 loc) · 11.5 KB
/
either.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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
// Copyright (c) 2013-2014 Quildreen Motta <quildreen@gmail.com>
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation files
// (the "Software"), to deal in the Software without restriction,
// including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software,
// and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
/**
* @module lib/either
*/
module.exports = Either
// -- Aliases ----------------------------------------------------------
var clone = Object.create
var unimplemented = function(){ throw new Error('Not implemented.') }
var noop = function(){ return this }
// -- Implementation ---------------------------------------------------
/**
* The `Either(a, b)` structure represents the logical disjunction between `a`
* and `b`. In other words, `Either` may contain either a value of type `a` or
* a value of type `b`, at any given time. This particular implementation is
* biased on the right value (`b`), thus projections will take the right value
* over the left one.
*
* This class models two different cases: `Left a` and `Right b`, and can hold
* one of the cases at any given time. The projections are, none the less,
* biased for the `Right` case, thus a common use case for this structure is to
* hold the results of computations that may fail, when you want to store
* additional information on the failure (instead of throwing an exception).
*
* Furthermore, the values of `Either(a, b)` can be combined and manipulated by
* using the expressive monadic operations. This allows safely sequencing
* operations that may fail, and safely composing values that you don't know
* whether they're present or not, failing early (returning a `Left a`) if any
* of the operations fail.
*
* While this class can certainly model input validations, the [Validation][]
* structure lends itself better to that use case, since it can naturally
* aggregate failures — monads shortcut on the first failure.
*
* [Validation]: https://github.com/folktale/data.validation
*
*
* @class
* @summary
* Either[α, β] <: Applicative[β]
* , Functor[β]
* , Chain[β]
* , Show
* , Eq
*/
function Either() { }
Left.prototype = clone(Either.prototype)
function Left(a) {
this.value = a
}
Right.prototype = clone(Either.prototype)
function Right(a) {
this.value = a
}
// -- Constructors -----------------------------------------------------
/**
* Constructs a new `Either[α, β]` structure holding a `Left` value. This
* usually represents a failure due to the right-bias of this structure.
*
* @summary a → Either[α, β]
*/
Either.Left = function(a) {
return new Left(a)
}
Either.prototype.Left = Either.Left
/**
* Constructs a new `Either[α, β]` structure holding a `Right` value. This
* usually represents a successful value due to the right bias of this
* structure.
*
* @summary β → Either[α, β]
*/
Either.Right = function(a) {
return new Right(a)
}
Either.prototype.Right = Either.Right
// -- Conversions ------------------------------------------------------
/**
* Constructs a new `Either[α, β]` structure from a nullable type.
*
* Takes the `Left` case if the value is `null` or `undefined`. Takes the
* `Right` case otherwise.
*
* @summary α → Either[α, α]
*/
Either.fromNullable = function(a) {
return a != null? new Right(a)
: /* otherwise */ new Left(a)
}
Either.prototype.fromNullable = Either.fromNullable
/**
* Constructs a new `Either[α, β]` structure from a `Validation[α, β]` type.
*
* @summary Validation[α, β] → Either[α, β]
*/
Either.fromValidation = function(a) {
return a.fold(Either.Left, Either.Right)
}
/**
* Executes a synchronous computation that may throw and converts it to an
* Either type.
*
* @summary (α₁, α₂, ..., αₙ -> β :: throws γ) -> (α₁, α₂, ..., αₙ -> Either[γ, β])
*/
Either.try = function(f) {
return function() {
try {
return new Right(f.apply(null, arguments))
} catch(e) {
return new Left(e)
}
}
}
// -- Predicates -------------------------------------------------------
/**
* True if the `Either[α, β]` contains a `Left` value.
*
* @summary Boolean
*/
Either.prototype.isLeft = false
Left.prototype.isLeft = true
/**
* True if the `Either[α, β]` contains a `Right` value.
*
* @summary Boolean
*/
Either.prototype.isRight = false
Right.prototype.isRight = true
// -- Applicative ------------------------------------------------------
/**
* Creates a new `Either[α, β]` instance holding the `Right` value `b`.
*
* `b` can be any value, including `null`, `undefined` or another
* `Either[α, β]` structure.
*
* @summary β → Either[α, β]
*/
Either.of = function(a) {
return new Right(a)
}
Either.prototype.of = Either.of
/**
* Applies the function inside the `Right` case of the `Either[α, β]` structure
* to another applicative type.
*
* The `Either[α, β]` should contain a function value, otherwise a `TypeError`
* is thrown.
*
* @method
* @summary (@Either[α, β → γ], f:Applicative[_]) => f[β] → f[γ]
*/
Either.prototype.ap = unimplemented
Left.prototype.ap = function(b) {
return this
}
Right.prototype.ap = function(b) {
return b.map(this.value)
}
// -- Functor ----------------------------------------------------------
/**
* Transforms the `Right` value of the `Either[α, β]` structure using a regular
* unary function.
*
* @method
* @summary (@Either[α, β]) => (β → γ) → Either[α, γ]
*/
Either.prototype.map = unimplemented
Left.prototype.map = noop
Right.prototype.map = function(f) {
return this.of(f(this.value))
}
// -- Chain ------------------------------------------------------------
/**
* Transforms the `Right` value of the `Either[α, β]` structure using an unary
* function to monads.
*
* @method
* @summary (@Either[α, β], m:Monad[_]) => (β → m[γ]) → m[γ]
*/
Either.prototype.chain = unimplemented
Left.prototype.chain = noop
Right.prototype.chain = function(f) {
return f(this.value)
}
// -- Semigroup ----------------------------------------------------------
/**
* Concats the `Right` value of the `Either[α, β]` structure with another `Right` or keeps the `Left` on either side
*
* @method
* @summary (@Either[α, m:Monoid]) => Either[β, m] → Either[α, m]
*/
Either.prototype.concat = unimplemented
Left.prototype.concat = function(other) {
return this
}
Right.prototype.concat = function(other) {
var that = this
return other.fold(function(_){
return other
},
function(y) {
return that.Right(that.value.concat(y))
})
}
// -- Show -------------------------------------------------------------
/**
* Returns a textual representation of the `Either[α, β]` structure.
*
* @method
* @summary (@Either[α, β]) => Void → String
*/
Either.prototype.toString = unimplemented
Left.prototype.toString = function() {
return 'Either.Left(' + this.value + ')'
}
Right.prototype.toString = function() {
return 'Either.Right(' + this.value + ')'
}
// -- Eq ---------------------------------------------------------------
/**
* Tests if an `Either[α, β]` structure is equal to another `Either[α, β]`
* structure.
*
* @method
* @summary (@Either[α, β]) => Either[α, β] → Boolean
*/
Either.prototype.isEqual = unimplemented
Left.prototype.isEqual = function(a) {
return a.isLeft && (a.value === this.value)
}
Right.prototype.isEqual = function(a) {
return a.isRight && (a.value === this.value)
}
// -- Extracting and recovering ----------------------------------------
/**
* Extracts the `Right` value out of the `Either[α, β]` structure, if it
* exists. Otherwise throws a `TypeError`.
*
* @method
* @summary (@Either[α, β]) => Void → β :: partial, throws
* @see {@link module:lib/either~Either#getOrElse} — A getter that can handle failures.
* @see {@link module:lib/either~Either#merge} — The convergence of both values.
* @throws {TypeError} if the structure has no `Right` value.
*/
Either.prototype.get = unimplemented
Left.prototype.get = function() {
throw new TypeError("Can't extract the value of a Left(a).")
}
Right.prototype.get = function() {
return this.value
}
/**
* Extracts the `Right` value out of the `Either[α, β]` structure. If the
* structure doesn't have a `Right` value, returns the given default.
*
* @method
* @summary (@Either[α, β]) => β → β
*/
Either.prototype.getOrElse = unimplemented
Left.prototype.getOrElse = function(a) {
return a
}
Right.prototype.getOrElse = function(_) {
return this.value
}
/**
* Transforms a `Left` value into a new `Either[α, β]` structure. Does nothing
* if the structure contain a `Right` value.
*
* @method
* @summary (@Either[α, β]) => (α → Either[γ, β]) → Either[γ, β]
*/
Either.prototype.orElse = unimplemented
Right.prototype.orElse = noop
Left.prototype.orElse = function(f) {
return f(this.value)
}
/**
* Returns the value of whichever side of the disjunction that is present.
*
* @summary (@Either[α, α]) => Void → α
*/
Either.prototype.merge = function() {
return this.value
}
// -- Folds and Extended Transformations -------------------------------
/**
* Applies a function to each case in this data structure.
*
* @method
* @summary (@Either[α, β]) => (α → γ), (β → γ) → γ
*/
Either.prototype.fold = unimplemented
Left.prototype.fold = function(f, _) {
return f(this.value)
}
Right.prototype.fold = function(_, g) {
return g(this.value)
}
/**
* Catamorphism.
*
* @method
* @summary (@Either[α, β]) => { Left: α → γ, Right: β → γ } → γ
*/
Either.prototype.cata = unimplemented
Left.prototype.cata = function(pattern) {
return pattern.Left(this.value)
}
Right.prototype.cata = function(pattern) {
return pattern.Right(this.value)
}
/**
* Swaps the disjunction values.
*
* @method
* @summary (@Either[α, β]) => Void → Either[β, α]
*/
Either.prototype.swap = unimplemented
Left.prototype.swap = function() {
return this.Right(this.value)
}
Right.prototype.swap = function() {
return this.Left(this.value)
}
/**
* Maps both sides of the disjunction.
*
* @method
* @summary (@Either[α, β]) => (α → γ), (β → δ) → Either[γ, δ]
*/
Either.prototype.bimap = unimplemented
Left.prototype.bimap = function(f, _) {
return this.Left(f(this.value))
}
Right.prototype.bimap = function(_, g) {
return this.Right(g(this.value))
}
/**
* Maps the left side of the disjunction.
*
* @method
* @summary (@Either[α, β]) => (α → γ) → Either[γ, β]
*/
Either.prototype.leftMap = unimplemented
Right.prototype.leftMap = noop
Left.prototype.leftMap = function(f) {
return this.Left(f(this.value))
}