diff --git a/content/reference.md b/content/reference.md
index ea114ff..ea31001 100644
--- a/content/reference.md
+++ b/content/reference.md
@@ -88,9 +88,9 @@ A named constructor for function types. `Arrow :a :b` is equivalent to `:a -> :b
Instances
-- Applicative (Arrow :A)
-- Functor (Arrow :A)
-- Monad (Arrow :A)
+- Applicative (Arrow :A)
+- Functor (Arrow :A)
+- Monad (Arrow :A)
- RuntimeRepr (:A → :B)
@@ -106,44 +106,44 @@ A single bit, equal to 0 or 1. Uses `cl:bit`.
Instances
-- Bits Bit
-- Bounded Bit
-- Default Bit
-- Eq Bit
-- Hash Bit
-- Integral Bit
-- Into Bit F32
-- Into Bit F64
-- Into Bit Fraction
-- Into Bit I16
-- Into Bit I32
-- Into Bit I64
-- Into Bit I8
-- Into Bit IFix
-- Into Bit Integer
-- Into Bit U16
-- Into Bit U32
-- Into Bit U64
-- Into Bit U8
-- Into Bit UFix
-- Num Bit
-- Ord Bit
-- Quantizable Bit
-- Rational Bit
-- Real Bit
-- Remainder Bit
-- RuntimeRepr Bit
-- TryInto I16 Bit String
-- TryInto I32 Bit String
-- TryInto I64 Bit String
-- TryInto I8 Bit String
-- TryInto IFix Bit String
-- TryInto Integer Bit String
-- TryInto U16 Bit String
-- TryInto U32 Bit String
-- TryInto U64 Bit String
-- TryInto U8 Bit String
-- TryInto UFix Bit String
+- Bits Bit
+- Bounded Bit
+- Default Bit
+- Eq Bit
+- Hash Bit
+- Integral Bit
+- Into Bit F32
+- Into Bit F64
+- Into Bit Fraction
+- Into Bit I16
+- Into Bit I32
+- Into Bit I64
+- Into Bit I8
+- Into Bit IFix
+- Into Bit Integer
+- Into Bit U16
+- Into Bit U32
+- Into Bit U64
+- Into Bit U8
+- Into Bit UFix
+- Num Bit
+- Ord Bit
+- Quantizable Bit
+- Rational Bit
+- Real Bit
+- Remainder Bit
+- RuntimeRepr Bit
+- TryInto I16 Bit String
+- TryInto I32 Bit String
+- TryInto I64 Bit String
+- TryInto I8 Bit String
+- TryInto IFix Bit String
+- TryInto Integer Bit String
+- TryInto U16 Bit String
+- TryInto U32 Bit String
+- TryInto U64 Bit String
+- TryInto U8 Bit String
+- TryInto UFix Bit String
@@ -162,12 +162,12 @@ Either true or false, internally represented by `cl:t` and `cl:nil` respectively
Instances
-- Default Boolean
-- Eq Boolean
-- Hash Boolean
-- Ord Boolean
-- RuntimeRepr Boolean
-- Terminator Boolean
+- Default Boolean
+- Eq Boolean
+- Hash Boolean
+- Ord Boolean
+- RuntimeRepr Boolean
+- Terminator Boolean
@@ -182,14 +182,14 @@ A character represented by a Common Lisp `cl:character`.
Instances
-- Eq Char
-- File Char
-- FromIterator String Char
-- Hash Char
-- Into Char String
-- IntoIterator String Char
-- Ord Char
-- RuntimeRepr Char
+- Eq Char
+- File Char
+- FromIterator String Char
+- Hash Char
+- Into Char String
+- IntoIterator String Char
+- Ord Char
+- RuntimeRepr Char
@@ -212,42 +212,42 @@ Single-precision floating point number (32 bits in size). Represented by a Commo
Instances
-- ComplexComponent F32
-- Default F32
-- Dividable Integer F32
-- Elementary F32
-- Eq F32
-- Exponentiable F32
-- Hash F32
-- Into Bit F32
-- Into F32 Big-Float
-- Into F32 CReal
-- Into F32 F64
-- Into F32 String
-- Into I16 F32
-- Into I8 F32
-- Into U16 F32
-- Into U8 F32
-- Num F32
-- Ord F32
-- Polar F32
-- Quantizable F32
-- Radical F32
-- Rational F32
-- Real F32
-- Reciprocable F32
-- Remainder F32
-- RuntimeRepr F32
-- Transfinite F32
-- Trigonometric F32
-- TryInto F32 Fraction String
-- TryInto I32 F32 String
-- TryInto I64 F32 String
-- TryInto IFix F32 String
-- TryInto Integer F32 String
-- TryInto U32 F32 String
-- TryInto U64 F32 String
-- TryInto UFix F32 String
+- ComplexComponent F32
+- Default F32
+- Dividable Integer F32
+- Elementary F32
+- Eq F32
+- Exponentiable F32
+- Hash F32
+- Into Bit F32
+- Into F32 Big-Float
+- Into F32 CReal
+- Into F32 F64
+- Into F32 String
+- Into I16 F32
+- Into I8 F32
+- Into U16 F32
+- Into U8 F32
+- Num F32
+- Ord F32
+- Polar F32
+- Quantizable F32
+- Radical F32
+- Rational F32
+- Real F32
+- Reciprocable F32
+- Remainder F32
+- RuntimeRepr F32
+- Transfinite F32
+- Trigonometric F32
+- TryInto F32 Fraction String
+- TryInto I32 F32 String
+- TryInto I64 F32 String
+- TryInto IFix F32 String
+- TryInto Integer F32 String
+- TryInto U32 F32 String
+- TryInto U64 F32 String
+- TryInto UFix F32 String
@@ -262,42 +262,42 @@ Double-precision floating point number (64 bits in size). Represented by a Commo
Instances
-- ComplexComponent F64
-- Default F64
-- Dividable Integer F64
-- Elementary F64
-- Eq F64
-- Exponentiable F64
-- Hash F64
-- Into Bit F64
-- Into F32 F64
-- Into F64 Big-Float
-- Into F64 CReal
-- Into F64 String
-- Into I16 F64
-- Into I32 F64
-- Into I8 F64
-- Into U16 F64
-- Into U32 F64
-- Into U8 F64
-- Num F64
-- Ord F64
-- Polar F64
-- Quantizable F64
-- Radical F64
-- Rational F64
-- Real F64
-- Reciprocable F64
-- Remainder F64
-- RuntimeRepr F64
-- Transfinite F64
-- Trigonometric F64
-- TryInto F64 Fraction String
-- TryInto I64 F64 String
-- TryInto IFix F64 String
-- TryInto Integer F64 String
-- TryInto U64 F64 String
-- TryInto UFix F64 String
+- ComplexComponent F64
+- Default F64
+- Dividable Integer F64
+- Elementary F64
+- Eq F64
+- Exponentiable F64
+- Hash F64
+- Into Bit F64
+- Into F32 F64
+- Into F64 Big-Float
+- Into F64 CReal
+- Into F64 String
+- Into I16 F64
+- Into I32 F64
+- Into I8 F64
+- Into U16 F64
+- Into U32 F64
+- Into U8 F64
+- Num F64
+- Ord F64
+- Polar F64
+- Quantizable F64
+- Radical F64
+- Rational F64
+- Real F64
+- Reciprocable F64
+- Remainder F64
+- RuntimeRepr F64
+- Transfinite F64
+- Trigonometric F64
+- TryInto F64 Fraction String
+- TryInto I64 F64 String
+- TryInto IFix F64 String
+- TryInto Integer F64 String
+- TryInto U64 F64 String
+- TryInto UFix F64 String
@@ -312,35 +312,35 @@ A ratio of integers always in reduced form. Represented by a Common Lisp `cl:rat
Instances
-- ComplexComponent Fraction
-- Dividable Integer Fraction
-- Eq Fraction
-- Into Bit Fraction
-- Into Dyadic Fraction
-- Into Fraction Big-Float
-- Into Fraction CReal
-- Into Fraction String
-- Into I16 Fraction
-- Into I32 Fraction
-- Into I64 Fraction
-- Into I8 Fraction
-- Into IFix Fraction
-- Into Integer Fraction
-- Into U16 Fraction
-- Into U32 Fraction
-- Into U64 Fraction
-- Into U8 Fraction
-- Into UFix Fraction
-- Num Fraction
-- Ord Fraction
-- Quantizable Fraction
-- Rational Fraction
-- Real Fraction
-- Reciprocable Fraction
-- Remainder Fraction
-- RuntimeRepr Fraction
-- TryInto F32 Fraction String
-- TryInto F64 Fraction String
+- ComplexComponent Fraction
+- Dividable Integer Fraction
+- Eq Fraction
+- Into Bit Fraction
+- Into Dyadic Fraction
+- Into Fraction Big-Float
+- Into Fraction CReal
+- Into Fraction String
+- Into I16 Fraction
+- Into I32 Fraction
+- Into I64 Fraction
+- Into I8 Fraction
+- Into IFix Fraction
+- Into Integer Fraction
+- Into U16 Fraction
+- Into U32 Fraction
+- Into U64 Fraction
+- Into U8 Fraction
+- Into UFix Fraction
+- Num Fraction
+- Ord Fraction
+- Quantizable Fraction
+- Rational Fraction
+- Real Fraction
+- Reciprocable Fraction
+- Remainder Fraction
+- RuntimeRepr Fraction
+- TryInto F32 Fraction String
+- TryInto F64 Fraction String
@@ -355,45 +355,45 @@ Signed 16-bit integer capable of storing values in `[-32768, 32767]`. Uses `(sig
Instances
-- %FileByte I16
-- Bits I16
-- Bounded I16
-- Default I16
-- Eq I16
-- File I16
-- Hash I16
-- Integral I16
-- Into Bit I16
-- Into I16 CReal
-- Into I16 F32
-- Into I16 F64
-- Into I16 Fraction
-- Into I16 I32
-- Into I16 I64
-- Into I16 IFix
-- Into I16 Integer
-- Into I16 String
-- Into I8 I16
-- Into U8 I16
-- Num I16
-- Ord I16
-- Remainder I16
-- RuntimeRepr I16
-- TryInto I16 Bit String
-- TryInto I16 I8 String
-- TryInto I16 U16 String
-- TryInto I16 U32 String
-- TryInto I16 U64 String
-- TryInto I16 U8 String
-- TryInto I16 UFix String
-- TryInto I32 I16 String
-- TryInto I64 I16 String
-- TryInto IFix I16 String
-- TryInto Integer I16 String
-- TryInto U16 I16 String
-- TryInto U32 I16 String
-- TryInto U64 I16 String
-- TryInto UFix I16 String
+- %FileByte I16
+- Bits I16
+- Bounded I16
+- Default I16
+- Eq I16
+- File I16
+- Hash I16
+- Integral I16
+- Into Bit I16
+- Into I16 CReal
+- Into I16 F32
+- Into I16 F64
+- Into I16 Fraction
+- Into I16 I32
+- Into I16 I64
+- Into I16 IFix
+- Into I16 Integer
+- Into I16 String
+- Into I8 I16
+- Into U8 I16
+- Num I16
+- Ord I16
+- Remainder I16
+- RuntimeRepr I16
+- TryInto I16 Bit String
+- TryInto I16 I8 String
+- TryInto I16 U16 String
+- TryInto I16 U32 String
+- TryInto I16 U64 String
+- TryInto I16 U8 String
+- TryInto I16 UFix String
+- TryInto I32 I16 String
+- TryInto I64 I16 String
+- TryInto IFix I16 String
+- TryInto Integer I16 String
+- TryInto U16 I16 String
+- TryInto U32 I16 String
+- TryInto U64 I16 String
+- TryInto UFix I16 String
@@ -408,48 +408,48 @@ Signed 32-bit integer capable of storing values in `[-2147483648, 2147483647]`.
Instances
-- %FileByte I32
-- Bits I32
-- Bounded I32
-- Default I32
-- Eq I32
-- File I32
-- Hash I32
-- Integral I32
-- Into Bit I32
-- Into I16 I32
-- Into I32 CReal
-- Into I32 F64
-- Into I32 Fraction
-- Into I32 I64
-- Into I32 IFix
-- Into I32 Integer
-- Into I32 String
-- Into I8 I32
-- Into U16 I32
-- Into U8 I32
-- Num I32
-- Ord I32
-- Quantizable I32
-- Rational I32
-- Real I32
-- Remainder I32
-- RuntimeRepr I32
-- TryInto I32 Bit String
-- TryInto I32 F32 String
-- TryInto I32 I16 String
-- TryInto I32 I8 String
-- TryInto I32 U16 String
-- TryInto I32 U32 String
-- TryInto I32 U64 String
-- TryInto I32 U8 String
-- TryInto I32 UFix String
-- TryInto I64 I32 String
-- TryInto IFix I32 String
-- TryInto Integer I32 String
-- TryInto U32 I32 String
-- TryInto U64 I32 String
-- TryInto UFix I32 String
+- %FileByte I32
+- Bits I32
+- Bounded I32
+- Default I32
+- Eq I32
+- File I32
+- Hash I32
+- Integral I32
+- Into Bit I32
+- Into I16 I32
+- Into I32 CReal
+- Into I32 F64
+- Into I32 Fraction
+- Into I32 I64
+- Into I32 IFix
+- Into I32 Integer
+- Into I32 String
+- Into I8 I32
+- Into U16 I32
+- Into U8 I32
+- Num I32
+- Ord I32
+- Quantizable I32
+- Rational I32
+- Real I32
+- Remainder I32
+- RuntimeRepr I32
+- TryInto I32 Bit String
+- TryInto I32 F32 String
+- TryInto I32 I16 String
+- TryInto I32 I8 String
+- TryInto I32 U16 String
+- TryInto I32 U32 String
+- TryInto I32 U64 String
+- TryInto I32 U8 String
+- TryInto I32 UFix String
+- TryInto I64 I32 String
+- TryInto IFix I32 String
+- TryInto Integer I32 String
+- TryInto U32 I32 String
+- TryInto U64 I32 String
+- TryInto UFix I32 String
@@ -464,48 +464,48 @@ Signed 64-bit integer capable of storing values in `[-9223372036854775808, 92233
Instances
-- %FileByte I64
-- Bits I64
-- Bounded I64
-- Default I64
-- Eq I64
-- File I64
-- Hash I64
-- Integral I64
-- Into Bit I64
-- Into I16 I64
-- Into I32 I64
-- Into I64 CReal
-- Into I64 Fraction
-- Into I64 Integer
-- Into I64 String
-- Into I8 I64
-- Into IFix I64
-- Into U16 I64
-- Into U32 I64
-- Into U8 I64
-- Into UFix I64
-- Num I64
-- Ord I64
-- Quantizable I64
-- Rational I64
-- Real I64
-- Remainder I64
-- RuntimeRepr I64
-- TryInto I64 Bit String
-- TryInto I64 F32 String
-- TryInto I64 F64 String
-- TryInto I64 I16 String
-- TryInto I64 I32 String
-- TryInto I64 I8 String
-- TryInto I64 IFix String
-- TryInto I64 U16 String
-- TryInto I64 U32 String
-- TryInto I64 U64 String
-- TryInto I64 U8 String
-- TryInto I64 UFix String
-- TryInto Integer I64 String
-- TryInto U64 I64 String
+- %FileByte I64
+- Bits I64
+- Bounded I64
+- Default I64
+- Eq I64
+- File I64
+- Hash I64
+- Integral I64
+- Into Bit I64
+- Into I16 I64
+- Into I32 I64
+- Into I64 CReal
+- Into I64 Fraction
+- Into I64 Integer
+- Into I64 String
+- Into I8 I64
+- Into IFix I64
+- Into U16 I64
+- Into U32 I64
+- Into U8 I64
+- Into UFix I64
+- Num I64
+- Ord I64
+- Quantizable I64
+- Rational I64
+- Real I64
+- Remainder I64
+- RuntimeRepr I64
+- TryInto I64 Bit String
+- TryInto I64 F32 String
+- TryInto I64 F64 String
+- TryInto I64 I16 String
+- TryInto I64 I32 String
+- TryInto I64 I8 String
+- TryInto I64 IFix String
+- TryInto I64 U16 String
+- TryInto I64 U32 String
+- TryInto I64 U64 String
+- TryInto I64 U8 String
+- TryInto I64 UFix String
+- TryInto Integer I64 String
+- TryInto U64 I64 String
@@ -520,48 +520,48 @@ Signed 8-bit integer capable of storing values in `[-128, 127]`. Uses `(signed-b
Instances
-- %FileByte I8
-- Bits I8
-- Bounded I8
-- Default I8
-- Eq I8
-- File I8
-- Hash I8
-- Integral I8
-- Into Bit I8
-- Into I8 CReal
-- Into I8 F32
-- Into I8 F64
-- Into I8 Fraction
-- Into I8 I16
-- Into I8 I32
-- Into I8 I64
-- Into I8 IFix
-- Into I8 Integer
-- Into I8 String
-- Num I8
-- Ord I8
-- Quantizable I8
-- Rational I8
-- Real I8
-- Remainder I8
-- RuntimeRepr I8
-- TryInto I16 I8 String
-- TryInto I32 I8 String
-- TryInto I64 I8 String
-- TryInto I8 Bit String
-- TryInto I8 U16 String
-- TryInto I8 U32 String
-- TryInto I8 U64 String
-- TryInto I8 U8 String
-- TryInto I8 UFix String
-- TryInto IFix I8 String
-- TryInto Integer I8 String
-- TryInto U16 I8 String
-- TryInto U32 I8 String
-- TryInto U64 I8 String
-- TryInto U8 I8 String
-- TryInto UFix I8 String
+- %FileByte I8
+- Bits I8
+- Bounded I8
+- Default I8
+- Eq I8
+- File I8
+- Hash I8
+- Integral I8
+- Into Bit I8
+- Into I8 CReal
+- Into I8 F32
+- Into I8 F64
+- Into I8 Fraction
+- Into I8 I16
+- Into I8 I32
+- Into I8 I64
+- Into I8 IFix
+- Into I8 Integer
+- Into I8 String
+- Num I8
+- Ord I8
+- Quantizable I8
+- Rational I8
+- Real I8
+- Remainder I8
+- RuntimeRepr I8
+- TryInto I16 I8 String
+- TryInto I32 I8 String
+- TryInto I64 I8 String
+- TryInto I8 Bit String
+- TryInto I8 U16 String
+- TryInto I8 U32 String
+- TryInto I8 U64 String
+- TryInto I8 U8 String
+- TryInto I8 UFix String
+- TryInto IFix I8 String
+- TryInto Integer I8 String
+- TryInto U16 I8 String
+- TryInto U32 I8 String
+- TryInto U64 I8 String
+- TryInto U8 I8 String
+- TryInto UFix I8 String
@@ -576,48 +576,48 @@ Non-allocating tagged integer; range is platform-dependent. Does not error on ov
Instances
-- %FileByte IFix
-- Bits IFix
-- Bounded IFix
-- Default IFix
-- Eq IFix
-- File IFix
-- Hash IFix
-- Integral IFix
-- Into Bit IFix
-- Into I16 IFix
-- Into I32 IFix
-- Into I8 IFix
-- Into IFix CReal
-- Into IFix Fraction
-- Into IFix I64
-- Into IFix Integer
-- Into IFix String
-- Into U16 IFix
-- Into U32 IFix
-- Into U8 IFix
-- Into UFix IFix
-- Num IFix
-- Ord IFix
-- Quantizable IFix
-- Rational IFix
-- Real IFix
-- Remainder IFix
-- RuntimeRepr IFix
-- TryInto I64 IFix String
-- TryInto IFix Bit String
-- TryInto IFix F32 String
-- TryInto IFix F64 String
-- TryInto IFix I16 String
-- TryInto IFix I32 String
-- TryInto IFix I8 String
-- TryInto IFix U16 String
-- TryInto IFix U32 String
-- TryInto IFix U64 String
-- TryInto IFix U8 String
-- TryInto IFix UFix String
-- TryInto Integer IFix String
-- TryInto U64 IFix String
+- %FileByte IFix
+- Bits IFix
+- Bounded IFix
+- Default IFix
+- Eq IFix
+- File IFix
+- Hash IFix
+- Integral IFix
+- Into Bit IFix
+- Into I16 IFix
+- Into I32 IFix
+- Into I8 IFix
+- Into IFix CReal
+- Into IFix Fraction
+- Into IFix I64
+- Into IFix Integer
+- Into IFix String
+- Into U16 IFix
+- Into U32 IFix
+- Into U8 IFix
+- Into UFix IFix
+- Num IFix
+- Ord IFix
+- Quantizable IFix
+- Rational IFix
+- Real IFix
+- Remainder IFix
+- RuntimeRepr IFix
+- TryInto I64 IFix String
+- TryInto IFix Bit String
+- TryInto IFix F32 String
+- TryInto IFix F64 String
+- TryInto IFix I16 String
+- TryInto IFix I32 String
+- TryInto IFix I8 String
+- TryInto IFix U16 String
+- TryInto IFix U32 String
+- TryInto IFix U64 String
+- TryInto IFix U8 String
+- TryInto IFix UFix String
+- TryInto Integer IFix String
+- TryInto U64 IFix String
@@ -632,54 +632,54 @@ Integer of unbounded size. Represented by a Common Lisp `cl:integer`.
Instances
-- Bits Integer
-- ComplexComponent Integer
-- Default Integer
-- Dividable Integer Big-Float
-- Dividable Integer CReal
-- Dividable Integer F32
-- Dividable Integer F64
-- Dividable Integer Fraction
-- Eq Integer
-- Hash Integer
-- Integral Integer
-- Into Bit Integer
-- Into I16 Integer
-- Into I32 Integer
-- Into I64 Integer
-- Into I8 Integer
-- Into IFix Integer
-- Into Integer Big-Float
-- Into Integer CReal
-- Into Integer Dyadic
-- Into Integer Fraction
-- Into Integer String
-- Into U16 Integer
-- Into U32 Integer
-- Into U64 Integer
-- Into U8 Integer
-- Into UFix Integer
-- Num Integer
-- Ord Integer
-- Quantizable Integer
-- Rational Integer
-- Real Integer
-- Remainder Integer
-- RuntimeRepr Integer
-- TryInto Integer Bit String
-- TryInto Integer F32 String
-- TryInto Integer F64 String
-- TryInto Integer I16 String
-- TryInto Integer I32 String
-- TryInto Integer I64 String
-- TryInto Integer I8 String
-- TryInto Integer IFix String
-- TryInto Integer U16 String
-- TryInto Integer U32 String
-- TryInto Integer U64 String
-- TryInto Integer U8 String
-- TryInto Integer UFix String
-- TryInto String Integer String
+- Bits Integer
+- ComplexComponent Integer
+- Default Integer
+- Dividable Integer Big-Float
+- Dividable Integer CReal
+- Dividable Integer F32
+- Dividable Integer F64
+- Dividable Integer Fraction
+- Eq Integer
+- Hash Integer
+- Integral Integer
+- Into Bit Integer
+- Into I16 Integer
+- Into I32 Integer
+- Into I64 Integer
+- Into I8 Integer
+- Into IFix Integer
+- Into Integer Big-Float
+- Into Integer CReal
+- Into Integer Dyadic
+- Into Integer Fraction
+- Into Integer String
+- Into U16 Integer
+- Into U32 Integer
+- Into U64 Integer
+- Into U8 Integer
+- Into UFix Integer
+- Num Integer
+- Ord Integer
+- Quantizable Integer
+- Rational Integer
+- Real Integer
+- Remainder Integer
+- RuntimeRepr Integer
+- TryInto Integer Bit String
+- TryInto Integer F32 String
+- TryInto Integer F64 String
+- TryInto Integer I16 String
+- TryInto Integer I32 String
+- TryInto Integer I64 String
+- TryInto Integer I8 String
+- TryInto Integer IFix String
+- TryInto Integer U16 String
+- TryInto Integer U32 String
+- TryInto Integer U64 String
+- TryInto Integer U8 String
+- TryInto Integer UFix String
+- TryInto String Integer String
@@ -690,7 +690,7 @@ Integer of unbounded size. Represented by a Common Lisp `cl:integer`.
#### List [TYPE]
- Nil
- `Nil` represents an empty `List`.
-- (Cons :A (List :A))
+- (Cons :A (List :A))
- `Cons` represents a `List` containing a first element (`car`) and a nested `Cons` (`cdr`).
Homogeneous list of objects. Represented as a typical Common Lisp chain of `cl:cons` (or `cl:nil`).
@@ -698,34 +698,34 @@ Homogeneous list of objects. Represented as a typical Common Lisp chain of `cl:c
Instances
-- Alternative List
-- Applicative List
-- Default (List :A)
-- Eq :A ⇒ Eq (List :A)
-- Foldable List
-- FromIterator (List :A) :A
-- Functor List
-- Hash :A ⇒ Hash (List :A)
-- Into (LispArray :A) (List :A)
-- Into (List :A) (Vector :A)
-- Into (List Char) String
-- Into (Optional :A) (List :A)
-- Into (Seq :A) (List :A)
-- Into (Vector :A) (List :A)
-- Into String (List Char)
-- IntoIterator (List :A) :A
-- Iso (List Char) String
-- Iso (Vector :A) (List :A)
-- Monad List
-- Monoid (List :A)
-- Ord :A ⇒ Ord (List :A)
-- RuntimeRepr (List :A)
-- RuntimeRepr :A ⇒ Into (List :A) (LispArray :A)
-- RuntimeRepr :A ⇒ Iso (LispArray :A) (List :A)
-- Semigroup (List :A)
-- Terminator (List :A)
-- Traversable List
-- Yielder List
+- Alternative List
+- Applicative List
+- Default (List :A)
+- Eq :A ⇒ Eq (List :A)
+- Foldable List
+- FromIterator (List :A) :A
+- Functor List
+- Hash :A ⇒ Hash (List :A)
+- Into (LispArray :A) (List :A)
+- Into (List :A) (Vector :A)
+- Into (List Char) String
+- Into (Optional :A) (List :A)
+- Into (Seq :A) (List :A)
+- Into (Vector :A) (List :A)
+- Into String (List Char)
+- IntoIterator (List :A) :A
+- Iso (List Char) String
+- Iso (Vector :A) (List :A)
+- Monad List
+- Monoid (List :A)
+- Ord :A ⇒ Ord (List :A)
+- RuntimeRepr (List :A)
+- RuntimeRepr :A ⇒ Into (List :A) (LispArray :A)
+- RuntimeRepr :A ⇒ Iso (LispArray :A) (List :A)
+- Semigroup (List :A)
+- Terminator (List :A)
+- Traversable List
+- Yielder List
@@ -744,27 +744,27 @@ A type that allows indicating the presence or absence of a value. The underlying
Instances
-- Alternative Optional
-- Applicative Optional
-- Default (Optional :A)
-- Eq :A ⇒ Eq (Optional :A)
-- FromIterator :A :B ⇒ FromIterator (Optional :A) (Optional :B)
-- Functor Optional
-- Into (Optional :A) (List :A)
-- Into (Optional :A) (Result Unit :A)
-- Into (Result :A :B) (Optional :B)
-- IntoIterator (Optional :A) :A
-- Iso (Result Unit :A) (Optional :A)
-- Monad Optional
-- MonadFail Optional
-- Monoid :A ⇒ Monoid (Optional :A)
-- Ord :A ⇒ Ord (Optional :A)
-- RuntimeRepr (Optional :A)
-- Semigroup :A ⇒ Semigroup (Optional :A)
-- Terminator (Optional :A)
-- Traversable Optional
-- Unwrappable Optional
-- Yielder Optional
+- Alternative Optional
+- Applicative Optional
+- Default (Optional :A)
+- Eq :A ⇒ Eq (Optional :A)
+- FromIterator :A :B ⇒ FromIterator (Optional :A) (Optional :B)
+- Functor Optional
+- Into (Optional :A) (List :A)
+- Into (Optional :A) (Result Unit :A)
+- Into (Result :A :B) (Optional :B)
+- IntoIterator (Optional :A) :A
+- Iso (Result Unit :A) (Optional :A)
+- Monad Optional
+- MonadFail Optional
+- Monoid :A ⇒ Monoid (Optional :A)
+- Ord :A ⇒ Ord (Optional :A)
+- RuntimeRepr (Optional :A)
+- Semigroup :A ⇒ Semigroup (Optional :A)
+- Terminator (Optional :A)
+- Traversable Optional
+- Unwrappable Optional
+- Yielder Optional
@@ -787,134 +787,134 @@ String of characters. Represented by Common Lisp `cl:string`.
Instances
-- Default String
-- Eq String
-- FromIterator String Char
-- Hash String
-- Into (List Char) String
-- Into (Vector Char) String
-- Into :A String ⇒ Into (Cell :A) String
-- Into Char String
-- Into F32 String
-- Into F64 String
-- Into Fraction String
-- Into I16 String
-- Into I32 String
-- Into I64 String
-- Into I8 String
-- Into IFix String
-- Into Integer String
-- Into Pathname String
-- Into String (List Char)
-- Into String (Vector Char)
-- Into String Pathname
-- Into U16 String
-- Into U32 String
-- Into U64 String
-- Into U8 String
-- Into UFix String
-- IntoIterator String Char
-- Iso (List Char) String
-- Monoid String
-- Ord String
-- RuntimeRepr String
-- Semigroup String
-- Signalable String
-- TryInto F32 Fraction String
-- TryInto F64 Fraction String
-- TryInto I16 Bit String
-- TryInto I16 I8 String
-- TryInto I16 U16 String
-- TryInto I16 U32 String
-- TryInto I16 U64 String
-- TryInto I16 U8 String
-- TryInto I16 UFix String
-- TryInto I32 Bit String
-- TryInto I32 F32 String
-- TryInto I32 I16 String
-- TryInto I32 I8 String
-- TryInto I32 U16 String
-- TryInto I32 U32 String
-- TryInto I32 U64 String
-- TryInto I32 U8 String
-- TryInto I32 UFix String
-- TryInto I64 Bit String
-- TryInto I64 F32 String
-- TryInto I64 F64 String
-- TryInto I64 I16 String
-- TryInto I64 I32 String
-- TryInto I64 I8 String
-- TryInto I64 IFix String
-- TryInto I64 U16 String
-- TryInto I64 U32 String
-- TryInto I64 U64 String
-- TryInto I64 U8 String
-- TryInto I64 UFix String
-- TryInto I8 Bit String
-- TryInto I8 U16 String
-- TryInto I8 U32 String
-- TryInto I8 U64 String
-- TryInto I8 U8 String
-- TryInto I8 UFix String
-- TryInto IFix Bit String
-- TryInto IFix F32 String
-- TryInto IFix F64 String
-- TryInto IFix I16 String
-- TryInto IFix I32 String
-- TryInto IFix I8 String
-- TryInto IFix U16 String
-- TryInto IFix U32 String
-- TryInto IFix U64 String
-- TryInto IFix U8 String
-- TryInto IFix UFix String
-- TryInto Integer Bit String
-- TryInto Integer F32 String
-- TryInto Integer F64 String
-- TryInto Integer I16 String
-- TryInto Integer I32 String
-- TryInto Integer I64 String
-- TryInto Integer I8 String
-- TryInto Integer IFix String
-- TryInto Integer U16 String
-- TryInto Integer U32 String
-- TryInto Integer U64 String
-- TryInto Integer U8 String
-- TryInto Integer UFix String
-- TryInto String Integer String
-- TryInto U16 Bit String
-- TryInto U16 I16 String
-- TryInto U16 I8 String
-- TryInto U16 U8 String
-- TryInto U32 Bit String
-- TryInto U32 F32 String
-- TryInto U32 I16 String
-- TryInto U32 I32 String
-- TryInto U32 I8 String
-- TryInto U32 U16 String
-- TryInto U32 U8 String
-- TryInto U64 Bit String
-- TryInto U64 F32 String
-- TryInto U64 F64 String
-- TryInto U64 I16 String
-- TryInto U64 I32 String
-- TryInto U64 I64 String
-- TryInto U64 I8 String
-- TryInto U64 IFix String
-- TryInto U64 U16 String
-- TryInto U64 U32 String
-- TryInto U64 U8 String
-- TryInto U64 UFix String
-- TryInto U8 Bit String
-- TryInto U8 I8 String
-- TryInto UFix Bit String
-- TryInto UFix F32 String
-- TryInto UFix F64 String
-- TryInto UFix I16 String
-- TryInto UFix I32 String
-- TryInto UFix I8 String
-- TryInto UFix U16 String
-- TryInto UFix U32 String
-- TryInto UFix U8 String
+- Default String
+- Eq String
+- FromIterator String Char
+- Hash String
+- Into (List Char) String
+- Into (Vector Char) String
+- Into :A String ⇒ Into (Cell :A) String
+- Into Char String
+- Into F32 String
+- Into F64 String
+- Into Fraction String
+- Into I16 String
+- Into I32 String
+- Into I64 String
+- Into I8 String
+- Into IFix String
+- Into Integer String
+- Into Pathname String
+- Into String (List Char)
+- Into String (Vector Char)
+- Into String Pathname
+- Into U16 String
+- Into U32 String
+- Into U64 String
+- Into U8 String
+- Into UFix String
+- IntoIterator String Char
+- Iso (List Char) String
+- Monoid String
+- Ord String
+- RuntimeRepr String
+- Semigroup String
+- Signalable String
+- TryInto F32 Fraction String
+- TryInto F64 Fraction String
+- TryInto I16 Bit String
+- TryInto I16 I8 String
+- TryInto I16 U16 String
+- TryInto I16 U32 String
+- TryInto I16 U64 String
+- TryInto I16 U8 String
+- TryInto I16 UFix String
+- TryInto I32 Bit String
+- TryInto I32 F32 String
+- TryInto I32 I16 String
+- TryInto I32 I8 String
+- TryInto I32 U16 String
+- TryInto I32 U32 String
+- TryInto I32 U64 String
+- TryInto I32 U8 String
+- TryInto I32 UFix String
+- TryInto I64 Bit String
+- TryInto I64 F32 String
+- TryInto I64 F64 String
+- TryInto I64 I16 String
+- TryInto I64 I32 String
+- TryInto I64 I8 String
+- TryInto I64 IFix String
+- TryInto I64 U16 String
+- TryInto I64 U32 String
+- TryInto I64 U64 String
+- TryInto I64 U8 String
+- TryInto I64 UFix String
+- TryInto I8 Bit String
+- TryInto I8 U16 String
+- TryInto I8 U32 String
+- TryInto I8 U64 String
+- TryInto I8 U8 String
+- TryInto I8 UFix String
+- TryInto IFix Bit String
+- TryInto IFix F32 String
+- TryInto IFix F64 String
+- TryInto IFix I16 String
+- TryInto IFix I32 String
+- TryInto IFix I8 String
+- TryInto IFix U16 String
+- TryInto IFix U32 String
+- TryInto IFix U64 String
+- TryInto IFix U8 String
+- TryInto IFix UFix String
+- TryInto Integer Bit String
+- TryInto Integer F32 String
+- TryInto Integer F64 String
+- TryInto Integer I16 String
+- TryInto Integer I32 String
+- TryInto Integer I64 String
+- TryInto Integer I8 String
+- TryInto Integer IFix String
+- TryInto Integer U16 String
+- TryInto Integer U32 String
+- TryInto Integer U64 String
+- TryInto Integer U8 String
+- TryInto Integer UFix String
+- TryInto String Integer String
+- TryInto U16 Bit String
+- TryInto U16 I16 String
+- TryInto U16 I8 String
+- TryInto U16 U8 String
+- TryInto U32 Bit String
+- TryInto U32 F32 String
+- TryInto U32 I16 String
+- TryInto U32 I32 String
+- TryInto U32 I8 String
+- TryInto U32 U16 String
+- TryInto U32 U8 String
+- TryInto U64 Bit String
+- TryInto U64 F32 String
+- TryInto U64 F64 String
+- TryInto U64 I16 String
+- TryInto U64 I32 String
+- TryInto U64 I64 String
+- TryInto U64 I8 String
+- TryInto U64 IFix String
+- TryInto U64 U16 String
+- TryInto U64 U32 String
+- TryInto U64 U8 String
+- TryInto U64 UFix String
+- TryInto U8 Bit String
+- TryInto U8 I8 String
+- TryInto UFix Bit String
+- TryInto UFix F32 String
+- TryInto UFix F64 String
+- TryInto UFix I16 String
+- TryInto UFix I32 String
+- TryInto UFix I8 String
+- TryInto UFix U16 String
+- TryInto UFix U32 String
+- TryInto UFix U8 String
@@ -929,46 +929,46 @@ Unsigned 16-bit integer capable of storing values in `[0, 65535]`. Uses `(unsign
Instances
-- %FileByte U16
-- Bits U16
-- Bounded U16
-- Default U16
-- Eq U16
-- File U16
-- Hash U16
-- Integral U16
-- Into Bit U16
-- Into U16 CReal
-- Into U16 F32
-- Into U16 F64
-- Into U16 Fraction
-- Into U16 I32
-- Into U16 I64
-- Into U16 IFix
-- Into U16 Integer
-- Into U16 String
-- Into U16 U32
-- Into U16 U64
-- Into U16 UFix
-- Into U8 U16
-- Num U16
-- Ord U16
-- Remainder U16
-- ReverseBits U16
-- RuntimeRepr U16
-- TryInto I16 U16 String
-- TryInto I32 U16 String
-- TryInto I64 U16 String
-- TryInto I8 U16 String
-- TryInto IFix U16 String
-- TryInto Integer U16 String
-- TryInto U16 Bit String
-- TryInto U16 I16 String
-- TryInto U16 I8 String
-- TryInto U16 U8 String
-- TryInto U32 U16 String
-- TryInto U64 U16 String
-- TryInto UFix U16 String
+- %FileByte U16
+- Bits U16
+- Bounded U16
+- Default U16
+- Eq U16
+- File U16
+- Hash U16
+- Integral U16
+- Into Bit U16
+- Into U16 CReal
+- Into U16 F32
+- Into U16 F64
+- Into U16 Fraction
+- Into U16 I32
+- Into U16 I64
+- Into U16 IFix
+- Into U16 Integer
+- Into U16 String
+- Into U16 U32
+- Into U16 U64
+- Into U16 UFix
+- Into U8 U16
+- Num U16
+- Ord U16
+- Remainder U16
+- ReverseBits U16
+- RuntimeRepr U16
+- TryInto I16 U16 String
+- TryInto I32 U16 String
+- TryInto I64 U16 String
+- TryInto I8 U16 String
+- TryInto IFix U16 String
+- TryInto Integer U16 String
+- TryInto U16 Bit String
+- TryInto U16 I16 String
+- TryInto U16 I8 String
+- TryInto U16 U8 String
+- TryInto U32 U16 String
+- TryInto U64 U16 String
+- TryInto UFix U16 String
@@ -983,49 +983,49 @@ Unsigned 32-bit integer capable of storing values in `[0, 4294967295]`. Uses `(u
Instances
-- %FileByte U32
-- Bits U32
-- Bounded U32
-- Default U32
-- Eq U32
-- File U32
-- Hash U32
-- Integral U32
-- Into Bit U32
-- Into U16 U32
-- Into U32 CReal
-- Into U32 F64
-- Into U32 Fraction
-- Into U32 I64
-- Into U32 IFix
-- Into U32 Integer
-- Into U32 String
-- Into U32 U64
-- Into U32 UFix
-- Into U8 U32
-- Num U32
-- Ord U32
-- Quantizable U32
-- Rational U32
-- Real U32
-- Remainder U32
-- ReverseBits U32
-- RuntimeRepr U32
-- TryInto I16 U32 String
-- TryInto I32 U32 String
-- TryInto I64 U32 String
-- TryInto I8 U32 String
-- TryInto IFix U32 String
-- TryInto Integer U32 String
-- TryInto U32 Bit String
-- TryInto U32 F32 String
-- TryInto U32 I16 String
-- TryInto U32 I32 String
-- TryInto U32 I8 String
-- TryInto U32 U16 String
-- TryInto U32 U8 String
-- TryInto U64 U32 String
-- TryInto UFix U32 String
+- %FileByte U32
+- Bits U32
+- Bounded U32
+- Default U32
+- Eq U32
+- File U32
+- Hash U32
+- Integral U32
+- Into Bit U32
+- Into U16 U32
+- Into U32 CReal
+- Into U32 F64
+- Into U32 Fraction
+- Into U32 I64
+- Into U32 IFix
+- Into U32 Integer
+- Into U32 String
+- Into U32 U64
+- Into U32 UFix
+- Into U8 U32
+- Num U32
+- Ord U32
+- Quantizable U32
+- Rational U32
+- Real U32
+- Remainder U32
+- ReverseBits U32
+- RuntimeRepr U32
+- TryInto I16 U32 String
+- TryInto I32 U32 String
+- TryInto I64 U32 String
+- TryInto I8 U32 String
+- TryInto IFix U32 String
+- TryInto Integer U32 String
+- TryInto U32 Bit String
+- TryInto U32 F32 String
+- TryInto U32 I16 String
+- TryInto U32 I32 String
+- TryInto U32 I8 String
+- TryInto U32 U16 String
+- TryInto U32 U8 String
+- TryInto U64 U32 String
+- TryInto UFix U32 String
@@ -1040,49 +1040,49 @@ Unsigned 64-bit integer capable of storing values in `[0, 18446744073709551615]`
Instances
-- %FileByte U64
-- Bits U64
-- Bounded U64
-- Default U64
-- Eq U64
-- File U64
-- Hash U64
-- Integral U64
-- Into Bit U64
-- Into U16 U64
-- Into U32 U64
-- Into U64 CReal
-- Into U64 Fraction
-- Into U64 Integer
-- Into U64 String
-- Into U8 U64
-- Into UFix U64
-- Num U64
-- Ord U64
-- Quantizable U64
-- Rational U64
-- Real U64
-- Remainder U64
-- ReverseBits U64
-- RuntimeRepr U64
-- TryInto I16 U64 String
-- TryInto I32 U64 String
-- TryInto I64 U64 String
-- TryInto I8 U64 String
-- TryInto IFix U64 String
-- TryInto Integer U64 String
-- TryInto U64 Bit String
-- TryInto U64 F32 String
-- TryInto U64 F64 String
-- TryInto U64 I16 String
-- TryInto U64 I32 String
-- TryInto U64 I64 String
-- TryInto U64 I8 String
-- TryInto U64 IFix String
-- TryInto U64 U16 String
-- TryInto U64 U32 String
-- TryInto U64 U8 String
-- TryInto U64 UFix String
+- %FileByte U64
+- Bits U64
+- Bounded U64
+- Default U64
+- Eq U64
+- File U64
+- Hash U64
+- Integral U64
+- Into Bit U64
+- Into U16 U64
+- Into U32 U64
+- Into U64 CReal
+- Into U64 Fraction
+- Into U64 Integer
+- Into U64 String
+- Into U8 U64
+- Into UFix U64
+- Num U64
+- Ord U64
+- Quantizable U64
+- Rational U64
+- Real U64
+- Remainder U64
+- ReverseBits U64
+- RuntimeRepr U64
+- TryInto I16 U64 String
+- TryInto I32 U64 String
+- TryInto I64 U64 String
+- TryInto I8 U64 String
+- TryInto IFix U64 String
+- TryInto Integer U64 String
+- TryInto U64 Bit String
+- TryInto U64 F32 String
+- TryInto U64 F64 String
+- TryInto U64 I16 String
+- TryInto U64 I32 String
+- TryInto U64 I64 String
+- TryInto U64 I8 String
+- TryInto U64 IFix String
+- TryInto U64 U16 String
+- TryInto U64 U32 String
+- TryInto U64 U8 String
+- TryInto U64 UFix String
@@ -1097,49 +1097,49 @@ Unsigned 8-bit integer capable of storing values in `[0, 255]`. Uses `(unsigned-
Instances
-- %FileByte U8
-- Bits U8
-- Bounded U8
-- Default U8
-- Eq U8
-- File U8
-- Hash U8
-- Integral U8
-- Into Bit U8
-- Into U8 CReal
-- Into U8 F32
-- Into U8 F64
-- Into U8 Fraction
-- Into U8 I16
-- Into U8 I32
-- Into U8 I64
-- Into U8 IFix
-- Into U8 Integer
-- Into U8 String
-- Into U8 U16
-- Into U8 U32
-- Into U8 U64
-- Into U8 UFix
-- Num U8
-- Ord U8
-- Quantizable U8
-- Rational U8
-- Real U8
-- Remainder U8
-- ReverseBits U8
-- RuntimeRepr U8
-- TryInto I16 U8 String
-- TryInto I32 U8 String
-- TryInto I64 U8 String
-- TryInto I8 U8 String
-- TryInto IFix U8 String
-- TryInto Integer U8 String
-- TryInto U16 U8 String
-- TryInto U32 U8 String
-- TryInto U64 U8 String
-- TryInto U8 Bit String
-- TryInto U8 I8 String
-- TryInto UFix U8 String
+- %FileByte U8
+- Bits U8
+- Bounded U8
+- Default U8
+- Eq U8
+- File U8
+- Hash U8
+- Integral U8
+- Into Bit U8
+- Into U8 CReal
+- Into U8 F32
+- Into U8 F64
+- Into U8 Fraction
+- Into U8 I16
+- Into U8 I32
+- Into U8 I64
+- Into U8 IFix
+- Into U8 Integer
+- Into U8 String
+- Into U8 U16
+- Into U8 U32
+- Into U8 U64
+- Into U8 UFix
+- Num U8
+- Ord U8
+- Quantizable U8
+- Rational U8
+- Real U8
+- Remainder U8
+- ReverseBits U8
+- RuntimeRepr U8
+- TryInto I16 U8 String
+- TryInto I32 U8 String
+- TryInto I64 U8 String
+- TryInto I8 U8 String
+- TryInto IFix U8 String
+- TryInto Integer U8 String
+- TryInto U16 U8 String
+- TryInto U32 U8 String
+- TryInto U64 U8 String
+- TryInto U8 Bit String
+- TryInto U8 I8 String
+- TryInto UFix U8 String
@@ -1154,49 +1154,49 @@ Non-allocating tagged non-negative integer; range is platform-dependent. Uses `(
Instances
-- %FileByte UFix
-- Bits UFix
-- Bounded UFix
-- Default UFix
-- Eq UFix
-- File UFix
-- Hash UFix
-- Integral UFix
-- Into Bit UFix
-- Into U16 UFix
-- Into U32 UFix
-- Into U8 UFix
-- Into UFix CReal
-- Into UFix Fraction
-- Into UFix I64
-- Into UFix IFix
-- Into UFix Integer
-- Into UFix String
-- Into UFix U64
-- Num UFix
-- Ord UFix
-- Quantizable UFix
-- Rational UFix
-- Real UFix
-- Remainder UFix
-- ReverseBits UFix
-- RuntimeRepr UFix
-- TryInto I16 UFix String
-- TryInto I32 UFix String
-- TryInto I64 UFix String
-- TryInto I8 UFix String
-- TryInto IFix UFix String
-- TryInto Integer UFix String
-- TryInto U64 UFix String
-- TryInto UFix Bit String
-- TryInto UFix F32 String
-- TryInto UFix F64 String
-- TryInto UFix I16 String
-- TryInto UFix I32 String
-- TryInto UFix I8 String
-- TryInto UFix U16 String
-- TryInto UFix U32 String
-- TryInto UFix U8 String
+- %FileByte UFix
+- Bits UFix
+- Bounded UFix
+- Default UFix
+- Eq UFix
+- File UFix
+- Hash UFix
+- Integral UFix
+- Into Bit UFix
+- Into U16 UFix
+- Into U32 UFix
+- Into U8 UFix
+- Into UFix CReal
+- Into UFix Fraction
+- Into UFix I64
+- Into UFix IFix
+- Into UFix Integer
+- Into UFix String
+- Into UFix U64
+- Num UFix
+- Ord UFix
+- Quantizable UFix
+- Rational UFix
+- Real UFix
+- Remainder UFix
+- ReverseBits UFix
+- RuntimeRepr UFix
+- TryInto I16 UFix String
+- TryInto I32 UFix String
+- TryInto I64 UFix String
+- TryInto I8 UFix String
+- TryInto IFix UFix String
+- TryInto Integer UFix String
+- TryInto U64 UFix String
+- TryInto UFix Bit String
+- TryInto UFix F32 String
+- TryInto UFix F64 String
+- TryInto UFix I16 String
+- TryInto UFix I32 String
+- TryInto UFix I8 String
+- TryInto UFix U16 String
+- TryInto UFix U32 String
+- TryInto UFix U8 String
@@ -1213,7 +1213,7 @@ The "unit" type whose only member is the value `Unit`.
Instances
-- Eq Unit
+- Eq Unit
@@ -1225,7 +1225,7 @@ The "unit" type whose only member is the value `Unit`.
Instances
-- RuntimeRepr Void
+- RuntimeRepr Void
@@ -1236,7 +1236,7 @@ The "unit" type whose only member is the value `Unit`.
### Values
#### (CONS X XS) [FUNCTION] · src
-∀ :A. (:A → (List :A) → (List :A))
+∀ :A. (:A → (List :A) → (List :A))
***
@@ -1252,7 +1252,7 @@ Try to inline `application`. It will only attempt to inline
***
#### (LIKELY PREDICATE) [FUNCTION] · src
-(Boolean → Boolean)
+(Boolean → Boolean)
Hint to the compiler that `predicate` is likely `True`.
@@ -1271,7 +1271,7 @@ inlining when the argument is syntactically a function application.
***
#### (SOME X) [FUNCTION] · src
-∀ :A. (:A → (Optional :A))
+∀ :A. (:A → (Optional :A))
A constructor for the type, `Optional`. This constructor can be used
like any other algebraic data type constructor, including for pattern
@@ -1289,7 +1289,7 @@ matching, as in the following example.
***
#### (UNLIKELY PREDICATE) [FUNCTION] · src
-(Boolean → Boolean)
+(Boolean → Boolean)
Hint to the compiler that `predicate` is likely `False`.
@@ -1297,20 +1297,20 @@ Hint to the compiler that `predicate` is likely `False`.
***
-#### FALSE [VALUE] · src
-BooleanFalse [VALUE] · src
+Boolean
***
-#### NIL [VALUE] · src
-∀ :A. (List :A)
+#### Nil [VALUE] · src
+∀ :A. (List :A)
***
-#### NONE [VALUE] · src
-∀ :A. (Optional :A)
+#### None [VALUE] · src
+∀ :A. (Optional :A)
A constructor for the type, `Optional`. This constructor can be used
like any other algebraic data type constructor, including for pattern
@@ -1327,14 +1327,14 @@ matching, as in the following example.
***
-#### TRUE [VALUE] · src
-BooleanTrue [VALUE] · src
+Boolean
***
-#### UNIT [VALUE] · src
-UnitUnit [VALUE] · src
+Unit
***
@@ -1504,12 +1504,12 @@ Methods:
- CYCLIC-ADD-IDENTITY :: :A
- CYCLIC-ADD :: (:A → :A → :A)
- CYCLIC-ADD-INVERSE :: (:A → :A)
-- CYCLIC-NTH-GENERATOR :: (UFix → :A)
A function which returns a primitive `n`th root of unity.
+- CYCLIC-NTH-GENERATOR :: (UFix → :A)
A function which returns a primitive `n`th root of unity.
Instances
-- FFTCyclicGroup (Complex F64)
-- FFTCyclicGroup (Complex F32)
+- FFTCyclicGroup (Complex F64)
+- FFTCyclicGroup (Complex F32)
@@ -1530,8 +1530,8 @@ Methods:
Instances
-- FFTField (Complex F64)
-- FFTField (Complex F32)
+- FFTField (Complex F64)
+- FFTField (Complex F32)
@@ -1554,8 +1554,8 @@ Methods:
Instances
-- FFTGroup (Complex F64)
-- FFTGroup (Complex F32)
+- FFTGroup (Complex F64)
+- FFTGroup (Complex F32)
@@ -1577,8 +1577,8 @@ Methods:
Instances
-- FFTRing (Complex F64)
-- FFTRing (Complex F32)
+- FFTRing (Complex F64)
+- FFTRing (Complex F32)
@@ -1589,7 +1589,7 @@ Methods:
### Values
#### (DIF-FFT-RAW DST SRC) [FUNCTION] · src
-∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
+∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
A decimation-in-frequency fast fourier transform, reading from `src` and writing to `dst`.
@@ -1602,7 +1602,7 @@ Normalization: none
***
#### (DIF-IFFT-RAW DST SRC) [FUNCTION] · src
-∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
+∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
A decimation-in-frequency inverse fast fourier transform, reading from `src` and writing to `dst`.
@@ -1615,7 +1615,7 @@ Normalization: none
***
#### (DIT-FFT-RAW DST SRC) [FUNCTION] · src
-∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
+∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
A decimation-in-time fast fourier transform, reading from `src` and writing to `dst`.
@@ -1628,7 +1628,7 @@ Normalization: none
***
#### (DIT-IFFT-RAW DST SRC) [FUNCTION] · src
-∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
+∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → Unit)
A decimation-in-time inverse fast fourier transform, reading from `src` and writing to `dst`.
@@ -1717,26 +1717,26 @@ An arbitrary (but fixed) precision floating point number.
Instances
-- ComplexComponent Big-Float
-- Dividable Integer Big-Float
-- Elementary Big-Float
-- Eq Big-Float
-- Exponentiable Big-Float
-- Into F32 Big-Float
-- Into F64 Big-Float
-- Into Fraction Big-Float
-- Into Integer Big-Float
-- Num Big-Float
-- Ord Big-Float
-- Polar Big-Float
-- Quantizable Big-Float
-- Radical Big-Float
-- Rational Big-Float
-- Real Big-Float
-- Reciprocable Big-Float
-- RuntimeRepr Big-Float
-- Transfinite Big-Float
-- Trigonometric Big-Float
+- ComplexComponent Big-Float
+- Dividable Integer Big-Float
+- Elementary Big-Float
+- Eq Big-Float
+- Exponentiable Big-Float
+- Into F32 Big-Float
+- Into F64 Big-Float
+- Into Fraction Big-Float
+- Into Integer Big-Float
+- Num Big-Float
+- Ord Big-Float
+- Polar Big-Float
+- Quantizable Big-Float
+- Radical Big-Float
+- Rational Big-Float
+- Real Big-Float
+- Reciprocable Big-Float
+- RuntimeRepr Big-Float
+- Transfinite Big-Float
+- Trigonometric Big-Float
@@ -1748,7 +1748,7 @@ An arbitrary (but fixed) precision floating point number.
Instances
-- RuntimeRepr RoundingMode
+- RuntimeRepr RoundingMode
@@ -1759,7 +1759,7 @@ An arbitrary (but fixed) precision floating point number.
### Values
#### (BF-EE _) [FUNCTION] · src
-∀ :A. (:A → Big-Float)
+∀ :A. (:A → Big-Float)
Return the value of ee = exp(1) to the currently set precision.
@@ -1768,7 +1768,7 @@ Return the value of ee = exp(1) to the currently set precision.
***
#### (BF-PI _) [FUNCTION] · src
-∀ :A. (:A → Big-Float)
+∀ :A. (:A → Big-Float)
Return the value of pi to the currently set precision.
@@ -1777,7 +1777,7 @@ Return the value of pi to the currently set precision.
***
#### (GET-PRECISION _) [FUNCTION] · src
-(Unit → UFix)
+(Unit → UFix)
Get the current precision of Big-Float arithmetic.
@@ -1786,7 +1786,7 @@ Get the current precision of Big-Float arithmetic.
***
#### (GET-ROUNDING-MODE _) [FUNCTION] · src
-(Unit → RoundingMode)
+(Unit → RoundingMode)
Get the current rounding-mode of Big-Float arithmetic.
@@ -1795,7 +1795,7 @@ Get the current rounding-mode of Big-Float arithmetic.
***
#### (SET-PRECISION! PREC-BITS) [FUNCTION] · src
-(UFix → Unit)
+(UFix → Unit)
Set the precision of Big-Float arithmetic to PREC-BITS bits.
@@ -1804,7 +1804,7 @@ Set the precision of Big-Float arithmetic to PREC-BITS bits.
***
#### (SET-ROUNDING-MODE! R) [FUNCTION] · src
-(RoundingMode → Unit)
+(RoundingMode → Unit)
Set the global rounding mode for Big-Float operations.
@@ -1813,7 +1813,7 @@ Set the global rounding mode for Big-Float operations.
***
#### (WITH-PRECISION PREC-BITS F) [FUNCTION] · src
-∀ :A. (UFix → (Unit → :A) → :A)
+∀ :A. (UFix → (Unit → :A) → :A)
Call F with a temporary Big-Float precision PREC-BITS.
@@ -1822,7 +1822,7 @@ Call F with a temporary Big-Float precision PREC-BITS.
***
#### (WITH-PRECISION-ROUNDING PREC-BITS RND F) [FUNCTION] · src
-∀ :A. (UFix → RoundingMode → (Unit → :A) → :A)
+∀ :A. (UFix → RoundingMode → (Unit → :A) → :A)
Call F with a temporary Big-Float PREC-BITS precision and RND rounding-mode.
@@ -1831,7 +1831,7 @@ Call F with a temporary Big-Float PREC-BITS precision and RND rounding-mode.
***
#### (WITH-ROUNDING RND F) [FUNCTION] · src
-∀ :A. (RoundingMode → (Unit → :A) → :A)
+∀ :A. (RoundingMode → (Unit → :A) → :A)
Call F with a temporary Big-Float rounding-mode RND.
@@ -1840,7 +1840,7 @@ Call F with a temporary Big-Float rounding-mode RND.
***
#### RNDA [VALUE] · src
-RoundingModeRoundingMode
RouND Away from zero.
@@ -1849,7 +1849,7 @@ RouND Away from zero.
***
#### RNDD [VALUE] · src
-RoundingModeRoundingMode
RouND Down, toward negative infinity.
@@ -1858,7 +1858,7 @@ RouND Down, toward negative infinity.
***
#### RNDF [VALUE] · src
-RoundingModeRoundingMode
Faithful rounding (experimental).
@@ -1867,7 +1867,7 @@ Faithful rounding (experimental).
***
#### RNDN [VALUE] · src
-RoundingModeRoundingMode
RouND to Nearest, with the even rounding rule.
@@ -1876,7 +1876,7 @@ RouND to Nearest, with the even rounding rule.
***
#### RNDNA [VALUE] · src
-RoundingModeRoundingMode
RouND to Nearest Away.
@@ -1885,7 +1885,7 @@ RouND to Nearest Away.
***
#### RNDU [VALUE] · src
-RoundingModeRoundingMode
RouND Up, toward positive infinity.
@@ -1894,7 +1894,7 @@ RouND Up, toward positive infinity.
***
#### RNDZ [VALUE] · src
-RoundingModeRoundingMode
RouND toward Zero.
@@ -1917,22 +1917,22 @@ Methods:
- OR :: (:A → :A → :A)
The bitwise logical `or` of two integers
- XOR :: (:A → :A → :A)
The bitwise logical exclusive `or` of two integers
- NOT :: (:A → :A)
The bitwise logical `not` of two integers
-- SHIFT :: (Integer → :A → :A)
The arithmetic left-shift of an integer by an integer number of bits
+- SHIFT :: (Integer → :A → :A)
The arithmetic left-shift of an integer by an integer number of bits
Instances
-- Bits UFix
-- Bits U64
-- Bits U32
-- Bits U16
-- Bits U8
-- Bits Bit
-- Bits IFix
-- Bits I64
-- Bits I32
-- Bits I16
-- Bits I8
-- Bits Integer
+- Bits UFix
+- Bits U64
+- Bits U32
+- Bits U16
+- Bits U8
+- Bits Bit
+- Bits IFix
+- Bits I64
+- Bits I32
+- Bits I16
+- Bits I8
+- Bits Integer
@@ -1948,15 +1948,15 @@ A type class for number types that support bit reversal.
Methods:
- REVERSE-BITS :: (:A → :A)
Reverse the bits of `x`.
-- REVERSE-N-BITS :: (UFix → :A → :A)
Reverse the first `n` bits of `x` and set the rest to 0.
+- REVERSE-N-BITS :: (UFix → :A → :A)
Reverse the first `n` bits of `x` and set the rest to 0.
Instances
-- ReverseBits U64
-- ReverseBits UFix
-- ReverseBits U32
-- ReverseBits U16
-- ReverseBits U8
+- ReverseBits U64
+- ReverseBits UFix
+- ReverseBits U32
+- ReverseBits U16
+- ReverseBits U8
@@ -1967,7 +1967,7 @@ Methods:
### Values
#### (DPB NEWBYTE SIZE POSITION BITSTRING) [FUNCTION] · src
-∀ :A. Bits :A ⇒ (:A → UFix → UFix → :A → :A)
+∀ :A. Bits :A ⇒ (:A → UFix → UFix → :A → :A)
Deposits a byte `newbyte` of size `size` into a bitstring `bitstring` at a position `position`.
@@ -1976,7 +1976,7 @@ Deposits a byte `newbyte` of size `size` into a bitstring `bitstring` at a posit
***
#### (LDB SIZE POSITION BITSTRING) [FUNCTION] · src
-∀ :A. Bits :A ⇒ (UFix → UFix → :A → :A)
+∀ :A. Bits :A ⇒ (UFix → UFix → :A → :A)
Deposits a byte of size `size` into a bitstring at a position `position`.
@@ -1989,7 +1989,7 @@ Deposits a byte of size `size` into a bitstring at a position `position`.
### Values
#### (BOOLEAN-AND X Y) [FUNCTION] · src
-(Boolean → Boolean → Boolean)
+(Boolean → Boolean → Boolean)
Are both `x` and `y` true? Note that this is a *function* which means both `x` and `y` will be evaluated. Use the `and` macro for short-circuiting behavior.
@@ -1998,7 +1998,7 @@ Are both `x` and `y` true? Note that this is a *function* which means both `x` a
***
#### (BOOLEAN-NOT X) [FUNCTION] · src
-(Boolean → Boolean)
+(Boolean → Boolean)
The logical negation of `x`. Is `x` false?
@@ -2007,7 +2007,7 @@ The logical negation of `x`. Is `x` false?
***
#### (BOOLEAN-OR X Y) [FUNCTION] · src
-(Boolean → Boolean → Boolean)
+(Boolean → Boolean → Boolean)
Is either `x` or `y` true? Note that this is a *function* which means both `x` and `y` will be evaluated. Use the `or` macro for short-circuiting behavior.
@@ -2016,7 +2016,7 @@ Is either `x` or `y` true? Note that this is a *function* which means both `x` a
***
#### (BOOLEAN-XOR X Y) [FUNCTION] · src
-(Boolean → Boolean → Boolean)
+(Boolean → Boolean → Boolean)
Are `x` or `y` true, but not both?
@@ -2025,7 +2025,7 @@ Are `x` or `y` true, but not both?
***
#### (NOT X) [FUNCTION] · src
-(Boolean → Boolean)
+(Boolean → Boolean)
Synonym for `boolean-not`.
@@ -2043,7 +2043,7 @@ A function which can be used in place of any value, throwing an error at runtime
***
#### (XOR X Y) [FUNCTION] · src
-(Boolean → Boolean → Boolean)
+(Boolean → Boolean → Boolean)
Synonym for `boolean-xor`.
@@ -2072,17 +2072,17 @@ Internally mutable cell
Instances
-- Applicative Cell
-- Default :A ⇒ Default (Cell :A)
-- Eq :A ⇒ Eq (Cell :A)
-- Functor Cell
-- Into (Cell :A) :A
-- Into :A (Cell :A)
-- Into :A String ⇒ Into (Cell :A) String
-- Num :A ⇒ Num (Cell :A)
-- Ord :A ⇒ Ord (Cell :A)
-- RuntimeRepr (Cell :A)
-- Semigroup :A ⇒ Semigroup (Cell :A)
+- Applicative Cell
+- Default :A ⇒ Default (Cell :A)
+- Eq :A ⇒ Eq (Cell :A)
+- Functor Cell
+- Into (Cell :A) :A
+- Into :A (Cell :A)
+- Into :A String ⇒ Into (Cell :A) String
+- Num :A ⇒ Num (Cell :A)
+- Ord :A ⇒ Ord (Cell :A)
+- RuntimeRepr (Cell :A)
+- Semigroup :A ⇒ Semigroup (Cell :A)
@@ -2093,7 +2093,7 @@ Internally mutable cell
### Values
#### (DECREMENT! CEL) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((Cell :A) → :A)
+∀ :A. Num :A ⇒ ((Cell :A) → :A)
Subtract one from the contents of `cel`, storing and returning the new
value.
@@ -2103,7 +2103,7 @@ value.
***
#### (INCREMENT! CEL) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((Cell :A) → :A)
+∀ :A. Num :A ⇒ ((Cell :A) → :A)
Add one to the contents of `cel`, storing and returning the new value.
@@ -2112,7 +2112,7 @@ Add one to the contents of `cel`, storing and returning the new value.
***
#### (NEW DATA) [FUNCTION] · src
-∀ :A. (:A → (Cell :A))
+∀ :A. (:A → (Cell :A))
Create a new mutable cell containing `data`.
@@ -2121,7 +2121,7 @@ Create a new mutable cell containing `data`.
***
#### (POP! CEL) [FUNCTION] · src
-∀ :A. ((Cell (List :A)) → (Optional :A))
+∀ :A. ((Cell (List :A)) → (Optional :A))
Remove and return the first element of the list in `cel`.
@@ -2130,7 +2130,7 @@ Remove and return the first element of the list in `cel`.
***
#### (PUSH! CEL NEW-ELT) [FUNCTION] · src
-∀ :A. ((Cell (List :A)) → :A → (List :A))
+∀ :A. ((Cell (List :A)) → :A → (List :A))
Push `new-elt` onto the start of the list in `cel`.
@@ -2139,7 +2139,7 @@ Push `new-elt` onto the start of the list in `cel`.
***
#### (READ CEL) [FUNCTION] · src
-∀ :A. ((Cell :A) → :A)
+∀ :A. ((Cell :A) → :A)
Read the value of a mutable cell `cel`.
@@ -2148,7 +2148,7 @@ Read the value of a mutable cell `cel`.
***
#### (SWAP! CEL DATA) [FUNCTION] · src
-∀ :A. ((Cell :A) → :A → :A)
+∀ :A. ((Cell :A) → :A → :A)
Replace the value of a mutable cell `cel` with a new value `data`,
then return the old value.
@@ -2158,7 +2158,7 @@ then return the old value.
***
#### (UPDATE! F CEL) [FUNCTION] · src
-∀ :A. ((:A → :A) → (Cell :A) → :A)
+∀ :A. ((:A → :A) → (Cell :A) → :A)
Apply `f` to the contents of `cel`, storing and returning the result.
@@ -2167,7 +2167,7 @@ Apply `f` to the contents of `cel`, storing and returning the result.
***
#### (UPDATE-SWAP! F CEL) [FUNCTION] · src
-∀ :A. ((:A → :A) → (Cell :A) → :A)
+∀ :A. ((:A → :A) → (Cell :A) → :A)
Apply `f` to the contents of `cel`, swapping the result for the old
value.
@@ -2177,7 +2177,7 @@ value.
***
#### (WRITE! CEL DATA) [FUNCTION] · src
-∀ :A. ((Cell :A) → :A → :A)
+∀ :A. ((Cell :A) → :A → :A)
Set the value of a mutable cell `cel` to `data`, returning the new
value.
@@ -2191,7 +2191,7 @@ value.
### Values
#### (ALPHA? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` an alphabetic character?
@@ -2200,7 +2200,7 @@ Is `c` an alphabetic character?
***
#### (ASCII-ALPHA? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` an ASCII alphabetic character?
@@ -2209,7 +2209,7 @@ Is `c` an ASCII alphabetic character?
***
#### (ASCII-ALPHANUMERIC? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` an ASCII alphanumeric character?
@@ -2218,7 +2218,7 @@ Is `c` an ASCII alphanumeric character?
***
#### (ASCII-DIGIT? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` an ASCII digit character?
@@ -2227,7 +2227,7 @@ Is `c` an ASCII digit character?
***
#### (ASCII-LOWERCASE? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` an ASCII lowercase character?
@@ -2236,7 +2236,7 @@ Is `c` an ASCII lowercase character?
***
#### (ASCII-UPPERCASE? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` an ASCII uppercase character?
@@ -2245,7 +2245,7 @@ Is `c` an ASCII uppercase character?
***
#### (CHAR-CODE CHAR) [FUNCTION] · src
-(Char → UFix)
+(Char → UFix)
Convert a character to its ASCII representation.
@@ -2254,7 +2254,7 @@ Convert a character to its ASCII representation.
***
#### (CODE-CHAR CODE) [FUNCTION] · src
-(UFix → (Optional Char))
+(UFix → (Optional Char))
Convert a number to its ASCII character, returning None on failure.
@@ -2263,7 +2263,7 @@ Convert a number to its ASCII character, returning None on failure.
***
#### (DIGIT? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` a digit character?
@@ -2272,7 +2272,7 @@ Is `c` a digit character?
***
#### (DOWNCASE C) [FUNCTION] · src
-(Char → Char)
+(Char → Char)
Returns the downcased version of `c`, returning `c` when there is none.
@@ -2281,7 +2281,7 @@ Returns the downcased version of `c`, returning `c` when there is none.
***
#### (LOWERCASE? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` a lowercase character?
@@ -2290,7 +2290,7 @@ Is `c` a lowercase character?
***
#### (RANGE START END) [FUNCTION] · src
-(Char → Char → (Iterator Char))
+(Char → Char → (Iterator Char))
An inclusive range of characters from `start` to `end` by `char-code`.
@@ -2299,7 +2299,7 @@ An inclusive range of characters from `start` to `end` by `char-code`.
***
#### (UPCASE C) [FUNCTION] · src
-(Char → Char)
+(Char → Char)
Returns the upcased version of `c`, returning `c` when there is none.
@@ -2308,7 +2308,7 @@ Returns the upcased version of `c`, returning `c` when there is none.
***
#### (UPPERCASE? C) [FUNCTION] · src
-(Char → Boolean)
+(Char → Boolean)
Is `c` an uppercase character?
@@ -2327,13 +2327,13 @@ Implementation dependent hash code.
Instances
-- Default Hash
-- Eq Hash
-- Hash Hash
-- Monoid Hash
-- Ord Hash
-- RuntimeRepr Hash
-- Semigroup Hash
+- Default Hash
+- Eq Hash
+- Hash Hash
+- Monoid Hash
+- Ord Hash
+- RuntimeRepr Hash
+- Semigroup Hash
@@ -2354,9 +2354,9 @@ The result of an ordered comparison.
Instances
-- Eq Ord
-- Ord Ord
-- RuntimeRepr Ord
+- Eq Ord
+- Ord Ord
+- RuntimeRepr Ord
@@ -2373,24 +2373,24 @@ Represents something that may have failed.
Instances
-- (Eq :A) (Eq :B) ⇒ Eq (Result :A :B)
-- (Ord :A) (Ord :B) ⇒ Ord (Result :A :B)
-- Applicative (Result :A)
-- Bifunctor Result
-- FromIterator :A :B ⇒ FromIterator (Result :C :A) (Result :C :B)
-- Functor (Result :A)
-- Into (Optional :A) (Result Unit :A)
-- Into (Result :A :B) (Optional :B)
-- IntoIterator (Result :A :B) :B
-- Iso (Result Unit :A) (Optional :A)
-- Monad (Result :A)
-- Monoid :A ⇒ Monoid (Result :B :A)
-- RuntimeRepr (Result :A :B)
-- Semigroup :A ⇒ Semigroup (Result :B :A)
-- Terminator (Result :A :B)
-- Traversable (Result :A)
-- Unwrappable (Result :A)
-- Yielder (Result :A)
+- (Eq :A) (Eq :B) ⇒ Eq (Result :A :B)
+- (Ord :A) (Ord :B) ⇒ Ord (Result :A :B)
+- Applicative (Result :A)
+- Bifunctor Result
+- FromIterator :A :B ⇒ FromIterator (Result :C :A) (Result :C :B)
+- Functor (Result :A)
+- Into (Optional :A) (Result Unit :A)
+- Into (Result :A :B) (Optional :B)
+- IntoIterator (Result :A :B) :B
+- Iso (Result Unit :A) (Optional :A)
+- Monad (Result :A)
+- Monoid :A ⇒ Monoid (Result :B :A)
+- RuntimeRepr (Result :A :B)
+- Semigroup :A ⇒ Semigroup (Result :B :A)
+- Terminator (Result :A :B)
+- Traversable (Result :A)
+- Unwrappable (Result :A)
+- Yielder (Result :A)
@@ -2407,22 +2407,22 @@ A heterogeneous collection of items.
Instances
-- (Default :A) (Default :B) ⇒ Default (Tuple :A :B)
-- (Eq :A) (Eq :B) ⇒ Eq (Tuple :A :B)
-- (Hash :A) (Hash :B) ⇒ Hash (Tuple :A :B)
-- (Ord :A) (Ord :B) ⇒ Ord (Tuple :A :B)
-- Bifunctor Tuple
-- Hash :A ⇒ FromIterator (HashMap :A :B) (Tuple :A :B)
-- Hash :A ⇒ FromIterator (Hashtable :A :B) (Tuple :A :B)
-- Into (MapPair :A :B) (Tuple :A :B)
-- Into (Tuple :A :B) (Tuple :B :A)
-- IntoIterator (HashMap :A :B) (Tuple :A :B)
-- IntoIterator (Hashtable :A :B) (Tuple :A :B)
-- IntoIterator (OrdMap :A :B) (Tuple :A :B)
-- Iso (Tuple :A :B) (Tuple :B :A)
-- Ord :A ⇒ FromIterator (OrdMap :A :B) (Tuple :A :B)
-- RuntimeRepr (Tuple :A :B)
-- Traversable (Tuple :A)
+- (Default :A) (Default :B) ⇒ Default (Tuple :A :B)
+- (Eq :A) (Eq :B) ⇒ Eq (Tuple :A :B)
+- (Hash :A) (Hash :B) ⇒ Hash (Tuple :A :B)
+- (Ord :A) (Ord :B) ⇒ Ord (Tuple :A :B)
+- Bifunctor Tuple
+- Hash :A ⇒ FromIterator (HashMap :A :B) (Tuple :A :B)
+- Hash :A ⇒ FromIterator (Hashtable :A :B) (Tuple :A :B)
+- Into (MapPair :A :B) (Tuple :A :B)
+- Into (Tuple :A :B) (Tuple :B :A)
+- IntoIterator (HashMap :A :B) (Tuple :A :B)
+- IntoIterator (Hashtable :A :B) (Tuple :A :B)
+- IntoIterator (OrdMap :A :B) (Tuple :A :B)
+- Iso (Tuple :A :B) (Tuple :B :A)
+- Ord :A ⇒ FromIterator (OrdMap :A :B) (Tuple :A :B)
+- RuntimeRepr (Tuple :A :B)
+- Traversable (Tuple :A)
@@ -2444,9 +2444,9 @@ Methods:
Instances
-- Monad :A ⇒ Alternative (OptionalT :A)
-- Alternative List
-- Alternative Optional
+- Monad :A ⇒ Alternative (OptionalT :A)
+- Alternative List
+- Alternative Optional
@@ -2466,21 +2466,21 @@ Methods:
Instances
-- Monad :A ⇒ Applicative (LoopT :A)
-- (Functor :A) (Monad :B) ⇒ Applicative ((FreeT :A) :B)
-- Functor :A ⇒ Applicative (Free :A)
-- Monad :A ⇒ Applicative (OptionalT :A)
-- Monad :A ⇒ Applicative ((ResultT :B) :A)
-- Applicative :A ⇒ Applicative ((EnvT :B) :A)
-- Applicative (Env :A)
-- Applicative :A ⇒ Applicative ((StateT :B) :A)
-- Applicative (ST :A)
-- Applicative Identity
-- Applicative List
-- Applicative (Result :A)
-- Applicative Optional
-- Applicative Cell
-- Applicative (Arrow :A)
+- Monad :A ⇒ Applicative (LoopT :A)
+- (Functor :A) (Monad :B) ⇒ Applicative ((FreeT :A) :B)
+- Functor :A ⇒ Applicative (Free :A)
+- Monad :A ⇒ Applicative (OptionalT :A)
+- Monad :A ⇒ Applicative ((ResultT :B) :A)
+- Applicative :A ⇒ Applicative ((EnvT :B) :A)
+- Applicative (Env :A)
+- Applicative :A ⇒ Applicative ((StateT :B) :A)
+- Applicative (ST :A)
+- Applicative Identity
+- Applicative List
+- Applicative (Result :A)
+- Applicative Optional
+- Applicative Cell
+- Applicative (Arrow :A)
@@ -2499,9 +2499,9 @@ Methods:
Instances
-- Functor :A ⇒ Bifunctor (FreeF :A)
-- Bifunctor Result
-- Bifunctor Tuple
+- Functor :A ⇒ Bifunctor (FreeF :A)
+- Bifunctor Result
+- Bifunctor Tuple
@@ -2516,39 +2516,39 @@ Methods:
Types which have default values.
Methods:
-- DEFAULT :: (Unit → :A)
+- DEFAULT :: (Unit → :A)
Instances
-- RuntimeRepr :A ⇒ Default (Seq :A)
-- Default (Queue :A)
-- Hash :A ⇒ Default (Hashtable :A :B)
-- Default String
-- Default (Vector :A)
-- Default (List :A)
-- Default (Optional :A)
-- (Default :A) (Default :B) (Default :C) (Default :D) (Default :E) ⇒ Default (Tuple5 :A :B :C :D :E)
-- (Default :A) (Default :B) (Default :C) (Default :D) ⇒ Default (Tuple4 :A :B :C :D)
-- (Default :A) (Default :B) (Default :C) ⇒ Default (Tuple3 :A :B :C)
-- (Default :A) (Default :B) ⇒ Default (Tuple :A :B)
-- Default :A ⇒ Default (Cell :A)
-- Default F64
-- Default F32
-- Default Integer
-- Default UFix
-- Default IFix
-- Default U64
-- Default U32
-- Default U16
-- Default I64
-- Default I32
-- Default I16
-- Default U8
-- Default I8
-- Default Bit
-- Default Symbol
-- Default Boolean
-- Default Hash
+- RuntimeRepr :A ⇒ Default (Seq :A)
+- Default (Queue :A)
+- Hash :A ⇒ Default (Hashtable :A :B)
+- Default String
+- Default (Vector :A)
+- Default (List :A)
+- Default (Optional :A)
+- (Default :A) (Default :B) (Default :C) (Default :D) (Default :E) ⇒ Default (Tuple5 :A :B :C :D :E)
+- (Default :A) (Default :B) (Default :C) (Default :D) ⇒ Default (Tuple4 :A :B :C :D)
+- (Default :A) (Default :B) (Default :C) ⇒ Default (Tuple3 :A :B :C)
+- (Default :A) (Default :B) ⇒ Default (Tuple :A :B)
+- Default :A ⇒ Default (Cell :A)
+- Default F64
+- Default F32
+- Default Integer
+- Default UFix
+- Default IFix
+- Default U64
+- Default U32
+- Default U16
+- Default I64
+- Default I32
+- Default I16
+- Default U8
+- Default I8
+- Default Bit
+- Default Symbol
+- Default Boolean
+- Default Hash
@@ -2563,59 +2563,59 @@ Methods:
Types which have equality defined.
Methods:
-- == :: (:A → :A → Boolean)
+- == :: (:A → :A → Boolean)
Instances
-- Eq CReal
-- Eq Big-Float
-- Eq Pathname
-- Eq :A ⇒ Eq (Seq :A)
-- (Eq :A) (Eq :B) ⇒ Eq (OrdMap :A :B)
-- Eq :A ⇒ Eq (MapPair :A :B)
-- Eq :A ⇒ Eq (OrdTree :A)
-- Eq :A ⇒ Eq (Queue :A)
-- (Eq :A) (Eq :B) (Hash :A) ⇒ Eq (HashMap :A :B)
-- (Hash :A) (Eq :B) ⇒ Eq (Hashtable :A :B)
-- Eq :A ⇒ Eq (Slice :A)
-- Eq String
-- Eq Char
-- Eq :A ⇒ Eq (Vector :A)
-- Eq :A ⇒ Eq (List :A)
-- Eq :A ⇒ Eq (LispArray :A)
-- (Eq :A) (Eq :B) ⇒ Eq (Result :A :B)
-- Eq :A ⇒ Eq (Optional :A)
-- (Eq :A) (Eq :B) (Eq :C) (Eq :D) (Eq :E) ⇒ Eq (Tuple5 :A :B :C :D :E)
-- (Eq :A) (Eq :B) (Eq :C) (Eq :D) ⇒ Eq (Tuple4 :A :B :C :D)
-- (Eq :A) (Eq :B) (Eq :C) ⇒ Eq (Tuple3 :A :B :C)
-- (Eq :A) (Eq :B) ⇒ Eq (Tuple :A :B)
-- Eq :A ⇒ Eq (Cell :A)
-- Eq :A ⇒ Eq () (* (* x :A)
-- Eq :A ⇒ Eq (Dual :A)
+- Eq CReal
+- Eq Big-Float
+- Eq Pathname
+- Eq :A ⇒ Eq (Seq :A)
+- (Eq :A) (Eq :B) ⇒ Eq (OrdMap :A :B)
+- Eq :A ⇒ Eq (MapPair :A :B)
+- Eq :A ⇒ Eq (OrdTree :A)
+- Eq :A ⇒ Eq (Queue :A)
+- (Eq :A) (Eq :B) (Hash :A) ⇒ Eq (HashMap :A :B)
+- (Hash :A) (Eq :B) ⇒ Eq (Hashtable :A :B)
+- Eq :A ⇒ Eq (Slice :A)
+- Eq String
+- Eq Char
+- Eq :A ⇒ Eq (Vector :A)
+- Eq :A ⇒ Eq (List :A)
+- Eq :A ⇒ Eq (LispArray :A)
+- (Eq :A) (Eq :B) ⇒ Eq (Result :A :B)
+- Eq :A ⇒ Eq (Optional :A)
+- (Eq :A) (Eq :B) (Eq :C) (Eq :D) (Eq :E) ⇒ Eq (Tuple5 :A :B :C :D :E)
+- (Eq :A) (Eq :B) (Eq :C) (Eq :D) ⇒ Eq (Tuple4 :A :B :C :D)
+- (Eq :A) (Eq :B) (Eq :C) ⇒ Eq (Tuple3 :A :B :C)
+- (Eq :A) (Eq :B) ⇒ Eq (Tuple :A :B)
+- Eq :A ⇒ Eq (Cell :A)
+- Eq :A ⇒ Eq (Hyperdual :A)
+- Eq :A ⇒ Eq (Dual :A)
Note: Eq only compares the primal component.
-- Eq Dyadic
-- ComplexComponent :A ⇒ Eq (Complex :A)
-- Eq Fraction
-- Eq F64
-- Eq F32
-- Eq U64
-- Eq I64
-- Eq U32
-- Eq I32
-- Eq U16
-- Eq I16
-- Eq U8
-- Eq I8
-- Eq Bit
-- Eq UFix
-- Eq IFix
-- Eq Integer
-- Eq Symbol
-- Eq Boolean
-- Eq Hash
-- Eq Ord
-- Eq Unit
-- Eq LispType
+- Eq Dyadic
+- ComplexComponent :A ⇒ Eq (Complex :A)
+- Eq Fraction
+- Eq F64
+- Eq F32
+- Eq U64
+- Eq I64
+- Eq U32
+- Eq I32
+- Eq U16
+- Eq I16
+- Eq U8
+- Eq I8
+- Eq Bit
+- Eq UFix
+- Eq IFix
+- Eq Integer
+- Eq Symbol
+- Eq Boolean
+- Eq Hash
+- Eq Ord
+- Eq Unit
+- Eq LispType
@@ -2635,13 +2635,13 @@ Methods:
Instances
-- Foldable OrdTree
-- Foldable :A ⇒ Foldable (Free :A)
-- Foldable Queue
-- Foldable Slice
-- Foldable Vector
-- Foldable List
-- Foldable LispArray
+- Foldable OrdTree
+- Foldable :A ⇒ Foldable (Free :A)
+- Foldable Queue
+- Foldable Slice
+- Foldable Vector
+- Foldable List
+- Foldable LispArray
@@ -2660,28 +2660,28 @@ Methods:
Instances
-- Functor Seq
-- Functor (OrdMap :A)
-- Functor :A ⇒ Functor (LoopT :A)
-- (Functor :A) (Functor :B) ⇒ Functor ((FreeT :A) :B)
-- Functor :A ⇒ Functor ((FreeF :A) :B)
-- Functor :A ⇒ Functor (Free :A)
-- Functor :A ⇒ Functor (OptionalT :A)
-- Functor :A ⇒ Functor ((ResultT :B) :A)
-- Functor :A ⇒ Functor ((EnvT :B) :A)
-- Functor (Env :A)
-- Functor :A ⇒ Functor ((StateT :B) :A)
-- Functor (ST :A)
-- Functor Identity
-- Functor Queue
-- Functor (HashMap :A)
-- Functor Vector
-- Functor List
-- Functor (Result :A)
-- Functor Optional
-- Functor Iterator
-- Functor Cell
-- Functor (Arrow :A)
+- Functor Seq
+- Functor (OrdMap :A)
+- Functor :A ⇒ Functor (LoopT :A)
+- (Functor :A) (Functor :B) ⇒ Functor ((FreeT :A) :B)
+- Functor :A ⇒ Functor ((FreeF :A) :B)
+- Functor :A ⇒ Functor (Free :A)
+- Functor :A ⇒ Functor (OptionalT :A)
+- Functor :A ⇒ Functor ((ResultT :B) :A)
+- Functor :A ⇒ Functor ((EnvT :B) :A)
+- Functor (Env :A)
+- Functor :A ⇒ Functor ((StateT :B) :A)
+- Functor (ST :A)
+- Functor Identity
+- Functor Queue
+- Functor (HashMap :A)
+- Functor Vector
+- Functor List
+- Functor (Result :A)
+- Functor Optional
+- Functor Iterator
+- Functor Cell
+- Functor (Arrow :A)
@@ -2698,40 +2698,40 @@ Types which can be hashed for storage in hash tables.
The hash function must satisfy the invariant that `(== left right)` implies `(== (hash left) (hash right))`.
Methods:
-- HASH :: (:A → Hash)
+- HASH :: (:A → Hash)
Instances
-- (Hash :A) (Hash :B) ⇒ Hash (OrdMap :A :B)
-- Hash :A ⇒ Hash (OrdTree :A)
-- (Hash :A) (Hash :B) ⇒ Hash (HashMap :A :B)
-- (Hash :A) (Hash :B) ⇒ Hash (Hashtable :A :B)
-- Hash String
-- Hash Char
-- Hash :A ⇒ Hash (List :A)
-- (Hash :A) (Hash :B) (Hash :C) (Hash :D) (Hash :E) ⇒ Hash (Tuple5 :A :B :C :D :E)
-- (Hash :A) (Hash :B) (Hash :C) (Hash :D) ⇒ Hash (Tuple4 :A :B :C :D)
-- (Hash :A) (Hash :B) (Hash :C) ⇒ Hash (Tuple3 :A :B :C)
-- (Hash :A) (Hash :B) ⇒ Hash (Tuple :A :B)
-- Hash :A ⇒ Hash () (* (* x :A)
-- Hash :A ⇒ Hash (Dual :A)
+- (Hash :A) (Hash :B) ⇒ Hash (OrdMap :A :B)
+- Hash :A ⇒ Hash (OrdTree :A)
+- (Hash :A) (Hash :B) ⇒ Hash (HashMap :A :B)
+- (Hash :A) (Hash :B) ⇒ Hash (Hashtable :A :B)
+- Hash String
+- Hash Char
+- Hash :A ⇒ Hash (List :A)
+- (Hash :A) (Hash :B) (Hash :C) (Hash :D) (Hash :E) ⇒ Hash (Tuple5 :A :B :C :D :E)
+- (Hash :A) (Hash :B) (Hash :C) (Hash :D) ⇒ Hash (Tuple4 :A :B :C :D)
+- (Hash :A) (Hash :B) (Hash :C) ⇒ Hash (Tuple3 :A :B :C)
+- (Hash :A) (Hash :B) ⇒ Hash (Tuple :A :B)
+- Hash :A ⇒ Hash (Hyperdual :A)
+- Hash :A ⇒ Hash (Dual :A)
Note: Hash only considers the primal component in order to be consistent with Eq.
-- Hash F64
-- Hash F32
-- Hash UFix
-- Hash IFix
-- Hash U64
-- Hash U32
-- Hash U16
-- Hash U8
-- Hash Bit
-- Hash I64
-- Hash I32
-- Hash I16
-- Hash I8
-- Hash Integer
-- Hash Boolean
-- Hash Hash
+- Hash F64
+- Hash F32
+- Hash UFix
+- Hash IFix
+- Hash U64
+- Hash U32
+- Hash U16
+- Hash U8
+- Hash Bit
+- Hash I64
+- Hash I32
+- Hash I16
+- Hash I8
+- Hash Integer
+- Hash Boolean
+- Hash Hash
@@ -2750,145 +2750,145 @@ Methods:
Instances
-- Into I8 CReal
-- Into U8 CReal
-- Into I16 CReal
-- Into U16 CReal
-- Into I32 CReal
-- Into U32 CReal
-- Into I64 CReal
-- Into U64 CReal
-- Into IFix CReal
-- Into UFix CReal
-- Into Integer CReal
-- Into Fraction CReal
-- Into F64 CReal
-- Into F32 CReal
-- (ComplexComponent :A) (Into :A CReal) ⇒ Into (Complex :A) (Complex CReal)
-- Into F64 Big-Float
-- Into F32 Big-Float
-- Into Fraction Big-Float
-- Into Integer Big-Float
-- Into Pathname String
-- Into String Pathname
-- Into (Seq :A) (Vector :A)
-- Into (Seq :A) (List :A)
-- (Foldable :A) (RuntimeRepr :B) ⇒ Into (:A :B) (Seq :B)
-- Into (MapPair :A :B) (Tuple :A :B)
-- Into (Vector :A) (Slice :A)
-- Into (Slice :A) (Vector :A)
-- Into F64 String
-- Into F32 String
-- Into Fraction String
-- Into U64 String
-- Into I64 String
-- Into U32 String
-- Into I32 String
-- Into U16 String
-- Into I16 String
-- Into U8 String
-- Into I8 String
-- Into UFix String
-- Into IFix String
-- Into Integer String
-- Into (Vector Char) String
-- Into (List Char) String
-- Into Char String
-- Into String (Vector Char)
-- Into String (List Char)
-- Into (Vector :A) (List :A)
-- Into (List :A) (Vector :A)
-- Into (Optional :A) (List :A)
-- Into (LispArray :A) (List :A)
-- RuntimeRepr :A ⇒ Into (List :A) (LispArray :A)
-- Into (Optional :A) (Result Unit :A)
-- Into (Result :A :B) (Optional :B)
-- Into (Tuple :A :B) (Tuple :B :A)
-- Into :A String ⇒ Into (Cell :A) String
-- Into (Cell :A) :A
-- Into :A (Cell :A)
-- (ComplexComponent :A) (Into :A () (* (* x :A)) ⇒ Into (Complex :A) (Complex () (* (* x :A))
-- Num :A ⇒ Into :A () (* (* x :A)
-- Into Integer Dyadic
-- Into Dyadic Fraction
-- ComplexComponent :A ⇒ Into :A (Complex :A)
-- Into UFix Fraction
-- Into U64 Fraction
-- Into U32 Fraction
-- Into U16 Fraction
-- Into U8 Fraction
-- Into Bit Fraction
-- Into IFix Fraction
-- Into I64 Fraction
-- Into I32 Fraction
-- Into I16 Fraction
-- Into I8 Fraction
-- Into Integer Fraction
-- Into F32 F64
-- Into I32 F64
-- Into U32 F64
-- Into I16 F64
-- Into U16 F64
-- Into I8 F64
-- Into U8 F64
-- Into Bit F64
-- Into I16 F32
-- Into U16 F32
-- Into I8 F32
-- Into U8 F32
-- Into Bit F32
-- Into IFix Integer
-- Into IFix I64
-- Into UFix Integer
-- Into UFix IFix
-- Into UFix I64
-- Into UFix U64
-- Into I64 Integer
-- Into U64 Integer
-- Into I32 Integer
-- Into I32 IFix
-- Into I32 I64
-- Into U32 Integer
-- Into U32 IFix
-- Into U32 UFix
-- Into U32 I64
-- Into U32 U64
-- Into I16 Integer
-- Into I16 IFix
-- Into I16 I64
-- Into I16 I32
-- Into U16 Integer
-- Into U16 IFix
-- Into U16 UFix
-- Into U16 I64
-- Into U16 U64
-- Into U16 I32
-- Into U16 U32
-- Into I8 Integer
-- Into I8 IFix
-- Into I8 I64
-- Into I8 I32
-- Into I8 I16
-- Into U8 Integer
-- Into U8 IFix
-- Into U8 UFix
-- Into U8 I64
-- Into U8 U64
-- Into U8 I32
-- Into U8 U32
-- Into U8 I16
-- Into U8 U16
-- Into Bit Integer
-- Into Bit IFix
-- Into Bit UFix
-- Into Bit I64
-- Into Bit U64
-- Into Bit I32
-- Into Bit U32
-- Into Bit I16
-- Into Bit U16
-- Into Bit I8
-- Into Bit U8
+- Into I8 CReal
+- Into U8 CReal
+- Into I16 CReal
+- Into U16 CReal
+- Into I32 CReal
+- Into U32 CReal
+- Into I64 CReal
+- Into U64 CReal
+- Into IFix CReal
+- Into UFix CReal
+- Into Integer CReal
+- Into Fraction CReal
+- Into F64 CReal
+- Into F32 CReal
+- (ComplexComponent :A) (Into :A CReal) ⇒ Into (Complex :A) (Complex CReal)
+- Into F64 Big-Float
+- Into F32 Big-Float
+- Into Fraction Big-Float
+- Into Integer Big-Float
+- Into Pathname String
+- Into String Pathname
+- Into (Seq :A) (Vector :A)
+- Into (Seq :A) (List :A)
+- (Foldable :A) (RuntimeRepr :B) ⇒ Into (:A :B) (Seq :B)
+- Into (MapPair :A :B) (Tuple :A :B)
+- Into (Vector :A) (Slice :A)
+- Into (Slice :A) (Vector :A)
+- Into F64 String
+- Into F32 String
+- Into Fraction String
+- Into U64 String
+- Into I64 String
+- Into U32 String
+- Into I32 String
+- Into U16 String
+- Into I16 String
+- Into U8 String
+- Into I8 String
+- Into UFix String
+- Into IFix String
+- Into Integer String
+- Into (Vector Char) String
+- Into (List Char) String
+- Into Char String
+- Into String (Vector Char)
+- Into String (List Char)
+- Into (Vector :A) (List :A)
+- Into (List :A) (Vector :A)
+- Into (Optional :A) (List :A)
+- Into (LispArray :A) (List :A)
+- RuntimeRepr :A ⇒ Into (List :A) (LispArray :A)
+- Into (Optional :A) (Result Unit :A)
+- Into (Result :A :B) (Optional :B)
+- Into (Tuple :A :B) (Tuple :B :A)
+- Into :A String ⇒ Into (Cell :A) String
+- Into (Cell :A) :A
+- Into :A (Cell :A)
+- (ComplexComponent :A) (Into :A (Hyperdual :A)) ⇒ Into (Complex :A) (Complex (Hyperdual :A))
+- Num :A ⇒ Into :A (Hyperdual :A)
+- Into Integer Dyadic
+- Into Dyadic Fraction
+- ComplexComponent :A ⇒ Into :A (Complex :A)
+- Into UFix Fraction
+- Into U64 Fraction
+- Into U32 Fraction
+- Into U16 Fraction
+- Into U8 Fraction
+- Into Bit Fraction
+- Into IFix Fraction
+- Into I64 Fraction
+- Into I32 Fraction
+- Into I16 Fraction
+- Into I8 Fraction
+- Into Integer Fraction
+- Into F32 F64
+- Into I32 F64
+- Into U32 F64
+- Into I16 F64
+- Into U16 F64
+- Into I8 F64
+- Into U8 F64
+- Into Bit F64
+- Into I16 F32
+- Into U16 F32
+- Into I8 F32
+- Into U8 F32
+- Into Bit F32
+- Into IFix Integer
+- Into IFix I64
+- Into UFix Integer
+- Into UFix IFix
+- Into UFix I64
+- Into UFix U64
+- Into I64 Integer
+- Into U64 Integer
+- Into I32 Integer
+- Into I32 IFix
+- Into I32 I64
+- Into U32 Integer
+- Into U32 IFix
+- Into U32 UFix
+- Into U32 I64
+- Into U32 U64
+- Into I16 Integer
+- Into I16 IFix
+- Into I16 I64
+- Into I16 I32
+- Into U16 Integer
+- Into U16 IFix
+- Into U16 UFix
+- Into U16 I64
+- Into U16 U64
+- Into U16 I32
+- Into U16 U32
+- Into I8 Integer
+- Into I8 IFix
+- Into I8 I64
+- Into I8 I32
+- Into I8 I16
+- Into U8 Integer
+- Into U8 IFix
+- Into U8 UFix
+- Into U8 I64
+- Into U8 U64
+- Into U8 I32
+- Into U8 U32
+- Into U8 I16
+- Into U8 U16
+- Into Bit Integer
+- Into Bit IFix
+- Into Bit UFix
+- Into Bit I64
+- Into Bit U64
+- Into Bit I32
+- Into Bit U32
+- Into Bit I16
+- Into Bit U16
+- Into Bit I8
+- Into Bit U8
- Into :A :A
@@ -2907,12 +2907,12 @@ Methods:
Instances
-- Iso (Slice :A) (Vector :A)
-- Iso (List Char) String
-- Iso (Vector :A) (List :A)
-- RuntimeRepr :A ⇒ Iso (LispArray :A) (List :A)
-- Iso (Result Unit :A) (Optional :A)
-- Iso (Tuple :A :B) (Tuple :B :A)
+- Iso (Slice :A) (Vector :A)
+- Iso (List Char) String
+- Iso (Vector :A) (List :A)
+- RuntimeRepr :A ⇒ Iso (LispArray :A) (List :A)
+- Iso (Result Unit :A) (Optional :A)
+- Iso (Tuple :A :B) (Tuple :B :A)
- Iso :A :A
@@ -2932,20 +2932,20 @@ Methods:
Instances
-- Monad :A ⇒ Monad (LoopT :A)
-- (Functor :A) (Monad :B) ⇒ Monad ((FreeT :A) :B)
-- Functor :A ⇒ Monad (Free :A)
-- Monad :A ⇒ Monad (OptionalT :A)
-- Monad :A ⇒ Monad ((ResultT :B) :A)
-- Monad :A ⇒ Monad ((EnvT :B) :A)
-- Monad (Env :A)
-- Monad :A ⇒ Monad ((StateT :B) :A)
-- Monad (ST :A)
-- Monad Identity
-- Monad List
-- Monad (Result :A)
-- Monad Optional
-- Monad (Arrow :A)
+- Monad :A ⇒ Monad (LoopT :A)
+- (Functor :A) (Monad :B) ⇒ Monad ((FreeT :A) :B)
+- Functor :A ⇒ Monad (Free :A)
+- Monad :A ⇒ Monad (OptionalT :A)
+- Monad :A ⇒ Monad ((ResultT :B) :A)
+- Monad :A ⇒ Monad ((EnvT :B) :A)
+- Monad (Env :A)
+- Monad :A ⇒ Monad ((StateT :B) :A)
+- Monad (ST :A)
+- Monad Identity
+- Monad List
+- Monad (Result :A)
+- Monad Optional
+- Monad (Arrow :A)
@@ -2957,11 +2957,11 @@ Methods:
Monad :A ⇒ MonadFail :A
Methods:
-- FAIL :: (String → (:A :B))
+- FAIL :: (String → (:A :B))
Instances
-- MonadFail Optional
+- MonadFail Optional
@@ -2981,12 +2981,12 @@ Methods:
Instances
-- MonadTransformer LoopT
-- Functor :A ⇒ MonadTransformer (FreeT :A)
-- MonadTransformer OptionalT
-- MonadTransformer (ResultT :A)
-- MonadTransformer (EnvT :A)
-- MonadTransformer (StateT :A)
+- MonadTransformer LoopT
+- Functor :A ⇒ MonadTransformer (FreeT :A)
+- MonadTransformer OptionalT
+- MonadTransformer (ResultT :A)
+- MonadTransformer (EnvT :A)
+- MonadTransformer (StateT :A)
@@ -3005,16 +3005,16 @@ Methods:
Instances
-- Monoid Pathname
-- RuntimeRepr :A ⇒ Monoid (Seq :A)
-- Ord :A ⇒ Monoid (OrdMap :A :B)
-- Hash :A ⇒ Monoid (HashMap :A :B)
-- Monoid String
-- Monoid (Vector :A)
-- Monoid (List :A)
-- Monoid :A ⇒ Monoid (Result :B :A)
-- Monoid :A ⇒ Monoid (Optional :A)
-- Monoid Hash
+- Monoid Pathname
+- RuntimeRepr :A ⇒ Monoid (Seq :A)
+- Ord :A ⇒ Monoid (OrdMap :A :B)
+- Hash :A ⇒ Monoid (HashMap :A :B)
+- Monoid String
+- Monoid (Vector :A)
+- Monoid (List :A)
+- Monoid :A ⇒ Monoid (Result :B :A)
+- Monoid :A ⇒ Monoid (Optional :A)
+- Monoid Hash
@@ -3032,32 +3032,32 @@ Methods:
- + :: (:A → :A → :A)
- - :: (:A → :A → :A)
- * :: (:A → :A → :A)
-- FROMINT :: (Integer → :A)
+- FROMINT :: (Integer → :A)
Instances
-- Num CReal
-- Num Big-Float
-- Num :A ⇒ Num (Cell :A)
-- Num :A ⇒ Num () (* (* x :A)
-- Num :A ⇒ Num (Dual :A)
-- Num Dyadic
-- ComplexComponent :A ⇒ Num (Complex :A)
-- Num Fraction
-- Num F64
-- Num F32
-- Num UFix
-- Num Bit
-- Num U64
-- Num U32
-- Num U16
-- Num U8
-- Num IFix
-- Num I64
-- Num I32
-- Num I16
-- Num I8
-- Num Integer
+- Num CReal
+- Num Big-Float
+- Num :A ⇒ Num (Cell :A)
+- Num :A ⇒ Num (Hyperdual :A)
+- Num :A ⇒ Num (Dual :A)
+- Num Dyadic
+- ComplexComponent :A ⇒ Num (Complex :A)
+- Num Fraction
+- Num F64
+- Num F32
+- Num UFix
+- Num Bit
+- Num U64
+- Num U32
+- Num U16
+- Num U8
+- Num IFix
+- Num I64
+- Num I32
+- Num I16
+- Num I8
+- Num Integer
@@ -3072,43 +3072,43 @@ Methods:
Types whose values can be ordered. Requires `Eq`.
Methods:
-- <=> :: (:A → :A → Ord)
Given two objects, return their comparison (as an `Ord` object).
+- <=> :: (:A → :A → Ord)
Given two objects, return their comparison (as an `Ord` object).
Instances
-- Ord CReal
-- Ord Big-Float
-- Ord Pathname
-- Ord :A ⇒ Ord (MapPair :A :B)
-- Ord String
-- Ord Char
-- Ord :A ⇒ Ord (List :A)
-- (Ord :A) (Ord :B) ⇒ Ord (Result :A :B)
-- Ord :A ⇒ Ord (Optional :A)
-- (Ord :A) (Ord :B) ⇒ Ord (Tuple :A :B)
-- Ord :A ⇒ Ord (Cell :A)
-- Ord :A ⇒ Ord () (* (* x :A)
-- Ord :A ⇒ Ord (Dual :A)
+- Ord CReal
+- Ord Big-Float
+- Ord Pathname
+- Ord :A ⇒ Ord (MapPair :A :B)
+- Ord String
+- Ord Char
+- Ord :A ⇒ Ord (List :A)
+- (Ord :A) (Ord :B) ⇒ Ord (Result :A :B)
+- Ord :A ⇒ Ord (Optional :A)
+- (Ord :A) (Ord :B) ⇒ Ord (Tuple :A :B)
+- Ord :A ⇒ Ord (Cell :A)
+- Ord :A ⇒ Ord (Hyperdual :A)
+- Ord :A ⇒ Ord (Dual :A)
Note: Ord only compares the primal component.
-- Ord Dyadic
-- Ord Fraction
-- Ord F64
-- Ord F32
-- Ord U64
-- Ord I64
-- Ord U32
-- Ord I32
-- Ord U16
-- Ord I16
-- Ord U8
-- Ord I8
-- Ord Bit
-- Ord UFix
-- Ord IFix
-- Ord Integer
-- Ord Boolean
-- Ord Hash
-- Ord Ord
+- Ord Dyadic
+- Ord Fraction
+- Ord F64
+- Ord F32
+- Ord U64
+- Ord I64
+- Ord U32
+- Ord I32
+- Ord U16
+- Ord I16
+- Ord U8
+- Ord I8
+- Ord Bit
+- Ord UFix
+- Ord IFix
+- Ord Integer
+- Ord Boolean
+- Ord Hash
+- Ord Ord
@@ -3127,18 +3127,18 @@ Methods:
Instances
-- Semigroup Pathname
-- RuntimeRepr :A ⇒ Semigroup (Seq :A)
-- Ord :A ⇒ Semigroup (OrdMap :A :B)
-- Semigroup (Queue :A)
-- Hash :A ⇒ Semigroup (HashMap :A :B)
-- Semigroup String
-- Semigroup (Vector :A)
-- Semigroup (List :A)
-- Semigroup :A ⇒ Semigroup (Result :B :A)
-- Semigroup :A ⇒ Semigroup (Optional :A)
-- Semigroup :A ⇒ Semigroup (Cell :A)
-- Semigroup Hash
+- Semigroup Pathname
+- RuntimeRepr :A ⇒ Semigroup (Seq :A)
+- Ord :A ⇒ Semigroup (OrdMap :A :B)
+- Semigroup (Queue :A)
+- Hash :A ⇒ Semigroup (HashMap :A :B)
+- Semigroup String
+- Semigroup (Vector :A)
+- Semigroup (List :A)
+- Semigroup :A ⇒ Semigroup (Result :B :A)
+- Semigroup :A ⇒ Semigroup (Optional :A)
+- Semigroup :A ⇒ Semigroup (Cell :A)
+- Semigroup Hash
@@ -3157,9 +3157,9 @@ Methods:
Instances
-- Signalable FileError
-- Signalable LispCondition
-- Signalable String
+- Signalable FileError
+- Signalable LispCondition
+- Signalable String
@@ -3175,13 +3175,13 @@ Methods:
Instances
-- (Monad :A) (Traversable :A) (Traversable :B) ⇒ Traversable ((FreeT :B) :A)
-- Traversable :A ⇒ Traversable ((FreeF :A) :B)
-- Traversable :A ⇒ Traversable (Free :A)
-- Traversable List
-- Traversable (Result :A)
-- Traversable Optional
-- Traversable (Tuple :A)
+- (Monad :A) (Traversable :A) (Traversable :B) ⇒ Traversable ((FreeT :B) :A)
+- Traversable :A ⇒ Traversable ((FreeF :A) :B)
+- Traversable :A ⇒ Traversable (Free :A)
+- Traversable List
+- Traversable (Result :A)
+- Traversable Optional
+- Traversable (Tuple :A)
@@ -3196,105 +3196,105 @@ Methods:
`TRY-INTO` implies some elements of `:a` can be represented exactly by an element of `:b`, but sometimes not. If not, an error of type `:c` is returned.
Methods:
-- TRYINTO :: (:A → (Result :C :B))
+- TRYINTO :: (:A → (Result :C :B))
Instances
-- TryInto String Integer String
-- TryInto UFix F64 String
-- TryInto IFix F64 String
-- TryInto U64 F64 String
-- TryInto I64 F64 String
-- TryInto I32 F32 String
-- TryInto U32 F32 String
-- TryInto UFix F32 String
-- TryInto IFix F32 String
-- TryInto U64 F32 String
-- TryInto I64 F32 String
-- TryInto Integer F64 String
-- TryInto Integer F32 String
-- TryInto Integer IFix String
-- TryInto Integer UFix String
-- TryInto Integer I64 String
-- TryInto Integer U64 String
-- TryInto Integer I32 String
-- TryInto Integer U32 String
-- TryInto Integer I16 String
-- TryInto Integer U16 String
-- TryInto Integer I8 String
-- TryInto Integer U8 String
-- TryInto Integer Bit String
-- TryInto IFix UFix String
-- TryInto IFix U64 String
-- TryInto IFix I32 String
-- TryInto IFix U32 String
-- TryInto IFix I16 String
-- TryInto IFix U16 String
-- TryInto IFix I8 String
-- TryInto IFix U8 String
-- TryInto IFix Bit String
-- TryInto UFix I32 String
-- TryInto UFix U32 String
-- TryInto UFix I16 String
-- TryInto UFix U16 String
-- TryInto UFix I8 String
-- TryInto UFix U8 String
-- TryInto UFix Bit String
-- TryInto I64 IFix String
-- TryInto I64 UFix String
-- TryInto I64 U64 String
-- TryInto I64 I32 String
-- TryInto I64 U32 String
-- TryInto I64 I16 String
-- TryInto I64 U16 String
-- TryInto I64 I8 String
-- TryInto I64 U8 String
-- TryInto I64 Bit String
-- TryInto U64 IFix String
-- TryInto U64 UFix String
-- TryInto U64 I64 String
-- TryInto U64 I32 String
-- TryInto U64 U32 String
-- TryInto U64 I16 String
-- TryInto U64 U16 String
-- TryInto U64 I8 String
-- TryInto U64 U8 String
-- TryInto U64 Bit String
-- TryInto I32 UFix String
-- TryInto I32 U64 String
-- TryInto I32 U32 String
-- TryInto I32 I16 String
-- TryInto I32 U16 String
-- TryInto I32 I8 String
-- TryInto I32 U8 String
-- TryInto I32 Bit String
-- TryInto U32 I32 String
-- TryInto U32 I16 String
-- TryInto U32 U16 String
-- TryInto U32 I8 String
-- TryInto U32 U8 String
-- TryInto U32 Bit String
-- TryInto I16 UFix String
-- TryInto I16 U64 String
-- TryInto I16 U32 String
-- TryInto I16 U16 String
-- TryInto I16 I8 String
-- TryInto I16 U8 String
-- TryInto I16 Bit String
-- TryInto U16 I16 String
-- TryInto U16 I8 String
-- TryInto U16 U8 String
-- TryInto U16 Bit String
-- TryInto I8 UFix String
-- TryInto I8 U64 String
-- TryInto I8 U32 String
-- TryInto I8 U16 String
-- TryInto I8 U8 String
-- TryInto I8 Bit String
-- TryInto U8 I8 String
-- TryInto U8 Bit String
-- TryInto F64 Fraction String
-- TryInto F32 Fraction String
+- TryInto String Integer String
+- TryInto UFix F64 String
+- TryInto IFix F64 String
+- TryInto U64 F64 String
+- TryInto I64 F64 String
+- TryInto I32 F32 String
+- TryInto U32 F32 String
+- TryInto UFix F32 String
+- TryInto IFix F32 String
+- TryInto U64 F32 String
+- TryInto I64 F32 String
+- TryInto Integer F64 String
+- TryInto Integer F32 String
+- TryInto Integer IFix String
+- TryInto Integer UFix String
+- TryInto Integer I64 String
+- TryInto Integer U64 String
+- TryInto Integer I32 String
+- TryInto Integer U32 String
+- TryInto Integer I16 String
+- TryInto Integer U16 String
+- TryInto Integer I8 String
+- TryInto Integer U8 String
+- TryInto Integer Bit String
+- TryInto IFix UFix String
+- TryInto IFix U64 String
+- TryInto IFix I32 String
+- TryInto IFix U32 String
+- TryInto IFix I16 String
+- TryInto IFix U16 String
+- TryInto IFix I8 String
+- TryInto IFix U8 String
+- TryInto IFix Bit String
+- TryInto UFix I32 String
+- TryInto UFix U32 String
+- TryInto UFix I16 String
+- TryInto UFix U16 String
+- TryInto UFix I8 String
+- TryInto UFix U8 String
+- TryInto UFix Bit String
+- TryInto I64 IFix String
+- TryInto I64 UFix String
+- TryInto I64 U64 String
+- TryInto I64 I32 String
+- TryInto I64 U32 String
+- TryInto I64 I16 String
+- TryInto I64 U16 String
+- TryInto I64 I8 String
+- TryInto I64 U8 String
+- TryInto I64 Bit String
+- TryInto U64 IFix String
+- TryInto U64 UFix String
+- TryInto U64 I64 String
+- TryInto U64 I32 String
+- TryInto U64 U32 String
+- TryInto U64 I16 String
+- TryInto U64 U16 String
+- TryInto U64 I8 String
+- TryInto U64 U8 String
+- TryInto U64 Bit String
+- TryInto I32 UFix String
+- TryInto I32 U64 String
+- TryInto I32 U32 String
+- TryInto I32 I16 String
+- TryInto I32 U16 String
+- TryInto I32 I8 String
+- TryInto I32 U8 String
+- TryInto I32 Bit String
+- TryInto U32 I32 String
+- TryInto U32 I16 String
+- TryInto U32 U16 String
+- TryInto U32 I8 String
+- TryInto U32 U8 String
+- TryInto U32 Bit String
+- TryInto I16 UFix String
+- TryInto I16 U64 String
+- TryInto I16 U32 String
+- TryInto I16 U16 String
+- TryInto I16 I8 String
+- TryInto I16 U8 String
+- TryInto I16 Bit String
+- TryInto U16 I16 String
+- TryInto U16 I8 String
+- TryInto U16 U8 String
+- TryInto U16 Bit String
+- TryInto I8 UFix String
+- TryInto I8 U64 String
+- TryInto I8 U32 String
+- TryInto I8 U16 String
+- TryInto I8 U8 String
+- TryInto I8 Bit String
+- TryInto U8 I8 String
+- TryInto U8 Bit String
+- TryInto F64 Fraction String
+- TryInto F32 Fraction String
@@ -3320,12 +3320,12 @@ Typical `fail` continuations are:
- Signal an error.
Methods:
-- UNWRAP-OR-ELSE :: ((:B → :C) → (Unit → :C) → (:A :B) → :C)
+- UNWRAP-OR-ELSE :: ((:B → :C) → (Unit → :C) → (:A :B) → :C)
Instances
-- Unwrappable Optional
-- Unwrappable (Result :A)
+- Unwrappable Optional
+- Unwrappable (Result :A)
@@ -3336,7 +3336,7 @@ Methods:
### Values
#### (< X Y) [FUNCTION] · src
-∀ :A. Ord :A ⇒ (:A → :A → Boolean)
+∀ :A. Ord :A ⇒ (:A → :A → Boolean)
Is `x` less than `y`?
@@ -3345,7 +3345,7 @@ Is `x` less than `y`?
***
#### (<= X Y) [FUNCTION] · src
-∀ :A. Ord :A ⇒ (:A → :A → Boolean)
+∀ :A. Ord :A ⇒ (:A → :A → Boolean)
Is `x` less than or equal to `y`?
@@ -3354,7 +3354,7 @@ Is `x` less than or equal to `y`?
***
#### (> X Y) [FUNCTION] · src
-∀ :A. Ord :A ⇒ (:A → :A → Boolean)
+∀ :A. Ord :A ⇒ (:A → :A → Boolean)
Is `x` greater than `y`?
@@ -3363,7 +3363,7 @@ Is `x` greater than `y`?
***
#### (>= X Y) [FUNCTION] · src
-∀ :A. Ord :A ⇒ (:A → :A → Boolean)
+∀ :A. Ord :A ⇒ (:A → :A → Boolean)
Is `x` greater than or equal to `y`?
@@ -3381,7 +3381,7 @@ Equivalent to `(>>= a (fn (_) b))`.
***
#### (AS-OPTIONAL CONTAINER) [FUNCTION] · src
-∀ :A :B. Unwrappable :A ⇒ ((:A :B) → (Optional :B))
+∀ :A :B. Unwrappable :A ⇒ ((:A :B) → (Optional :B))
Convert any Unwrappable container into an `Optional`, constructing Some on a successful unwrap and None on a failed unwrap.
@@ -3390,7 +3390,7 @@ Convert any Unwrappable container into an `Optional`, constructing Some on a suc
***
#### (DEFAULT? X) [FUNCTION] · src
-∀ :A. (Default :A) (Eq :A) ⇒ (:A → Boolean)
+∀ :A. (Default :A) (Eq :A) ⇒ (:A → Boolean)
Is `x` the default item of its type?
@@ -3408,7 +3408,7 @@ Unwrap an `unwrappable`, returning `(default)` of the wrapped type on failure.
***
#### (EXPECT REASON CONTAINER) [FUNCTION] · src
-∀ :A :B. Unwrappable :A ⇒ (String → (:A :B) → :B)
+∀ :A :B. Unwrappable :A ⇒ (String → (:A :B) → :B)
Unwrap `container`, signaling an error with the description `reason` on failure.
@@ -3453,7 +3453,7 @@ Returns the greater element of `x` and `y`.
***
#### (MCOMMUTE? A B) [FUNCTION] · src
-∀ :A. (Eq :A) (Semigroup :A) ⇒ (:A → :A → Boolean)
+∀ :A. (Eq :A) (Semigroup :A) ⇒ (:A → :A → Boolean)
Does `a <> b` equal `b <> a`?
@@ -3480,7 +3480,7 @@ Map a container to a container of monoids, and then fold that container into a s
***
#### (MEMPTY? A) [FUNCTION] · src
-∀ :A. (Eq :A) (Monoid :A) ⇒ (:A → Boolean)
+∀ :A. (Eq :A) (Monoid :A) ⇒ (:A → Boolean)
Does `a` equal `(the Type mempty)`?
@@ -3538,34 +3538,34 @@ Unwrap `container`, returning `default` on failure.
Instances
-- ComplexComponent CReal
-- Dividable Integer CReal
-- Elementary CReal
-- Eq CReal
-- Exponentiable CReal
-- Into F32 CReal
-- Into F64 CReal
-- Into Fraction CReal
-- Into I16 CReal
-- Into I32 CReal
-- Into I64 CReal
-- Into I8 CReal
-- Into IFix CReal
-- Into Integer CReal
-- Into U16 CReal
-- Into U32 CReal
-- Into U64 CReal
-- Into U8 CReal
-- Into UFix CReal
-- Num CReal
-- Ord CReal
-- Polar CReal
-- Quantizable CReal
-- Radical CReal
-- Real CReal
-- Reciprocable CReal
-- RuntimeRepr CReal
-- Trigonometric CReal
+- ComplexComponent CReal
+- Dividable Integer CReal
+- Elementary CReal
+- Eq CReal
+- Exponentiable CReal
+- Into F32 CReal
+- Into F64 CReal
+- Into Fraction CReal
+- Into I16 CReal
+- Into I32 CReal
+- Into I64 CReal
+- Into I8 CReal
+- Into IFix CReal
+- Into Integer CReal
+- Into U16 CReal
+- Into U32 CReal
+- Into U64 CReal
+- Into U8 CReal
+- Into UFix CReal
+- Num CReal
+- Ord CReal
+- Polar CReal
+- Quantizable CReal
+- Radical CReal
+- Real CReal
+- Reciprocable CReal
+- RuntimeRepr CReal
+- Trigonometric CReal
@@ -3576,7 +3576,7 @@ Unwrap `container`, returning `default` on failure.
### Values
#### (APPROX X K) [FUNCTION] · src
-(CReal → UFix → Integer)
+(CReal → UFix → Integer)
Computes an approximation of the bits of a given
`CReal`. Specifically, given an object of type `CReal` `x` and a
@@ -3594,7 +3594,7 @@ See `rational` or `rationalize` to produce a rational approximation of
***
#### (COMPARISON-THRESHOLD _) [FUNCTION] · src
-∀ :A. (:A → UFix)
+∀ :A. (:A → UFix)
Returns the current `CReal` comparison threshold measured as a number
of bits after the 'decimal' point.
@@ -3609,7 +3609,7 @@ is no guarantee that the `CReal` will be accurate to any precision*.
***
#### (CR-PRINT X K) [FUNCTION] · src
-(CReal → UFix → Boolean)
+(CReal → UFix → Boolean)
Prints a real `x` up to `k` bits of precision.
@@ -3618,7 +3618,7 @@ Prints a real `x` up to `k` bits of precision.
***
#### (RATIONAL-APPROX X K) [FUNCTION] · src
-(CReal → UFix → Fraction)
+(CReal → UFix → Fraction)
Produce a rational approximation of `x` called $r$ such that
@@ -3631,7 +3631,7 @@ $$
***
#### (RATIONALIZE X K) [FUNCTION] · src
-(CReal → UFix → Fraction)
+(CReal → UFix → Fraction)
Produce a rational approximation of `x` called $r$ such that
@@ -3647,7 +3647,7 @@ the simplest possible such approximation.
***
#### (SET-COMPARISON-THRESHOLD! K) [FUNCTION] · src
-∀ :A. (:A → Unit)
+∀ :A. (:A → Unit)
Sets the global `CReal` comparison threshold to k bits after the 'decimal' point.
@@ -3707,7 +3707,7 @@ Otherwise evaluate M-NONE.
***
#### (IF-VAL_ VAL? F-MVAL M-NONE) [FUNCTION] · src
-∀ :A :B :C :D :E. (Monad :C) (Yielder :A) ⇒ ((:A :B) → (:B → (:C :D)) → (:C :E) → (:C Unit))
+∀ :A :B :C :D :E. (Monad :C) (Yielder :A) ⇒ ((:A :B) → (:B → (:C :D)) → (:C :E) → (:C Unit))
Like if-val, but discards the branch result and returns Unit.
@@ -3734,7 +3734,7 @@ Evaluate MVAL? and map F->MB over the successful value(s) from inside the monad.
***
#### (WHEN-VAL VAL? F->M) [FUNCTION] · src
-∀ :A :B :C :D. (Monad :C) (Yielder :A) ⇒ ((:A :B) → (:B → (:C :D)) → (:C Unit))
+∀ :A :B :C :D. (Monad :C) (Yielder :A) ⇒ ((:A :B) → (:B → (:C :D)) → (:C Unit))
If VAL? yields a value, apply F->M to it. If not, do nothing. Always returns Unit.
@@ -3743,7 +3743,7 @@ If VAL? yields a value, apply F->M to it. If not, do nothing. Always returns Uni
***
#### (WHEN-VALM MVAL? F->M) [FUNCTION] · src
-∀ :A :B :C :D. (Monad :A) (Yielder :B) ⇒ ((:A (:B :C)) → (:C → (:A :D)) → (:A Unit))
+∀ :A :B :C :D. (Monad :A) (Yielder :B) ⇒ ((:A (:B :C)) → (:C → (:A :D)) → (:A Unit))
Evaluate MVAL?, and if it yields, run F->M on the value. Otherwise, do nothing.
@@ -3752,7 +3752,7 @@ Evaluate MVAL?, and if it yields, run F->M on the value. Otherwise, do nothing.
***
#### (WHENM MTERM? MOP) [FUNCTION] · src
-∀ :A :B :C. (Monad :A) (Terminator :B) ⇒ ((:A :B) → (:A :C) → (:A Unit))
+∀ :A :B :C. (Monad :A) (Terminator :B) ⇒ ((:A :B) → (:A :C) → (:A Unit))
Evaluate MTERM?, and if it indicates completion, run MOP, or do nothing.
@@ -3761,7 +3761,7 @@ Evaluate MTERM?, and if it indicates completion, run MOP, or do nothing.
***
#### (WHEN_ TERM? M) [FUNCTION] · src
-∀ :A :B :C. (Monad :B) (Terminator :A) ⇒ (:A → (:B :C) → (:B Unit))
+∀ :A :B :C. (Monad :B) (Terminator :A) ⇒ (:A → (:B :C) → (:B Unit))
Run the monadic operation M when the terminator TERM? indicates completion,
or do nothing.
@@ -3775,7 +3775,7 @@ or do nothing.
### Values
#### (COLLECT-VAL M-OPERATION) [FUNCTION] · src
-∀ :A :B :C. (Monad :A) (Yielder :B) ⇒ ((:A (:B :C)) → (:A (List :C)))
+∀ :A :B :C. (Monad :A) (Yielder :B) ⇒ ((:A (:B :C)) → (:A (List :C)))
Repeatedly run M-OPERATION, collecting each yielded value into a list until
no value is yielded.
@@ -3785,7 +3785,7 @@ no value is yielded.
***
#### (FOREACH INTO-ITR FA->M) [FUNCTION] · src
-∀ :A :B :C :D. (Monad :C) (IntoIterator :A :B) ⇒ (:A → (:B → (:C :D)) → (:C Unit))
+∀ :A :B :C :D. (Monad :C) (IntoIterator :A :B) ⇒ (:A → (:B → (:C :D)) → (:C Unit))
Apply FA->M to each element produced by INTO-ITR and run the resulting monadic action.
Discards the return values and returns Unit.
@@ -3795,7 +3795,7 @@ Discards the return values and returns Unit.
***
#### (LOOP-TIMES N M-OPERATION) [FUNCTION] · src
-∀ :A :B. Monad :A ⇒ (UFix → (UFix → (:A :B)) → (:A Unit))
+∀ :A :B. Monad :A ⇒ (UFix → (UFix → (:A :B)) → (:A Unit))
Repeat M-OPERATION N times. Passes the current index (starting at 0) to
M-OPERATION. Returns Unit.
@@ -3805,7 +3805,7 @@ M-OPERATION. Returns Unit.
***
#### (LOOP-WHILE M-OPERATION) [FUNCTION] · src
-∀ :A :B. (Monad :A) (Terminator :B) ⇒ ((:A :B) → (:A Unit))
+∀ :A :B. (Monad :A) (Terminator :B) ⇒ ((:A :B) → (:A Unit))
Repeat M-OPERATION until it returns a terminated value. Returns Unit.
@@ -3814,7 +3814,7 @@ Repeat M-OPERATION until it returns a terminated value. Returns Unit.
***
#### (LOOP-WHILE-VALM M-OPERATION F) [FUNCTION] · src
-∀ :A :B :C :D. (Monad :A) (Yielder :B) ⇒ ((:A (:B :C)) → (:C → (:A :D)) → (:A Unit))
+∀ :A :B :C :D. (Monad :A) (Yielder :B) ⇒ ((:A (:B :C)) → (:C → (:A :D)) → (:A Unit))
Repeat M-OPERATION while it yields a value, running the yielded value applied to F.
Returns Unit.
@@ -3828,17 +3828,17 @@ Returns Unit.
### Types
#### LoopT [TYPE] · src
-- (LoopT (:A (Step :B)))
+- (LoopT (:A (Step :B)))
Instances
-- Functor :A ⇒ Functor (LoopT :A)
-- Monad :A ⇒ Applicative (LoopT :A)
-- Monad :A ⇒ Monad (LoopT :A)
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A (LoopT :B)
-- MonadState :A :B ⇒ MonadState :A (LoopT :B)
-- MonadTransformer LoopT
-- RuntimeRepr ((LoopT :A) :B)
+- Functor :A ⇒ Functor (LoopT :A)
+- Monad :A ⇒ Applicative (LoopT :A)
+- Monad :A ⇒ Monad (LoopT :A)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A (LoopT :B)
+- MonadState :A :B ⇒ MonadState :A (LoopT :B)
+- MonadTransformer LoopT
+- RuntimeRepr ((LoopT :A) :B)
@@ -3849,7 +3849,7 @@ Returns Unit.
### Values
#### (COLLECT BODY) [FUNCTION] · src
-∀ :A :B. Monad :A ⇒ (((LoopT :A) :B) → (:A (List :B)))
+∀ :A :B. Monad :A ⇒ (((LoopT :A) :B) → (:A (List :B)))
Run BODY in a loop, collecting each value it produces into a list in encounter order.
Stops when BODY breaks. Continues skip the rest of the iteration. Returns the collected list.
@@ -3859,7 +3859,7 @@ Stops when BODY breaks. Continues skip the rest of the iteration. Returns the co
***
#### (COLLECT-VAL BODY) [FUNCTION] · src
-∀ :A :B :C. (Monad :A) (Yielder :B) ⇒ (((LoopT :A) (:B :C)) → (:A (List :C)))
+∀ :A :B :C. (Monad :A) (Yielder :B) ⇒ (((LoopT :A) (:B :C)) → (:A (List :C)))
Run BODY in a loop, adding each available value it yields to a list.
Stops when BODY yields no value or breaks. Continue skips the rest of the iteration.
@@ -3870,7 +3870,7 @@ Returns the collected list.
***
#### (FOREACH LST FA->LPT-M) [FUNCTION] · src
-∀ :A :B :C. Monad :B ⇒ ((List :A) → (:A → ((LoopT :B) :C)) → (:B Unit))
+∀ :A :B :C. Monad :B ⇒ ((List :A) → (:A → ((LoopT :B) :C)) → (:B Unit))
For each element of LST, run FA->LPT-M on it. Break stops the iteration.
Continue skips to the next element. Discards return values and returns Unit.
@@ -3880,7 +3880,7 @@ Continue skips to the next element. Discards return values and returns Unit.
***
#### (LOOP-DO-WHILE M-TERM? BODY) [FUNCTION] · src
-∀ :A :B :C. (Monad :A) (Terminator :B) ⇒ ((:A :B) → ((LoopT :A) :C) → (:A Unit))
+∀ :A :B :C. (Monad :A) (Terminator :B) ⇒ ((:A :B) → ((LoopT :A) :C) → (:A Unit))
Before each iteration, evaluate M-TERM?. If it indicates completion, stop; otherwise run BODY.
Respects break and continue within BODY. Returns Unit.
@@ -3890,7 +3890,7 @@ Respects break and continue within BODY. Returns Unit.
***
#### (LOOP-TIMES N BODY) [FUNCTION] · src
-∀ :A :B. Monad :A ⇒ (UFix → (UFix → ((LoopT :A) :B)) → (:A Unit))
+∀ :A :B. Monad :A ⇒ (UFix → (UFix → ((LoopT :A) :B)) → (:A Unit))
Repeat BODY N times. Passes the current index (starting at 0) to BODY.
Returns Unit.
@@ -3900,7 +3900,7 @@ Returns Unit.
***
#### (LOOP-WHILE BODY) [FUNCTION] · src
-∀ :A :B. (Monad :A) (Terminator :B) ⇒ (((LoopT :A) :B) → (:A Unit))
+∀ :A :B. (Monad :A) (Terminator :B) ⇒ (((LoopT :A) :B) → (:A Unit))
Run BODY repeatedly until it returns a terminated value. Returns Unit.
@@ -3909,7 +3909,7 @@ Run BODY repeatedly until it returns a terminated value. Returns Unit.
***
#### (LOOP_ BODY) [FUNCTION] · src
-∀ :A :B. Monad :A ⇒ (((LoopT :A) :B) → (:A Unit))
+∀ :A :B. Monad :A ⇒ (((LoopT :A) :B) → (:A Unit))
Run BODY forever, until it signals a break. Any produced values are ignored. Returns Unit.
@@ -3918,7 +3918,7 @@ Run BODY forever, until it signals a break. Any produced values are ignored. Ret
***
#### (ONCE LP-M) [FUNCTION] · src
-∀ :A :B. Monad :A ⇒ (((LoopT :A) :B) → (:A Unit))
+∀ :A :B. Monad :A ⇒ (((LoopT :A) :B) → (:A Unit))
Run an operation exactly once. Continue or break will both immediately end
execution in the operation. Returns Unit.
@@ -3928,7 +3928,7 @@ execution in the operation. Returns Unit.
***
#### (UNWRAP-LOOP (LOOPT M-STP)) [FUNCTION] · src
-∀ :A :B. (((LoopT :A) :B) → (:A (Step :B)))
+∀ :A :B. (((LoopT :A) :B) → (:A (Step :B)))
Advance a LoopT computation by one step, returning whether it asked to continue,
break, or produced a value.
@@ -3938,7 +3938,7 @@ break, or produced a value.
***
#### BREAK-LOOP [VALUE] · src
-∀ :A :B. Monad :A ⇒ ((LoopT :A) :B)
+∀ :A :B. Monad :A ⇒ ((LoopT :A) :B)
Signal that the loop should terminate immediately.
@@ -3947,7 +3947,7 @@ Signal that the loop should terminate immediately.
***
#### CONTINUE-LOOP [VALUE] · src
-∀ :A :B. Monad :A ⇒ ((LoopT :A) :B)
+∀ :A :B. Monad :A ⇒ ((LoopT :A) :B)
Signal that the current iteration should be skipped and the loop should continue.
@@ -4146,9 +4146,9 @@ Common Lisp makes a distinction between file and directory paths. Directory path
### Types
#### FileError [TYPE] · src
-- (PathError String Pathname)
-- (LispError LispCondition)
-- (FileError String)
+- (PathError String Pathname)
+- (LispError LispCondition)
+- (FileError String)
- EOF
Errors for file functions.
@@ -4156,8 +4156,8 @@ Errors for file functions.
Instances
-- RuntimeRepr FileError
-- Signalable FileError
+- RuntimeRepr FileError
+- Signalable FileError
@@ -4172,7 +4172,7 @@ Represents a file stream, using `cl:file-stream`.
Instances
-- RuntimeRepr (FileStream :A)
+- RuntimeRepr (FileStream :A)
@@ -4191,7 +4191,7 @@ Possible options for opening a stream when the file exists.
Instances
-- RuntimeRepr IfExists
+- RuntimeRepr IfExists
@@ -4206,13 +4206,13 @@ Pathname object. Equivalent to `cl:pathname`
Instances
-- Eq Pathname
-- Into Pathname String
-- Into String Pathname
-- Monoid Pathname
-- Ord Pathname
-- RuntimeRepr Pathname
-- Semigroup Pathname
+- Eq Pathname
+- Into Pathname String
+- Into String Pathname
+- Monoid Pathname
+- Ord Pathname
+- RuntimeRepr Pathname
+- Semigroup Pathname
@@ -4221,11 +4221,11 @@ Pathname object. Equivalent to `cl:pathname`
***
#### StreamOptions [TYPE] · src
-- (Bidirectional Pathname IfExists)
+- (Bidirectional Pathname IfExists)
- Constructor for opening a bidirectional stream.
-- (Output Pathname IfExists)
+- (Output Pathname IfExists)
- Constructor for opening an output stream.
-- (Input Pathname)
+- (Input Pathname)
- Constructor for opening an input stream
A type for providing parameters for opening streams. StreamOptions take strings for pathnames, but they will error if they are not proper and appropriate pathnames.
@@ -4233,7 +4233,7 @@ A type for providing parameters for opening streams. StreamOptions take strings
Instances
-- RuntimeRepr StreamOptions
+- RuntimeRepr StreamOptions
@@ -4250,23 +4250,23 @@ A type for providing parameters for opening streams. StreamOptions take strings
A class of types which are able to be written to or read from a file.
Methods:
-- OPEN :: (StreamOptions → (Result FileError (FileStream :A)))
-- READ :: ((FileStream :A) → (Result FileError :A))
-- WRITE :: ((FileStream :A) → :A → (Result FileError Unit))
+- OPEN :: (StreamOptions → (Result FileError (FileStream :A)))
+- READ :: ((FileStream :A) → (Result FileError :A))
+- WRITE :: ((FileStream :A) → :A → (Result FileError Unit))
Instances
-- File U64
-- File I64
-- File U32
-- File I32
-- File U16
-- File I16
-- File U8
-- File I8
-- File UFix
-- File IFix
-- File Char
+- File U64
+- File I64
+- File U32
+- File I32
+- File U16
+- File I16
+- File U8
+- File I8
+- File UFix
+- File IFix
+- File Char
@@ -4277,7 +4277,7 @@ Methods:
### Values
#### (ABORT STREAM) [FUNCTION] · src
-∀ :A :B. ((FileStream :A) → (Result FileError :B))
+∀ :A :B. ((FileStream :A) → (Result FileError :B))
Closes a FileStream and aborts all operations..
@@ -4286,7 +4286,7 @@ Closes a FileStream and aborts all operations..
***
#### (APPEND-TO-FILE! PATH DATA) [FUNCTION] · src
-∀ :A :B. (RuntimeRepr :B) (Into :A Pathname) (File :B) ⇒ (:A → (Vector :B) → (Result FileError Unit))
+∀ :A :B. (RuntimeRepr :B) (Into :A Pathname) (File :B) ⇒ (:A → (Vector :B) → (Result FileError Unit))
Opens and appends a file with data of type :a.
@@ -4295,7 +4295,7 @@ Opens and appends a file with data of type :a.
***
#### (CLOSE STREAM) [FUNCTION] · src
-∀ :A :B. ((FileStream :A) → (Result FileError :B))
+∀ :A :B. ((FileStream :A) → (Result FileError :B))
Closes a FileStream.
@@ -4304,7 +4304,7 @@ Closes a FileStream.
***
#### (COPY! INPUT OUTPUT) [FUNCTION] · src
-∀ :A :B. (Into :A Pathname) (Into :B Pathname) ⇒ (:A → :B → (Result FileError Unit))
+∀ :A :B. (Into :A Pathname) (Into :B Pathname) ⇒ (:A → :B → (Result FileError Unit))
Copies a file to a new location.
@@ -4313,7 +4313,7 @@ Copies a file to a new location.
***
#### (CREATE-DIRECTORY! PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Pathname))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Pathname))
This is equivalent to `mkdir -p`. Creates a directory and its parents. The pathname must be a valid directory pathname.
@@ -4322,7 +4322,7 @@ This is equivalent to `mkdir -p`. Creates a directory and its parents. The pathn
***
#### (CREATE-TEMP-DIRECTORY! _) [FUNCTION] · src
-(Unit → (Result FileError Pathname))
+(Unit → (Result FileError Pathname))
This configures a default temporary directory for use.
@@ -4331,7 +4331,7 @@ This configures a default temporary directory for use.
***
#### (CREATE-TEMP-FILE! FILE-EXT) [FUNCTION] · src
-(String → (Result FileError Pathname))
+(String → (Result FileError Pathname))
This configures a default temporary file for use.
@@ -4340,7 +4340,7 @@ This configures a default temporary file for use.
***
#### (DELETE-FILE! PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Unit))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Unit))
Deletes a given file if the file exists.
@@ -4349,7 +4349,7 @@ Deletes a given file if the file exists.
***
#### (DIRECTORY-EXISTS? PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
Returns True if a pathname names a directory that exists.
@@ -4358,7 +4358,7 @@ Returns True if a pathname names a directory that exists.
***
#### (DIRECTORY-FILES PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError (List Pathname)))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError (List Pathname)))
Returns all files within the directory. Returns an error if the pathname is not a directory pathname.
@@ -4367,7 +4367,7 @@ Returns all files within the directory. Returns an error if the pathname is not
***
#### (DIRECTORY-PATHNAME? PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → Boolean)
+∀ :A. Into :A Pathname ⇒ (:A → Boolean)
Returns True if a pathname has no file component.
@@ -4376,7 +4376,7 @@ Returns True if a pathname has no file component.
***
#### (EMPTY? PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
Checks whether a directory is empty.
@@ -4385,7 +4385,7 @@ Checks whether a directory is empty.
***
#### (EXISTS? PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
Returns whether a file or directory exists.
@@ -4394,7 +4394,7 @@ Returns whether a file or directory exists.
***
#### (FILE-EXISTS? PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Boolean))
Returns True if a pathname names a file that exists.
@@ -4403,7 +4403,7 @@ Returns True if a pathname names a file that exists.
***
#### (FILE-PATHNAME? PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → Boolean)
+∀ :A. Into :A Pathname ⇒ (:A → Boolean)
Returns True if a pathname has a file component.
@@ -4412,7 +4412,7 @@ Returns True if a pathname has a file component.
***
#### (FILE-POSITION STREAM) [FUNCTION] · src
-∀ :A. ((FileStream :A) → (Result FileError UFix))
+∀ :A. ((FileStream :A) → (Result FileError UFix))
Finds the file-position of a file stream.
@@ -4421,7 +4421,7 @@ Finds the file-position of a file stream.
***
#### (FLUSH STREAM) [FUNCTION] · src
-∀ :A :B. ((FileStream :A) → (Result FileError :B))
+∀ :A :B. ((FileStream :A) → (Result FileError :B))
Blocks until `stream` has been flushed. Calls `cl:finish-output`.
@@ -4430,7 +4430,7 @@ Blocks until `stream` has been flushed. Calls `cl:finish-output`.
***
#### (MERGE PATH1 PATH2) [FUNCTION] · src
-∀ :A :B. (Into :A Pathname) (Into :B Pathname) ⇒ (:A → :B → Pathname)
+∀ :A :B. (Into :A Pathname) (Into :B Pathname) ⇒ (:A → :B → Pathname)
Merges two pathnames together. The directory pathname should be the first argument.
@@ -4439,7 +4439,7 @@ Merges two pathnames together. The directory pathname should be the first argume
***
#### (READ-CHAR STREAM) [FUNCTION] · src
-((FileStream Char) → (Result FileError Char))
+((FileStream Char) → (Result FileError Char))
Reads a character from an FileStream.
@@ -4448,7 +4448,7 @@ Reads a character from an FileStream.
***
#### (READ-FILE-LINES PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError (List String)))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError (List String)))
Reads a file into lines, given a pathname or string.
@@ -4457,7 +4457,7 @@ Reads a file into lines, given a pathname or string.
***
#### (READ-FILE-TO-STRING PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError String))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError String))
Reads a file into a string, given a pathname string.
@@ -4466,7 +4466,7 @@ Reads a file into a string, given a pathname string.
***
#### (READ-FILE-TO-VECTOR STREAM) [FUNCTION] · src
-∀ :A. File :A ⇒ ((FileStream :A) → (Result FileError (Vector :A)))
+∀ :A. File :A ⇒ ((FileStream :A) → (Result FileError (Vector :A)))
Reads a file into a vector of type `:a`.
@@ -4475,7 +4475,7 @@ Reads a file into a vector of type `:a`.
***
#### (READ-LINE STREAM) [FUNCTION] · src
-((FileStream Char) → (Result FileError String))
+((FileStream Char) → (Result FileError String))
Reads a line of characters from a FileStream.
@@ -4484,7 +4484,7 @@ Reads a line of characters from a FileStream.
***
#### (READ-VECTOR STREAM CHUNK-SIZE) [FUNCTION] · src
-∀ :A. File :A ⇒ ((FileStream :A) → UFix → (Result FileError (Vector :A)))
+∀ :A. File :A ⇒ ((FileStream :A) → UFix → (Result FileError (Vector :A)))
Reads a chunk of a file into a vector of type `:a`.
@@ -4493,7 +4493,7 @@ Reads a chunk of a file into a vector of type `:a`.
***
#### (REMOVE-DIRECTORY! PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError :A))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError :A))
Deletes an empty directory.
@@ -4502,7 +4502,7 @@ Deletes an empty directory.
***
#### (REMOVE-DIRECTORY-RECURSIVE! PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Unit))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError Unit))
Deletes a target directory recursively. Equivalent to `rm -r`. Errors if the path is not a directory.
@@ -4511,7 +4511,7 @@ Deletes a target directory recursively. Equivalent to `rm -r`. Errors if the pat
***
#### (SET-FILE-POSITION STREAM I) [FUNCTION] · src
-∀ :A. ((FileStream :A) → UFix → (Result FileError Unit))
+∀ :A. ((FileStream :A) → UFix → (Result FileError Unit))
Sets the file position of a file stream.
@@ -4520,7 +4520,7 @@ Sets the file position of a file stream.
***
#### (SUBDIRECTORIES PATH) [FUNCTION] · src
-∀ :A. Into :A Pathname ⇒ (:A → (Result FileError (List Pathname)))
+∀ :A. Into :A Pathname ⇒ (:A → (Result FileError (List Pathname)))
Returns all subdirectories within the directory. Returns an error if the pathname is not a directory pathname.
@@ -4529,7 +4529,7 @@ Returns all subdirectories within the directory. Returns an error if the pathnam
***
#### (SYSTEM-RELATIVE-PATHNAME SYSTEM-NAME NAME) [FUNCTION] · src
-∀ :A. Into :A String ⇒ (:A → String → (Result FileError Pathname))
+∀ :A. Into :A String ⇒ (:A → String → (Result FileError Pathname))
Generates a system-relative-pathname for a given filename or path. This is a wrapper for `asdf:system-relative-pathname`. `Name` will likely be an empty string unless a subdirectory or filename is specified.
@@ -4538,7 +4538,7 @@ Generates a system-relative-pathname for a given filename or path. This is a wra
***
#### (WITH-OPEN-FILE STREAM-OPTIONS THUNK) [FUNCTION] · src
-∀ :A :B. File :A ⇒ (StreamOptions → ((FileStream :A) → (Result FileError :B)) → (Result FileError :B))
+∀ :A :B. File :A ⇒ (StreamOptions → ((FileStream :A) → (Result FileError :B)) → (Result FileError :B))
Opens a file stream, performs `thunk` on it, then closes the stream.
@@ -4547,7 +4547,7 @@ Opens a file stream, performs `thunk` on it, then closes the stream.
***
#### (WITH-TEMP-DIRECTORY THUNK) [FUNCTION] · src
-∀ :A. ((Pathname → (Result FileError :A)) → (Result FileError :A))
+∀ :A. ((Pathname → (Result FileError :A)) → (Result FileError :A))
Performs an operation `thunk` inside a temporary directory.
@@ -4556,7 +4556,7 @@ Performs an operation `thunk` inside a temporary directory.
***
#### (WITH-TEMP-FILE FILE-TYPE THUNK) [FUNCTION] · src
-∀ :A :B. File :A ⇒ (String → ((FileStream :A) → (Result FileError :B)) → (Result FileError :B))
+∀ :A :B. File :A ⇒ (String → ((FileStream :A) → (Result FileError :B)) → (Result FileError :B))
Performs an operation `thunk` on a temporary file. File type extensions need to include `.`, like ".txt".
@@ -4565,7 +4565,7 @@ Performs an operation `thunk` on a temporary file. File type extensions need to
***
#### (WRITE-CHAR STREAM DATA) [FUNCTION] · src
-((FileStream Char) → Char → (Result FileError Unit))
+((FileStream Char) → Char → (Result FileError Unit))
Writes a `Char` to the stream.
@@ -4574,7 +4574,7 @@ Writes a `Char` to the stream.
***
#### (WRITE-LINE STREAM S) [FUNCTION] · src
-((FileStream Char) → String → (Result FileError Unit))
+((FileStream Char) → String → (Result FileError Unit))
Writes a string with an appended newline to a filestream of type Char.
@@ -4583,7 +4583,7 @@ Writes a string with an appended newline to a filestream of type Char.
***
#### (WRITE-STRING FS S) [FUNCTION] · src
-((FileStream Char) → String → (Result FileError Unit))
+((FileStream Char) → String → (Result FileError Unit))
Writes a `string` to a FileStream of type Char.
@@ -4592,7 +4592,7 @@ Writes a `string` to a FileStream of type Char.
***
#### (WRITE-TO-FILE! PATH DATA) [FUNCTION] · src
-∀ :A :B. (RuntimeRepr :B) (Into :A Pathname) (File :B) ⇒ (:A → (Vector :B) → (Result FileError Unit))
+∀ :A :B. (RuntimeRepr :B) (Into :A Pathname) (File :B) ⇒ (:A → (Vector :B) → (Result FileError Unit))
Opens and writes to a file with data of type :a. Supersedes existing data on the file.
@@ -4601,7 +4601,7 @@ Opens and writes to a file with data of type :a. Supersedes existing data on the
***
#### (WRITE-VECTOR STREAM V) [FUNCTION] · src
-∀ :A. (RuntimeRepr :A) (File :A) ⇒ ((FileStream :A) → (Vector :A) → (Result FileError Unit))
+∀ :A. (RuntimeRepr :A) (File :A) ⇒ ((FileStream :A) → (Vector :A) → (Result FileError Unit))
Writes elements of an vector of type `:a` to a stream of type `:a`.
@@ -4614,7 +4614,7 @@ Writes elements of an vector of type `:a` to a stream of type `:a`.
### Values
#### (/= A B) [FUNCTION] · src
-∀ :A. Eq :A ⇒ (:A → :A → Boolean)
+∀ :A. Eq :A ⇒ (:A → :A → Boolean)
Is `a` not equal to `b`?
@@ -4645,7 +4645,7 @@ Modeled after Haskell: https://wiki.haskell.org/Bracket_pattern
***
#### (COMPLEMENT F X) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → :A → Boolean)
+∀ :A. ((:A → Boolean) → :A → Boolean)
Compute the complement of a unary Boolean function.
@@ -4663,7 +4663,7 @@ Equivalent to `(f (g x))`.
***
#### (CONJOIN F G X) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (:A → Boolean) → :A → Boolean)
+∀ :A. ((:A → Boolean) → (:A → Boolean) → :A → Boolean)
Compute the conjunction of two unary Boolean functions.
@@ -4681,7 +4681,7 @@ A function that always returns its first argument.
***
#### (CURRY FUNC LEFT RIGHT) [FUNCTION] · src
-∀ :A :B :C. (((Tuple :A :B) → :C) → :A → :B → :C)
+∀ :A :B :C. (((Tuple :A :B) → :C) → :A → :B → :C)
Take a function whose input is a tuple and enable curried application of the left and right parameters, equivalent to `(func (Tuple left right))`.
@@ -4690,7 +4690,7 @@ Take a function whose input is a tuple and enable curried application of the lef
***
#### (DISJOIN F G X) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (:A → Boolean) → :A → Boolean)
+∀ :A. ((:A → Boolean) → (:A → Boolean) → :A → Boolean)
Compute the disjunction of two unary Boolean functions.
@@ -4742,7 +4742,7 @@ Fold over a list using `<>`.
***
#### (PAIR-WITH FUNC LEFT) [FUNCTION] · src
-∀ :A :B. ((:A → :B) → :A → (Tuple :A :B))
+∀ :A :B. ((:A → :B) → :A → (Tuple :A :B))
Create a `Tuple` of the form `(Tuple left (func left))`.
@@ -4751,7 +4751,7 @@ Create a `Tuple` of the form `(Tuple left (func left))`.
***
#### (PRINT ITEM) [FUNCTION] · src
-∀ :A. Into :A String ⇒ (:A → Unit)
+∀ :A. Into :A String ⇒ (:A → Unit)
Print the String representation of `item` to `cl:*standard-output*`.
@@ -4769,7 +4769,7 @@ The same as `fold` but with the argument order swapped to match `cl:reduce`
***
#### (TRACE STR) [FUNCTION] · src
-(String → Unit)
+(String → Unit)
Print a line to `cl:*standard-output*`.
@@ -4778,7 +4778,7 @@ Print a line to `cl:*standard-output*`.
***
#### (TRACEOBJECT STR ITEM) [FUNCTION] · src
-∀ :A. (String → :A → Unit)
+∀ :A. (String → :A → Unit)
Print a line to `cl:*standard-output*` in the form "{STR}: {ITEM}".
@@ -4787,7 +4787,7 @@ Print a line to `cl:*standard-output*` in the form "{STR}: {ITEM}".
***
#### (UNCURRY FUNC TPL) [FUNCTION] · src
-∀ :A :B :C. ((:A → :B → :C) → (Tuple :A :B) → :C)
+∀ :A :B :C. ((:A → :B → :C) → (Tuple :A :B) → :C)
Take a function with two currying parameters and enable their input as a single `Tuple`.
@@ -4796,7 +4796,7 @@ Take a function with two currying parameters and enable their input as a single
***
#### (UNSAFE-POINTER-EQ? A B) [FUNCTION] · src
-∀ :A. (:A → :A → Boolean)
+∀ :A. (:A → :A → Boolean)
***
@@ -4836,13 +4836,13 @@ For example, the following expressions are equivalent.
### Values
#### (COMBINE-HASHES LHS RHS) [FUNCTION] · src
-(Hash → Hash → Hash)
+(Hash → Hash → Hash)
***
#### (COMBINE-HASHES-ORDER-INDEPENDENT LHS RHS) [FUNCTION] · src
-(Hash → Hash → Hash)
+(Hash → Hash → Hash)
***
@@ -4852,21 +4852,21 @@ For example, the following expressions are equivalent.
### Types
#### HashMap [TYPE] · src
-- (HashMap (HmNode :A :B))
+- (HashMap (HmNode :A :B))
Immutable map (also known as a dictionary or dict) using hashes. Implemented as a hash array mapped trie data structure.
Instances
-- (Eq :A) (Eq :B) (Hash :A) ⇒ Eq (HashMap :A :B)
-- (Hash :A) (Hash :B) ⇒ Hash (HashMap :A :B)
-- Functor (HashMap :A)
-- Hash :A ⇒ FromIterator (HashMap :A :B) (Tuple :A :B)
-- Hash :A ⇒ Monoid (HashMap :A :B)
-- Hash :A ⇒ Semigroup (HashMap :A :B)
-- IntoIterator (HashMap :A :B) (Tuple :A :B)
-- RuntimeRepr (HashMap :A :B)
+- (Eq :A) (Eq :B) (Hash :A) ⇒ Eq (HashMap :A :B)
+- (Hash :A) (Hash :B) ⇒ Hash (HashMap :A :B)
+- Functor (HashMap :A)
+- Hash :A ⇒ FromIterator (HashMap :A :B) (Tuple :A :B)
+- Hash :A ⇒ Monoid (HashMap :A :B)
+- Hash :A ⇒ Semigroup (HashMap :A :B)
+- IntoIterator (HashMap :A :B) (Tuple :A :B)
+- RuntimeRepr (HashMap :A :B)
@@ -4877,7 +4877,7 @@ Immutable map (also known as a dictionary or dict) using hashes. Implemented as
### Values
#### (ADJOIN HM KEY VAL) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → :B → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → :B → (HashMap :A :B))
Returns a hashmap that has a new entry of (`key`, `val`) added to `hm`.
If `hm` alreay contains an entry with `key`, however, `hm` is returned as is.
@@ -4887,7 +4887,7 @@ If `hm` alreay contains an entry with `key`, however, `hm` is returned as is.
***
#### (COUNT HM) [FUNCTION] · src
-∀ :A :B. ((HashMap :A :B) → Integer)
+∀ :A :B. ((HashMap :A :B) → Integer)
Returns the number of entries in HM.
@@ -4896,7 +4896,7 @@ Returns the number of entries in HM.
***
#### (DIFFERENCE A B) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
Raturns a HashMap that contains mappings in `a` but not in `b`.
@@ -4905,7 +4905,7 @@ Raturns a HashMap that contains mappings in `a` but not in `b`.
***
#### (EMPTY? HM) [FUNCTION] · src
-∀ :A :B. ((HashMap :A :B) → Boolean)
+∀ :A :B. ((HashMap :A :B) → Boolean)
Returns True if a hashmap HM is empty, False if not.
@@ -4914,7 +4914,7 @@ Returns True if a hashmap HM is empty, False if not.
***
#### (ENTRIES HM) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (Iterator (Tuple :A :B)))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (Iterator (Tuple :A :B)))
Returns an interator to iterate over all entries in hashmap hm.
@@ -4923,7 +4923,7 @@ Returns an interator to iterate over all entries in hashmap hm.
***
#### (INSERT HM KEY VAL) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → :B → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → :B → (HashMap :A :B))
Returns a hashmap that has a new entry of (KEY, VAL) added to HM. If HM
contains an entry with KEY, the new hashmap replaces it for the new entry.
@@ -4933,7 +4933,7 @@ contains an entry with KEY, the new hashmap replaces it for the new entry.
***
#### (INTERSECTION A B) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
Construct a HashMap containing all the mappings whose key is in both A and B.
@@ -4944,7 +4944,7 @@ The entries from A remains in the result.
***
#### (KEYS HM) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (Iterator :A))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (Iterator :A))
Returns an interator to iterate over all the keys in a hashmap hm.
@@ -4953,7 +4953,7 @@ Returns an interator to iterate over all the keys in a hashmap hm.
***
#### (LOOKUP HM KEY) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → (Optional :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → (Optional :B))
Returns a value associated with KEY in the hashmap HM.
@@ -4962,7 +4962,7 @@ Returns a value associated with KEY in the hashmap HM.
***
#### (REMOVE HM KEY) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → (HashMap :A :B))
Returns a hashmap that is identical to HM except the entry with KEY is
removed. If HM does not contain an entry with KEY, HM is returned as is.
@@ -4972,7 +4972,7 @@ removed. If HM does not contain an entry with KEY, HM is returned as is.
***
#### (REPLACE HM KEY VAL) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → :B → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → :A → :B → (HashMap :A :B))
Returns a hashmap where the value associated with `key` is replaced
with `val`. If `hm` does not contain an entry with `key`, `hm` is
@@ -4983,7 +4983,7 @@ with `val`. If `hm` does not contain an entry with `key`, `hm` is
***
#### (UNION A B) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
Construct a HashMap containing all the mappings from A and B.
@@ -4996,13 +4996,13 @@ The operation is associative, but not commutative.
***
#### (UPDATE HM KEY F) [FUNCTION] · src
-∀ :A :B :C. Hash :A ⇒ ((HashMap :A :B) → :A → ((Optional :B) → (Tuple (Optional :B) :C)) → (Tuple (HashMap :A :B) :C))
+∀ :A :B :C. Hash :A ⇒ ((HashMap :A :B) → :A → ((Optional :B) → (Tuple (Optional :B) :C)) → (Tuple (HashMap :A :B) :C))
***
#### (VALUES HM) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (Iterator :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (Iterator :B))
Returns an interator to iterate over all the values in a hashmap hm.
@@ -5011,7 +5011,7 @@ Returns an interator to iterate over all the values in a hashmap hm.
***
#### (XOR A B) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
+∀ :A :B. Hash :A ⇒ ((HashMap :A :B) → (HashMap :A :B) → (HashMap :A :B))
Raturns a HashMap that contains mappings either in `a` or in `b`,
but not in both.
@@ -5021,7 +5021,7 @@ but not in both.
***
#### EMPTY [VALUE] · src
-∀ :A :B. (HashMap :A :B)
+∀ :A :B. (HashMap :A :B)
An empty HashMap
@@ -5040,12 +5040,12 @@ A mutable hash table.
Instances
-- (Hash :A) (Eq :B) ⇒ Eq (Hashtable :A :B)
-- (Hash :A) (Hash :B) ⇒ Hash (Hashtable :A :B)
-- Hash :A ⇒ Default (Hashtable :A :B)
-- Hash :A ⇒ FromIterator (Hashtable :A :B) (Tuple :A :B)
-- IntoIterator (Hashtable :A :B) (Tuple :A :B)
-- RuntimeRepr (Hashtable :A :B)
+- (Hash :A) (Eq :B) ⇒ Eq (Hashtable :A :B)
+- (Hash :A) (Hash :B) ⇒ Hash (Hashtable :A :B)
+- Hash :A ⇒ Default (Hashtable :A :B)
+- Hash :A ⇒ FromIterator (Hashtable :A :B) (Tuple :A :B)
+- IntoIterator (Hashtable :A :B) (Tuple :A :B)
+- RuntimeRepr (Hashtable :A :B)
@@ -5056,7 +5056,7 @@ A mutable hash table.
### Values
#### (COUNT TABLE) [FUNCTION] · src
-∀ :A :B. ((Hashtable :A :B) → Integer)
+∀ :A :B. ((Hashtable :A :B) → Integer)
Returns the number of entries in TABLE
@@ -5065,7 +5065,7 @@ Returns the number of entries in TABLE
***
#### (ENTRIES TABLE) [FUNCTION] · src
-∀ :A :B. ((Hashtable :A :B) → (Iterator (Tuple :A :B)))
+∀ :A :B. ((Hashtable :A :B) → (Iterator (Tuple :A :B)))
Returns the key-values pairs as a list.
@@ -5074,7 +5074,7 @@ Returns the key-values pairs as a list.
***
#### (EXTEND! TABLE ITER) [FUNCTION] · src
-∀ :A :B :C. (Hash :A) (IntoIterator :C (Tuple :A :B)) ⇒ ((Hashtable :A :B) → :C → Unit)
+∀ :A :B :C. (Hash :A) (IntoIterator :C (Tuple :A :B)) ⇒ ((Hashtable :A :B) → :C → Unit)
Insert all of the key value pairs from ITER into TABLE, overwriting duplicate keys.
@@ -5083,7 +5083,7 @@ Insert all of the key value pairs from ITER into TABLE, overwriting duplicate ke
***
#### (GET TABLE KEY) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((Hashtable :A :B) → :A → (Optional :B))
+∀ :A :B. Hash :A ⇒ ((Hashtable :A :B) → :A → (Optional :B))
Lookup KEY in TABLE
@@ -5092,7 +5092,7 @@ Lookup KEY in TABLE
***
#### (KEYS TABLE) [FUNCTION] · src
-∀ :A :B. ((Hashtable :A :B) → (Iterator :A))
+∀ :A :B. ((Hashtable :A :B) → (Iterator :A))
Returns the keys in TABLE as a list
@@ -5101,7 +5101,7 @@ Returns the keys in TABLE as a list
***
#### (NEW _) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ (Unit → (Hashtable :A :B))
+∀ :A :B. Hash :A ⇒ (Unit → (Hashtable :A :B))
Create a new empty hashtable
@@ -5110,7 +5110,7 @@ Create a new empty hashtable
***
#### (REMOVE! TABLE KEY) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((Hashtable :A :B) → :A → Unit)
+∀ :A :B. Hash :A ⇒ ((Hashtable :A :B) → :A → Unit)
Remove the entry at KEY from TABLE
@@ -5119,7 +5119,7 @@ Remove the entry at KEY from TABLE
***
#### (SET! TABLE KEY VALUE) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ ((Hashtable :A :B) → :A → :B → Unit)
+∀ :A :B. Hash :A ⇒ ((Hashtable :A :B) → :A → :B → Unit)
Set KEY to VALUE in TABLE
@@ -5128,7 +5128,7 @@ Set KEY to VALUE in TABLE
***
#### (VALUES TABLE) [FUNCTION] · src
-∀ :A :B. ((Hashtable :A :B) → (Iterator :B))
+∀ :A :B. ((Hashtable :A :B) → (Iterator :B))
Returns the values in TABLE as a list
@@ -5137,7 +5137,7 @@ Returns the values in TABLE as a list
***
#### (WITH-CAPACITY CAPACITY) [FUNCTION] · src
-∀ :A :B. Hash :A ⇒ (Integer → (Hashtable :A :B))
+∀ :A :B. Hash :A ⇒ (Integer → (Hashtable :A :B))
Create a new empty hashtable with a given capacity
@@ -5156,9 +5156,9 @@ A forward-moving pointer into an ordered sequence of :ELTs
Instances
-- Functor Iterator
-- IntoIterator (Iterator :A) :A
-- RuntimeRepr (Iterator :A)
+- Functor Iterator
+- IntoIterator (Iterator :A) :A
+- RuntimeRepr (Iterator :A)
@@ -5172,22 +5172,22 @@ A forward-moving pointer into an ordered sequence of :ELTs
FromIterator :A :B
Methods:
-- COLLECT! :: ((Iterator :B) → :A)
+- COLLECT! :: ((Iterator :B) → :A)
Instances
-- RuntimeRepr :A ⇒ FromIterator (Seq :A) :A
-- Ord :A ⇒ FromIterator (OrdMap :A :B) (Tuple :A :B)
-- Ord :A ⇒ FromIterator (OrdTree :A) :A
-- FromIterator (Queue :A) :A
-- Hash :A ⇒ FromIterator (HashMap :A :B) (Tuple :A :B)
-- Hash :A ⇒ FromIterator (Hashtable :A :B) (Tuple :A :B)
-- FromIterator (Slice :A) :A
-- FromIterator String Char
-- FromIterator (Vector :A) :A
-- FromIterator (List :A) :A
-- FromIterator :A :B ⇒ FromIterator (Result :C :A) (Result :C :B)
-- FromIterator :A :B ⇒ FromIterator (Optional :A) (Optional :B)
+- RuntimeRepr :A ⇒ FromIterator (Seq :A) :A
+- Ord :A ⇒ FromIterator (OrdMap :A :B) (Tuple :A :B)
+- Ord :A ⇒ FromIterator (OrdTree :A) :A
+- FromIterator (Queue :A) :A
+- Hash :A ⇒ FromIterator (HashMap :A :B) (Tuple :A :B)
+- Hash :A ⇒ FromIterator (Hashtable :A :B) (Tuple :A :B)
+- FromIterator (Slice :A) :A
+- FromIterator String Char
+- FromIterator (Vector :A) :A
+- FromIterator (List :A) :A
+- FromIterator :A :B ⇒ FromIterator (Result :C :A) (Result :C :B)
+- FromIterator :A :B ⇒ FromIterator (Optional :A) (Optional :B)
@@ -5204,23 +5204,23 @@ Containers which can be converted into iterators.
`INTO-ITER` must not mutate its argument, only produce a "view" into it.
Methods:
-- INTO-ITER :: (:A → (Iterator :B))
+- INTO-ITER :: (:A → (Iterator :B))
Instances
-- IntoIterator (Seq :A) :A
-- IntoIterator (OrdMap :A :B) (Tuple :A :B)
-- IntoIterator (OrdTree :A) :A
-- IntoIterator (Queue :A) :A
-- IntoIterator (HashMap :A :B) (Tuple :A :B)
-- IntoIterator (Hashtable :A :B) (Tuple :A :B)
-- IntoIterator (Slice :A) :A
-- IntoIterator String Char
-- IntoIterator (Vector :A) :A
-- IntoIterator (List :A) :A
-- IntoIterator (Result :A :B) :B
-- IntoIterator (Optional :A) :A
-- IntoIterator (Iterator :A) :A
+- IntoIterator (Seq :A) :A
+- IntoIterator (OrdMap :A :B) (Tuple :A :B)
+- IntoIterator (OrdTree :A) :A
+- IntoIterator (Queue :A) :A
+- IntoIterator (HashMap :A :B) (Tuple :A :B)
+- IntoIterator (Hashtable :A :B) (Tuple :A :B)
+- IntoIterator (Slice :A) :A
+- IntoIterator String Char
+- IntoIterator (Vector :A) :A
+- IntoIterator (List :A) :A
+- IntoIterator (Result :A :B) :B
+- IntoIterator (Optional :A) :A
+- IntoIterator (Iterator :A) :A
@@ -5231,7 +5231,7 @@ Methods:
### Values
#### (AND! ITER) [FUNCTION] · src
-((Iterator Boolean) → Boolean)
+((Iterator Boolean) → Boolean)
Returns True if all iterator elements are True. May not consume the entire iterator. Returns True on an empty iterator.
@@ -5240,7 +5240,7 @@ Returns True if all iterator elements are True. May not consume the entire itera
***
#### (ANY! GOOD? ITER) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (Iterator :A) → Boolean)
+∀ :A. ((:A → Boolean) → (Iterator :A) → Boolean)
Return `True` as soon as any element of ITER is GOOD?, or `False` if none of them are.
@@ -5251,7 +5251,7 @@ Returns `False` if ITER is empty.
***
#### (CHAIN! ITER1 ITER2) [FUNCTION] · src
-∀ :A. ((Iterator :A) → (Iterator :A) → (Iterator :A))
+∀ :A. ((Iterator :A) → (Iterator :A) → (Iterator :A))
Yield all the elements of ITER1 followed by all the elements from ITER2.
@@ -5260,7 +5260,7 @@ Yield all the elements of ITER1 followed by all the elements from ITER2.
***
#### (COUNT! ITER) [FUNCTION] · src
-∀ :A. ((Iterator :A) → UFix)
+∀ :A. ((Iterator :A) → UFix)
Return the number of elements in ITER.
This operation could be called `length!`, but `count!` emphasizes the fact that it consumes ITER, and
@@ -5271,7 +5271,7 @@ afterwards, ITER will be exhausted.
***
#### (COUNT-FOREVER _) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (Unit → (Iterator :A))
+∀ :A. (Num :A) (Ord :A) ⇒ (Unit → (Iterator :A))
An infinite iterator which starts at 0 and counts upwards by 1.
@@ -5280,7 +5280,7 @@ An infinite iterator which starts at 0 and counts upwards by 1.
***
#### (DOWN-FROM LIMIT) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → (Iterator :A))
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → (Iterator :A))
An iterator which begins below the provided limit and counts down through and including zero.
@@ -5289,7 +5289,7 @@ An iterator which begins below the provided limit and counts down through and in
***
#### (ELEMENTWISE-HASH! ITER) [FUNCTION] · src
-∀ :A. Hash :A ⇒ ((Iterator :A) → Hash)
+∀ :A. Hash :A ⇒ ((Iterator :A) → Hash)
Hash an iterator by combining the hashes of all its elements.
@@ -5300,7 +5300,7 @@ The empty iterator will hash as 0.
***
#### (ELEMENTWISE-MATCH! SAME? LEFT RIGHT) [FUNCTION] · src
-∀ :A. ((:A → :A → Boolean) → (Iterator :A) → (Iterator :A) → Boolean)
+∀ :A. ((:A → :A → Boolean) → (Iterator :A) → (Iterator :A) → Boolean)
Are LEFT and RIGHT elementwise-identical under SAME?
@@ -5312,7 +5312,7 @@ same length.
***
#### (ELEMENTWISE==!) [FUNCTION] · src
-∀ :A. Eq :A ⇒ ((Iterator :A) → (Iterator :A) → Boolean)
+∀ :A. Eq :A ⇒ ((Iterator :A) → (Iterator :A) → Boolean)
Is every element of the first iterator `==' to the corresponding element of the second?
@@ -5324,7 +5324,7 @@ the Nth element of the second iterator.
***
#### (ENUMERATE! ITER) [FUNCTION] · src
-∀ :A. ((Iterator :A) → (Iterator (Tuple UFix :A)))
+∀ :A. ((Iterator :A) → (Iterator (Tuple UFix :A)))
Pair successive zero-based incides with elements from ITER
@@ -5333,7 +5333,7 @@ Pair successive zero-based incides with elements from ITER
***
#### (EVERY! GOOD? ITER) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (Iterator :A) → Boolean)
+∀ :A. ((:A → Boolean) → (Iterator :A) → Boolean)
Return `True` if every element of ITER is GOOD?, or `False` as soon as any element is not GOOD?.
@@ -5344,7 +5344,7 @@ Returns `True` if ITER is empty.
***
#### (FILTER! KEEP? ITER) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (Iterator :A) → (Iterator :A))
+∀ :A. ((:A → Boolean) → (Iterator :A) → (Iterator :A))
Return an iterator over the elements from ITER for which KEEP?returns true.
@@ -5353,7 +5353,7 @@ Return an iterator over the elements from ITER for which KEEP?returns true.
***
#### (FILTER-MAP! F ITER) [FUNCTION] · src
-∀ :A :B. ((:A → (Optional :B)) → (Iterator :A) → (Iterator :B))
+∀ :A :B. ((:A → (Optional :B)) → (Iterator :A) → (Iterator :B))
Map an iterator, retaining only the elements where F returns SOME.
@@ -5362,7 +5362,7 @@ Map an iterator, retaining only the elements where F returns SOME.
***
#### (FIND! THIS? ITER) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (Iterator :A) → (Optional :A))
+∀ :A. ((:A → Boolean) → (Iterator :A) → (Optional :A))
Return the first element of ITER for which THIS? returns `True`, or `None` if no element matches.
@@ -5371,7 +5371,7 @@ Return the first element of ITER for which THIS? returns `True`, or `None` if no
***
#### (FIND-MAP! F) [FUNCTION] · src
-∀ :A :B. ((:A → (Optional :B)) → (Iterator :A) → (Optional :B))
+∀ :A :B. ((:A → (Optional :B)) → (Iterator :A) → (Optional :B))
Return the first element of (map F ITER) for which F returns `Some`.
@@ -5380,7 +5380,7 @@ Return the first element of (map F ITER) for which F returns `Some`.
***
#### (FLAT-MAP! FUNC ITER) [FUNCTION] · src
-∀ :A :B. ((:A → (Iterator :B)) → (Iterator :A) → (Iterator :B))
+∀ :A :B. ((:A → (Iterator :B)) → (Iterator :A) → (Iterator :B))
Flatten! wrapped around map.
@@ -5389,7 +5389,7 @@ Flatten! wrapped around map.
***
#### (FLATTEN! ITERS) [FUNCTION] · src
-∀ :A. ((Iterator (Iterator :A)) → (Iterator :A))
+∀ :A. ((Iterator (Iterator :A)) → (Iterator :A))
Yield all the elements from each of the ITERS in order.
@@ -5398,7 +5398,7 @@ Yield all the elements from each of the ITERS in order.
***
#### (FOLD! FUNC INIT ITER) [FUNCTION] · src
-∀ :A :B. ((:A → :B → :A) → :A → (Iterator :B) → :A)
+∀ :A :B. ((:A → :B → :A) → :A → (Iterator :B) → :A)
Tail recursive in-order fold. Common Lisp calls this operation `reduce`.
@@ -5410,7 +5410,7 @@ STATE, using INIT as the first STATE.
***
#### (FOR-EACH! THUNK ITER) [FUNCTION] · src
-∀ :A. ((:A → Unit) → (Iterator :A) → Unit)
+∀ :A. ((:A → Unit) → (Iterator :A) → Unit)
Call THUNK on each element of ITER in order for side effects.
Discard values returned by THUNK.
@@ -5420,7 +5420,7 @@ Discard values returned by THUNK.
***
#### (INDEX-OF! THIS? ITER) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (Iterator :A) → (Optional UFix))
+∀ :A. ((:A → Boolean) → (Iterator :A) → (Optional UFix))
Return the zero-based index of the first element of ITER for which THIS? is `True`, or `None` if no element matches.
@@ -5429,7 +5429,7 @@ Return the zero-based index of the first element of ITER for which THIS? is `Tru
***
#### (INTERLEAVE! LEFT RIGHT) [FUNCTION] · src
-∀ :A. ((Iterator :A) → (Iterator :A) → (Iterator :A))
+∀ :A. ((Iterator :A) → (Iterator :A) → (Iterator :A))
Return an interator of interleaved elements from LEFT and RIGHT which terminates as soon as both LEFT and RIGHT do.
@@ -5441,7 +5441,7 @@ interleaving. (interleave empty ITER) is equivalent to (id ITER).
***
#### (LAST! ITER) [FUNCTION] · src
-∀ :A. ((Iterator :A) → (Optional :A))
+∀ :A. ((Iterator :A) → (Optional :A))
Yields the last element of ITER, completely consuming it.
@@ -5450,7 +5450,7 @@ Yields the last element of ITER, completely consuming it.
***
#### (MAP-WHILE! F ITER) [FUNCTION] · src
-∀ :A :B. ((:A → (Optional :B)) → (Iterator :A) → (Iterator :B))
+∀ :A :B. ((:A → (Optional :B)) → (Iterator :A) → (Iterator :B))
Map an iterator, stopping early if F returns NONE.
@@ -5459,7 +5459,7 @@ Map an iterator, stopping early if F returns NONE.
***
#### (MAX! ITER) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((Iterator :A) → (Optional :A))
+∀ :A. Ord :A ⇒ ((Iterator :A) → (Optional :A))
Return the most-positive element of ITER, or `None` if ITER is empty.
@@ -5468,7 +5468,7 @@ Return the most-positive element of ITER, or `None` if ITER is empty.
***
#### (MAXIMIZE-BY! F ITER) [FUNCTION] · src
-∀ :A :B. Ord :B ⇒ ((:A → :B) → (Iterator :A) → (Optional :A))
+∀ :A :B. Ord :B ⇒ ((:A → :B) → (Iterator :A) → (Optional :A))
For a function F, which maps the iterator, return the element of ITER where (F ELT) is the most-positive.
@@ -5479,7 +5479,7 @@ Return `None' if ITER is empty.
***
#### (MCONCAT! ITER) [FUNCTION] · src
-∀ :A. Monoid :A ⇒ ((Iterator :A) → :A)
+∀ :A. Monoid :A ⇒ ((Iterator :A) → :A)
Fold an iterator of monoids into a single element.
@@ -5488,7 +5488,7 @@ Fold an iterator of monoids into a single element.
***
#### (MCONCATMAP! FUNC ITER) [FUNCTION] · src
-∀ :A :B. Monoid :B ⇒ ((:A → :B) → (Iterator :A) → :B)
+∀ :A :B. Monoid :B ⇒ ((:A → :B) → (Iterator :A) → :B)
Map an iterator to an iterator of monoids, and then fold that iterator into a single element.
@@ -5497,7 +5497,7 @@ Map an iterator to an iterator of monoids, and then fold that iterator into a si
***
#### (MIN! ITER) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((Iterator :A) → (Optional :A))
+∀ :A. Ord :A ⇒ ((Iterator :A) → (Optional :A))
Return the most-negative element of ITER, or `None` if ITER is empty.
@@ -5506,7 +5506,7 @@ Return the most-negative element of ITER, or `None` if ITER is empty.
***
#### (MINIMIZE-BY! F ITER) [FUNCTION] · src
-∀ :A :B. Ord :B ⇒ ((:A → :B) → (Iterator :A) → (Optional :A))
+∀ :A :B. Ord :B ⇒ ((:A → :B) → (Iterator :A) → (Optional :A))
For a function F, which maps the iterator, return the element of ITER where (F ELT) is the most-negative.
@@ -5517,7 +5517,7 @@ Return `None' if ITER is empty.
***
#### (NEW F) [FUNCTION] · src
-∀ :A. ((Unit → (Optional :A)) → (Iterator :A))
+∀ :A. ((Unit → (Optional :A)) → (Iterator :A))
Create a new iterator from a function that yields elements.
@@ -5526,7 +5526,7 @@ Create a new iterator from a function that yields elements.
***
#### (NEXT! ITER) [FUNCTION] · src
-∀ :A. ((Iterator :A) → (Optional :A))
+∀ :A. ((Iterator :A) → (Optional :A))
Advance ITER, returning its next yielded value, or `None` if the iterator is exhausted.
Behavior is undefined if two threads concurrently call `next!` on the same iterator without a lock. Note that
@@ -5538,7 +5538,7 @@ most of the operators defined on iterators call `next!` internally, or create ne
***
#### (ONCE ITEM) [FUNCTION] · src
-∀ :A. (:A → (Iterator :A))
+∀ :A. (:A → (Iterator :A))
Yield `item` once.
@@ -5547,7 +5547,7 @@ Yield `item` once.
***
#### (OPTIMIZE! BETTER? ITER) [FUNCTION] · src
-∀ :A. ((:A → :A → Boolean) → (Iterator :A) → (Optional :A))
+∀ :A. ((:A → :A → Boolean) → (Iterator :A) → (Optional :A))
For an order BETTER? which returns `True` if its first argument is better than its second argument, return the best element of ITER.
@@ -5558,7 +5558,7 @@ Return `None` if ITER is empty.
***
#### (OPTIMIZE-BY! BETTER? F ITER) [FUNCTION] · src
-∀ :A :B. ((:A → :A → Boolean) → (:B → :A) → (Iterator :B) → (Optional :B))
+∀ :A :B. ((:A → :A → Boolean) → (:B → :A) → (Iterator :B) → (Optional :B))
For an order BETTER? which returns `True` if its first argument is better than its second argument, return the element of ITER where (F ELT) is the best.
@@ -5569,7 +5569,7 @@ Return `None` if ITER is empty.
***
#### (OR! ITER) [FUNCTION] · src
-((Iterator Boolean) → Boolean)
+((Iterator Boolean) → Boolean)
Returns True if any iterator elements are True. May not consume the entire iterator. Returns False on an empty iterator.
@@ -5578,7 +5578,7 @@ Returns True if any iterator elements are True. May not consume the entire itera
***
#### (PAIR-WITH! FUNC KEYS) [FUNCTION] · src
-∀ :A :B. ((:A → :B) → (Iterator :A) → (Iterator (Tuple :A :B)))
+∀ :A :B. ((:A → :B) → (Iterator :A) → (Iterator (Tuple :A :B)))
Returns an iterator over tuples whose FSTs are elements from KEYS, and whose SNDs are the results of applying FUNC to those KEYS.
@@ -5587,7 +5587,7 @@ Returns an iterator over tuples whose FSTs are elements from KEYS, and whose SND
***
#### (RANGE-DECREASING STEP START END) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → :A → :A → (Iterator :A))
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → :A → :A → (Iterator :A))
A range which begins below START and counts down through and including END by STEP.
@@ -5598,7 +5598,7 @@ Equivalent to reversing `range-increasing`
***
#### (RANGE-INCREASING STEP START END) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → :A → :A → (Iterator :A))
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → :A → :A → (Iterator :A))
An iterator which begins at START and yields successive elements spaced by STEP, stopping before END.
@@ -5607,7 +5607,7 @@ An iterator which begins at START and yields successive elements spaced by STEP,
***
#### (RECURSIVE-ITER SUCC DONE? START) [FUNCTION] · src
-∀ :A. ((:A → :A) → (:A → Boolean) → :A → (Iterator :A))
+∀ :A. ((:A → :A) → (:A → Boolean) → :A → (Iterator :A))
An iterator which yields first START, then (SUCC START), then (SUCC (SUCC START)), and so on, stopping as soon as such a value is `done?`.
@@ -5619,7 +5619,7 @@ iterator is empty.
***
#### (REMOVE-DUPLICATES! ITER) [FUNCTION] · src
-∀ :A. Hash :A ⇒ ((Iterator :A) → (Iterator :A))
+∀ :A. Hash :A ⇒ ((Iterator :A) → (Iterator :A))
Yield unique elements from ITER in order of first appearance.
@@ -5628,7 +5628,7 @@ Yield unique elements from ITER in order of first appearance.
***
#### (REPEAT ITEM) [FUNCTION] · src
-∀ :A. (:A → (Iterator :A))
+∀ :A. (:A → (Iterator :A))
Yield ITEM over and over, infinitely.
@@ -5637,7 +5637,7 @@ Yield ITEM over and over, infinitely.
***
#### (REPEAT-FOR ITEM COUNT) [FUNCTION] · src
-∀ :A. (:A → UFix → (Iterator :A))
+∀ :A. (:A → UFix → (Iterator :A))
Yield ITEM COUNT times, then stop.
@@ -5646,13 +5646,13 @@ Yield ITEM COUNT times, then stop.
***
#### (SIZE-HINT ITER) [FUNCTION] · src
-∀ :A. ((Iterator :A) → (Optional UFix))
+∀ :A. ((Iterator :A) → (Optional UFix))
***
#### (SUM! ITER) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((Iterator :A) → :A)
+∀ :A. Num :A ⇒ ((Iterator :A) → :A)
Add together all the elements of ITER.
@@ -5661,7 +5661,7 @@ Add together all the elements of ITER.
***
#### (TAKE! COUNT ITER) [FUNCTION] · src
-∀ :A. (UFix → (Iterator :A) → (Iterator :A))
+∀ :A. (UFix → (Iterator :A) → (Iterator :A))
An `Iterator` which yields at most COUNT elements from ITER.
@@ -5670,13 +5670,13 @@ An `Iterator` which yields at most COUNT elements from ITER.
***
#### (UNWRAPPED! ITER) [FUNCTION] · src
-∀ :A :B. Unwrappable :A ⇒ ((Iterator (:A :B)) → (Iterator :B))
+∀ :A :B. Unwrappable :A ⇒ ((Iterator (:A :B)) → (Iterator :B))
***
#### (UP-THROUGH LIMIT) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → (Iterator :A))
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → (Iterator :A))
An iterator which begins at zero and counts up through and including LIMIT.
@@ -5685,7 +5685,7 @@ An iterator which begins at zero and counts up through and including LIMIT.
***
#### (UP-TO LIMIT) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → (Iterator :A))
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → (Iterator :A))
An iterator which begins at zero and counts up to, but not including, LIMIT.
@@ -5694,13 +5694,13 @@ An iterator which begins at zero and counts up to, but not including, LIMIT.
***
#### (WITH-SIZE F SIZE) [FUNCTION] · src
-∀ :A. ((Unit → (Optional :A)) → UFix → (Iterator :A))
+∀ :A. ((Unit → (Optional :A)) → UFix → (Iterator :A))
***
#### (ZIP!) [FUNCTION] · src
-∀ :A :B. ((Iterator :A) → (Iterator :B) → (Iterator (Tuple :A :B)))
+∀ :A :B. ((Iterator :A) → (Iterator :B) → (Iterator (Tuple :A :B)))
Return an iterator of tuples contining elements from two iterators.
@@ -5709,7 +5709,7 @@ Return an iterator of tuples contining elements from two iterators.
***
#### (ZIP-WITH! F LEFT RIGHT) [FUNCTION] · src
-∀ :A :B :C. ((:A → :B → :C) → (Iterator :A) → (Iterator :B) → (Iterator :C))
+∀ :A :B :C. ((:A → :B → :C) → (Iterator :A) → (Iterator :B) → (Iterator :C))
Return an iterator of elements from LEFT and RIGHT which terminates as soon as either LEFT or RIGHT does.
@@ -5718,7 +5718,7 @@ Return an iterator of elements from LEFT and RIGHT which terminates as soon as e
***
#### EMPTY [VALUE] · src
-∀ :A. (Iterator :A)
+∀ :A. (Iterator :A)
Yields nothing; stops immediately
@@ -5741,13 +5741,13 @@ Whether or not the arrays are specialized depends on the underlying Lisp impleme
Instances
-- Eq :A ⇒ Eq (LispArray :A)
-- Foldable LispArray
-- Into (LispArray :A) (List :A)
-- RuntimeRepr :A ⇒ Into (List :A) (LispArray :A)
-- RuntimeRepr :A ⇒ Iso (LispArray :A) (List :A)
-- RuntimeRepr :A ⇒ RandomAccess (LispArray :A) :A
-- RuntimeRepr :A ⇒ RuntimeRepr (LispArray :A)
+- Eq :A ⇒ Eq (LispArray :A)
+- Foldable LispArray
+- Into (LispArray :A) (List :A)
+- RuntimeRepr :A ⇒ Into (List :A) (LispArray :A)
+- RuntimeRepr :A ⇒ Iso (LispArray :A) (List :A)
+- RuntimeRepr :A ⇒ RandomAccess (LispArray :A) :A
+- RuntimeRepr :A ⇒ RuntimeRepr (LispArray :A)
@@ -5758,7 +5758,7 @@ Whether or not the arrays are specialized depends on the underlying Lisp impleme
### Values
#### (AREF V I) [FUNCTION] · src
-∀ :A. ((LispArray :A) → UFix → :A)
+∀ :A. ((LispArray :A) → UFix → :A)
Read the `i`th value of the `LispArray` `v`.
@@ -5767,7 +5767,7 @@ Read the `i`th value of the `LispArray` `v`.
***
#### (COPY V) [FUNCTION] · src
-∀ :A. ((LispArray :A) → (LispArray :A))
+∀ :A. ((LispArray :A) → (LispArray :A))
Make a deep copy of the `LispArray` `v`.
@@ -5776,7 +5776,7 @@ Make a deep copy of the `LispArray` `v`.
***
#### (LENGTH V) [FUNCTION] · src
-∀ :A. ((LispArray :A) → UFix)
+∀ :A. ((LispArray :A) → UFix)
Return the length of the `LispArray` `v`.
@@ -5785,7 +5785,7 @@ Return the length of the `LispArray` `v`.
***
#### (MAKE N X) [FUNCTION] · src
-∀ :A. RuntimeRepr :A ⇒ (UFix → :A → (LispArray :A))
+∀ :A. RuntimeRepr :A ⇒ (UFix → :A → (LispArray :A))
Make a new `LispArray` of length `n` initialized to `x`.
@@ -5796,7 +5796,7 @@ If the type of `x` represents a specialized array
***
#### (MAKE-UNINITIALIZED N) [FUNCTION] · src
-∀ :A. RuntimeRepr :A ⇒ (UFix → (LispArray :A))
+∀ :A. RuntimeRepr :A ⇒ (UFix → (LispArray :A))
Make a new LispArray of length `n` that can store elements of type `:t`.
@@ -5808,7 +5808,7 @@ WARNING: The consequences are undefined if an uninitialized element is read befo
***
#### (SET! V I X) [FUNCTION] · src
-∀ :A. ((LispArray :A) → UFix → :A → Unit)
+∀ :A. ((LispArray :A) → UFix → :A → Unit)
Set the `i`th value of the `LispArray` `v` to `x`.
@@ -5821,7 +5821,7 @@ Set the `i`th value of the `LispArray` `v` to `x`.
### Values
#### (ALL F? XS) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → Boolean)
+∀ :A. ((:A → Boolean) → (List :A) → Boolean)
Returns `True` if every element in `xs` matches `f?`.
@@ -5830,7 +5830,7 @@ Returns `True` if every element in `xs` matches `f?`.
***
#### (ANY F? L) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → Boolean)
+∀ :A. ((:A → Boolean) → (List :A) → Boolean)
Returns `True` if at least one element in `xs` matches `f?`.
@@ -5839,7 +5839,7 @@ Returns `True` if at least one element in `xs` matches `f?`.
***
#### (APPEND XS YS) [FUNCTION] · src
-∀ :A. ((List :A) → (List :A) → (List :A))
+∀ :A. ((List :A) → (List :A) → (List :A))
Appends two lists together and returns a new list.
@@ -5848,7 +5848,7 @@ Appends two lists together and returns a new list.
***
#### (CAR X) [FUNCTION] · src
-∀ :A. ((List :A) → :A)
+∀ :A. ((List :A) → :A)
Return the traditional car of a list. This function is partial
@@ -5857,7 +5857,7 @@ Return the traditional car of a list. This function is partial
***
#### (CDR XS) [FUNCTION] · src
-∀ :A. ((List :A) → (List :A))
+∀ :A. ((List :A) → (List :A))
Return the traditional cdr of a list.
@@ -5866,7 +5866,7 @@ Return the traditional cdr of a list.
***
#### (COMBS L) [FUNCTION] · src
-∀ :A. ((List :A) → (List (List :A)))
+∀ :A. ((List :A) → (List (List :A)))
Compute a list of all combinations of elements of `l`. This function is sometimes goes by the name "power set" or "subsets".
@@ -5877,7 +5877,7 @@ The ordering of elements of `l` is preserved in the ordering of elements in each
***
#### (COMBSOF N L) [FUNCTION] · src
-∀ :A. (UFix → (List :A) → (List (List :A)))
+∀ :A. (UFix → (List :A) → (List (List :A)))
Produce a list of size-N subsets of `l`.
@@ -5890,7 +5890,7 @@ This function is equivalent to all size-`n` elements of `(combs l)`.
***
#### (CONCAT XS) [FUNCTION] · src
-∀ :A. ((List (List :A)) → (List :A))
+∀ :A. ((List (List :A)) → (List :A))
Appends a list of lists together into a single new list.
@@ -5899,7 +5899,7 @@ Appends a list of lists together into a single new list.
***
#### (CONCATMAP F XS) [FUNCTION] · src
-∀ :A :B. ((:A → (List :B)) → (List :A) → (List :B))
+∀ :A :B. ((:A → (List :B)) → (List :A) → (List :B))
Apply F to each element in XS and concatenate the results.
@@ -5908,7 +5908,7 @@ Apply F to each element in XS and concatenate the results.
***
#### (CONS? XS) [FUNCTION] · src
-∀ :A. ((List :A) → Boolean)
+∀ :A. ((List :A) → Boolean)
Returns TRUE if XS is a non-empty list.
@@ -5917,7 +5917,7 @@ Returns TRUE if XS is a non-empty list.
***
#### (COUNTBY F THINGS) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → UFix)
+∀ :A. ((:A → Boolean) → (List :A) → UFix)
Count the number of items in THINGS that satisfy the predicate F.
@@ -5926,7 +5926,7 @@ Count the number of items in THINGS that satisfy the predicate F.
***
#### (DIFFERENCE XS YS) [FUNCTION] · src
-∀ :A. Eq :A ⇒ ((List :A) → (List :A) → (List :A))
+∀ :A. Eq :A ⇒ ((List :A) → (List :A) → (List :A))
Returns a new list with the first occurence of each element in `ys` removed from `xs`.
@@ -5935,7 +5935,7 @@ Returns a new list with the first occurence of each element in `ys` removed from
***
#### (DROP N XS) [FUNCTION] · src
-∀ :A. (UFix → (List :A) → (List :A))
+∀ :A. (UFix → (List :A) → (List :A))
Returns a list with the first N elements removed.
@@ -5944,19 +5944,19 @@ Returns a list with the first N elements removed.
***
#### (ELEMINDEX X XS) [FUNCTION] · src
-∀ :A. Eq :A ⇒ (:A → (List :A) → (Optional UFix))
+∀ :A. Eq :A ⇒ (:A → (List :A) → (Optional UFix))
***
#### (EQUIVALENCE-CLASSES) [FUNCTION] · src
-∀ :A. Eq :A ⇒ ((List :A) → (List (List :A)))
+∀ :A. Eq :A ⇒ ((List :A) → (List (List :A)))
***
#### (EQUIVALENCE-CLASSES-BY F L) [FUNCTION] · src
-∀ :A. ((:A → :A → Boolean) → (List :A) → (List (List :A)))
+∀ :A. ((:A → :A → Boolean) → (List :A) → (List (List :A)))
Break a list into a list of equivalence classes according to an equivalence relation.
@@ -5965,7 +5965,7 @@ Break a list into a list of equivalence classes according to an equivalence rela
***
#### (FILTER F XS) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → (List :A))
+∀ :A. ((:A → Boolean) → (List :A) → (List :A))
Returns a new list containing every element of XS that matches the predicate function F in the same order.
@@ -5974,7 +5974,7 @@ Returns a new list containing every element of XS that matches the predicate fun
***
#### (FIND F XS) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → (Optional :A))
+∀ :A. ((:A → Boolean) → (List :A) → (Optional :A))
Returns the first element in a list matching the predicate function F.
@@ -5983,7 +5983,7 @@ Returns the first element in a list matching the predicate function F.
***
#### (FINDINDEX F XS) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → (Optional UFix))
+∀ :A. ((:A → Boolean) → (List :A) → (Optional UFix))
Returns the index of the first element matching the predicate function F.
@@ -5992,7 +5992,7 @@ Returns the index of the first element matching the predicate function F.
***
#### (HEAD L) [FUNCTION] · src
-∀ :A. ((List :A) → (Optional :A))
+∀ :A. ((List :A) → (Optional :A))
Returns the first element of a list.
@@ -6001,7 +6001,7 @@ Returns the first element of a list.
***
#### (INDEX I XS) [FUNCTION] · src
-∀ :A. (UFix → (List :A) → (Optional :A))
+∀ :A. (UFix → (List :A) → (Optional :A))
Returns the Ith element of a list.
@@ -6010,7 +6010,7 @@ Returns the Ith element of a list.
***
#### (INIT L) [FUNCTION] · src
-∀ :A. ((List :A) → (List :A))
+∀ :A. ((List :A) → (List :A))
Returns every element except the last in a list.
@@ -6019,7 +6019,7 @@ Returns every element except the last in a list.
***
#### (INSERT E LS) [FUNCTION] · src
-∀ :A. Ord :A ⇒ (:A → (List :A) → (List :A))
+∀ :A. Ord :A ⇒ (:A → (List :A) → (List :A))
Inserts an element into a list at the first place it is less than or equal to the next element.
@@ -6028,7 +6028,7 @@ Inserts an element into a list at the first place it is less than or equal to th
***
#### (INSERTBY CMP X YS) [FUNCTION] · src
-∀ :A. ((:A → :A → Ord) → :A → (List :A) → (List :A))
+∀ :A. ((:A → :A → Ord) → :A → (List :A) → (List :A))
Generic version of insert
@@ -6037,7 +6037,7 @@ Generic version of insert
***
#### (INSERTIONS A L) [FUNCTION] · src
-∀ :A. (:A → (List :A) → (List (List :A)))
+∀ :A. (:A → (List :A) → (List (List :A)))
Produce a list of copies of `l`, each with A inserted at a possible position.
@@ -6050,7 +6050,7 @@ Produce a list of copies of `l`, each with A inserted at a possible position.
***
#### (INTERCALATE XS XSS) [FUNCTION] · src
-∀ :A. ((List :A) → (List (List :A)) → (List :A))
+∀ :A. ((List :A) → (List (List :A)) → (List :A))
Intersperse `xs` into `xss` and then concatenate the result.
@@ -6059,7 +6059,7 @@ Intersperse `xs` into `xss` and then concatenate the result.
***
#### (INTERSECTION XS YS) [FUNCTION] · src
-∀ :A. Eq :A ⇒ ((List :A) → (List :A) → (List :A))
+∀ :A. Eq :A ⇒ ((List :A) → (List :A) → (List :A))
Returns elements which occur in both lists. Does not return duplicates and does not guarantee order.
@@ -6068,7 +6068,7 @@ Returns elements which occur in both lists. Does not return duplicates and does
***
#### (INTERSPERSE E XS) [FUNCTION] · src
-∀ :A. (:A → (List :A) → (List :A))
+∀ :A. (:A → (List :A) → (List :A))
Returns a new list by inserting `e` between every element of `xs`.
@@ -6077,7 +6077,7 @@ Returns a new list by inserting `e` between every element of `xs`.
***
#### (LAST L) [FUNCTION] · src
-∀ :A. ((List :A) → (Optional :A))
+∀ :A. ((List :A) → (Optional :A))
Returns the last element of a list.
@@ -6086,7 +6086,7 @@ Returns the last element of a list.
***
#### (LENGTH L) [FUNCTION] · src
-∀ :A. ((List :A) → UFix)
+∀ :A. ((List :A) → UFix)
Returns the length of a list.
@@ -6095,7 +6095,7 @@ Returns the length of a list.
***
#### (LOOKUP E XS) [FUNCTION] · src
-∀ :A :B. Eq :A ⇒ (:A → (List (Tuple :A :B)) → (Optional :B))
+∀ :A :B. Eq :A ⇒ (:A → (List (Tuple :A :B)) → (Optional :B))
Returns the value of the first (key, value) tuple in XS where the key matches E.
@@ -6104,7 +6104,7 @@ Returns the value of the first (key, value) tuple in XS where the key matches E.
***
#### (MAXIMUM L) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((List :A) → (Optional :A))
+∀ :A. Ord :A ⇒ ((List :A) → (Optional :A))
Returns a greatest element of a list, or `None`.
@@ -6113,7 +6113,7 @@ Returns a greatest element of a list, or `None`.
***
#### (MEMBER E XS) [FUNCTION] · src
-∀ :A. Eq :A ⇒ (:A → (List :A) → Boolean)
+∀ :A. Eq :A ⇒ (:A → (List :A) → Boolean)
Returns true if any element of XS is equal to E.
@@ -6122,7 +6122,7 @@ Returns true if any element of XS is equal to E.
***
#### (MINIMUM L) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((List :A) → (Optional :A))
+∀ :A. Ord :A ⇒ ((List :A) → (Optional :A))
Returns a least element of a list, or `None`.
@@ -6131,7 +6131,7 @@ Returns a least element of a list, or `None`.
***
#### (NTH N L) [FUNCTION] · src
-∀ :A. (UFix → (List :A) → :A)
+∀ :A. (UFix → (List :A) → :A)
Like INDEX, but errors if the index is not found.
@@ -6140,7 +6140,7 @@ Like INDEX, but errors if the index is not found.
***
#### (NTH-CDR N L) [FUNCTION] · src
-∀ :A. (UFix → (List :A) → (List :A))
+∀ :A. (UFix → (List :A) → (List :A))
Returns the nth-cdr of a list.
@@ -6149,7 +6149,7 @@ Returns the nth-cdr of a list.
***
#### (NULL? XS) [FUNCTION] · src
-∀ :A. ((List :A) → Boolean)
+∀ :A. ((List :A) → Boolean)
Returns TRUE if XS is an empty list.
@@ -6158,7 +6158,7 @@ Returns TRUE if XS is an empty list.
***
#### (OPTIMUMBY F XS) [FUNCTION] · src
-∀ :A. ((:A → :A → Boolean) → (List :A) → (Optional :A))
+∀ :A. ((:A → :A → Boolean) → (List :A) → (Optional :A))
Returns an optimum according to a total order.
@@ -6167,7 +6167,7 @@ Returns an optimum according to a total order.
***
#### (PARTITION F XS) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → (Tuple (List :A) (List :A)))
+∀ :A. ((:A → Boolean) → (List :A) → (Tuple (List :A) (List :A)))
Splits a list into two new lists. The first list contains elements matching predicate F.
@@ -6176,7 +6176,7 @@ Splits a list into two new lists. The first list contains elements matching pred
***
#### (PERMS L) [FUNCTION] · src
-∀ :A. ((List :A) → (List (List :A)))
+∀ :A. ((List :A) → (List (List :A)))
Produce all permutations of the list L.
@@ -6185,7 +6185,7 @@ Produce all permutations of the list L.
***
#### (PRODUCT XS) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((List :A) → :A)
+∀ :A. Num :A ⇒ ((List :A) → :A)
Returns the product of `xs`.
@@ -6194,7 +6194,7 @@ Returns the product of `xs`.
***
#### (RANGE START END) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → :A → (List :A))
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → :A → (List :A))
Returns a list containing the numbers from START to END inclusive, counting by 1.
@@ -6210,7 +6210,7 @@ Returns a list containing the numbers from START to END inclusive, counting by 1
***
#### (REMOVE X YS) [FUNCTION] · src
-∀ :A. Eq :A ⇒ (:A → (List :A) → (List :A))
+∀ :A. Eq :A ⇒ (:A → (List :A) → (List :A))
Return a new list with the first element equal to `x` removed.
@@ -6219,7 +6219,7 @@ Return a new list with the first element equal to `x` removed.
***
#### (REMOVE-DUPLICATES XS) [FUNCTION] · src
-∀ :A. Eq :A ⇒ ((List :A) → (List :A))
+∀ :A. Eq :A ⇒ ((List :A) → (List :A))
Returns a new list without duplicate elements.
@@ -6228,7 +6228,7 @@ Returns a new list without duplicate elements.
***
#### (REMOVE-IF PRED XS) [FUNCTION] · src
-∀ :A. ((:A → Boolean) → (List :A) → (List :A))
+∀ :A. ((:A → Boolean) → (List :A) → (List :A))
Return a new list with the first element for which PRED is `True` is removed.
@@ -6237,7 +6237,7 @@ Return a new list with the first element for which PRED is `True` is removed.
***
#### (REPEAT N X) [FUNCTION] · src
-∀ :A. (UFix → :A → (List :A))
+∀ :A. (UFix → :A → (List :A))
Returns a list with the same value repeated multiple times.
@@ -6246,7 +6246,7 @@ Returns a list with the same value repeated multiple times.
***
#### (REVERSE XS) [FUNCTION] · src
-∀ :A. ((List :A) → (List :A))
+∀ :A. ((List :A) → (List :A))
Returns a new list containing the same elements in reverse order.
@@ -6255,7 +6255,7 @@ Returns a new list containing the same elements in reverse order.
***
#### (SINGLETON X) [FUNCTION] · src
-∀ :A. (:A → (List :A))
+∀ :A. (:A → (List :A))
Returns a list containing one element.
@@ -6264,7 +6264,7 @@ Returns a list containing one element.
***
#### (SINGLETON? XS) [FUNCTION] · src
-∀ :A. ((List :A) → Boolean)
+∀ :A. ((List :A) → Boolean)
Is `xs` a list containing exactly one element?
@@ -6273,7 +6273,7 @@ Is `xs` a list containing exactly one element?
***
#### (SORT XS) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((List :A) → (List :A))
+∀ :A. Ord :A ⇒ ((List :A) → (List :A))
Sort `xs`.
@@ -6282,7 +6282,7 @@ Sort `xs`.
***
#### (SORTBY CMP XS) [FUNCTION] · src
-∀ :A. ((:A → :A → Ord) → (List :A) → (List :A))
+∀ :A. ((:A → :A → Ord) → (List :A) → (List :A))
Sort `xs` by a custom comparison function `cmp`.
@@ -6291,7 +6291,7 @@ Sort `xs` by a custom comparison function `cmp`.
***
#### (SPLIT C STR) [FUNCTION] · src
-(Char → String → (List String))
+(Char → String → (List String))
Split a string `str` into a list of substrings by the character `c`.
@@ -6300,7 +6300,7 @@ Split a string `str` into a list of substrings by the character `c`.
***
#### (SUM XS) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((List :A) → :A)
+∀ :A. Num :A ⇒ ((List :A) → :A)
Returns the sum of `xs`.
@@ -6309,7 +6309,7 @@ Returns the sum of `xs`.
***
#### (TAIL L) [FUNCTION] · src
-∀ :A. ((List :A) → (Optional (List :A)))
+∀ :A. ((List :A) → (Optional (List :A)))
Returns every element except the first in a list.
@@ -6318,7 +6318,7 @@ Returns every element except the first in a list.
***
#### (TAKE N XS) [FUNCTION] · src
-∀ :A. (UFix → (List :A) → (List :A))
+∀ :A. (UFix → (List :A) → (List :A))
Returns the first N elements of a list.
@@ -6327,7 +6327,7 @@ Returns the first N elements of a list.
***
#### (TRANSPOSE XS) [FUNCTION] · src
-∀ :A. ((List (List :A)) → (List (List :A)))
+∀ :A. ((List (List :A)) → (List (List :A)))
Transposes a matrix represented by a list of lists.
@@ -6336,7 +6336,7 @@ Transposes a matrix represented by a list of lists.
***
#### (UNION XS YS) [FUNCTION] · src
-∀ :A. Eq :A ⇒ ((List :A) → (List :A) → (List :A))
+∀ :A. Eq :A ⇒ ((List :A) → (List :A) → (List :A))
Returns a new list with the elements from both XS and YS and without duplicates.
@@ -6345,7 +6345,7 @@ Returns a new list with the elements from both XS and YS and without duplicates.
***
#### (ZIP XS YS) [FUNCTION] · src
-∀ :A :B. ((List :A) → (List :B) → (List (Tuple :A :B)))
+∀ :A :B. ((List :A) → (List :B) → (List (Tuple :A :B)))
Builds a list of tuples with the elements of XS and YS.
@@ -6354,7 +6354,7 @@ Builds a list of tuples with the elements of XS and YS.
***
#### (ZIPWITH F XS YS) [FUNCTION] · src
-∀ :A :B :C. ((:A → :B → :C) → (List :A) → (List :B) → (List :C))
+∀ :A :B :C. ((:A → :B → :C) → (List :A) → (List :B) → (List :C))
Builds a new list by calling `f` with elements of `xs` and `ys`.
@@ -6363,7 +6363,7 @@ Builds a new list by calling `f` with elements of `xs` and `ys`.
***
#### (ZIPWITH3 F XS YS ZS) [FUNCTION] · src
-∀ :A :B :C :D. ((:A → :B → :C → :D) → (List :A) → (List :B) → (List :C) → (List :D))
+∀ :A :B :C :D. ((:A → :B → :C → :D) → (List :A) → (List :B) → (List :C) → (List :D))
Build a new list by calling F with elements of XS, YS and ZS
@@ -6372,7 +6372,7 @@ Build a new list by calling F with elements of XS, YS and ZS
***
#### (ZIPWITH4 F AS BS CS DS) [FUNCTION] · src
-∀ :A :B :C :D :E. ((:A → :B → :C → :D → :E) → (List :A) → (List :B) → (List :C) → (List :D) → (List :E))
+∀ :A :B :C :D :E. ((:A → :B → :C → :D → :E) → (List :A) → (List :B) → (List :C) → (List :D) → (List :E))
Build a new list by calling F with elements of AS, BS, CS and DS
@@ -6381,7 +6381,7 @@ Build a new list by calling F with elements of AS, BS, CS and DS
***
#### (ZIPWITH5 F AS BS CS DS ES) [FUNCTION] · src
-∀ :A :B :C :D :E :F. ((:A → :B → :C → :D → :E → :F) → (List :A) → (List :B) → (List :C) → (List :D) → (List :E) → (List :F))
+∀ :A :B :C :D :E :F. ((:A → :B → :C → :D → :E → :F) → (List :A) → (List :B) → (List :C) → (List :D) → (List :E) → (List :F))
Build a new list by calling F with elements of AS, BS, CS, DS and ES
@@ -6431,11 +6431,11 @@ Methods:
Instances
-- Dividable Integer CReal
-- Dividable Integer Big-Float
-- Dividable Integer Fraction
-- Dividable Integer F64
-- Dividable Integer F32
+- Dividable Integer CReal
+- Dividable Integer Big-Float
+- Dividable Integer Fraction
+- Dividable Integer F64
+- Dividable Integer F32
- Reciprocable :A ⇒ Dividable :A :A
@@ -6464,14 +6464,14 @@ Methods:
Instances
-- Reciprocable CReal
-- Reciprocable Big-Float
-- Reciprocable :A ⇒ Reciprocable () (* (* x :A)
-- Reciprocable :A ⇒ Reciprocable (Dual :A)
-- (ComplexComponent :A) (Reciprocable :A) ⇒ Reciprocable (Complex :A)
-- Reciprocable Fraction
-- Reciprocable F64
-- Reciprocable F32
+- Reciprocable CReal
+- Reciprocable Big-Float
+- Reciprocable :A ⇒ Reciprocable (Hyperdual :A)
+- Reciprocable :A ⇒ Reciprocable (Dual :A)
+- (ComplexComponent :A) (Reciprocable :A) ⇒ Reciprocable (Complex :A)
+- Reciprocable Fraction
+- Reciprocable F64
+- Reciprocable F32
@@ -6487,15 +6487,15 @@ Numeric type with a value for (positive) infinity and/or NaN.
Methods:
- INFINITY :: :A
-- INFINITE? :: (:A → Boolean)
+- INFINITE? :: (:A → Boolean)
- NAN :: :A
-- NAN? :: (:A → Boolean)
+- NAN? :: (:A → Boolean)
Instances
-- Transfinite Big-Float
-- Transfinite F64
-- Transfinite F32
+- Transfinite Big-Float
+- Transfinite F64
+- Transfinite F32
@@ -6533,7 +6533,7 @@ Absolute value of `x`.
***
#### (ASH X N) [FUNCTION] · src
-(Integer → Integer → Integer)
+(Integer → Integer → Integer)
Compute the "arithmetic shift" of `x` by `n`.
@@ -6542,7 +6542,7 @@ Compute the "arithmetic shift" of `x` by `n`.
***
#### (FINITE? X) [FUNCTION] · src
-∀ :A. Transfinite :A ⇒ (:A → Boolean)
+∀ :A. Transfinite :A ⇒ (:A → Boolean)
Neither infinite or NaN.
@@ -6560,7 +6560,7 @@ The negation, or additive inverse, of `x`.
***
#### (NEGATIVE? X) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
Is `x` negative?
@@ -6569,7 +6569,7 @@ Is `x` negative?
***
#### (NONNEGATIVE? X) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
Is `x` not negative?
@@ -6578,7 +6578,7 @@ Is `x` not negative?
***
#### (NONPOSITIVE? X) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
Is `x` not positive?
@@ -6587,7 +6587,7 @@ Is `x` not positive?
***
#### (NONZERO? X) [FUNCTION] · src
-∀ :A. Num :A ⇒ (:A → Boolean)
+∀ :A. Num :A ⇒ (:A → Boolean)
Is `x` not zero?
@@ -6596,7 +6596,7 @@ Is `x` not zero?
***
#### (POSITIVE? X) [FUNCTION] · src
-∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
+∀ :A. (Num :A) (Ord :A) ⇒ (:A → Boolean)
Is `x` positive?
@@ -6614,7 +6614,7 @@ The sign of `x`, where `(sign 0) = 1`.
***
#### (ZERO? X) [FUNCTION] · src
-∀ :A. Num :A ⇒ (:A → Boolean)
+∀ :A. Num :A ⇒ (:A → Boolean)
Is `x` zero?
@@ -6644,17 +6644,17 @@ Methods:
Instances
-- Bounded UFix
-- Bounded IFix
-- Bounded I64
-- Bounded U64
-- Bounded I32
-- Bounded U32
-- Bounded I16
-- Bounded U16
-- Bounded I8
-- Bounded U8
-- Bounded Bit
+- Bounded UFix
+- Bounded IFix
+- Bounded I64
+- Bounded U64
+- Bounded I32
+- Bounded U32
+- Bounded I16
+- Bounded U16
+- Bounded I8
+- Bounded U8
+- Bounded Bit
@@ -6680,24 +6680,24 @@ component types.
Instances
-- (ComplexComponent :A) (Into :A () (* (* x :A)) ⇒ Into (Complex :A) (Complex () (* (* x :A))
-- (ComplexComponent :A) (Into :A CReal) ⇒ Into (Complex :A) (Complex CReal)
-- (ComplexComponent :A) (Reciprocable :A) ⇒ Reciprocable (Complex :A)
-- ComplexComponent :A ⇒ Eq (Complex :A)
-- ComplexComponent :A ⇒ Into :A (Complex :A)
-- ComplexComponent :A ⇒ Num (Complex :A)
-- Elementary :A ⇒ Exponentiable (Complex :A)
-- Elementary :A ⇒ Radical (Complex :A)
-- Elementary :A ⇒ Trigonometric (Complex :A)
-- FFTCyclicGroup (Complex F64)
-- FFTCyclicGroup (Complex F32)
-- FFTField (Complex F64)
-- FFTField (Complex F32)
-- FFTGroup (Complex F64)
-- FFTGroup (Complex F32)
-- FFTRing (Complex F64)
-- FFTRing (Complex F32)
-- RuntimeRepr :A ⇒ RuntimeRepr (Complex :A)
+- (ComplexComponent :A) (Into :A (Hyperdual :A)) ⇒ Into (Complex :A) (Complex (Hyperdual :A))
+- (ComplexComponent :A) (Into :A CReal) ⇒ Into (Complex :A) (Complex CReal)
+- (ComplexComponent :A) (Reciprocable :A) ⇒ Reciprocable (Complex :A)
+- ComplexComponent :A ⇒ Eq (Complex :A)
+- ComplexComponent :A ⇒ Into :A (Complex :A)
+- ComplexComponent :A ⇒ Num (Complex :A)
+- Elementary :A ⇒ Exponentiable (Complex :A)
+- Elementary :A ⇒ Radical (Complex :A)
+- Elementary :A ⇒ Trigonometric (Complex :A)
+- FFTCyclicGroup (Complex F64)
+- FFTCyclicGroup (Complex F32)
+- FFTField (Complex F64)
+- FFTField (Complex F32)
+- FFTGroup (Complex F64)
+- FFTGroup (Complex F32)
+- FFTRing (Complex F64)
+- FFTRing (Complex F32)
+- RuntimeRepr :A ⇒ RuntimeRepr (Complex :A)
@@ -6715,19 +6715,19 @@ A type class for describing complex component types. This type class
also encodes the construction and projection of `Complex` data types.
Methods:
-- COMPLEX :: (:A → :A → (Complex :A))
-- REAL-PART :: ((Complex :A) → :A)
-- IMAG-PART :: ((Complex :A) → :A)
+- COMPLEX :: (:A → :A → (Complex :A))
+- REAL-PART :: ((Complex :A) → :A)
+- IMAG-PART :: ((Complex :A) → :A)
Instances
-- ComplexComponent CReal
-- ComplexComponent Big-Float
-- ComplexComponent :A ⇒ ComplexComponent () (* (* x :A)
-- ComplexComponent Integer
-- ComplexComponent Fraction
-- ComplexComponent F64
-- ComplexComponent F32
+- ComplexComponent CReal
+- ComplexComponent Big-Float
+- ComplexComponent :A ⇒ ComplexComponent (Hyperdual :A)
+- ComplexComponent Integer
+- ComplexComponent Fraction
+- ComplexComponent F64
+- ComplexComponent F32
@@ -6738,7 +6738,7 @@ Methods:
### Values
#### (CONJUGATE Z) [FUNCTION] · src
-∀ :A. ComplexComponent :A ⇒ ((Complex :A) → (Complex :A))
+∀ :A. ComplexComponent :A ⇒ ((Complex :A) → (Complex :A))
The complex conjugate. If $z=a+bi$ then the conjugate $\bar z=a-bi$.
@@ -6747,7 +6747,7 @@ The complex conjugate. If $z=a+bi$ then the conjugate $\bar z=a-bi$.
***
#### (SQUARE-MAGNITUDE Z) [FUNCTION] · src
-∀ :A. ComplexComponent :A ⇒ ((Complex :A) → :A)
+∀ :A. ComplexComponent :A ⇒ ((Complex :A) → :A)
The squared length of a complex number:
$$\vert z\vert^2=(\operatorname{Re} z)^2+(\operatorname{Im} z)^2.$$
@@ -6757,7 +6757,7 @@ $$\vert z\vert^2=(\operatorname{Re} z)^2+(\operatorname{Im} z)^2.$$
***
#### II [VALUE] · src
-∀ :A. ComplexComponent :A ⇒ (Complex :A)
+∀ :A. ComplexComponent :A ⇒ (Complex :A)
The complex unit $i=\sqrt{-1}$. (The double `ii` represents a
blackboard-bold 𝕚.)
@@ -6835,18 +6835,18 @@ component.
Instances
-- (Num :A) (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable (Dual :A)
-- (Num :A) (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical (Dual :A)
-- (Num :A) (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric (Dual :A)
-- Eq :A ⇒ Eq (Dual :A)
+- (Num :A) (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable (Dual :A)
+- (Num :A) (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical (Dual :A)
+- (Num :A) (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric (Dual :A)
+- Eq :A ⇒ Eq (Dual :A)
Note: Eq only compares the primal component.
-- Hash :A ⇒ Hash (Dual :A)
+- Hash :A ⇒ Hash (Dual :A)
Note: Hash only considers the primal component in order to be consistent with Eq.
-- Num :A ⇒ Num (Dual :A)
-- Ord :A ⇒ Ord (Dual :A)
+- Num :A ⇒ Num (Dual :A)
+- Ord :A ⇒ Ord (Dual :A)
Note: Ord only compares the primal component.
-- Reciprocable :A ⇒ Reciprocable (Dual :A)
-- RuntimeRepr (Dual :A)
+- Reciprocable :A ⇒ Reciprocable (Dual :A)
+- RuntimeRepr (Dual :A)
@@ -6857,7 +6857,7 @@ Note: Ord only compares the primal component.
### Values
#### (DUAL-PART (DUAL _ D)) [FUNCTION] · src
-∀ :A. ((Dual :A) → :A)
+∀ :A. ((Dual :A) → :A)
The dual (i.e., derivative) part of a dual number.
@@ -6866,7 +6866,7 @@ The dual (i.e., derivative) part of a dual number.
***
#### (PRIMAL-PART (DUAL P _)) [FUNCTION] · src
-∀ :A. ((Dual :A) → :A)
+∀ :A. ((Dual :A) → :A)
The primal (i.e., real) part of a dual number.
@@ -6879,22 +6879,22 @@ The primal (i.e., real) part of a dual number.
### Types
#### Dyadic [TYPE] · src
-- (Dyadic Integer Integer)
+- (Dyadic Integer Integer)
`(Dyadic n k)` represents the rational $\mathtt{n}\cdot 2^{\mathtt{k}}$.
Instances
-- Eq Dyadic
-- Into Dyadic Fraction
-- Into Integer Dyadic
-- Num Dyadic
-- Ord Dyadic
-- Quantizable Dyadic
-- Rational Dyadic
-- Real Dyadic
-- RuntimeRepr Dyadic
+- Eq Dyadic
+- Into Dyadic Fraction
+- Into Integer Dyadic
+- Num Dyadic
+- Ord Dyadic
+- Quantizable Dyadic
+- Rational Dyadic
+- Real Dyadic
+- RuntimeRepr Dyadic
@@ -6905,7 +6905,7 @@ The primal (i.e., real) part of a dual number.
### Values
#### (SCALE X J) [FUNCTION] · src
-(Dyadic → Integer → Dyadic)
+(Dyadic → Integer → Dyadic)
Scales a dyadic `x` by $2^{\mathtt{k}}$.
@@ -6914,7 +6914,7 @@ Scales a dyadic `x` by $2^{\mathtt{k}}$.
***
#### (SHIFT K A) [FUNCTION] · src
-(UFix → Dyadic → Dyadic)
+(UFix → Dyadic → Dyadic)
Shift dyadic `a` to its floor with $\mathtt{k}+1$ bits of precision.
@@ -6923,7 +6923,7 @@ Shift dyadic `a` to its floor with $\mathtt{k}+1$ bits of precision.
***
#### (SIMPLIFY D) [FUNCTION] · src
-(Dyadic → Dyadic)
+(Dyadic → Dyadic)
Simplifies a dyadic by maximizing the absolute value of the exponent.
@@ -6932,7 +6932,7 @@ Simplifies a dyadic by maximizing the absolute value of the exponent.
***
#### (SIMPLIFY-INTEGER N) [FUNCTION] · src
-(Integer → Dyadic)
+(Integer → Dyadic)
Finds the simplest dyadic given an integer.
@@ -6954,10 +6954,10 @@ Methods:
Instances
-- Elementary CReal
-- Elementary Big-Float
-- Elementary F64
-- Elementary F32
+- Elementary CReal
+- Elementary Big-Float
+- Elementary F64
+- Elementary F32
@@ -6986,13 +6986,13 @@ Methods:
Instances
-- Exponentiable CReal
-- Exponentiable Big-Float
-- (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable () (* (* x :A)
-- (Num :A) (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable (Dual :A)
-- Elementary :A ⇒ Exponentiable (Complex :A)
-- Exponentiable F64
-- Exponentiable F32
+- Exponentiable CReal
+- Exponentiable Big-Float
+- (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable (Hyperdual :A)
+- (Num :A) (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable (Dual :A)
+- Elementary :A ⇒ Exponentiable (Complex :A)
+- Exponentiable F64
+- Exponentiable F32
@@ -7014,15 +7014,15 @@ For a complex number `z = (complex x y)`, the following identities hold:
Methods:
-- PHASE :: ((Complex :A) → :A)
-- POLAR :: ((Complex :A) → (Tuple :A :A))
+- PHASE :: ((Complex :A) → :A)
+- POLAR :: ((Complex :A) → (Tuple :A :A))
Instances
-- Polar CReal
-- Polar Big-Float
-- Polar F64
-- Polar F32
+- Polar CReal
+- Polar Big-Float
+- Polar F64
+- Polar F32
@@ -7039,18 +7039,18 @@ Obeys:
(^ (sqrt x) 2) = x = (^^ (nth-root n x) n)
Methods:
-- NTH-ROOT :: (Integer → :A → :A)
+- NTH-ROOT :: (Integer → :A → :A)
- SQRT :: (:A → :A)
Instances
-- Radical CReal
-- Radical Big-Float
-- (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical () (* (* x :A)
-- (Num :A) (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical (Dual :A)
-- Elementary :A ⇒ Radical (Complex :A)
-- Radical F64
-- Radical F32
+- Radical CReal
+- Radical Big-Float
+- (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical (Hyperdual :A)
+- (Num :A) (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical (Dual :A)
+- Elementary :A ⇒ Radical (Complex :A)
+- Radical F64
+- Radical F32
@@ -7075,13 +7075,13 @@ Methods:
Instances
-- Trigonometric CReal
-- Trigonometric Big-Float
-- (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric () (* (* x :A)
-- (Num :A) (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric (Dual :A)
-- Elementary :A ⇒ Trigonometric (Complex :A)
-- Trigonometric F64
-- Trigonometric F32
+- Trigonometric CReal
+- Trigonometric Big-Float
+- (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric (Hyperdual :A)
+- (Num :A) (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric (Dual :A)
+- Elementary :A ⇒ Trigonometric (Complex :A)
+- Trigonometric F64
+- Trigonometric F32
@@ -7121,7 +7121,7 @@ the point $(\mathtt{x},\mathtt{y})$.
***
#### (CIS Z) [FUNCTION] · src
-∀ :A. (Trigonometric :A) (ComplexComponent :A) ⇒ (:A → (Complex :A))
+∀ :A. (Trigonometric :A) (ComplexComponent :A) ⇒ (:A → (Complex :A))
A point on the complex unit circle:
@@ -7141,7 +7141,7 @@ A point on the complex unit circle:
***
#### (MAGNITUDE Z) [FUNCTION] · src
-∀ :A. (Radical :A) (ComplexComponent :A) ⇒ ((Complex :A) → :A)
+∀ :A. (Radical :A) (ComplexComponent :A) ⇒ ((Complex :A) → :A)
The magnitude of a complex number. For `z = x + yi`,
@@ -7153,7 +7153,7 @@ The magnitude of a complex number. For `z = x + yi`,
***
#### (SINCOS X) [FUNCTION] · src
-∀ :A. Trigonometric :A ⇒ (:A → (Tuple :A :A))
+∀ :A. Trigonometric :A ⇒ (:A → (Tuple :A :A))
Computes the sine and cosine of X.
@@ -7178,7 +7178,7 @@ Computes the sine and cosine of X.
### Values
#### (DENOMINATOR Q) [FUNCTION] · src
-(Fraction → Integer)
+(Fraction → Integer)
The denominator of a fraction.
@@ -7187,13 +7187,13 @@ The denominator of a fraction.
***
#### (MKFRACTION A B) [FUNCTION] · src
-(Integer → Integer → Fraction)
+(Integer → Integer → Fraction)
***
#### (NUMERATOR Q) [FUNCTION] · src
-(Fraction → Integer)
+(Fraction → Integer)
The numerator of a fraction.
@@ -7302,7 +7302,7 @@ The following list of identities describe the theory of hyperdual numbers.
### Structs
-#### ) (* (* x :A [STRUCT] · src
+#### Hyperdual :A [STRUCT] · src
Representation of a hyperdual number in the form `a + bε₁ + cε₂ + dε₁ε₂` where `a`, `b`, `c`, and `d` are real numbers and `ε₁` and `ε₂` satisfy `εᵢ² = 0` and `ε₁ε₂ != 0`.
@@ -7311,17 +7311,17 @@ Note: `Eq`, and `Ord` and `Hash` only make use of the primal component.
Instances
-- (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable () (* (* x :A)
-- (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical () (* (* x :A)
-- (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric () (* (* x :A)
-- ComplexComponent :A ⇒ ComplexComponent () (* (* x :A)
-- Eq :A ⇒ Eq () (* (* x :A)
-- Hash :A ⇒ Hash () (* (* x :A)
-- Num :A ⇒ Into :A () (* (* x :A)
-- Num :A ⇒ Num () (* (* x :A)
-- Ord :A ⇒ Ord () (* (* x :A)
-- Reciprocable :A ⇒ Reciprocable () (* (* x :A)
-- RuntimeRepr () (* (* x :A)
+- (Exponentiable :A) (Reciprocable :A) ⇒ Exponentiable (Hyperdual :A)
+- (Radical :A) (Reciprocable :A) (Exponentiable :A) ⇒ Radical (Hyperdual :A)
+- (Trigonometric :A) (Reciprocable :A) (Radical :A) ⇒ Trigonometric (Hyperdual :A)
+- ComplexComponent :A ⇒ ComplexComponent (Hyperdual :A)
+- Eq :A ⇒ Eq (Hyperdual :A)
+- Hash :A ⇒ Hash (Hyperdual :A)
+- Num :A ⇒ Into :A (Hyperdual :A)
+- Num :A ⇒ Num (Hyperdual :A)
+- Ord :A ⇒ Ord (Hyperdual :A)
+- Reciprocable :A ⇒ Reciprocable (Hyperdual :A)
+- RuntimeRepr (Hyperdual :A)
@@ -7332,7 +7332,7 @@ Note: `Eq`, and `Ord` and `Hash` only make use of the primal component.
### Values
#### (D-X F X) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A)) → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A)) → :A → :A)
Compute f'(x).
@@ -7341,7 +7341,7 @@ Compute f'(x).
***
#### (D-XX F X) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A)) → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A)) → :A → :A)
Compute f''(x).
@@ -7350,7 +7350,7 @@ Compute f''(x).
***
#### (GRADIENT F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → (List :A))
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → (List :A))
Compute the gradient (∂f/∂x, ∂f/∂y) at the point (x, y).
@@ -7359,7 +7359,7 @@ Compute the gradient (∂f/∂x, ∂f/∂y) at the point (x, y).
***
#### (HESSIAN F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → (List :A))
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → (List :A))
Compute the flat Hessian (∂²f/∂x², ∂²f/∂x∂y, ∂²f/∂y∂x, ∂²f/∂y²) at the point (x, y).
@@ -7368,7 +7368,7 @@ Compute the flat Hessian (∂²f/∂x², ∂²f/∂x∂y, ∂²f/∂y∂x, ∂²
***
#### (LAPLACIAN F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → :A)
Compute the Laplacian ∂²f/∂x² + ∂²f/∂y² at the point (x, y).
@@ -7377,7 +7377,7 @@ Compute the Laplacian ∂²f/∂x² + ∂²f/∂y² at the point (x, y).
***
#### (PARTIAL-X F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → :A)
Compute ∂f/∂x(x, y).
@@ -7386,7 +7386,7 @@ Compute ∂f/∂x(x, y).
***
#### (PARTIAL-XX F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → :A)
Compute ∂²f/∂x²(x, y).
@@ -7395,7 +7395,7 @@ Compute ∂²f/∂x²(x, y).
***
#### (PARTIAL-XY F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → :A)
Compute ∂²f/∂x∂y(x, y).
@@ -7404,7 +7404,7 @@ Compute ∂²f/∂x∂y(x, y).
***
#### (PARTIAL-Y F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → :A)
Compute ∂f/∂y(x, y).
@@ -7413,7 +7413,7 @@ Compute ∂f/∂y(x, y).
***
#### (PARTIAL-YY F X Y) [FUNCTION] · src
-∀ :A. Num :A ⇒ ((() (* (* x :A) → () (* (* x :A) → () (* (* x :A)) → :A → :A → :A)
+∀ :A. Num :A ⇒ (((Hyperdual :A) → (Hyperdual :A) → (Hyperdual :A)) → :A → :A → :A)
Compute ∂²f/∂y²(x, y).
@@ -7433,22 +7433,22 @@ Integral is a number that is either even or odd where `div` and `quot`
are floored and truncated division, respectively.
Methods:
-- TOINTEGER :: (:A → Integer)
+- TOINTEGER :: (:A → Integer)
Instances
-- Integral UFix
-- Integral U64
-- Integral U32
-- Integral U16
-- Integral U8
-- Integral Bit
-- Integral IFix
-- Integral I64
-- Integral I32
-- Integral I16
-- Integral I8
-- Integral Integer
+- Integral UFix
+- Integral U64
+- Integral U32
+- Integral U16
+- Integral U8
+- Integral Bit
+- Integral IFix
+- Integral I64
+- Integral I32
+- Integral I16
+- Integral I8
+- Integral Integer
@@ -7471,28 +7471,28 @@ a = (+ (* b (div a b)) (mod a b))
Methods:
- QUOT :: (:A → :A → :A)
- REM :: (:A → :A → :A)
-- QUOTREM :: (:A → :A → (Tuple :A :A))
+- QUOTREM :: (:A → :A → (Tuple :A :A))
- DIV :: (:A → :A → :A)
- MOD :: (:A → :A → :A)
-- DIVMOD :: (:A → :A → (Tuple :A :A))
+- DIVMOD :: (:A → :A → (Tuple :A :A))
Instances
-- Remainder F64
-- Remainder F32
-- Remainder Fraction
-- Remainder UFix
-- Remainder U64
-- Remainder U32
-- Remainder U16
-- Remainder U8
-- Remainder Bit
-- Remainder IFix
-- Remainder I64
-- Remainder I32
-- Remainder I16
-- Remainder I8
-- Remainder Integer
+- Remainder F64
+- Remainder F32
+- Remainder Fraction
+- Remainder UFix
+- Remainder U64
+- Remainder U32
+- Remainder U16
+- Remainder U8
+- Remainder Bit
+- Remainder IFix
+- Remainder I64
+- Remainder I32
+- Remainder I16
+- Remainder I8
+- Remainder Integer
@@ -7503,7 +7503,7 @@ Methods:
### Values
#### (EVEN? N) [FUNCTION] · src
-∀ :A. Integral :A ⇒ (:A → Boolean)
+∀ :A. Integral :A ⇒ (:A → Boolean)
Is N even?
@@ -7566,7 +7566,7 @@ Left shift X by N
***
#### (ODD? N) [FUNCTION] · src
-∀ :A. Integral :A ⇒ (:A → Boolean)
+∀ :A. Integral :A ⇒ (:A → Boolean)
Is N odd?
@@ -7612,7 +7612,7 @@ Represents an integer quantization of `:a`.
Instances
-- RuntimeRepr (Quantization :A)
+- RuntimeRepr (Quantization :A)
@@ -7645,28 +7645,28 @@ where
Methods:
-- PROPER :: (:A → (Tuple Integer :A))
-- FLOOR :: (:A → Integer)
-- CEILING :: (:A → Integer)
+- PROPER :: (:A → (Tuple Integer :A))
+- FLOOR :: (:A → Integer)
+- CEILING :: (:A → Integer)
Instances
-- Quantizable CReal
-- Quantizable Big-Float
-- Quantizable Dyadic
-- Quantizable F64
-- Quantizable F32
-- Quantizable Fraction
-- Quantizable Integer
-- Quantizable IFix
-- Quantizable I64
-- Quantizable I32
-- Quantizable I8
-- Quantizable UFix
-- Quantizable U64
-- Quantizable U32
-- Quantizable U8
-- Quantizable Bit
+- Quantizable CReal
+- Quantizable Big-Float
+- Quantizable Dyadic
+- Quantizable F64
+- Quantizable F32
+- Quantizable Fraction
+- Quantizable Integer
+- Quantizable IFix
+- Quantizable I64
+- Quantizable I32
+- Quantizable I8
+- Quantizable UFix
+- Quantizable U64
+- Quantizable U32
+- Quantizable U8
+- Quantizable Bit
@@ -7691,26 +7691,26 @@ Furthermore, `best-approx` returns the simplest fraction, and both functions may
Methods:
-- TO-FRACTION :: (:A → Fraction)
-- BEST-APPROX :: (:A → Fraction)
+- TO-FRACTION :: (:A → Fraction)
+- BEST-APPROX :: (:A → Fraction)
Instances
-- Rational Big-Float
-- Rational Dyadic
-- Rational F64
-- Rational F32
-- Rational Fraction
-- Rational Integer
-- Rational IFix
-- Rational I64
-- Rational I32
-- Rational I8
-- Rational UFix
-- Rational U64
-- Rational U32
-- Rational U8
-- Rational Bit
+- Rational Big-Float
+- Rational Dyadic
+- Rational F64
+- Rational F32
+- Rational Fraction
+- Rational Integer
+- Rational IFix
+- Rational I64
+- Rational I32
+- Rational I8
+- Rational UFix
+- Rational U64
+- Rational U32
+- Rational U8
+- Rational Bit
@@ -7725,26 +7725,26 @@ Methods:
A real number that can be approximated with abs(real-approx x - x) < 2^-n.
Methods:
-- REAL-APPROX :: (UFix → :A → Fraction)
+- REAL-APPROX :: (UFix → :A → Fraction)
Instances
-- Real CReal
-- Real Big-Float
-- Real Dyadic
-- Real F64
-- Real F32
-- Real Fraction
-- Real Integer
-- Real IFix
-- Real I64
-- Real I32
-- Real I8
-- Real UFix
-- Real U64
-- Real U32
-- Real U8
-- Real Bit
+- Real CReal
+- Real Big-Float
+- Real Dyadic
+- Real F64
+- Real F32
+- Real Fraction
+- Real Integer
+- Real IFix
+- Real I64
+- Real I32
+- Real I8
+- Real UFix
+- Real U64
+- Real U32
+- Real U8
+- Real Bit
@@ -7755,7 +7755,7 @@ Methods:
### Values
#### (CEILING/ A B) [FUNCTION] · src
-(Integer → Integer → Integer)
+(Integer → Integer → Integer)
Divide two integers and compute the ceiling of the quotient.
@@ -7764,7 +7764,7 @@ Divide two integers and compute the ceiling of the quotient.
***
#### (EXACT/ A B) [FUNCTION] · src
-(Integer → Integer → Fraction)
+(Integer → Integer → Fraction)
Exactly divide two integers and produce a fraction.
@@ -7773,7 +7773,7 @@ Exactly divide two integers and produce a fraction.
***
#### (FLOOR/ A B) [FUNCTION] · src
-(Integer → Integer → Integer)
+(Integer → Integer → Integer)
Divide two integers and compute the floor of the quotient.
@@ -7782,7 +7782,7 @@ Divide two integers and compute the floor of the quotient.
***
#### (FROMFRAC Q) [FUNCTION] · src
-∀ :A. Dividable Integer :A ⇒ (Fraction → :A)
+∀ :A. Dividable Integer :A ⇒ (Fraction → :A)
Converts a fraction to a target type.
@@ -7795,7 +7795,7 @@ This conversion may result in loss of fidelity.
***
#### (INEXACT/ A B) [FUNCTION] · src
-(Integer → Integer → F64)
+(Integer → Integer → F64)
Compute the quotient of integers as a double-precision float.
@@ -7806,7 +7806,7 @@ Note: This does *not* divide double-float arguments.
***
#### (QUANTIZE X) [FUNCTION] · src
-∀ :A. Real :A ⇒ (:A → (Quantization :A))
+∀ :A. Real :A ⇒ (:A → (Quantization :A))
Given X, (QUANTIZE X) will return the least integer greater or equal to X,
and the greatest integer less than or equal to X, along with their respective
@@ -7817,7 +7817,7 @@ remainders expressed as values of type of X.
***
#### (ROUND X) [FUNCTION] · src
-∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer)
+∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer)
Return the nearest integer to X, with ties breaking towards even numbers.
@@ -7826,7 +7826,7 @@ Return the nearest integer to X, with ties breaking towards even numbers.
***
#### (ROUND-HALF-DOWN X) [FUNCTION] · src
-∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer)
+∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer)
Return the nearest integer to X, with ties breaking toward positive infinity.
@@ -7835,7 +7835,7 @@ Return the nearest integer to X, with ties breaking toward positive infinity.
***
#### (ROUND-HALF-UP X) [FUNCTION] · src
-∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer)
+∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer)
Return the nearest integer to X, with ties breaking toward positive infinity.
@@ -7844,7 +7844,7 @@ Return the nearest integer to X, with ties breaking toward positive infinity.
***
#### (ROUND/ A B) [FUNCTION] · src
-(Integer → Integer → Integer)
+(Integer → Integer → Integer)
Divide two integers and round the quotient.
@@ -7853,7 +7853,7 @@ Divide two integers and round the quotient.
***
#### (SAFE/ X Y) [FUNCTION] · src
-∀ :A :B. (Num :A) (Dividable :A :B) ⇒ (:A → :A → (Optional :B))
+∀ :A :B. (Num :A) (Dividable :A :B) ⇒ (:A → :A → (Optional :B))
Safely divide X by Y, returning None if Y is zero.
@@ -7862,7 +7862,7 @@ Safely divide X by Y, returning None if Y is zero.
***
#### (TRUNCATE X) [FUNCTION] · src
-∀ :A. Quantizable :A ⇒ (:A → Integer)
+∀ :A. Quantizable :A ⇒ (:A → Integer)
Returns the integer closest/equal to `x` that is within `0` and `x`.
@@ -7907,12 +7907,12 @@ Methods:
Instances
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A (LoopT :B)
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A (OptionalT :B)
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((ResultT :C) :B)
-- Monad :A ⇒ MonadEnvironment :B ((EnvT :B) :A)
-- MonadEnvironment :A (Env :A)
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((StateT :C) :B)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A (LoopT :B)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A (OptionalT :B)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((ResultT :C) :B)
+- Monad :A ⇒ MonadEnvironment :B ((EnvT :B) :A)
+- MonadEnvironment :A (Env :A)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((StateT :C) :B)
@@ -7928,16 +7928,16 @@ A monad capable of tracking state in a computation.
Methods:
- GET :: (:A :B)
Retrieve the computation state.
-- PUT :: (:B → (:A Unit))
Set the state to a given value.
-- MODIFY :: ((:B → :B) → (:A Unit))
Modify the computation state, discarding the old state.
+- PUT :: (:B → (:A Unit))
Set the state to a given value.
+- MODIFY :: ((:B → :B) → (:A Unit))
Modify the computation state, discarding the old state.
Instances
-- MonadState :A :B ⇒ MonadState :A (LoopT :B)
-- MonadState :A :B ⇒ MonadState :A (OptionalT :B)
-- MonadState :A :B ⇒ MonadState :A ((ResultT :C) :B)
-- MonadState :A :B ⇒ MonadState :A ((EnvT :C) :B)
-- Monad :A ⇒ MonadState :B ((StateT :B) :A)
+- MonadState :A :B ⇒ MonadState :A (LoopT :B)
+- MonadState :A :B ⇒ MonadState :A (OptionalT :B)
+- MonadState :A :B ⇒ MonadState :A ((ResultT :C) :B)
+- MonadState :A :B ⇒ MonadState :A ((EnvT :C) :B)
+- Monad :A ⇒ MonadState :B ((StateT :B) :A)
@@ -7957,11 +7957,11 @@ A computation that runs inside an :env environment.
Instances
-- Applicative (Env :A)
-- Functor (Env :A)
-- Monad (Env :A)
-- MonadEnvironment :A (Env :A)
-- RuntimeRepr (Env :A :B)
+- Applicative (Env :A)
+- Functor (Env :A)
+- Monad (Env :A)
+- MonadEnvironment :A (Env :A)
+- RuntimeRepr (Env :A :B)
@@ -7978,13 +7978,13 @@ Equivalent to Haskell's ReaderT monad https://hackage.haskell.org/package/transf
Instances
-- Applicative :A ⇒ Applicative ((EnvT :B) :A)
-- Functor :A ⇒ Functor ((EnvT :B) :A)
-- Monad :A ⇒ Monad ((EnvT :B) :A)
-- Monad :A ⇒ MonadEnvironment :B ((EnvT :B) :A)
-- MonadState :A :B ⇒ MonadState :A ((EnvT :C) :B)
-- MonadTransformer (EnvT :A)
-- RuntimeRepr (((EnvT :A) :B) :C)
+- Applicative :A ⇒ Applicative ((EnvT :B) :A)
+- Functor :A ⇒ Functor ((EnvT :B) :A)
+- Monad :A ⇒ Monad ((EnvT :B) :A)
+- Monad :A ⇒ MonadEnvironment :B ((EnvT :B) :A)
+- MonadState :A :B ⇒ MonadState :A ((EnvT :C) :B)
+- MonadTransformer (EnvT :A)
+- RuntimeRepr (((EnvT :A) :B) :C)
@@ -7995,7 +7995,7 @@ Equivalent to Haskell's ReaderT monad https://hackage.haskell.org/package/transf
### Values
#### (ASKS-ENV FENV->A) [FUNCTION] · src
-∀ :A :B. ((:A → :B) → (Env :A :B))
+∀ :A :B. ((:A → :B) → (Env :A :B))
Retrieve an aspect of the computation environment.
@@ -8004,7 +8004,7 @@ Retrieve an aspect of the computation environment.
***
#### (ASKS-ENVT FENV->A) [FUNCTION] · src
-∀ :A :B :C. Applicative :C ⇒ ((:A → :B) → (((EnvT :A) :C) :B))
+∀ :A :B :C. Applicative :C ⇒ ((:A → :B) → (((EnvT :A) :C) :B))
Retrieve an aspect of the computation environment.
@@ -8013,19 +8013,19 @@ Retrieve an aspect of the computation environment.
***
#### (LIFT-ENVT M) [FUNCTION] · src
-∀ :A :B :C. ((:A :B) → (((EnvT :C) :A) :B))
+∀ :A :B :C. ((:A :B) → (((EnvT :C) :A) :B))
***
#### (LOCAL-ENV FENV MENV) [FUNCTION] · src
-∀ :A :B. ((:A → :A) → (Env :A :B) → (Env :A :B))
+∀ :A :B. ((:A → :A) → (Env :A :B) → (Env :A :B))
***
#### (LOCAL-ENVT FENV (ENVT FENV->A)) [FUNCTION] · src
-∀ :A :B :C. ((:A → :A) → (((EnvT :A) :B) :C) → (((EnvT :A) :B) :C))
+∀ :A :B :C. ((:A → :A) → (((EnvT :A) :B) :C) → (((EnvT :A) :B) :C))
Run a computation in a modified environment.
@@ -8034,13 +8034,13 @@ Run a computation in a modified environment.
***
#### (MAP-ENVT FMA->NB (ENVT FENV->MA)) [FUNCTION] · src
-∀ :A :B :C :D :E. (((:A :B) → (:C :D)) → (((EnvT :E) :A) :B) → (((EnvT :E) :C) :D))
+∀ :A :B :C :D :E. (((:A :B) → (:C :D)) → (((EnvT :E) :A) :B) → (((EnvT :E) :C) :D))
***
#### (RUN-ENV (ENV ENV-COMPUTATION) ENV) [FUNCTION] · src
-∀ :A :B. ((Env :A :B) → :A → :B)
+∀ :A :B. ((Env :A :B) → :A → :B)
Run a Env inside an environment.
@@ -8049,7 +8049,7 @@ Run a Env inside an environment.
***
#### (RUN-ENVT (ENVT FENV->VAL) ENV) [FUNCTION] · src
-∀ :A :B :C. ((((EnvT :A) :B) :C) → :A → (:B :C))
+∀ :A :B :C. ((((EnvT :A) :B) :C) → :A → (:B :C))
Run a EnvT inside an environment.
@@ -8058,7 +8058,7 @@ Run a EnvT inside an environment.
***
#### ASK-ENV [VALUE] · src
-∀ :A. (Env :A :A)
+∀ :A. (Env :A :A)
Retrieve the computation environment.
@@ -8067,7 +8067,7 @@ Retrieve the computation environment.
***
#### ASK-ENVT [VALUE] · src
-∀ :A :B. Monad :B ⇒ (((EnvT :A) :B) :A)
+∀ :A :B. Monad :B ⇒ (((EnvT :A) :B) :A)
Retrieve the computation environment.
@@ -8080,7 +8080,7 @@ Retrieve the computation environment.
### Types
#### Free [TYPE] · src
-- (Free (:A ((Free :A) :B)))
+- (Free (:A ((Free :A) :B)))
- (Val :C)
`Free :f` gives you a Monad instance for any `Functor :f`.
@@ -8090,13 +8090,13 @@ References: [here](https://serokell.io/blog/introduction-to-free-monads) and [he
Instances
-- Foldable :A ⇒ Foldable (Free :A)
-- Functor :A ⇒ Applicative (Free :A)
-- Functor :A ⇒ Functor (Free :A)
-- Functor :A ⇒ Monad (Free :A)
-- Functor :A ⇒ MonadFree :A (Free :A)
-- RuntimeRepr ((Free :A) :B)
-- Traversable :A ⇒ Traversable (Free :A)
+- Foldable :A ⇒ Foldable (Free :A)
+- Functor :A ⇒ Applicative (Free :A)
+- Functor :A ⇒ Functor (Free :A)
+- Functor :A ⇒ Monad (Free :A)
+- Functor :A ⇒ MonadFree :A (Free :A)
+- RuntimeRepr ((Free :A) :B)
+- Traversable :A ⇒ Traversable (Free :A)
@@ -8118,8 +8118,8 @@ Methods:
Instances
-- (Functor :A) (Monad :B) ⇒ MonadFree :A ((FreeT :A) :B)
-- Functor :A ⇒ MonadFree :A (Free :A)
+- (Functor :A) (Monad :B) ⇒ MonadFree :A ((FreeT :A) :B)
+- Functor :A ⇒ MonadFree :A (Free :A)
@@ -8130,7 +8130,7 @@ Methods:
### Values
#### (FOLDFREE NAT FR) [FUNCTION] · src
-∀ :A :B :C. Monad :C ⇒ (((:A ((Free :A) :B)) → (:C ((Free :A) :B))) → ((Free :A) :B) → (:C :B))
+∀ :A :B :C. Monad :C ⇒ (((:A ((Free :A) :B)) → (:C ((Free :A) :B))) → ((Free :A) :B) → (:C :B))
Given a natural transformation, induce a Monad homomorphism from a
free monad to a target monad.
@@ -8149,7 +8149,7 @@ Lift a Functor into the Free Monad.
***
#### (RUN-FREE TRANSF OP) [FUNCTION] · src
-∀ :A :B. Functor :A ⇒ (((:A ((Free :A) :B)) → ((Free :A) :B)) → ((Free :A) :B) → :B)
+∀ :A :B. Functor :A ⇒ (((:A ((Free :A) :B)) → ((Free :A) :B)) → ((Free :A) :B) → :B)
Run a free monad with a function that unwraps a single layer of the functor
`f` at a time.
@@ -8170,10 +8170,10 @@ References: [here](https://github.com/purescript/purescript-free/blob/v5.1.0/src
Instances
-- Functor :A ⇒ Bifunctor (FreeF :A)
-- Functor :A ⇒ Functor ((FreeF :A) :B)
-- RuntimeRepr (((FreeF :A) :B) :C)
-- Traversable :A ⇒ Traversable ((FreeF :A) :B)
+- Functor :A ⇒ Bifunctor (FreeF :A)
+- Functor :A ⇒ Functor ((FreeF :A) :B)
+- RuntimeRepr (((FreeF :A) :B) :C)
+- Traversable :A ⇒ Traversable ((FreeF :A) :B)
@@ -8182,20 +8182,20 @@ References: [here](https://github.com/purescript/purescript-free/blob/v5.1.0/src
***
#### FreeT [TYPE] · src
-- (FreeT (:A (((FreeF :B) :C) (((FreeT :B) :A) :C))))
+- (FreeT (:A (((FreeF :B) :C) (((FreeT :B) :A) :C))))
`Free :f :m :a` gives you a Monad Transformer instance for any `Functor :f` and `Monad :m`.
Instances
-- (Functor :A) (Functor :B) ⇒ Functor ((FreeT :A) :B)
-- (Functor :A) (Monad :B) ⇒ Applicative ((FreeT :A) :B)
-- (Functor :A) (Monad :B) ⇒ Monad ((FreeT :A) :B)
-- (Functor :A) (Monad :B) ⇒ MonadFree :A ((FreeT :A) :B)
-- (Monad :A) (Traversable :A) (Traversable :B) ⇒ Traversable ((FreeT :B) :A)
-- Functor :A ⇒ MonadTransformer (FreeT :A)
-- RuntimeRepr (((FreeT :A) :B) :C)
+- (Functor :A) (Functor :B) ⇒ Functor ((FreeT :A) :B)
+- (Functor :A) (Monad :B) ⇒ Applicative ((FreeT :A) :B)
+- (Functor :A) (Monad :B) ⇒ Monad ((FreeT :A) :B)
+- (Functor :A) (Monad :B) ⇒ MonadFree :A ((FreeT :A) :B)
+- (Monad :A) (Traversable :A) (Traversable :B) ⇒ Traversable ((FreeT :B) :A)
+- Functor :A ⇒ MonadTransformer (FreeT :A)
+- RuntimeRepr (((FreeT :A) :B) :C)
@@ -8206,13 +8206,13 @@ References: [here](https://github.com/purescript/purescript-free/blob/v5.1.0/src
### Values
#### (FOLD-FREET F (FREET M)) [FUNCTION] · src
-∀ :A :B :C :D. (MonadTransformer :D) (Monad (:D :B)) (Monad :B) ⇒ (((:A (((FreeT :A) :B) :C)) → ((:D :B) (((FreeT :A) :B) :C))) → (((FreeT :A) :B) :C) → ((:D :B) :C))
+∀ :A :B :C :D. (MonadTransformer :D) (Monad (:D :B)) (Monad :B) ⇒ (((:A (((FreeT :A) :B) :C)) → ((:D :B) (((FreeT :A) :B) :C))) → (((FreeT :A) :B) :C) → ((:D :B) :C))
***
#### (RUN-FREET TRANSF OP) [FUNCTION] · src
-∀ :A :B :C. Monad :B ⇒ (((:A (((FreeT :A) :B) :C)) → (((FreeT :A) :B) :C)) → (((FreeT :A) :B) :C) → (:B :C))
+∀ :A :B :C. Monad :B ⇒ (((:A (((FreeT :A) :B) :C)) → (((FreeT :A) :B) :C)) → (((FreeT :A) :B) :C) → (:B :C))
Run a free monad transformer with a function that unwraps a single layer of the
functor `f` at a time.
@@ -8222,7 +8222,7 @@ functor `f` at a time.
***
#### (UNWRAP-FREET (FREET M)) [FUNCTION] · src
-∀ :A :B :C. ((((FreeT :A) :B) :C) → (:B (((FreeF :A) :C) (((FreeT :A) :B) :C))))
+∀ :A :B :C. ((((FreeT :A) :B) :C) → (:B (((FreeF :A) :C) (((FreeT :A) :B) :C))))
Unwrap one layer of the the free monad transformer, returning a value of the base
monad containing a FreeF (which can either contain VAL, a pure value, or FREEF, another
@@ -8244,10 +8244,10 @@ A bare computation. Not useful on its own, but is useful for running Monad trans
Instances
-- Applicative Identity
-- Functor Identity
-- Monad Identity
-- RuntimeRepr (Identity :A)
+- Applicative Identity
+- Functor Identity
+- Monad Identity
+- RuntimeRepr (Identity :A)
@@ -8258,7 +8258,7 @@ A bare computation. Not useful on its own, but is useful for running Monad trans
### Values
#### (RUN-IDENTITY (IDENTITY A)) [FUNCTION] · src
-∀ :A. ((Identity :A) → :A)
+∀ :A. ((Identity :A) → :A)
***
@@ -8268,21 +8268,21 @@ A bare computation. Not useful on its own, but is useful for running Monad trans
### Types
#### OptionalT [TYPE] · src
-- (OptionalT (:A (Optional :B)))
+- (OptionalT (:A (Optional :B)))
A monadic computation that returns an Optional.
Instances
-- Functor :A ⇒ Functor (OptionalT :A)
-- Monad :A ⇒ Alternative (OptionalT :A)
-- Monad :A ⇒ Applicative (OptionalT :A)
-- Monad :A ⇒ Monad (OptionalT :A)
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A (OptionalT :B)
-- MonadState :A :B ⇒ MonadState :A (OptionalT :B)
-- MonadTransformer OptionalT
-- RuntimeRepr ((OptionalT :A) :B)
+- Functor :A ⇒ Functor (OptionalT :A)
+- Monad :A ⇒ Alternative (OptionalT :A)
+- Monad :A ⇒ Applicative (OptionalT :A)
+- Monad :A ⇒ Monad (OptionalT :A)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A (OptionalT :B)
+- MonadState :A :B ⇒ MonadState :A (OptionalT :B)
+- MonadTransformer OptionalT
+- RuntimeRepr ((OptionalT :A) :B)
@@ -8293,13 +8293,13 @@ A monadic computation that returns an Optional.
### Values
#### (MAP-OPTIONALT F (OPTIONALT M)) [FUNCTION] · src
-∀ :A :B :C :D. (((:A (Optional :B)) → (:C (Optional :D))) → ((OptionalT :A) :B) → ((OptionalT :C) :D))
+∀ :A :B :C :D. (((:A (Optional :B)) → (:C (Optional :D))) → ((OptionalT :A) :B) → ((OptionalT :C) :D))
***
#### (RUN-OPTIONALT (OPTIONALT M)) [FUNCTION] · src
-∀ :A :B. (((OptionalT :A) :B) → (:A (Optional :B)))
+∀ :A :B. (((OptionalT :A) :B) → (:A (Optional :B)))
***
@@ -8309,20 +8309,20 @@ A monadic computation that returns an Optional.
### Types
#### ResultT [TYPE] · src
-- (ResultT (:A (Result :B :C)))
+- (ResultT (:A (Result :B :C)))
A monadic computation that returns a Result.
Instances
-- Functor :A ⇒ Functor ((ResultT :B) :A)
-- Monad :A ⇒ Applicative ((ResultT :B) :A)
-- Monad :A ⇒ Monad ((ResultT :B) :A)
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((ResultT :C) :B)
-- MonadState :A :B ⇒ MonadState :A ((ResultT :C) :B)
-- MonadTransformer (ResultT :A)
-- RuntimeRepr (((ResultT :A) :B) :C)
+- Functor :A ⇒ Functor ((ResultT :B) :A)
+- Monad :A ⇒ Applicative ((ResultT :B) :A)
+- Monad :A ⇒ Monad ((ResultT :B) :A)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((ResultT :C) :B)
+- MonadState :A :B ⇒ MonadState :A ((ResultT :C) :B)
+- MonadTransformer (ResultT :A)
+- RuntimeRepr (((ResultT :A) :B) :C)
@@ -8333,7 +8333,7 @@ A monadic computation that returns a Result.
### Values
#### (ERR-IFM FAILED? FAILURE) [FUNCTION] · src
-∀ :A :B. Monad :B ⇒ (Boolean → :A → (:B (Result :A Unit)))
+∀ :A :B. Monad :B ⇒ (Boolean → :A → (:B (Result :A Unit)))
Fail with FAILURE inside :m if FAILED? is True.
@@ -8342,7 +8342,7 @@ Fail with FAILURE inside :m if FAILED? is True.
***
#### (ERR-IFT FAILED? FAILURE) [FUNCTION] · src
-∀ :A :B. Monad :B ⇒ (Boolean → :A → (((ResultT :A) :B) Unit))
+∀ :A :B. Monad :B ⇒ (Boolean → :A → (((ResultT :A) :B) Unit))
Fail with FAILURE if FAILED? is True.
@@ -8351,7 +8351,7 @@ Fail with FAILURE if FAILED? is True.
***
#### (MAP-ERRM FERR M) [FUNCTION] · src
-∀ :A :B :C :D. Monad :C ⇒ ((:A → :B) → (:C (Result :A :D)) → (:C (Result :B :D)))
+∀ :A :B :C :D. Monad :C ⇒ ((:A → :B) → (:C (Result :A :D)) → (:C (Result :B :D)))
Map FERR over the error value of a Result contained in M.
@@ -8360,19 +8360,19 @@ Map FERR over the error value of a Result contained in M.
***
#### (MAP-ERRT FERR) [FUNCTION] · src
-∀ :A :B :C :D. Functor :C ⇒ ((:A → :B) → (((ResultT :A) :C) :D) → (((ResultT :B) :C) :D))
+∀ :A :B :C :D. Functor :C ⇒ ((:A → :B) → (((ResultT :A) :C) :D) → (((ResultT :B) :C) :D))
***
#### (MAP-RESULTT F (RESULTT M)) [FUNCTION] · src
-∀ :A :B :C :D :E :F. (((:A (Result :B :C)) → (:D (Result :E :F))) → (((ResultT :B) :A) :C) → (((ResultT :E) :D) :F))
+∀ :A :B :C :D :E :F. (((:A (Result :B :C)) → (:D (Result :E :F))) → (((ResultT :B) :A) :C) → (((ResultT :E) :D) :F))
***
#### (RUN-RESULTT (RESULTT M)) [FUNCTION] · src
-∀ :A :B :C. ((((ResultT :A) :B) :C) → (:B (Result :A :C)))
+∀ :A :B :C. ((((ResultT :A) :B) :C) → (:B (Result :A :C)))
***
@@ -8382,7 +8382,7 @@ Map FERR over the error value of a Result contained in M.
### Types
#### ST [TYPE] · src
-- (ST (:A → (Tuple :A :B)))
+- (ST (:A → (Tuple :A :B)))
A computation of a value which may affect the state.
Represented as a closure from initial state to updated state and value.
@@ -8390,10 +8390,10 @@ Represented as a closure from initial state to updated state and value.
Instances
-- Applicative (ST :A)
-- Functor (ST :A)
-- Monad (ST :A)
-- RuntimeRepr (ST :A :B)
+- Applicative (ST :A)
+- Functor (ST :A)
+- Monad (ST :A)
+- RuntimeRepr (ST :A :B)
@@ -8404,7 +8404,7 @@ Represented as a closure from initial state to updated state and value.
### Values
#### (MODIFY FS->S) [FUNCTION] · src
-∀ :A. ((:A → :A) → (ST :A Unit))
+∀ :A. ((:A → :A) → (ST :A Unit))
Modify the state in a StatefulComputation, discarding the old state.
@@ -8413,7 +8413,7 @@ Modify the state in a StatefulComputation, discarding the old state.
***
#### (MODIFY-GET FS->S) [FUNCTION] · src
-∀ :A. ((:A → :A) → (ST :A :A))
+∀ :A. ((:A → :A) → (ST :A :A))
Modify the state in a StatefulComputation, discarding the old state. Return the new state.
@@ -8422,7 +8422,7 @@ Modify the state in a StatefulComputation, discarding the old state. Return the
***
#### (MODIFY-SWAP FS->S) [FUNCTION] · src
-∀ :A. ((:A → :A) → (ST :A :A))
+∀ :A. ((:A → :A) → (ST :A :A))
Modify the state in a StatefulComputation, returning the old state.
@@ -8431,7 +8431,7 @@ Modify the state in a StatefulComputation, returning the old state.
***
#### (PUT STATE) [FUNCTION] · src
-∀ :A. (:A → (ST :A Unit))
+∀ :A. (:A → (ST :A Unit))
A StatefulComputation with state set to be the given state. The returned value is Unit.
@@ -8440,7 +8440,7 @@ A StatefulComputation with state set to be the given state. The returned value i
***
#### (RUN SC) [FUNCTION] · src
-∀ :A :B. ((ST :A :B) → :A → (Tuple :A :B))
+∀ :A :B. ((ST :A :B) → :A → (Tuple :A :B))
Runs a StatefulComputation to produce a final updated state and value given an initial state
@@ -8449,7 +8449,7 @@ Runs a StatefulComputation to produce a final updated state and value given an i
***
#### (SWAP STATE) [FUNCTION] · src
-∀ :A. (:A → (ST :A :A))
+∀ :A. (:A → (ST :A :A))
A StatefulComputation with state set to be the given state. The old state is returned.
@@ -8458,7 +8458,7 @@ A StatefulComputation with state set to be the given state. The old state is ret
***
#### GET [VALUE] · src
-∀ :A. (ST :A :A)
+∀ :A. (ST :A :A)
A StatefulComputation which returns the current state as the value.
@@ -8471,20 +8471,20 @@ A StatefulComputation which returns the current state as the value.
### Types
#### StateT [TYPE] · src
-- (StateT (:A → (:B (Tuple :A :C))))
+- (StateT (:A → (:B (Tuple :A :C))))
A monadic computation that tracks state of type :s.
Instances
-- Applicative :A ⇒ Applicative ((StateT :B) :A)
-- Functor :A ⇒ Functor ((StateT :B) :A)
-- Monad :A ⇒ Monad ((StateT :B) :A)
-- Monad :A ⇒ MonadState :B ((StateT :B) :A)
-- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((StateT :C) :B)
-- MonadTransformer (StateT :A)
-- RuntimeRepr (((StateT :A) :B) :C)
+- Applicative :A ⇒ Applicative ((StateT :B) :A)
+- Functor :A ⇒ Functor ((StateT :B) :A)
+- Monad :A ⇒ Monad ((StateT :B) :A)
+- Monad :A ⇒ MonadState :B ((StateT :B) :A)
+- MonadEnvironment :A :B ⇒ MonadEnvironment :A ((StateT :C) :B)
+- MonadTransformer (StateT :A)
+- RuntimeRepr (((StateT :A) :B) :C)
@@ -8495,7 +8495,7 @@ A monadic computation that tracks state of type :s.
### Values
#### (LIFT-STATET M) [FUNCTION] · src
-∀ :A :B :C. Functor :A ⇒ ((:A :B) → (((StateT :C) :A) :B))
+∀ :A :B :C. Functor :A ⇒ ((:A :B) → (((StateT :C) :A) :B))
Lift a stateless computation into a stateful context.
@@ -8504,7 +8504,7 @@ Lift a stateless computation into a stateful context.
***
#### (MAP-STATET FMA->NB (STATET FS->MSA)) [FUNCTION] · src
-∀ :A :B :C :D :E. (((:A (Tuple :B :C)) → (:D (Tuple :B :E))) → (((StateT :B) :A) :C) → (((StateT :B) :D) :E))
+∀ :A :B :C :D :E. (((:A (Tuple :B :C)) → (:D (Tuple :B :E))) → (((StateT :B) :A) :C) → (((StateT :B) :D) :E))
Map the return value, the final state, and the execution context.
@@ -8513,7 +8513,7 @@ Map the return value, the final state, and the execution context.
***
#### (MODIFY-STATET FS->S) [FUNCTION] · src
-∀ :A :B. Applicative :B ⇒ ((:A → :A) → (((StateT :A) :B) Unit))
+∀ :A :B. Applicative :B ⇒ ((:A → :A) → (((StateT :A) :B) Unit))
Modify the computation state, discarding the old state.
@@ -8522,7 +8522,7 @@ Modify the computation state, discarding the old state.
***
#### (PUT-STATET STATE) [FUNCTION] · src
-∀ :A :B. Applicative :B ⇒ (:A → (((StateT :A) :B) Unit))
+∀ :A :B. Applicative :B ⇒ (:A → (((StateT :A) :B) Unit))
A stateful computation with state set to the given state. The returned value is Unit.
@@ -8531,13 +8531,13 @@ A stateful computation with state set to the given state. The returned value is
***
#### (RUN-STATET (STATET FS->MSA) S) [FUNCTION] · src
-∀ :A :B :C. Applicative :B ⇒ ((((StateT :A) :B) :C) → :A → (:B (Tuple :A :C)))
+∀ :A :B :C. Applicative :B ⇒ ((((StateT :A) :B) :C) → :A → (:B (Tuple :A :C)))
***
#### (RUN-STATET_ ST-OP S) [FUNCTION] · src
-∀ :A :B :C. Applicative :B ⇒ ((((StateT :A) :B) :C) → :A → (:B :C))
+∀ :A :B :C. Applicative :B ⇒ ((((StateT :A) :B) :C) → :A → (:B :C))
Run ST-OP, discarding the state and returning the result.
@@ -8546,7 +8546,7 @@ Run ST-OP, discarding the state and returning the result.
***
#### GET-STATET [VALUE] · src
-∀ :A :B. Applicative :B ⇒ (((StateT :A) :B) :A)
+∀ :A :B. Applicative :B ⇒ (((StateT :A) :B) :A)
A stateful computation which returns the current state as the value.
@@ -8559,7 +8559,7 @@ A stateful computation which returns the current state as the value.
### Values
#### (FROM-SOME STR OPT) [FUNCTION] · src
-∀ :A. (String → (Optional :A) → :A)
+∀ :A. (String → (Optional :A) → :A)
Get the value of OPT, erroring with the provided string if it is None.
@@ -8568,7 +8568,7 @@ Get the value of OPT, erroring with the provided string if it is None.
***
#### (NONE? X) [FUNCTION] · src
-∀ :A. ((Optional :A) → Boolean)
+∀ :A. ((Optional :A) → Boolean)
Is X None?
@@ -8577,7 +8577,7 @@ Is X None?
***
#### (SOME? X) [FUNCTION] · src
-∀ :A. ((Optional :A) → Boolean)
+∀ :A. ((Optional :A) → Boolean)
Is X Some?
@@ -8596,14 +8596,14 @@ A binary tree which associates each :KEY with a :VALUE, sorted by `<=>' on the k
Instances
-- (Eq :A) (Eq :B) ⇒ Eq (OrdMap :A :B)
-- (Hash :A) (Hash :B) ⇒ Hash (OrdMap :A :B)
-- Functor (OrdMap :A)
-- IntoIterator (OrdMap :A :B) (Tuple :A :B)
-- Ord :A ⇒ FromIterator (OrdMap :A :B) (Tuple :A :B)
-- Ord :A ⇒ Monoid (OrdMap :A :B)
-- Ord :A ⇒ Semigroup (OrdMap :A :B)
-- RuntimeRepr (OrdMap :A :B)
+- (Eq :A) (Eq :B) ⇒ Eq (OrdMap :A :B)
+- (Hash :A) (Hash :B) ⇒ Hash (OrdMap :A :B)
+- Functor (OrdMap :A)
+- IntoIterator (OrdMap :A :B) (Tuple :A :B)
+- Ord :A ⇒ FromIterator (OrdMap :A :B) (Tuple :A :B)
+- Ord :A ⇒ Monoid (OrdMap :A :B)
+- Ord :A ⇒ Semigroup (OrdMap :A :B)
+- RuntimeRepr (OrdMap :A :B)
@@ -8614,7 +8614,7 @@ A binary tree which associates each :KEY with a :VALUE, sorted by `<=>' on the k
### Values
#### (ADJOIN MP K V) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → :B → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → :B → (OrdMap :A :B))
Returns an OrdMap in which the key `k` is associated with `v` added
to the `mp`, only when `mp` doesn't have an association with `k`.
@@ -8625,7 +8625,7 @@ If `mp` already contains an association with `k`, `mp` is returned as is.
***
#### (COLLECT COLL) [FUNCTION] · src
-∀ :A :B :C. (Ord :B) (Foldable :A) ⇒ ((:A (Tuple :B :C)) → (OrdMap :B :C))
+∀ :A :B :C. (Ord :B) (Foldable :A) ⇒ ((:A (Tuple :B :C)) → (OrdMap :B :C))
Construct a `OrdMap` containing all the `(key value)` pairs in `coll`.
@@ -8636,7 +8636,7 @@ If `coll` contains duplicate keys, later values will overwrite earlier values.
***
#### (COLLECT! ITER) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((Iterator (Tuple :A :B)) → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((Iterator (Tuple :A :B)) → (OrdMap :A :B))
Construct a `OrdMap` containing all the `(key value)` pairs in `iter`.
@@ -8647,7 +8647,7 @@ If `iter` contains duplicate keys, later values will overwrite earlier values.
***
#### (DIFFERENCE A B) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
Raturns an OrdMap that contains mappings in `a` but not in `b`.
@@ -8656,7 +8656,7 @@ Raturns an OrdMap that contains mappings in `a` but not in `b`.
***
#### (EMPTY? M) [FUNCTION] · src
-∀ :A :B. ((OrdMap :A :B) → Boolean)
+∀ :A :B. ((OrdMap :A :B) → Boolean)
Returns True iff the given OrdMap is empty.
@@ -8665,7 +8665,7 @@ Returns True iff the given OrdMap is empty.
***
#### (ENTRIES MP) [FUNCTION] · src
-∀ :A :B. ((OrdMap :A :B) → (Iterator (Tuple :A :B)))
+∀ :A :B. ((OrdMap :A :B) → (Iterator (Tuple :A :B)))
Iterate over the (key value) pairs in MP, sorted by the keys in least-to-greatest order.
@@ -8674,7 +8674,7 @@ Iterate over the (key value) pairs in MP, sorted by the keys in least-to-greates
***
#### (INSERT MP K V) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → :B → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → :B → (OrdMap :A :B))
Returns an OrdMap in which the key `k` is associated with `v` added
to the `mp`. If `mp` already contains mapping for `k`, it is replaced.
@@ -8684,7 +8684,7 @@ to the `mp`. If `mp` already contains mapping for `k`, it is replaced.
***
#### (INTERSECTION A B) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
Construct an OrdMap contaning elements whose key appears in both `a` and `b`.
The resulting values are from `a`.
@@ -8694,7 +8694,7 @@ The resulting values are from `a`.
***
#### (KEYS MP) [FUNCTION] · src
-∀ :A :B. ((OrdMap :A :B) → (Iterator :A))
+∀ :A :B. ((OrdMap :A :B) → (Iterator :A))
Iterate over the keys in MP, sorted least-to-greatest.
@@ -8703,7 +8703,7 @@ Iterate over the keys in MP, sorted least-to-greatest.
***
#### (LOOKUP MP K) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → (Optional :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → (Optional :B))
Retrieve the value associated with K in MP, or None if MP does not contain K.
@@ -8712,7 +8712,7 @@ Retrieve the value associated with K in MP, or None if MP does not contain K.
***
#### (LOOKUP-NEIGHBORS MP K) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → (Tuple3 (Optional (Tuple :A :B)) (Optional (Tuple :A :B)) (Optional (Tuple :A :B))))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → (Tuple3 (Optional (Tuple :A :B)) (Optional (Tuple :A :B)) (Optional (Tuple :A :B))))
Returns elements LO, ON, and HI, such that LO has the closest
key that is strictly less than `k`, ON is the entry with `k`,
@@ -8724,7 +8724,7 @@ Any of these values can be None if there's no such entry.
***
#### (MAX-KEY-ENTRY MP) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (Optional (Tuple :A :B)))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (Optional (Tuple :A :B)))
Returns the entry (Tuple :key :value) with the maximum key in the map `mp`. If the map is empty, None is returned.
@@ -8733,7 +8733,7 @@ Returns the entry (Tuple :key :value) with the maximum key in the map `mp`. If t
***
#### (MIN-KEY-ENTRY MP) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (Optional (Tuple :A :B)))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (Optional (Tuple :A :B)))
Returns the entry (Tuple :key :value) with the minimum key in the map `mp`. If the map is empty, None is returned.
@@ -8742,7 +8742,7 @@ Returns the entry (Tuple :key :value) with the minimum key in the map `mp`. If t
***
#### (REMOVE MP K) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → (OrdMap :A :B))
Returns an OrdMap in which the association with key 'k' is removed from
`mp`. If `mp` doesn't have an association with `k`, it is returned as is.
@@ -8752,7 +8752,7 @@ Returns an OrdMap in which the association with key 'k' is removed from
***
#### (REPLACE MP K V) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → :B → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → :A → :B → (OrdMap :A :B))
Returns an OrdMap in which the key `k` is associated with `v` replaced
from `mp`, when `mp` already has an association with `k`.
@@ -8763,7 +8763,7 @@ If `mp` doesn't has an association with `k`, `mp` is returned as is.
***
#### (UNION A B) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
Construct an OrdMap containing all the mappings of both A and B.
@@ -8776,7 +8776,7 @@ The operation is associative, but not commutative.
***
#### (UPDATE MP K F) [FUNCTION] · src
-∀ :A :B :C. Ord :A ⇒ ((OrdMap :A :B) → :A → ((Optional :B) → (Tuple (Optional :B) :C)) → (Tuple (OrdMap :A :B) :C))
+∀ :A :B :C. Ord :A ⇒ ((OrdMap :A :B) → :A → ((Optional :B) → (Tuple (Optional :B) :C)) → (Tuple (OrdMap :A :B) :C))
Lookup an association with `k` in `mp`. If there's an entry, call `f`
with its value wrapped with Some. If there isn't an entry, call 'f' with
@@ -8803,7 +8803,7 @@ result, where v' is the previous value associated with k.
***
#### (VALUES MP) [FUNCTION] · src
-∀ :A :B. ((OrdMap :A :B) → (Iterator :B))
+∀ :A :B. ((OrdMap :A :B) → (Iterator :B))
Iterate over the values in MP, sorted by their corresponding keys in least-to-greatest order.
@@ -8812,7 +8812,7 @@ Iterate over the values in MP, sorted by their corresponding keys in least-to-gr
***
#### (XOR A B) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
+∀ :A :B. Ord :A ⇒ ((OrdMap :A :B) → (OrdMap :A :B) → (OrdMap :A :B))
Raturns an OrdMap that contains mappings either in `a` or in `b`,
but not in both.
@@ -8822,7 +8822,7 @@ but not in both.
***
#### EMPTY [VALUE] · src
-∀ :A :B. (OrdMap :A :B)
+∀ :A :B. (OrdMap :A :B)
A OrdMap containing no mappings.
@@ -8843,12 +8843,12 @@ A 1-2 brother tree, sorted by `<=>` and unique by `==`.
Instances
-- Eq :A ⇒ Eq (OrdTree :A)
-- Foldable OrdTree
-- Hash :A ⇒ Hash (OrdTree :A)
-- IntoIterator (OrdTree :A) :A
-- Ord :A ⇒ FromIterator (OrdTree :A) :A
-- RuntimeRepr (OrdTree :A)
+- Eq :A ⇒ Eq (OrdTree :A)
+- Foldable OrdTree
+- Hash :A ⇒ Hash (OrdTree :A)
+- IntoIterator (OrdTree :A) :A
+- Ord :A ⇒ FromIterator (OrdTree :A) :A
+- RuntimeRepr (OrdTree :A)
@@ -8859,7 +8859,7 @@ A 1-2 brother tree, sorted by `<=>` and unique by `==`.
### Values
#### (ADJOIN T A) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
Returns an ordtree that has a new entry `a`. If `t` already has an entry
which is `==` to `a`, however, the original `t` is returned as is.
@@ -8869,7 +8869,7 @@ which is `==` to `a`, however, the original `t` is returned as is.
***
#### (DECREASING-ORDER TRE) [FUNCTION] · src
-∀ :A. ((OrdTree :A) → (Iterator :A))
+∀ :A. ((OrdTree :A) → (Iterator :A))
Returns an iterator that traverses elements in `tre` in decreasing order.
@@ -8878,7 +8878,7 @@ Returns an iterator that traverses elements in `tre` in decreasing order.
***
#### (DIFFERENCE A B) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
Returns an OrdTree that contains elements in `a` but not in `b`.
@@ -8887,13 +8887,13 @@ Returns an OrdTree that contains elements in `a` but not in `b`.
***
#### (EMPTY? T) [FUNCTION] · src
-∀ :A. ((OrdTree :A) → Boolean)
+∀ :A. ((OrdTree :A) → Boolean)
***
#### (INCREASING-ORDER TRE) [FUNCTION] · src
-∀ :A. ((OrdTree :A) → (Iterator :A))
+∀ :A. ((OrdTree :A) → (Iterator :A))
Returns an iterator that traverses elements in `tre` in increasing order.
This is same as (iter:into-iter tre).
@@ -8903,7 +8903,7 @@ This is same as (iter:into-iter tre).
***
#### (INSERT T A) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
Returns an ordtree that has an new entry `a` added to `t`. If `t` already
has an entry which is `==` to `a`, The new ordtree has `a` in place of the
@@ -8914,7 +8914,7 @@ existing entry.
***
#### (INTERSECTION A B) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
Returns an OrdTree that contains elements that appear in both `a` and `b`.
The resulting elements are from `a`.
@@ -8924,7 +8924,7 @@ The resulting elements are from `a`.
***
#### (LOOKUP HAYSTACK NEEDLE) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (Optional :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (Optional :A))
If HAYSTACK contains an element `==` to NEEDLE, return it.
@@ -8933,7 +8933,7 @@ If HAYSTACK contains an element `==` to NEEDLE, return it.
***
#### (LOOKUP-NEIGHBORS HAYSTACK NEEDLE) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (Tuple3 (Optional :A) (Optional :A) (Optional :A)))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (Tuple3 (Optional :A) (Optional :A) (Optional :A)))
Returns elements LO, ON, and HI, such that LO is the closest
element that is strictly less than `needle`, ON is the element
@@ -8946,7 +8946,7 @@ if there's no such element.
***
#### (MAX-ELEMENT TRE) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → (Optional :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → (Optional :A))
Returns the maximum element in the tree, or None if the tree is empty.
@@ -8955,7 +8955,7 @@ Returns the maximum element in the tree, or None if the tree is empty.
***
#### (MIN-ELEMENT TRE) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → (Optional :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → (Optional :A))
Returns the minimum element in the tree, or None if the tree is empty.
@@ -8964,7 +8964,7 @@ Returns the minimum element in the tree, or None if the tree is empty.
***
#### (REMOVE T A) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
Returns an ordtree that is the same as `t` except that the entry
which is `==` to `a` is removed. If `t` does not have such an entry,
@@ -8975,7 +8975,7 @@ which is `==` to `a` is removed. If `t` does not have such an entry,
***
#### (REPLACE T A) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → :A → (OrdTree :A))
Returns an ordtree that has an entry `a` only if `t` already has an
entry which is `==` to `a`. The original entry is replaced with the given
@@ -8986,7 +8986,7 @@ entry which is `==` to `a`. The original entry is replaced with the given
***
#### (TRANSFORM-ELEMENTS F TRE) [FUNCTION] · src
-∀ :A :B. ((:A → :B) → (OrdTree :A) → (OrdTree :B))
+∀ :A :B. ((:A → :B) → (OrdTree :A) → (OrdTree :B))
Returns a tree whose element consists of the result of `f` applied to
the original element, and isomorphic to the original tree.
@@ -9002,7 +9002,7 @@ We do not name this `map` because of this restriction.
***
#### (UNION A B) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
Returns an OrdTree that contains all the elements from `a` and `b`.
If both OrdTrees has the same (`==`) element, the one from `a` is taken.
@@ -9012,7 +9012,7 @@ If both OrdTrees has the same (`==`) element, the one from `a` is taken.
***
#### (UPDATE T A F) [FUNCTION] · src
-∀ :A :B. Ord :A ⇒ ((OrdTree :A) → :A → ((Optional :A) → (Tuple (Optional :A) :B)) → (Tuple (OrdTree :A) :B))
+∀ :A :B. Ord :A ⇒ ((OrdTree :A) → :A → ((Optional :A) → (Tuple (Optional :A) :B)) → (Tuple (OrdTree :A) :B))
Generic update. Look for the element `a` in `t`. If there's an entry,
call `f` with the existing entry wrapped with Some. If there isn't an entry,
@@ -9036,7 +9036,7 @@ carries extra info, though; see OrdMap implementation.
***
#### (XOR A B) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
+∀ :A. Ord :A ⇒ ((OrdTree :A) → (OrdTree :A) → (OrdTree :A))
Rdturns an OrdTree that contains elements either in `a` or in `b`,
but not in both.
@@ -9056,14 +9056,14 @@ Unbounded FIFO queue implemented with a linked list.
Instances
-- Default (Queue :A)
-- Eq :A ⇒ Eq (Queue :A)
-- Foldable Queue
-- FromIterator (Queue :A) :A
-- Functor Queue
-- IntoIterator (Queue :A) :A
-- RuntimeRepr (Queue :A)
-- Semigroup (Queue :A)
+- Default (Queue :A)
+- Eq :A ⇒ Eq (Queue :A)
+- Foldable Queue
+- FromIterator (Queue :A) :A
+- Functor Queue
+- IntoIterator (Queue :A) :A
+- RuntimeRepr (Queue :A)
+- Semigroup (Queue :A)
@@ -9074,7 +9074,7 @@ Unbounded FIFO queue implemented with a linked list.
### Values
#### (APPEND Q1 Q2) [FUNCTION] · src
-∀ :A. ((Queue :A) → (Queue :A) → (Queue :A))
+∀ :A. ((Queue :A) → (Queue :A) → (Queue :A))
Create a new queue containing the elements of `q1` followed by the elements of `q2`.
@@ -9083,7 +9083,7 @@ Create a new queue containing the elements of `q1` followed by the elements of `
***
#### (CLEAR! Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → Unit)
+∀ :A. ((Queue :A) → Unit)
Clear all elements from `q`.
@@ -9092,7 +9092,7 @@ Clear all elements from `q`.
***
#### (COPY Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → (Queue :A))
+∀ :A. ((Queue :A) → (Queue :A))
Return a new queue containing the same elements as `q`.
@@ -9101,7 +9101,7 @@ Return a new queue containing the same elements as `q`.
***
#### (EMPTY? Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → Boolean)
+∀ :A. ((Queue :A) → Boolean)
Is `q` empty?
@@ -9110,7 +9110,7 @@ Is `q` empty?
***
#### (EXTEND! Q ITER) [FUNCTION] · src
-∀ :A :B. IntoIterator :B :A ⇒ ((Queue :A) → :B → Unit)
+∀ :A :B. IntoIterator :B :A ⇒ ((Queue :A) → :B → Unit)
Push every element in `iter` to the end of `q`.
@@ -9119,7 +9119,7 @@ Push every element in `iter` to the end of `q`.
***
#### (INDEX INDEX Q) [FUNCTION] · src
-∀ :A. (UFix → (Queue :A) → (Optional :A))
+∀ :A. (UFix → (Queue :A) → (Optional :A))
Return the `index`th element of `q`.
@@ -9128,7 +9128,7 @@ Return the `index`th element of `q`.
***
#### (INDEX-UNSAFE INDEX Q) [FUNCTION] · src
-∀ :A. (UFix → (Queue :A) → :A)
+∀ :A. (UFix → (Queue :A) → :A)
Return the `index`th element of `q` without checking if the element exists.
@@ -9137,7 +9137,7 @@ Return the `index`th element of `q` without checking if the element exists.
***
#### (ITEMS! Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → (Iterator :A))
+∀ :A. ((Queue :A) → (Iterator :A))
Returns an interator over the items of `q`, removing items as they are returned.
@@ -9146,7 +9146,7 @@ Returns an interator over the items of `q`, removing items as they are returned.
***
#### (LENGTH Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → UFix)
+∀ :A. ((Queue :A) → UFix)
Returns the length of `q`.
@@ -9155,7 +9155,7 @@ Returns the length of `q`.
***
#### (NEW _) [FUNCTION] · src
-∀ :A. (Unit → (Queue :A))
+∀ :A. (Unit → (Queue :A))
Create a new empty queue.
@@ -9164,7 +9164,7 @@ Create a new empty queue.
***
#### (PEEK Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → (Optional :A))
+∀ :A. ((Queue :A) → (Optional :A))
Peek at the first item of `q`.
@@ -9173,7 +9173,7 @@ Peek at the first item of `q`.
***
#### (PEEK-UNSAFE Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → :A)
+∀ :A. ((Queue :A) → :A)
Peek at the first item of `q` without checking if the queue is empty.
@@ -9182,7 +9182,7 @@ Peek at the first item of `q` without checking if the queue is empty.
***
#### (POP! Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → (Optional :A))
+∀ :A. ((Queue :A) → (Optional :A))
Remove and return the first item of `q`.
@@ -9191,7 +9191,7 @@ Remove and return the first item of `q`.
***
#### (POP-UNSAFE! Q) [FUNCTION] · src
-∀ :A. ((Queue :A) → :A)
+∀ :A. ((Queue :A) → :A)
Remove and return the first item of `q` without checking if the queue is empty.
@@ -9200,7 +9200,7 @@ Remove and return the first item of `q` without checking if the queue is empty.
***
#### (PUSH! ITEM Q) [FUNCTION] · src
-∀ :A. (:A → (Queue :A) → Unit)
+∀ :A. (:A → (Queue :A) → Unit)
Push `item` onto the end of `q`.
@@ -9221,18 +9221,18 @@ Establishes that `:f` is a random-access store of elements of type `:t`. The **s
It is permitted for any of `make`, `unsafe-aref`, or `unsafe-set!` to error.
Methods:
-- MAKE :: (UFix → :B → :A)
-- MAKE-UNINITIALIZED :: (UFix → :A)
-- LENGTH :: (:A → UFix)
-- READABLE? :: (:A → Boolean)
-- WRITABLE? :: (:A → Boolean)
-- UNSAFE-AREF :: (:A → UFix → :B)
-- UNSAFE-SET! :: (:A → UFix → :B → Unit)
+- MAKE :: (UFix → :B → :A)
+- MAKE-UNINITIALIZED :: (UFix → :A)
+- LENGTH :: (:A → UFix)
+- READABLE? :: (:A → Boolean)
+- WRITABLE? :: (:A → Boolean)
+- UNSAFE-AREF :: (:A → UFix → :B)
+- UNSAFE-SET! :: (:A → UFix → :B → Unit)
Instances
-- RandomAccess (Vector :A) :A
-- RuntimeRepr :A ⇒ RandomAccess (LispArray :A) :A
+- RandomAccess (Vector :A) :A
+- RuntimeRepr :A ⇒ RandomAccess (LispArray :A) :A
@@ -9243,7 +9243,7 @@ Methods:
### Values
#### (AREF STORAGE INDEX) [FUNCTION] · src
-∀ :A :B. RandomAccess :A :B ⇒ (:A → UFix → (Optional :B))
+∀ :A :B. RandomAccess :A :B ⇒ (:A → UFix → (Optional :B))
Read the element at `index` of the random-access storage `storage`. Return `None` if the read is out-of-bounds or not permitted.
@@ -9252,7 +9252,7 @@ Read the element at `index` of the random-access storage `storage`. Return `None
***
#### (ROTATE! STORAGE INDEX1 INDEX2) [FUNCTION] · src
-∀ :A :B. RandomAccess :B :A ⇒ (:B → UFix → UFix → (Optional Unit))
+∀ :A :B. RandomAccess :B :A ⇒ (:B → UFix → UFix → (Optional Unit))
Rotate the elements at indices `index1` and `index2` of the random-access storage `storage`. Return `None` if the indices are out-of-bounds or if reading from or writing to `storage` is not permitted.
@@ -9261,7 +9261,7 @@ Rotate the elements at indices `index1` and `index2` of the random-access storag
***
#### (SET! STORAGE INDEX VALUE) [FUNCTION] · src
-∀ :A :B. RandomAccess :A :B ⇒ (:A → UFix → :B → (Optional Unit))
+∀ :A :B. RandomAccess :A :B ⇒ (:A → UFix → :B → (Optional Unit))
Write the element `value` at `index` of the random-access storage `storage`. Return `None` if the write is out-of-bounds or not permitted.
@@ -9270,7 +9270,7 @@ Write the element `value` at `index` of the random-access storage `storage`. Ret
***
#### (UNSAFE-ROTATE! STORAGE INDEX1 INDEX2) [FUNCTION] · src
-∀ :A :B. RandomAccess :B :A ⇒ (:B → UFix → UFix → Unit)
+∀ :A :B. RandomAccess :B :A ⇒ (:B → UFix → UFix → Unit)
Rotate the elements at indices `index1` and `index2` of the random-access storage `storage`.
@@ -9283,7 +9283,7 @@ Rotate the elements at indices `index1` and `index2` of the random-access storag
### Values
#### (ERR-IF FAILED? FAILURE) [FUNCTION] · src
-∀ :A. (Boolean → :A → (Result :A Unit))
+∀ :A. (Boolean → :A → (Result :A Unit))
Fail with FAILURE value if FAILED? is True.
@@ -9292,7 +9292,7 @@ Fail with FAILURE value if FAILED? is True.
***
#### (ERR? X) [FUNCTION] · src
-∀ :A :B. ((Result :A :B) → Boolean)
+∀ :A :B. ((Result :A :B) → Boolean)
Returns TRUE if X is ERR
@@ -9301,13 +9301,13 @@ Returns TRUE if X is ERR
***
#### (FLATTEN X) [FUNCTION] · src
-∀ :A. ((Result :A :A) → :A)
+∀ :A. ((Result :A :A) → :A)
***
#### (MAP-ERR F X) [FUNCTION] · src
-∀ :A :B :C. ((:A → :B) → (Result :A :C) → (Result :B :C))
+∀ :A :B :C. ((:A → :B) → (Result :A :C) → (Result :B :C))
Map over the ERR case
@@ -9316,7 +9316,7 @@ Map over the ERR case
***
#### (OK-OR-DEF DEF RES) [FUNCTION] · src
-∀ :A :B. (:A → (Result :B :A) → :A)
+∀ :A :B. (:A → (Result :B :A) → :A)
Take value in RES if it is OK, or DEF if it is ERR.
@@ -9325,13 +9325,13 @@ Take value in RES if it is OK, or DEF if it is ERR.
***
#### (OK-OR-ERROR RES) [FUNCTION] · src
-∀ :A :B. Signalable :A ⇒ ((Result :A :B) → :B)
+∀ :A :B. Signalable :A ⇒ ((Result :A :B) → :B)
***
#### (OK? X) [FUNCTION] · src
-∀ :A :B. ((Result :A :B) → Boolean)
+∀ :A :B. ((Result :A :B) → Boolean)
Returns TRUE if X is OK
@@ -9340,7 +9340,7 @@ Returns TRUE if X is OK
***
#### (OKM F-A) [FUNCTION] · src
-∀ :A :B :C. Functor :A ⇒ ((:A :B) → (:A (Result :C :B)))
+∀ :A :B :C. Functor :A ⇒ ((:A :B) → (:A (Result :C :B)))
Wrap a value inside F-A inside of 'Ok'.
@@ -9349,7 +9349,7 @@ Wrap a value inside F-A inside of 'Ok'.
***
#### (OPT->RESULT FAILURE OPT) [FUNCTION] · src
-∀ :A :B. (:A → (Optional :B) → (Result :A :B))
+∀ :A :B. (:A → (Optional :B) → (Result :A :B))
Convert OPT to a Result, using FAILURE value if None.
@@ -9365,17 +9365,17 @@ Convert OPT to a Result, using FAILURE value if None.
Instances
-- (Foldable :A) (RuntimeRepr :B) ⇒ Into (:A :B) (Seq :B)
-- Eq :A ⇒ Eq (Seq :A)
-- Functor Seq
-- Into (Seq :A) (List :A)
-- Into (Seq :A) (Vector :A)
-- IntoIterator (Seq :A) :A
-- RuntimeRepr (Seq :A)
-- RuntimeRepr :A ⇒ Default (Seq :A)
-- RuntimeRepr :A ⇒ FromIterator (Seq :A) :A
-- RuntimeRepr :A ⇒ Monoid (Seq :A)
-- RuntimeRepr :A ⇒ Semigroup (Seq :A)
+- (Foldable :A) (RuntimeRepr :B) ⇒ Into (:A :B) (Seq :B)
+- Eq :A ⇒ Eq (Seq :A)
+- Functor Seq
+- Into (Seq :A) (List :A)
+- Into (Seq :A) (Vector :A)
+- IntoIterator (Seq :A) :A
+- RuntimeRepr (Seq :A)
+- RuntimeRepr :A ⇒ Default (Seq :A)
+- RuntimeRepr :A ⇒ FromIterator (Seq :A) :A
+- RuntimeRepr :A ⇒ Monoid (Seq :A)
+- RuntimeRepr :A ⇒ Semigroup (Seq :A)
@@ -9386,7 +9386,7 @@ Convert OPT to a Result, using FAILURE value if None.
### Values
#### (CONC LEFT RIGHT) [FUNCTION] · src
-∀ :A. RuntimeRepr :A ⇒ ((Seq :A) → (Seq :A) → (Seq :A))
+∀ :A. RuntimeRepr :A ⇒ ((Seq :A) → (Seq :A) → (Seq :A))
Concatenate two `Seq`s
@@ -9395,13 +9395,13 @@ Concatenate two `Seq`s
***
#### (EMPTY? SEQ) [FUNCTION] · src
-∀ :A. ((Seq :A) → Boolean)
+∀ :A. ((Seq :A) → Boolean)
***
#### (GET SEQ IDX) [FUNCTION] · src
-∀ :A. ((Seq :A) → UFix → (Optional :A))
+∀ :A. ((Seq :A) → UFix → (Optional :A))
Get the member of `seq` at index `idx`, or `None` if `idx` is larger
than `(size seq)`
@@ -9411,7 +9411,7 @@ than `(size seq)`
***
#### (NEW _) [FUNCTION] · src
-∀ :A. RuntimeRepr :A ⇒ (Unit → (Seq :A))
+∀ :A. RuntimeRepr :A ⇒ (Unit → (Seq :A))
Create a new empty `Seq`.
@@ -9420,7 +9420,7 @@ Create a new empty `Seq`.
***
#### (POP SEQ) [FUNCTION] · src
-∀ :A. ((Seq :A) → (Optional (Tuple :A (Seq :A))))
+∀ :A. ((Seq :A) → (Optional (Tuple :A (Seq :A))))
If `seq` is empty, return `None`. Otherwise, the last member of `seq` and
a new `Seq` instance.
@@ -9430,7 +9430,7 @@ a new `Seq` instance.
***
#### (PUSH SEQ A) [FUNCTION] · src
-∀ :A. ((Seq :A) → :A → (Seq :A))
+∀ :A. ((Seq :A) → :A → (Seq :A))
Push `a` onto the end of `seq`, returning a new `Seq` instance.
@@ -9439,7 +9439,7 @@ Push `a` onto the end of `seq`, returning a new `Seq` instance.
***
#### (PUT SEQ IDX A) [FUNCTION] · src
-∀ :A. ((Seq :A) → UFix → :A → (Optional (Seq :A)))
+∀ :A. ((Seq :A) → UFix → :A → (Optional (Seq :A)))
If `idx` is less than `(size seq)`, Return a new `seq` whose `idx` position
contains `a`.
@@ -9449,7 +9449,7 @@ contains `a`.
***
#### (SIZE SEQ) [FUNCTION] · src
-∀ :A. ((Seq :A) → UFix)
+∀ :A. ((Seq :A) → UFix)
Return the number of elements in the `seq`.
@@ -9475,15 +9475,15 @@ Create a new `Seq` containing `elems`.
Instances
-- Eq :A ⇒ Eq (Slice :A)
-- Foldable Slice
-- FromIterator (Slice :A) :A
-- Into (Slice :A) (Vector :A)
-- Into (Vector :A) (Slice :A)
-- IntoIterator (Slice :A) :A
-- Iso (Slice :A) (Vector :A)
-- RuntimeRepr (Slice :A)
-- Sliceable (Slice :A)
+- Eq :A ⇒ Eq (Slice :A)
+- Foldable Slice
+- FromIterator (Slice :A) :A
+- Into (Slice :A) (Vector :A)
+- Into (Vector :A) (Slice :A)
+- IntoIterator (Slice :A) :A
+- Iso (Slice :A) (Vector :A)
+- RuntimeRepr (Slice :A)
+- Sliceable (Slice :A)
@@ -9494,7 +9494,7 @@ Create a new `Seq` containing `elems`.
### Values
#### (INDEX IDX S) [FUNCTION] · src
-∀ :A. (UFix → (Slice :A) → (Optional :A))
+∀ :A. (UFix → (Slice :A) → (Optional :A))
Lookup the element at `index` in `s`.
@@ -9503,7 +9503,7 @@ Lookup the element at `index` in `s`.
***
#### (INDEX-UNSAFE IDX S) [FUNCTION] · src
-∀ :A. (UFix → (Slice :A) → :A)
+∀ :A. (UFix → (Slice :A) → :A)
Lookup the element at `index` in `s` without bounds checking.
@@ -9512,7 +9512,7 @@ Lookup the element at `index` in `s` without bounds checking.
***
#### (ITER-CHUNKED SIZE S) [FUNCTION] · src
-∀ :A :B. Sliceable (:A :B) ⇒ (UFix → (:A :B) → (Iterator (Slice :B)))
+∀ :A :B. Sliceable (:A :B) ⇒ (UFix → (:A :B) → (Iterator (Slice :B)))
Divide `s` into a series of slices of length `size`. Will return a final shorter slice if `s` does not divide evenly.
@@ -9521,7 +9521,7 @@ Divide `s` into a series of slices of length `size`. Will return a final shorter
***
#### (ITER-CHUNKED-EXACT SIZE S) [FUNCTION] · src
-∀ :A :B. Sliceable (:A :B) ⇒ (UFix → (:A :B) → (Iterator (Slice :B)))
+∀ :A :B. Sliceable (:A :B) ⇒ (UFix → (:A :B) → (Iterator (Slice :B)))
Divide `s` into a series of slices of length `size`. Will skip trailing elements if `s` does not divide evenly.
@@ -9530,7 +9530,7 @@ Divide `s` into a series of slices of length `size`. Will skip trailing elements
***
#### (ITER-SLIDING SIZE S) [FUNCTION] · src
-∀ :A :B. Sliceable (:A :B) ⇒ (UFix → (:A :B) → (Iterator (Slice :B)))
+∀ :A :B. Sliceable (:A :B) ⇒ (UFix → (:A :B) → (Iterator (Slice :B)))
Returns an iterator that yeilds a series of overlapping slices of length `size`.
@@ -9539,7 +9539,7 @@ Returns an iterator that yeilds a series of overlapping slices of length `size`.
***
#### (LENGTH S) [FUNCTION] · src
-∀ :A. ((Slice :A) → UFix)
+∀ :A. ((Slice :A) → UFix)
Returns the length of `s`.
@@ -9548,7 +9548,7 @@ Returns the length of `s`.
***
#### (NEW START LEN V) [FUNCTION] · src
-∀ :A :B. Sliceable (:A :B) ⇒ (UFix → UFix → (:A :B) → (Slice :B))
+∀ :A :B. Sliceable (:A :B) ⇒ (UFix → UFix → (:A :B) → (Slice :B))
Create a new slice backed by `v` starting at index `start` and continuing for `len` elements.
@@ -9557,7 +9557,7 @@ Create a new slice backed by `v` starting at index `start` and continuing for `l
***
#### (SET! IDX ITEM S) [FUNCTION] · src
-∀ :A. (UFix → :A → (Slice :A) → Unit)
+∀ :A. (UFix → :A → (Slice :A) → Unit)
Set the element at index `idx` in `s` to `item`.
@@ -9570,7 +9570,7 @@ Set the element at index `idx` in `s` to `item`.
### Values
#### (CHARS STR) [FUNCTION] · src
-(String → (Iterator Char))
+(String → (Iterator Char))
Returns an iterator over the characters in `str`.
@@ -9579,7 +9579,7 @@ Returns an iterator over the characters in `str`.
***
#### (CONCAT STR1 STR2) [FUNCTION] · src
-(String → String → String)
+(String → String → String)
Concatenate STR1 and STR2 together, returning a new string.
@@ -9588,7 +9588,7 @@ Concatenate STR1 and STR2 together, returning a new string.
***
#### (DOWNCASE STR) [FUNCTION] · src
-(String → String)
+(String → String)
Returns a new string with lowercase characters.
@@ -9597,7 +9597,7 @@ Returns a new string with lowercase characters.
***
#### (LENGTH STR) [FUNCTION] · src
-(String → UFix)
+(String → UFix)
The length of a string STR.
@@ -9606,7 +9606,7 @@ The length of a string STR.
***
#### (PARSE-INT STR) [FUNCTION] · src
-(String → (Optional Integer))
+(String → (Optional Integer))
Parse the integer in string `str`.
@@ -9615,7 +9615,7 @@ Parse the integer in string `str`.
***
#### (REF STR IDX) [FUNCTION] · src
-(String → UFix → (Optional Char))
+(String → UFix → (Optional Char))
Return the `idx`th character of `str`.
@@ -9624,7 +9624,7 @@ Return the `idx`th character of `str`.
***
#### (REF-UNCHECKED STR IDX) [FUNCTION] · src
-(String → UFix → Char)
+(String → UFix → Char)
Return the `idx`th character of `str`. This function is partial.
@@ -9633,7 +9633,7 @@ Return the `idx`th character of `str`. This function is partial.
***
#### (REVERSE S) [FUNCTION] · src
-(String → String)
+(String → String)
Reverse a string.
@@ -9642,7 +9642,7 @@ Reverse a string.
***
#### (SPLIT N STR) [FUNCTION] · src
-(UFix → String → (Tuple String String))
+(UFix → String → (Tuple String String))
Splits a string into a head and tail at the nth index.
@@ -9651,7 +9651,7 @@ Splits a string into a head and tail at the nth index.
***
#### (STRIP-PREFIX PREFIX STR) [FUNCTION] · src
-(String → String → (Optional String))
+(String → String → (Optional String))
Returns a string without a give prefix, or `None` if the string
does not have that suffix.
@@ -9661,7 +9661,7 @@ does not have that suffix.
***
#### (STRIP-SUFFIX SUFFIX STR) [FUNCTION] · src
-(String → String → (Optional String))
+(String → String → (Optional String))
Returns a string without a give suffix, or `None` if the string
does not have that suffix.
@@ -9671,7 +9671,7 @@ does not have that suffix.
***
#### (SUBSTRING STR START END) [FUNCTION] · src
-(String → UFix → UFix → String)
+(String → UFix → UFix → String)
Compute a substring of a string bounded by given indices.
@@ -9680,7 +9680,7 @@ Compute a substring of a string bounded by given indices.
***
#### (SUBSTRING-INDEX SMALL BIG) [FUNCTION] · src
-(String → String → (Optional UFix))
+(String → String → (Optional UFix))
If the first argument appears as a substring within the second argument, return the starting index into the second argument.
@@ -9689,7 +9689,7 @@ If the first argument appears as a substring within the second argument, return
***
#### (SUBSTRING? SMALL BIG) [FUNCTION] · src
-(String → String → Boolean)
+(String → String → Boolean)
Return true if the first argument appears as a substring within the second argument.
@@ -9698,7 +9698,7 @@ Return true if the first argument appears as a substring within the second argum
***
#### (UPCASE STR) [FUNCTION] · src
-(String → String)
+(String → String)
Returns a new string with uppercase characters.
@@ -9720,9 +9720,9 @@ A Common Lisp symbol.
Instances
-- Default Symbol
-- Eq Symbol
-- RuntimeRepr Symbol
+- Default Symbol
+- Eq Symbol
+- RuntimeRepr Symbol
@@ -9733,7 +9733,7 @@ A Common Lisp symbol.
### Values
#### (GENSYM _) [FUNCTION] · src
-(Unit → Symbol)
+(Unit → Symbol)
Make an uninterned symbol as by `cl:gensym`.
@@ -9742,7 +9742,7 @@ Make an uninterned symbol as by `cl:gensym`.
***
#### (KEYWORD? S) [FUNCTION] · src
-(Symbol → Boolean)
+(Symbol → Boolean)
Is the symbol `s` a Common Lisp keyword?
@@ -9751,7 +9751,7 @@ Is the symbol `s` a Common Lisp keyword?
***
#### (MAKE-KEYWORD S) [FUNCTION] · src
-(String → Symbol)
+(String → Symbol)
Find or make a keyword named `s`.
@@ -9762,7 +9762,7 @@ Find or make a keyword named `s`.
***
#### (MAKE-SYMBOL S) [FUNCTION] · src
-(String → Symbol)
+(String → Symbol)
Make an uninterned symbol with the name `s`.
@@ -9771,7 +9771,7 @@ Make an uninterned symbol with the name `s`.
***
#### (SYMBOL-NAME S) [FUNCTION] · src
-(Symbol → String)
+(Symbol → String)
Return the name of the symbol `s`.
@@ -9780,7 +9780,7 @@ Return the name of the symbol `s`.
***
#### (UNINTERNED? S) [FUNCTION] · src
-(Symbol → Boolean)
+(Symbol → Boolean)
Is the symbol `s` uninterned?
@@ -9799,8 +9799,8 @@ Condition for lisp error handling. Uses `cl:condition`.
Instances
-- RuntimeRepr LispCondition
-- Signalable LispCondition
+- RuntimeRepr LispCondition
+- Signalable LispCondition
@@ -9817,7 +9817,7 @@ Function output with space and timing metedata.
Instances
-- RuntimeRepr (MeteredResult :A)
+- RuntimeRepr (MeteredResult :A)
@@ -9828,7 +9828,7 @@ Function output with space and timing metedata.
### Values
#### (ADD-FEATURE FEAT) [FUNCTION] · src
-(String → Unit)
+(String → Unit)
Adds a feature `feat` to `cl:*features*`.
@@ -9837,7 +9837,7 @@ Adds a feature `feat` to `cl:*features*`.
***
#### (ARCHITECTURE _) [FUNCTION] · src
-(Unit → String)
+(Unit → String)
The system's architecture (stored at compile time).
@@ -9846,7 +9846,7 @@ The system's architecture (stored at compile time).
***
#### (ARGV0 _) [FUNCTION] · src
-(Unit → (Optional String))
+(Unit → (Optional String))
The first command line argument (stored at compile time).
@@ -9855,7 +9855,7 @@ The first command line argument (stored at compile time).
***
#### (CMD-ARGS _) [FUNCTION] · src
-(Unit → (List String))
+(Unit → (List String))
The current command line arguments (stored at compile time).
@@ -9864,7 +9864,7 @@ The current command line arguments (stored at compile time).
***
#### (FEATURES _) [FUNCTION] · src
-(Unit → (List String))
+(Unit → (List String))
Returns a list of active features, from `cl:*features*`.
@@ -9873,7 +9873,7 @@ Returns a list of active features, from `cl:*features*`.
***
#### (GC _) [FUNCTION] · src
-(Unit → Unit)
+(Unit → Unit)
Perform a full garbage collection.
@@ -9882,7 +9882,7 @@ Perform a full garbage collection.
***
#### (GET-REAL-TIME _) [FUNCTION] · src
-(Unit → Integer)
+(Unit → Integer)
Gets the real-time in internal time units. The difference between two successive calls to this function represents the time that has elapsed.
@@ -9891,7 +9891,7 @@ Gets the real-time in internal time units. The difference between two successive
***
#### (GETENV VAR) [FUNCTION] · src
-(String → (Optional String))
+(String → (Optional String))
Gets the value of the environmental variable `var`, errors if `var` doesn't exist.
@@ -9900,7 +9900,7 @@ Gets the value of the environmental variable `var`, errors if `var` doesn't exis
***
#### (HOSTNAME _) [FUNCTION] · src
-(Unit → String)
+(Unit → String)
Returns the system's hostname. This is a function because the hostname can be redefined.
@@ -9909,7 +9909,7 @@ Returns the system's hostname. This is a function because the hostname can be re
***
#### (IMPLEMENTATION _) [FUNCTION] · src
-(Unit → String)
+(Unit → String)
The lisp implementation (stored at compile time).
@@ -9918,7 +9918,7 @@ The lisp implementation (stored at compile time).
***
#### (LISP-VERSION _) [FUNCTION] · src
-(Unit → String)
+(Unit → String)
The lisp implementation version (stored at compile time).
@@ -9927,7 +9927,7 @@ The lisp implementation version (stored at compile time).
***
#### (MONOTONIC-BYTES-CONSED _) [FUNCTION] · src
-(Unit → (Optional Integer))
+(Unit → (Optional Integer))
Returns the number of bytes consed since some unspecified point in time.
@@ -9938,7 +9938,7 @@ The difference between two successive calls to this function represents the numb
***
#### (OS _) [FUNCTION] · src
-(Unit → String)
+(Unit → String)
The system's operating system (stored at compile time).
@@ -9947,7 +9947,7 @@ The system's operating system (stored at compile time).
***
#### (SETENV! VAR VAL) [FUNCTION] · src
-(String → String → Unit)
+(String → String → Unit)
Sets an environment variable `var` to string `val`, only if `var` already exists.
@@ -9956,7 +9956,7 @@ Sets an environment variable `var` to string `val`, only if `var` already exists
***
#### (SLEEP N) [FUNCTION] · src
-∀ :A. Rational :A ⇒ (:A → Unit)
+∀ :A. Rational :A ⇒ (:A → Unit)
Sleep for `n` seconds, where `n` can be of any type with an instance of `Rational`.
@@ -9967,7 +9967,7 @@ Sleep uses type class `Rational`'s `best-approx` instead of `Real`'s `real-appro
***
#### (SPACE F) [FUNCTION] · src
-∀ :A. ((Unit → :A) → (Tuple :A (Optional Integer)))
+∀ :A. ((Unit → :A) → (Tuple :A (Optional Integer)))
Run the thunk `f` and return a tuple containing its value along with the approximate number of bytes consed during the course of executing f.
@@ -9980,7 +9980,7 @@ A garbage collection will be forced prior to invoking `f`.
***
#### (SPACETIME F) [FUNCTION] · src
-∀ :A. ((Unit → :A) → (MeteredResult :A))
+∀ :A. ((Unit → :A) → (MeteredResult :A))
Runs a function, gathering space and timing information and returning a `MeteredResults` object.
@@ -9991,7 +9991,7 @@ Garbage collection will be performed before profiling is performed.
***
#### (TIME F) [FUNCTION] · src
-∀ :A. ((Unit → :A) → (Tuple :A Integer))
+∀ :A. ((Unit → :A) → (Tuple :A Integer))
Run the thunk `f` and return a tuple containing its value along with the run time in microseconds.
@@ -10002,7 +10002,7 @@ While the result will always contain microseconds, some implementations may retu
***
#### (TIME-UNITS->ROUNDED-MICROSECONDS T) [FUNCTION] · src
-(Integer → Integer)
+(Integer → Integer)
Converts internal time units into an integer number of rounded microseconds.
@@ -10011,7 +10011,7 @@ Converts internal time units into an integer number of rounded microseconds.
***
#### (TIME-UNITS->SECONDS T) [FUNCTION] · src
-(Integer → Fraction)
+(Integer → Fraction)
Converts internal time units into `Fraction` seconds.
@@ -10020,7 +10020,7 @@ Converts internal time units into `Fraction` seconds.
***
#### INTERNAL-TIME-UNITS-PER-SECOND [VALUE] · src
-IntegerInteger
The number of internal time units per second. This is implementation specific.
@@ -10039,10 +10039,10 @@ The number of internal time units per second. This is implementation specific.
Instances
-- (Default :A) (Default :B) (Default :C) ⇒ Default (Tuple3 :A :B :C)
-- (Eq :A) (Eq :B) (Eq :C) ⇒ Eq (Tuple3 :A :B :C)
-- (Hash :A) (Hash :B) (Hash :C) ⇒ Hash (Tuple3 :A :B :C)
-- RuntimeRepr (Tuple3 :A :B :C)
+- (Default :A) (Default :B) (Default :C) ⇒ Default (Tuple3 :A :B :C)
+- (Eq :A) (Eq :B) (Eq :C) ⇒ Eq (Tuple3 :A :B :C)
+- (Hash :A) (Hash :B) (Hash :C) ⇒ Hash (Tuple3 :A :B :C)
+- RuntimeRepr (Tuple3 :A :B :C)
@@ -10058,10 +10058,10 @@ The number of internal time units per second. This is implementation specific.
Instances
-- (Default :A) (Default :B) (Default :C) (Default :D) ⇒ Default (Tuple4 :A :B :C :D)
-- (Eq :A) (Eq :B) (Eq :C) (Eq :D) ⇒ Eq (Tuple4 :A :B :C :D)
-- (Hash :A) (Hash :B) (Hash :C) (Hash :D) ⇒ Hash (Tuple4 :A :B :C :D)
-- RuntimeRepr (Tuple4 :A :B :C :D)
+- (Default :A) (Default :B) (Default :C) (Default :D) ⇒ Default (Tuple4 :A :B :C :D)
+- (Eq :A) (Eq :B) (Eq :C) (Eq :D) ⇒ Eq (Tuple4 :A :B :C :D)
+- (Hash :A) (Hash :B) (Hash :C) (Hash :D) ⇒ Hash (Tuple4 :A :B :C :D)
+- RuntimeRepr (Tuple4 :A :B :C :D)
@@ -10078,10 +10078,10 @@ The number of internal time units per second. This is implementation specific.
Instances
-- (Default :A) (Default :B) (Default :C) (Default :D) (Default :E) ⇒ Default (Tuple5 :A :B :C :D :E)
-- (Eq :A) (Eq :B) (Eq :C) (Eq :D) (Eq :E) ⇒ Eq (Tuple5 :A :B :C :D :E)
-- (Hash :A) (Hash :B) (Hash :C) (Hash :D) (Hash :E) ⇒ Hash (Tuple5 :A :B :C :D :E)
-- RuntimeRepr (Tuple5 :A :B :C :D :E)
+- (Default :A) (Default :B) (Default :C) (Default :D) (Default :E) ⇒ Default (Tuple5 :A :B :C :D :E)
+- (Eq :A) (Eq :B) (Eq :C) (Eq :D) (Eq :E) ⇒ Eq (Tuple5 :A :B :C :D :E)
+- (Hash :A) (Hash :B) (Hash :C) (Hash :D) (Hash :E) ⇒ Hash (Tuple5 :A :B :C :D :E)
+- RuntimeRepr (Tuple5 :A :B :C :D :E)
@@ -10092,7 +10092,7 @@ The number of internal time units per second. This is implementation specific.
### Values
#### (FST (TUPLE A _)) [FUNCTION] · src
-∀ :A :B. ((Tuple :A :B) → :A)
+∀ :A :B. ((Tuple :A :B) → :A)
Get the first element of a tuple.
@@ -10101,7 +10101,7 @@ Get the first element of a tuple.
***
#### (SEQUENCE-TUPLE (TUPLE A? B?)) [FUNCTION] · src
-∀ :A :B :C. Monad :A ⇒ ((Tuple (:A :B) (:A :C)) → (:A (Tuple :B :C)))
+∀ :A :B :C. Monad :A ⇒ ((Tuple (:A :B) (:A :C)) → (:A (Tuple :B :C)))
Flatten a Tuple of wrapped-values. Particularly useful for types like
(Tuple (Optional :a) (Optional :b)), etc.
@@ -10111,7 +10111,7 @@ Flatten a Tuple of wrapped-values. Particularly useful for types like
***
#### (SEQUENCE-TUPLE3 (TUPLE3 A? B? C?)) [FUNCTION] · src
-∀ :A :B :C :D. Monad :A ⇒ ((Tuple3 (:A :B) (:A :C) (:A :D)) → (:A (Tuple3 :B :C :D)))
+∀ :A :B :C :D. Monad :A ⇒ ((Tuple3 (:A :B) (:A :C) (:A :D)) → (:A (Tuple3 :B :C :D)))
Flatten a Tuple of wrapped-values. Particularly useful for types like
(Tuple (Optional :a) (Optional :b)), etc.
@@ -10121,7 +10121,7 @@ Flatten a Tuple of wrapped-values. Particularly useful for types like
***
#### (SEQUENCE-TUPLE4 (TUPLE4 A? B? C? D?)) [FUNCTION] · src
-∀ :A :B :C :D :E. Monad :A ⇒ ((Tuple4 (:A :B) (:A :C) (:A :D) (:A :E)) → (:A (Tuple4 :B :C :D :E)))
+∀ :A :B :C :D :E. Monad :A ⇒ ((Tuple4 (:A :B) (:A :C) (:A :D) (:A :E)) → (:A (Tuple4 :B :C :D :E)))
Flatten a Tuple of wrapped-values. Particularly useful for types like
(Tuple (Optional :a) (Optional :b)), etc.
@@ -10131,7 +10131,7 @@ Flatten a Tuple of wrapped-values. Particularly useful for types like
***
#### (SEQUENCE-TUPLE5 (TUPLE5 A? B? C? D? E?)) [FUNCTION] · src
-∀ :A :B :C :D :E :F. Monad :A ⇒ ((Tuple5 (:A :B) (:A :C) (:A :D) (:A :E) (:A :F)) → (:A (Tuple5 :B :C :D :E :F)))
+∀ :A :B :C :D :E :F. Monad :A ⇒ ((Tuple5 (:A :B) (:A :C) (:A :D) (:A :E) (:A :F)) → (:A (Tuple5 :B :C :D :E :F)))
Flatten a Tuple of wrapped-values. Particularly useful for types like
(Tuple (Optional :a) (Optional :b)), etc.
@@ -10141,7 +10141,7 @@ Flatten a Tuple of wrapped-values. Particularly useful for types like
***
#### (SND (TUPLE _ B)) [FUNCTION] · src
-∀ :A :B. ((Tuple :A :B) → :B)
+∀ :A :B. ((Tuple :A :B) → :B)
Get the second element of a tuple.
@@ -10160,8 +10160,8 @@ The runtime representation of a Coalton type as a lisp type.
Instances
-- Eq LispType
-- RuntimeRepr LispType
+- Eq LispType
+- RuntimeRepr LispType
@@ -10177,7 +10177,7 @@ Proxy holds no data, but has a phantom type parameter.
Instances
-- RuntimeRepr (Proxy :A)
+- RuntimeRepr (Proxy :A)
@@ -10198,85 +10198,85 @@ Types which have a runtime LispType representation.
The compiler will auto-generate instances of `RuntimeRepr` for all defined types.
Methods:
-- RUNTIME-REPR :: ((Proxy :A) → LispType)
+- RUNTIME-REPR :: ((Proxy :A) → LispType)
Instances
-- RuntimeRepr CReal
-- RuntimeRepr Big-Float
-- RuntimeRepr RoundingMode
-- RuntimeRepr StreamOptions
-- RuntimeRepr IfExists
-- RuntimeRepr (FileStream :A)
-- RuntimeRepr FileError
-- RuntimeRepr Pathname
-- RuntimeRepr LispCondition
-- RuntimeRepr (MeteredResult :A)
-- RuntimeRepr (Seq :A)
-- RuntimeRepr (OrdMap :A :B)
-- RuntimeRepr (MapPair :A :B)
-- RuntimeRepr (OrdTree :A)
-- RuntimeRepr ((LoopT :A) :B)
-- RuntimeRepr (Step :A)
-- RuntimeRepr (((FreeT :A) :B) :C)
-- RuntimeRepr (((FreeF :A) :B) :C)
-- RuntimeRepr ((Free :A) :B)
-- RuntimeRepr ((OptionalT :A) :B)
-- RuntimeRepr (((ResultT :A) :B) :C)
-- RuntimeRepr (((EnvT :A) :B) :C)
-- RuntimeRepr (Env :A :B)
-- RuntimeRepr (((StateT :A) :B) :C)
-- RuntimeRepr (ST :A :B)
-- RuntimeRepr (Identity :A)
-- RuntimeRepr (Queue :A)
-- RuntimeRepr InsertionMode
-- RuntimeRepr (HashMap :A :B)
-- RuntimeRepr (HmNode :A :B)
-- RuntimeRepr (HmEntry :A :B)
-- RuntimeRepr (Hashtable :A :B)
-- RuntimeRepr (Slice :A)
-- RuntimeRepr (Vector :A)
-- RuntimeRepr :A ⇒ RuntimeRepr (LispArray :A)
-- RuntimeRepr RangeStatus
-- RuntimeRepr (Iterator :A)
-- RuntimeRepr (Tuple5 :A :B :C :D :E)
-- RuntimeRepr (Tuple4 :A :B :C :D)
-- RuntimeRepr (Tuple3 :A :B :C)
-- RuntimeRepr (Cell :A)
-- RuntimeRepr () (* (* x :A)
-- RuntimeRepr (Dual :A)
-- RuntimeRepr Dyadic
-- RuntimeRepr :A ⇒ RuntimeRepr (Complex :A)
-- RuntimeRepr (Quantization :A)
-- RuntimeRepr Symbol
-- RuntimeRepr (Tuple :A :B)
-- RuntimeRepr Ord
-- RuntimeRepr Hash
-- RuntimeRepr (Result :A :B)
-- RuntimeRepr UFix
-- RuntimeRepr IFix
-- RuntimeRepr I64
-- RuntimeRepr I32
-- RuntimeRepr I16
-- RuntimeRepr I8
-- RuntimeRepr U64
-- RuntimeRepr U32
-- RuntimeRepr U16
-- RuntimeRepr U8
-- RuntimeRepr Bit
-- RuntimeRepr Void
-- RuntimeRepr (Proxy :A)
-- RuntimeRepr LispType
-- RuntimeRepr (Optional :A)
-- RuntimeRepr (List :A)
+- RuntimeRepr CReal
+- RuntimeRepr Big-Float
+- RuntimeRepr RoundingMode
+- RuntimeRepr StreamOptions
+- RuntimeRepr IfExists
+- RuntimeRepr (FileStream :A)
+- RuntimeRepr FileError
+- RuntimeRepr Pathname
+- RuntimeRepr LispCondition
+- RuntimeRepr (MeteredResult :A)
+- RuntimeRepr (Seq :A)
+- RuntimeRepr (OrdMap :A :B)
+- RuntimeRepr (MapPair :A :B)
+- RuntimeRepr (OrdTree :A)
+- RuntimeRepr ((LoopT :A) :B)
+- RuntimeRepr (Step :A)
+- RuntimeRepr (((FreeT :A) :B) :C)
+- RuntimeRepr (((FreeF :A) :B) :C)
+- RuntimeRepr ((Free :A) :B)
+- RuntimeRepr ((OptionalT :A) :B)
+- RuntimeRepr (((ResultT :A) :B) :C)
+- RuntimeRepr (((EnvT :A) :B) :C)
+- RuntimeRepr (Env :A :B)
+- RuntimeRepr (((StateT :A) :B) :C)
+- RuntimeRepr (ST :A :B)
+- RuntimeRepr (Identity :A)
+- RuntimeRepr (Queue :A)
+- RuntimeRepr InsertionMode
+- RuntimeRepr (HashMap :A :B)
+- RuntimeRepr (HmNode :A :B)
+- RuntimeRepr (HmEntry :A :B)
+- RuntimeRepr (Hashtable :A :B)
+- RuntimeRepr (Slice :A)
+- RuntimeRepr (Vector :A)
+- RuntimeRepr :A ⇒ RuntimeRepr (LispArray :A)
+- RuntimeRepr RangeStatus
+- RuntimeRepr (Iterator :A)
+- RuntimeRepr (Tuple5 :A :B :C :D :E)
+- RuntimeRepr (Tuple4 :A :B :C :D)
+- RuntimeRepr (Tuple3 :A :B :C)
+- RuntimeRepr (Cell :A)
+- RuntimeRepr (Hyperdual :A)
+- RuntimeRepr (Dual :A)
+- RuntimeRepr Dyadic
+- RuntimeRepr :A ⇒ RuntimeRepr (Complex :A)
+- RuntimeRepr (Quantization :A)
+- RuntimeRepr Symbol
+- RuntimeRepr (Tuple :A :B)
+- RuntimeRepr Ord
+- RuntimeRepr Hash
+- RuntimeRepr (Result :A :B)
+- RuntimeRepr UFix
+- RuntimeRepr IFix
+- RuntimeRepr I64
+- RuntimeRepr I32
+- RuntimeRepr I16
+- RuntimeRepr I8
+- RuntimeRepr U64
+- RuntimeRepr U32
+- RuntimeRepr U16
+- RuntimeRepr U8
+- RuntimeRepr Bit
+- RuntimeRepr Void
+- RuntimeRepr (Proxy :A)
+- RuntimeRepr LispType
+- RuntimeRepr (Optional :A)
+- RuntimeRepr (List :A)
- RuntimeRepr (:A → :B)
-- RuntimeRepr Fraction
-- RuntimeRepr String
-- RuntimeRepr F64
-- RuntimeRepr F32
-- RuntimeRepr Integer
-- RuntimeRepr Char
-- RuntimeRepr Boolean
+- RuntimeRepr Fraction
+- RuntimeRepr String
+- RuntimeRepr F64
+- RuntimeRepr F32
+- RuntimeRepr Integer
+- RuntimeRepr Char
+- RuntimeRepr Boolean
@@ -10287,7 +10287,7 @@ Methods:
### Values
#### (AS-PROXY-OF X _) [FUNCTION] · src
-∀ :A. (:A → (Proxy :A) → :A)
+∀ :A. (:A → (Proxy :A) → :A)
Returns the parameter, forcing the proxy to have the same type as the parameter.
@@ -10296,13 +10296,13 @@ Returns the parameter, forcing the proxy to have the same type as the parameter.
***
#### (PROXY-INNER _) [FUNCTION] · src
-∀ :A :B. ((Proxy (:A :B)) → (Proxy :B))
+∀ :A :B. ((Proxy (:A :B)) → (Proxy :B))
***
#### (PROXY-OF _) [FUNCTION] · src
-∀ :A. (:A → (Proxy :A))
+∀ :A. (:A → (Proxy :A))
Returns a Proxy containing the type of the parameter.
@@ -10311,7 +10311,7 @@ Returns a Proxy containing the type of the parameter.
***
#### (RUNTIME-REPR-OF X) [FUNCTION] · src
-∀ :A. RuntimeRepr :A ⇒ (:A → LispType)
+∀ :A. RuntimeRepr :A ⇒ (:A → LispType)
Returns the runtime representation of the type of the given value.
@@ -10327,26 +10327,26 @@ Returns the runtime representation of the type of the given value.
Instances
-- Default (Vector :A)
-- Eq :A ⇒ Eq (Vector :A)
-- Foldable Vector
-- FromIterator (Vector :A) :A
-- Functor Vector
-- Into (List :A) (Vector :A)
-- Into (Seq :A) (Vector :A)
-- Into (Slice :A) (Vector :A)
-- Into (Vector :A) (List :A)
-- Into (Vector :A) (Slice :A)
-- Into (Vector Char) String
-- Into String (Vector Char)
-- IntoIterator (Vector :A) :A
-- Iso (Slice :A) (Vector :A)
-- Iso (Vector :A) (List :A)
-- Monoid (Vector :A)
-- RandomAccess (Vector :A) :A
-- RuntimeRepr (Vector :A)
-- Semigroup (Vector :A)
-- Sliceable (Vector :A)
+- Default (Vector :A)
+- Eq :A ⇒ Eq (Vector :A)
+- Foldable Vector
+- FromIterator (Vector :A) :A
+- Functor Vector
+- Into (List :A) (Vector :A)
+- Into (Seq :A) (Vector :A)
+- Into (Slice :A) (Vector :A)
+- Into (Vector :A) (List :A)
+- Into (Vector :A) (Slice :A)
+- Into (Vector Char) String
+- Into String (Vector Char)
+- IntoIterator (Vector :A) :A
+- Iso (Slice :A) (Vector :A)
+- Iso (Vector :A) (List :A)
+- Monoid (Vector :A)
+- RandomAccess (Vector :A) :A
+- RuntimeRepr (Vector :A)
+- Semigroup (Vector :A)
+- Sliceable (Vector :A)
@@ -10357,7 +10357,7 @@ Returns the runtime representation of the type of the given value.
### Values
#### (APPEND V1 V2) [FUNCTION] · src
-∀ :A. ((Vector :A) → (Vector :A) → (Vector :A))
+∀ :A. ((Vector :A) → (Vector :A) → (Vector :A))
Create a new vector containing the elements of `v1` followed by the elements of `v2`.
@@ -10366,7 +10366,7 @@ Create a new vector containing the elements of `v1` followed by the elements of
***
#### (CAPACITY V) [FUNCTION] · src
-∀ :A. ((Vector :A) → UFix)
+∀ :A. ((Vector :A) → UFix)
Returns the number of elements that `v` can store without resizing.
@@ -10375,7 +10375,7 @@ Returns the number of elements that `v` can store without resizing.
***
#### (CLEAR! V) [FUNCTION] · src
-∀ :A. ((Vector :A) → Unit)
+∀ :A. ((Vector :A) → Unit)
Set the capacity of `v` to `0`.
@@ -10384,7 +10384,7 @@ Set the capacity of `v` to `0`.
***
#### (COPY V) [FUNCTION] · src
-∀ :A. ((Vector :A) → (Vector :A))
+∀ :A. ((Vector :A) → (Vector :A))
Return a new vector containing the same elements as `v`.
@@ -10393,7 +10393,7 @@ Return a new vector containing the same elements as `v`.
***
#### (EMPTY? V) [FUNCTION] · src
-∀ :A. ((Vector :A) → Boolean)
+∀ :A. ((Vector :A) → Boolean)
Is `v` empty?
@@ -10402,7 +10402,7 @@ Is `v` empty?
***
#### (EXTEND! VEC ITER) [FUNCTION] · src
-∀ :A :B. IntoIterator :B :A ⇒ ((Vector :A) → :B → Unit)
+∀ :A :B. IntoIterator :B :A ⇒ ((Vector :A) → :B → Unit)
Push every element in `iter` to the end of `vec`.
@@ -10411,7 +10411,7 @@ Push every element in `iter` to the end of `vec`.
***
#### (FIND-ELEM E V) [FUNCTION] · src
-∀ :A. Eq :A ⇒ (:A → (Vector :A) → (Optional UFix))
+∀ :A. Eq :A ⇒ (:A → (Vector :A) → (Optional UFix))
Find the index of element `e` in `v`.
@@ -10420,7 +10420,7 @@ Find the index of element `e` in `v`.
***
#### (HEAD V) [FUNCTION] · src
-∀ :A. ((Vector :A) → (Optional :A))
+∀ :A. ((Vector :A) → (Optional :A))
Return the first item of `v`.
@@ -10429,7 +10429,7 @@ Return the first item of `v`.
***
#### (HEAD-UNSAFE V) [FUNCTION] · src
-∀ :A. ((Vector :A) → :A)
+∀ :A. ((Vector :A) → :A)
Return the first item of `v` without first checking if `v` is empty.
@@ -10438,7 +10438,7 @@ Return the first item of `v` without first checking if `v` is empty.
***
#### (INDEX INDEX V) [FUNCTION] · src
-∀ :A. (UFix → (Vector :A) → (Optional :A))
+∀ :A. (UFix → (Vector :A) → (Optional :A))
Return the `index`th element of `v`.
@@ -10447,7 +10447,7 @@ Return the `index`th element of `v`.
***
#### (INDEX-UNSAFE IDX V) [FUNCTION] · src
-∀ :A. (UFix → (Vector :A) → :A)
+∀ :A. (UFix → (Vector :A) → :A)
Return the `idx`th element of `v` without checking if the element exists.
@@ -10456,7 +10456,7 @@ Return the `idx`th element of `v` without checking if the element exists.
***
#### (LAST V) [FUNCTION] · src
-∀ :A. ((Vector :A) → (Optional :A))
+∀ :A. ((Vector :A) → (Optional :A))
Return the last element of `v`.
@@ -10465,7 +10465,7 @@ Return the last element of `v`.
***
#### (LAST-UNSAFE V) [FUNCTION] · src
-∀ :A. ((Vector :A) → :A)
+∀ :A. ((Vector :A) → :A)
Return the last element of `v` without first checking if `v` is empty.
@@ -10474,7 +10474,7 @@ Return the last element of `v` without first checking if `v` is empty.
***
#### (LENGTH V) [FUNCTION] · src
-∀ :A. ((Vector :A) → UFix)
+∀ :A. ((Vector :A) → UFix)
Returns the length of `v`.
@@ -10483,7 +10483,7 @@ Returns the length of `v`.
***
#### (NEW _) [FUNCTION] · src
-∀ :A. (Unit → (Vector :A))
+∀ :A. (Unit → (Vector :A))
Create a new empty vector
@@ -10492,7 +10492,7 @@ Create a new empty vector
***
#### (POP! V) [FUNCTION] · src
-∀ :A. ((Vector :A) → (Optional :A))
+∀ :A. ((Vector :A) → (Optional :A))
Remove and return the last item of `v`.
@@ -10501,7 +10501,7 @@ Remove and return the last item of `v`.
***
#### (POP-UNSAFE! V) [FUNCTION] · src
-∀ :A. ((Vector :A) → :A)
+∀ :A. ((Vector :A) → :A)
Remove and return the last item of `v` without checking if the vector is empty.
@@ -10510,7 +10510,7 @@ Remove and return the last item of `v` without checking if the vector is empty.
***
#### (PUSH! ITEM V) [FUNCTION] · src
-∀ :A. (:A → (Vector :A) → UFix)
+∀ :A. (:A → (Vector :A) → UFix)
Append `item` to `v` and resize `v` if necessary, returning the index of the new item.
@@ -10519,7 +10519,7 @@ Append `item` to `v` and resize `v` if necessary, returning the index of the new
***
#### (RESECT! V START END) [FUNCTION] · src
-∀ :A. ((Vector :A) → UFix → UFix → Unit)
+∀ :A. ((Vector :A) → UFix → UFix → Unit)
Destructively kills a subsequence in a vector bounded by given indices.
@@ -10530,7 +10530,7 @@ Destructively kills a subsequence in a vector bounded by given indices.
***
#### (REVERSE V) [FUNCTION] · src
-∀ :A. ((Vector :A) → (Vector :A))
+∀ :A. ((Vector :A) → (Vector :A))
Returns a fresh vector with the elements of vector `v` in reverse order. The original vector isn't modified.
@@ -10539,7 +10539,7 @@ Returns a fresh vector with the elements of vector `v` in reverse order. The or
***
#### (REVERSE! V) [FUNCTION] · src
-∀ :A. ((Vector :A) → (Vector :A))
+∀ :A. ((Vector :A) → (Vector :A))
Returns a vector with the elements of vector `v` in reverse order. The original vector may be destroyed to produce the result.
@@ -10548,7 +10548,7 @@ Returns a vector with the elements of vector `v` in reverse order. The original
***
#### (SET! IDX ITEM V) [FUNCTION] · src
-∀ :A. (UFix → :A → (Vector :A) → Unit)
+∀ :A. (UFix → :A → (Vector :A) → Unit)
Set the `idx`th element of `v` to `item`. This function left intentionally unsafe because it does not have a return value to check.
@@ -10557,7 +10557,7 @@ Set the `idx`th element of `v` to `item`. This function left intentionally unsaf
***
#### (SET-CAPACITY! NEW-CAPACITY V) [FUNCTION] · src
-∀ :A. (UFix → (Vector :A) → Unit)
+∀ :A. (UFix → (Vector :A) → Unit)
Set the capacity of `v` to `new-capacity`. Setting the capacity to lower then the length will remove elements from the end.
@@ -10566,7 +10566,7 @@ Set the capacity of `v` to `new-capacity`. Setting the capacity to lower then th
***
#### (SINGLETON X) [FUNCTION] · src
-∀ :A. (:A → (Vector :A))
+∀ :A. (:A → (Vector :A))
Create a new vector with a single element equal to `x`
@@ -10575,7 +10575,7 @@ Create a new vector with a single element equal to `x`
***
#### (SINGLETON? V) [FUNCTION] · src
-∀ :A. ((Vector :A) → Boolean)
+∀ :A. ((Vector :A) → Boolean)
Is `v` a singleton?
@@ -10584,7 +10584,7 @@ Is `v` a singleton?
***
#### (SORT! V) [FUNCTION] · src
-∀ :A. Ord :A ⇒ ((Vector :A) → Unit)
+∀ :A. Ord :A ⇒ ((Vector :A) → Unit)
Sort a vector in-place in ascending order.
@@ -10593,7 +10593,7 @@ Sort a vector in-place in ascending order.
***
#### (SORT-BY! F V) [FUNCTION] · src
-∀ :A. ((:A → :A → Boolean) → (Vector :A) → Unit)
+∀ :A. ((:A → :A → Boolean) → (Vector :A) → Unit)
Sort a vector in-place with predicate function `f`.
@@ -10602,7 +10602,7 @@ Sort a vector in-place with predicate function `f`.
***
#### (SUBSEQ V START END) [FUNCTION] · src
-∀ :A. ((Vector :A) → UFix → UFix → (Vector :A))
+∀ :A. ((Vector :A) → UFix → UFix → (Vector :A))
Compute a subseq of a vector bounded by given indices.
@@ -10613,7 +10613,7 @@ Compute a subseq of a vector bounded by given indices.
***
#### (SWAP-REMOVE! IDX VEC) [FUNCTION] · src
-∀ :A. (UFix → (Vector :A) → (Optional :A))
+∀ :A. (UFix → (Vector :A) → (Optional :A))
Remove the element `idx` from `vec` and replace it with the last element in `vec`. Then return the removed element.
@@ -10622,7 +10622,7 @@ Remove the element `idx` from `vec` and replace it with the last element in `vec
***
#### (SWAP-REMOVE-UNSAFE! IDX VEC) [FUNCTION] · src
-∀ :A. (UFix → (Vector :A) → :A)
+∀ :A. (UFix → (Vector :A) → :A)
Remove the element `idx` from `vec` and replace it with the last element in `vec` without bounds checking. Then return the removed element.
@@ -10631,7 +10631,7 @@ Remove the element `idx` from `vec` and replace it with the last element in `vec
***
#### (WITH-CAPACITY N) [FUNCTION] · src
-∀ :A. (UFix → (Vector :A))
+∀ :A. (UFix → (Vector :A))
Create a new vector with `n` elements preallocated.
@@ -10640,7 +10640,7 @@ Create a new vector with `n` elements preallocated.
***
#### (WITH-INITIAL-ELEMENT N X) [FUNCTION] · src
-∀ :A. (UFix → :A → (Vector :A))
+∀ :A. (UFix → :A → (Vector :A))
Create a new vector with `n` elements equal to `x`.