Result

enum Result[e: Type, t: Type] with Eq, Order, ToStringSource

case Ok(t)case Err(e)

The Result type.

A result represents a successful value or an error value. The constructor Ok(v) represents the successful value v, whereas the constructor Err(v) represents the error value v.

Instances

instance Applicative[Result[e]]Source

instance Eq[Result[e, t]] with Eq[e], Eq[t]Source

instance Formattable[Result[e, t]] with Formattable[e], Formattable[t]Source

instance Functor[Result[e]]Source

instance Hash[Result[e, t]] with Hash[e], Hash[t]Source

instance Monad[Result[e]]Source

instance Order[Result[e, t]] with Order[e], Order[t]Source

instance ToString[Result[e, t]] with ToString[e], ToString[t]Source

Definitions

def ap(r1: Result[e, t -> u \ ef], r2: Result[e, t]): Result[e, u] \ ef§ Source

Applies the function in r1 to the value in r2.

def count(f: t -> Bool \ ef, r: Result[e, t]): Int32 \ ef§ Source

Returns 1 if r is Ok(v) and the predicate f(v) evaluates to true. Otherwise returns 0.

def exists(f: t -> Bool \ ef, r: Result[e, t]): Bool \ ef§ Source

Returns true if r is Ok(v) and the predicate f(v) evaluates to true. Otherwise returns false.

def find(f: t -> Bool, r: Result[e, t]): Option[t]§ Source

Returns Some(v) if r is Ok(v) and the predicate f(v) evaluates to true. Otherwise returns None.

The function f must be pure.

def flatMap(f: t1 -> Result[e, t2] \ ef, r: Result[e, t1]): Result[e, t2] \ ef§ Source

Returns f(v) if r is Ok(v). Returns Err(w) if r is Err(w).

def flatten(r: Result[e, Result[e, t]]): Result[e, t]§ Source

Returns v if r is Ok(v). Returns Err(w) if r is Err(w).

def foldLeft(f: a -> (t -> a \ ef), z: a, r: Result[e, t]): a \ ef§ Source

Returns f(z, v) if r is Ok(v). Otherwise returns z.

def foldLeftM(f: b -> (a -> Result[e, b] \ ef), s: b, l: List[a]): Result[e, b] \ ef§ Source

Returns the result of applying f to a start value s and the elements in l going from left to right.

If at any step applying f fails (i.e. it produces a Err(e) value) the traversal of l is short-circuited and Err(e) is returned.

If f is successfully applied to all elements in l the result is of the form: Ok(f(...f(f(s, x1), x2)..., xn)).

def foldRight(f: t -> (a -> a \ ef), z: a, r: Result[e, t]): a \ ef§ Source

Returns f(v, z) if r is Ok(v). Otherwise returns z.

def foldRightM(f: a -> (b -> Result[e, b] \ ef), s: b, l: List[a]): Result[e, b] \ ef§ Source

Returns the result of applying f to a start value s and the elements in l going from right to left.

If at any step applying f fails (i.e. it produces a Err(e) value) the traversal of l is short-circuited and Err(e) is returned.

If f is successfully applied to all elements in l the result is of the form: Ok(f(x1, ...f(xn-1, f(xn, s))...)).

def forAll(f: t -> Bool \ ef, r: Result[e, t]): Bool \ ef§ Source

Returns true if r is Ok(v) and the predicate f(v) evaluates to true or if r is Err(w). Otherwise returns false.

def forEach(f: t -> Unit \ ef, r: Result[e, t]): Unit \ ef§ Source

Applies f to v if r is Ok(v). Otherwise does nothing.

def getOrAbort(r: Result[e, t]): t \ Abort§ Source

Returns v if r is Ok(v). Otherwise aborts with a stack trace.

def getWithDefault(d: t, r: Result[e, t]): t§ Source

Returns v if r is Ok(v). Otherwise returns d.

def isErr(r: Result[e, t]): Bool§ Source

Returns true iff r is Err(w).

def isOk(r: Result[e, t]): Bool§ Source

Returns true iff r is Ok(v).

def iterator(rc: Region[r], r: Result[e, t]): Iterator[t, r, r] \ r§ Source

Returns an iterator over r with 1 element or an empty iterator if r is Err.

def map(f: t1 -> t2 \ ef, r: Result[e, t1]): Result[e, t2] \ ef§ Source

Returns Ok(f(v)) if r is Ok(v). Returns Err(w) if r is Err(w).

def map10(f: t1 -> (t2 -> (t3 -> (t4 -> (t5 -> (t6 -> (t7 -> (t8 -> (t9 -> (t10 -> u \ ef))))))))), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3], r4: Result[e, t4], r5: Result[e, t5], r6: Result[e, t6], r7: Result[e, t7], r8: Result[e, t8], r9: Result[e, t9], r10: Result[e, t10]): Result[e, u] \ ef

§ Source

Applies the 10-ary function f to the values in r1, r2, ... r10.

Returns the first Err(e) value if any of r1, r2, ... r10 are Err(e).

def map2(f: t1 -> (t2 -> u \ ef), r1: Result[e, t1], r2: Result[e, t2]): Result[e, u] \ ef§ Source

Applies the binary function f to the values in r1 and r2.

Returns the first Err(e) value if either of r1 and r2 are Err(e).

def map3(f: t1 -> (t2 -> (t3 -> u \ ef)), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3]): Result[e, u] \ ef§ Source

Applies the ternary function f to the values in r1, r2 and r3.

Returns the first Err(e) value if any of r1, r2 and r3 are Err(e).

def map4(f: t1 -> (t2 -> (t3 -> (t4 -> u \ ef))), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3], r4: Result[e, t4]): Result[e, u] \ ef

§ Source

Applies the 4-ary function f to the values in r1, r2, r3 and r4.

Returns the first Err(e) value if any of r1, r2, r3 and r4 are Err(e).

def map5(f: t1 -> (t2 -> (t3 -> (t4 -> (t5 -> u \ ef)))), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3], r4: Result[e, t4], r5: Result[e, t5]): Result[e, u] \ ef

§ Source

Applies the 5-ary function f to the values in r1, r2, ... r5.

Returns the first Err(e) value if any of r1, r2, ... r5 are Err(e).

def map6(f: t1 -> (t2 -> (t3 -> (t4 -> (t5 -> (t6 -> u \ ef))))), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3], r4: Result[e, t4], r5: Result[e, t5], r6: Result[e, t6]): Result[e, u] \ ef

§ Source

Applies the 6-ary function f to the values in r1, r2, ... r6.

Returns the first Err(e) value if any of r1, r2, ... r6 are Err(e).

def map7(f: t1 -> (t2 -> (t3 -> (t4 -> (t5 -> (t6 -> (t7 -> u \ ef)))))), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3], r4: Result[e, t4], r5: Result[e, t5], r6: Result[e, t6], r7: Result[e, t7]): Result[e, u] \ ef

§ Source

Applies the 7-ary function f to the values in r1, r2, ... r7.

Returns the first Err(e) value if any of r1, r2, ... r7 are Err(e).

def map8(f: t1 -> (t2 -> (t3 -> (t4 -> (t5 -> (t6 -> (t7 -> (t8 -> u \ ef))))))), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3], r4: Result[e, t4], r5: Result[e, t5], r6: Result[e, t6], r7: Result[e, t7], r8: Result[e, t8]): Result[e, u] \ ef

§ Source

Applies the 8-ary function f to the values in r1, r2, ... r8.

Returns the first Err(e) value if any of r1, r2, ... r8 are Err(e).

def map9(f: t1 -> (t2 -> (t3 -> (t4 -> (t5 -> (t6 -> (t7 -> (t8 -> (t9 -> u \ ef)))))))), r1: Result[e, t1], r2: Result[e, t2], r3: Result[e, t3], r4: Result[e, t4], r5: Result[e, t5], r6: Result[e, t6], r7: Result[e, t7], r8: Result[e, t8], r9: Result[e, t9]): Result[e, u] \ ef

§ Source

Applies the 9-ary function f to the values in r1, r2, ... r9.

Returns the first Err(e) value if any of r1, r2, ... r9 are Err(e).

def mapErr(f: e1 -> e2 \ ef, r: Result[e1, t]): Result[e2, t] \ ef§ Source

Returns Err(f(e)) if r is Err(e). Returns Ok(v) if r is Ok(v).

def orAbort(r: Result[e, t]): Unit \ Abort§ Source

Aborts with a stack trace if r is Err.

def replace(src: { src = t }, dst: { dst = t }, r: Result[e, t]): Result[e, t] with Eq[t]§ Source

Returns Ok(dst) if r is Ok(src). Otherwise returns r.

def sequence(l: List[Result[e, a]]): Result[e, List[a]]§ Source

Returns Ok(v1 :: v2 :: ... :: vn) if each of l_i is Ok(v_i). Otherwise returns the first Err encountered.

def sum(r: Result[e, Int32]): Int32§ Source

Returns v if r is Ok(v) else 0.

def sumWith(f: t -> Int32 \ ef, r: Result[e, t]): Int32 \ ef§ Source

Returns f(v) if r is Ok(v) else 0.

def toList(r: Result[e, t]): List[t]§ Source

Returns a one-element list of the value v if r is Ok(v). Otherwise returns the empty list.

def toMap(r: Result[e, (k, v)]): Map[k, v] with Order[k]§ Source

Returns a singleton map with the mapping k -> v if r is Ok((k, v)). Otherwise returns the empty map.

def toMapWith(f: a -> b, s: Result[a, a]): Map[a, b] with Order[a]§ Source

Returns a map with elements of s as keys and f applied as values.

def toOption(r: Result[e, t]): Option[t]§ Source

Returns Some(v) if r is Ok(v). Otherwise returns None.

def toSet(r: Result[e, t]): Set[t] with Order[t]§ Source

Returns a one-element set of the value v if r is Ok(v). Otherwise returns the empty set.

def toValidation(r: Result[e, t]): Validation[e, t]§ Source

Returns a Success(v) if r is Ok(v). Otherwise returns a Failure(Nec.singleton(t)) if r is Err(t).

def traverse(f: a -> Result[e, b] \ ef, l: List[a]): Result[e, List[b]] \ ef§ Source

Returns Ok(v1 :: v2 :: ... v :: vn) if each of f(l_i) is Ok(v_i). Otherwise returns the first Err encountered.

def traverseX(f: a -> Result[e, b] \ ef, l: List[a]): Result[e, Unit] \ ef§ Source

Returns Ok() if each of f(l_i) is Ok(_). Otherwise returns the first Err.

This function is the "forgetful" version of traverse, use it when you want the effect of applying f to each element but do not care about collecting the results.

def withDefault(default: { default = Result[e2, t] }, r: Result[e1, t]): Result[e2, t]§ Source

Returns Ok(v) if r is Ok(v). Otherwise returns default.