@@ -1403,7 +1403,7 @@ to the `format-string` via `cl:format` to produce an error message. #### MAKE-LIST (&REST FORMS) [MACRO] Create a heterogeneous Coalton `List` of objects. This macro is -deprecated; use `coalton-library/list:make`. +deprecated; use `coalton/list:make`. @@ -1485,14 +1485,14 @@ Note that this may copy the object or allocate memory. *** -# Package `COALTON-LIBRARY/ALGORITHMS/FFT` +# Package `COALTON/ALGORITHMS/FFT` A coalton package for performing FFTs. ### Classes -#### FFTCyclicGroup [CLASS] · src +#### FFTCyclicGroup [CLASS] · src FFTCyclicGroup :A @@ -1517,7 +1517,7 @@ Methods: *** -#### FFTField [CLASS] · src +#### FFTField [CLASS] · src FFTRing :A ⇒ FFTField :A @@ -1539,7 +1539,7 @@ Methods: *** -#### FFTGroup [CLASS] · src +#### FFTGroup [CLASS] · src FFTGroup :A @@ -1563,7 +1563,7 @@ Methods: *** -#### FFTRing [CLASS] · src +#### FFTRing [CLASS] · src FFTGroup :A ⇒ FFTRing :A @@ -1588,7 +1588,7 @@ Methods: ### Values -#### (DIF-FFT-RAW DST SRC) [FUNCTION] · src +#### (DIF-FFT-RAW DST SRC) [FUNCTION] · src ∀ :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`. @@ -1601,7 +1601,7 @@ Normalization: none *** -#### (DIF-IFFT-RAW DST SRC) [FUNCTION] · src +#### (DIF-IFFT-RAW DST SRC) [FUNCTION] · src ∀ :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`. @@ -1614,7 +1614,7 @@ Normalization: none *** -#### (DIT-FFT-RAW DST SRC) [FUNCTION] · src +#### (DIT-FFT-RAW DST SRC) [FUNCTION] · src ∀ :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`. @@ -1627,7 +1627,7 @@ Normalization: none *** -#### (DIT-IFFT-RAW DST SRC) [FUNCTION] · src +#### (DIT-IFFT-RAW DST SRC) [FUNCTION] · src ∀ :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`. @@ -1640,13 +1640,13 @@ Normalization: none *** -#### (DIVIDE X Y) [FUNCTION] · src +#### (DIVIDE X Y) [FUNCTION] · src ∀ :A. FFTField :A ⇒ (:A → :A → :A) *** -#### (FFT STORAGE) [FUNCTION] · src +#### (FFT STORAGE) [FUNCTION] · src ∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C) Perform a fast Fourier transform on the data in `storage`. @@ -1655,7 +1655,7 @@ Perform a fast Fourier transform on the data in `storage`. *** -#### (FFT! STORAGE) [FUNCTION] · src +#### (FFT! STORAGE) [FUNCTION] · src ∀ :A :B. (RandomAccess :B :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :B) Perform an in-place fast Fourier transform on `storage`. @@ -1664,7 +1664,7 @@ Perform an in-place fast Fourier transform on `storage`. *** -#### (FFT-INTO! DST SRC) [FUNCTION] · src +#### (FFT-INTO! DST SRC) [FUNCTION] · src ∀ :A :B :C. (RandomAccess :C :A) (RandomAccess :B :A) (FFTRing :A) (FFTCyclicGroup :A) ⇒ (:B → :C → :B) Perform a fast Fourier transform of `src`, writing the result to `dst`. If `dst` is longer than `src`, then remaining elements of `dst` are left unmutated. @@ -1673,7 +1673,7 @@ Perform a fast Fourier transform of `src`, writing the result to `dst`. If `dst` *** -#### (IFFT STORAGE) [FUNCTION] · src +#### (IFFT STORAGE) [FUNCTION] · src ∀ :A :B :C. (RandomAccess :B :A) (RandomAccess :C :A) (FFTField :A) (FFTCyclicGroup :A) (Num :A) ⇒ (:B → :C) Perform an inverse fast Fourier transform on the data in `storage`. @@ -1682,7 +1682,7 @@ Perform an inverse fast Fourier transform on the data in `storage`. *** -#### (IFFT! STORAGE) [FUNCTION] · src +#### (IFFT! STORAGE) [FUNCTION] · src ∀ :A :B. (RandomAccess :B :A) (FFTField :A) (FFTCyclicGroup :A) (Num :A) ⇒ (:B → :B) Perform an in-place inverse fast Fourier transform on `storage`. @@ -1691,7 +1691,7 @@ Perform an in-place inverse fast Fourier transform on `storage`. *** -#### (IFFT-INTO! DST SRC) [FUNCTION] · src +#### (IFFT-INTO! DST SRC) [FUNCTION] · src ∀ :A :B :C. (RandomAccess :C :A) (RandomAccess :B :A) (FFTField :A) (FFTCyclicGroup :A) (Num :A) ⇒ (:B → :C → :B) Perform an inverse fast Fourier transform of `src`, writing the result to `dst`. If `dst` is longer than `src`, then remaining elements of `dst` are left unmutated. @@ -1700,13 +1700,13 @@ Perform an inverse fast Fourier transform of `src`, writing the result to `dst`. *** -#### (SUBTRACT X Y) [FUNCTION] · src +#### (SUBTRACT X Y) [FUNCTION] · src ∀ :A. FFTGroup :A ⇒ (:A → :A → :A) *** -# Package `COALTON-LIBRARY/BIG-FLOAT` +# Package `COALTON/BIG-FLOAT` ### Types @@ -1902,7 +1902,7 @@ RouND toward Zero. *** -# Package `COALTON-LIBRARY/BITS` +# Package `COALTON/BITS` ### Classes @@ -1984,7 +1984,7 @@ Deposits a byte of size `size` into a bitstring at a position `position`. *** -# Package `COALTON-LIBRARY/BUILTIN` +# Package `COALTON/BUILTIN` ### Values @@ -2053,7 +2053,7 @@ Synonym for `boolean-xor`. ### Macros -#### UNREACHABLE (&OPTIONAL (DATUM "Unreachable") &REST ARGUMENTS) [MACRO] +#### UNREACHABLE (&OPTIONAL (DATUM "Unreachable") &REST ARGUMENTS) [MACRO] Signal an error with CL format string DATUM and optional format arguments ARGUMENTS. @@ -2061,7 +2061,7 @@ Signal an error with CL format string DATUM and optional format arguments ARGUME *** -# Package `COALTON-LIBRARY/CELL` +# Package `COALTON/CELL` ### Types @@ -2186,7 +2186,7 @@ value. *** -# Package `COALTON-LIBRARY/CHAR` +# Package `COALTON/CHAR` ### Values @@ -2316,7 +2316,7 @@ Is `c` an uppercase character? *** -# Package `COALTON-LIBRARY/CLASSES` +# Package `COALTON/CLASSES` ### Types @@ -3530,11 +3530,11 @@ Unwrap `container`, returning `default` on failure. *** -# Package `COALTON-LIBRARY/COMPUTABLE-REALS` +# Package `COALTON/COMPUTABLE-REALS` ### Types -#### CReal [TYPE] · src +#### CReal [TYPE] · src
Instances @@ -3575,7 +3575,7 @@ Unwrap `container`, returning `default` on failure. ### Values -#### (APPROX X K) [FUNCTION] · src +#### (APPROX X K) [FUNCTION] · src (CReal → UFix → Integer) Computes an approximation of the bits of a given @@ -3593,7 +3593,7 @@ See `rational` or `rationalize` to produce a rational approximation of *** -#### (COMPARISON-THRESHOLD _) [FUNCTION] · src +#### (COMPARISON-THRESHOLD _) [FUNCTION] · src ∀ :A. (:A → UFix) Returns the current `CReal` comparison threshold measured as a number @@ -3608,7 +3608,7 @@ is no guarantee that the `CReal` will be accurate to any precision*. *** -#### (CR-PRINT X K) [FUNCTION] · src +#### (CR-PRINT X K) [FUNCTION] · src (CReal → UFix → Boolean) Prints a real `x` up to `k` bits of precision. @@ -3617,7 +3617,7 @@ Prints a real `x` up to `k` bits of precision. *** -#### (RATIONAL-APPROX X K) [FUNCTION] · src +#### (RATIONAL-APPROX X K) [FUNCTION] · src (CReal → UFix → Fraction) Produce a rational approximation of `x` called $r$ such that @@ -3630,7 +3630,7 @@ $$ *** -#### (RATIONALIZE X K) [FUNCTION] · src +#### (RATIONALIZE X K) [FUNCTION] · src (CReal → UFix → Fraction) Produce a rational approximation of `x` called $r$ such that @@ -3646,7 +3646,7 @@ the simplest possible such approximation. *** -#### (SET-COMPARISON-THRESHOLD! K) [FUNCTION] · src +#### (SET-COMPARISON-THRESHOLD! K) [FUNCTION] · src ∀ :A. (:A → Unit) Sets the global `CReal` comparison threshold to k bits after the 'decimal' point. @@ -3657,7 +3657,7 @@ See `comparison-threshold` for more details. *** -# Package `COALTON-LIBRARY/EXPERIMENTAL/DO-CONTROL-CORE` +# Package `COALTON/EXPERIMENTAL/DO-CONTROL-CORE` ### Values @@ -3770,7 +3770,7 @@ or do nothing. *** -# Package `COALTON-LIBRARY/EXPERIMENTAL/DO-CONTROL-LOOPS` +# Package `COALTON/EXPERIMENTAL/DO-CONTROL-LOOPS` ### Values @@ -3845,7 +3845,7 @@ Returns Unit. ### Macros -#### DO-COLLECT ((SYM INTO-ITR) &BODY BODY) [MACRO] +#### DO-COLLECT ((SYM INTO-ITR) &BODY BODY) [MACRO] Apply FA->M to each element produced by INTO-ITR and run the resulting monadic action. Collect the results. @@ -3854,7 +3854,7 @@ Collect the results. *** -#### DO-LOOP-DO-WHILE (M-TERM? &BODY BODY) [MACRO] +#### DO-LOOP-DO-WHILE (M-TERM? &BODY BODY) [MACRO] Before each iteration, evaluate M-TERM?. If it indicates completion, stop; otherwise run BODY. Wraps BODY in a 'do' block. Returns Unit. @@ -3863,7 +3863,7 @@ Wraps BODY in a 'do' block. Returns Unit. *** -# Package `COALTON-LIBRARY/EXPERIMENTAL/DO-CONTROL-LOOPS-ADV` +# Package `COALTON/EXPERIMENTAL/DO-CONTROL-LOOPS-ADV` ### Types @@ -3995,7 +3995,7 @@ Signal that the current iteration should be skipped and the loop should continue *** -# Package `COALTON-LIBRARY/EXPERIMENTAL/LOOPS` +# Package `COALTON/EXPERIMENTAL/LOOPS` A Coalton package of loop macros. @@ -4004,7 +4004,7 @@ Note: `(return)`, `(break)`, and `(continue)` do not work inside _any_ of these ### Macros -#### ARGBESTTIMES ((VARIABLE COUNT BETTER?) &BODY BODY) [MACRO] +#### ARGBESTTIMES ((VARIABLE COUNT BETTER?) &BODY BODY) [MACRO] The `UFix` in [0, `count`) which, when `variable` is bound to it, results in the evaluation of `body` which is better than the same for the rest of the `UFix`s in [0, `count`). @@ -4012,7 +4012,7 @@ The `UFix` in [0, `count`) which, when `variable` is bound to it, results in the *** -#### BESTTIMES ((VARIABLE COUNT BETTER?) &BODY BODY) [MACRO] +#### BESTTIMES ((VARIABLE COUNT BETTER?) &BODY BODY) [MACRO] The result of evaluating `body` with `variable` bound to a `UFix` in [0, `count`) that is `better?` than the result of evaluating `body` with `variable` bound to the rest of the `UFix`s in [0, `count`).. @@ -4020,7 +4020,7 @@ The result of evaluating `body` with `variable` bound to a `UFix` in [0, `count` *** -#### COLLECTTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] +#### COLLECTTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] Collect the results of evaluating `body` for `variable` bound to every `UFix` in [0, `count`) as a `List`. @@ -4028,7 +4028,7 @@ Collect the results of evaluating `body` for `variable` bound to every `UFix` in *** -#### DOLIST ((VARIABLE LIS) &BODY BODY) [MACRO] +#### DOLIST ((VARIABLE LIS) &BODY BODY) [MACRO] Perform `body` with `variable` bound to every element of `lis`. @@ -4036,7 +4036,7 @@ Perform `body` with `variable` bound to every element of `lis`. *** -#### DOLIST-ENUMERATED ((INDEX-VARIABLE ELEMENT-VARIABLE LIS) &BODY BODY) [MACRO] +#### DOLIST-ENUMERATED ((INDEX-VARIABLE ELEMENT-VARIABLE LIS) &BODY BODY) [MACRO] Perform `body` with `element-variable` bound to the elements of `lis` and `index-variable` bound to their indices. @@ -4044,7 +4044,7 @@ Perform `body` with `element-variable` bound to the elements of `lis` and `index *** -#### DOLISTS (VARIABLES-AND-LISTS &BODY BODY) [MACRO] +#### DOLISTS (VARIABLES-AND-LISTS &BODY BODY) [MACRO] Perform `body` with the variables bound to the elements of the lists. See the example below. @@ -4066,7 +4066,7 @@ COALTON::UNIT/UNIT *** -#### DORANGE ((VARIABLE START-OR-STOP &OPTIONAL STOP STEP) &BODY BODY) [MACRO] +#### DORANGE ((VARIABLE START-OR-STOP &OPTIONAL STOP STEP) &BODY BODY) [MACRO] Perform `body` with `variable` bound to elements of a discrete range. @@ -4117,7 +4117,7 @@ COALTON::UNIT/UNIT *** -#### DOTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] +#### DOTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] Perform `body` with `variable` bound to every `UFix` in [0, `count`) sequentially. @@ -4125,7 +4125,7 @@ Perform `body` with `variable` bound to every `UFix` in [0, `count`) sequentiall *** -#### EVERYTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] +#### EVERYTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] Does `body` evaluate to `True` for `variable` bound to every `UFix` in [0, `count`). Returns `True` if `(zero? count)`. @@ -4133,7 +4133,7 @@ Does `body` evaluate to `True` for `variable` bound to every `UFix` in [0, `coun *** -#### PRODTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] +#### PRODTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] The product of `body` for `variable` bount to every `UFix` in [0, `count`). @@ -4141,7 +4141,7 @@ The product of `body` for `variable` bount to every `UFix` in [0, `count`). *** -#### REPEAT ((COUNT) &BODY BODY) [MACRO] +#### REPEAT ((COUNT) &BODY BODY) [MACRO] Perform `body` `count` times. @@ -4149,7 +4149,7 @@ Perform `body` `count` times. *** -#### SOMETIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] +#### SOMETIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] Does `body` evaluate to `True` for `variable` bound to some `UFix` in [0, `count`). Returns `False` if `(zero? count)`. @@ -4157,7 +4157,7 @@ Does `body` evaluate to `True` for `variable` bound to some `UFix` in [0, `count *** -#### SUMTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] +#### SUMTIMES ((VARIABLE COUNT) &BODY BODY) [MACRO] The sum of `body` for `variable` bount to every `UFix` in [0, `count`). @@ -4165,7 +4165,7 @@ The sum of `body` for `variable` bount to every `UFix` in [0, `count`). *** -# Package `COALTON-LIBRARY/FILE` +# Package `COALTON/FILE` This is Coalton's library for directory utilities and file IO. @@ -4649,7 +4649,7 @@ Writes elements of an vector of type `:a` to a stream of type `:a`. *** -# Package `COALTON-LIBRARY/FUNCTIONS` +# Package `COALTON/FUNCTIONS` ### Values @@ -4843,7 +4843,7 @@ Take a function with two currying parameters and enable their input as a single ### Macros -#### CONJOIN* (&REST PREDICATES) [MACRO] +#### CONJOIN* (&REST PREDICATES) [MACRO] Compute the conjuction of `predicates`. @@ -4857,7 +4857,7 @@ For example, the following expressions are equivalent. *** -#### DISJOIN* (&REST PREDICATES) [MACRO] +#### DISJOIN* (&REST PREDICATES) [MACRO] Compute the disjunction of `predicates`. @@ -4871,7 +4871,7 @@ For example, the following expressions are equivalent. *** -# Package `COALTON-LIBRARY/HASH` +# Package `COALTON/HASH` ### Values @@ -4887,7 +4887,7 @@ For example, the following expressions are equivalent. *** -# Package `COALTON-LIBRARY/HASHMAP` +# Package `COALTON/HASHMAP` ### Types @@ -5105,7 +5105,7 @@ An empty HashMap *** -# Package `COALTON-LIBRARY/HASHTABLE` +# Package `COALTON/HASHTABLE` ### Types @@ -5221,7 +5221,7 @@ Create a new empty hashtable with a given capacity *** -# Package `COALTON-LIBRARY/ITERATOR` +# Package `COALTON/ITERATOR` ### Types @@ -5802,7 +5802,7 @@ Yields nothing; stops immediately *** -# Package `COALTON-LIBRARY/LISPARRAY` +# Package `COALTON/LISPARRAY` ### Types @@ -5892,7 +5892,7 @@ Set the `i`th value of the `LispArray` `v` to `x`. *** -# Package `COALTON-LIBRARY/LIST` +# Package `COALTON/LIST` ### Values @@ -6476,7 +6476,7 @@ Build a new list by calling F with elements of AS, BS, CS, DS and ES ### Macros -#### MAKE (&REST ELEMENTS) [MACRO] +#### MAKE (&REST ELEMENTS) [MACRO] Make a homogeneous list of `elements`. Synonym for `coalton:make-list`. @@ -6484,7 +6484,7 @@ Make a homogeneous list of `elements`. Synonym for `coalton:make-list`. *** -# Package `COALTON-LIBRARY/MATH/ARITH` +# Package `COALTON/MATH/ARITH` ### Classes @@ -6713,7 +6713,7 @@ Is `x` zero? *** -# Package `COALTON-LIBRARY/MATH/BOUNDED` +# Package `COALTON/MATH/BOUNDED` ### Classes @@ -6747,7 +6747,7 @@ Methods: *** -# Package `COALTON-LIBRARY/MATH/COMPLEX` +# Package `COALTON/MATH/COMPLEX` ### Types @@ -6851,7 +6851,7 @@ blackboard-bold 𝕚.) *** -# Package `COALTON-LIBRARY/MATH/DUAL` +# Package `COALTON/MATH/DUAL` @@ -6959,7 +6959,7 @@ The primal (i.e., real) part of a dual number. *** -# Package `COALTON-LIBRARY/MATH/DYADIC` +# Package `COALTON/MATH/DYADIC` ### Types @@ -7025,7 +7025,7 @@ Finds the simplest dyadic given an integer. *** -# Package `COALTON-LIBRARY/MATH/ELEMENTARY` +# Package `COALTON/MATH/ELEMENTARY` ### Classes @@ -7258,7 +7258,7 @@ Computes the sine and cosine of X. *** -# Package `COALTON-LIBRARY/MATH/FRACTION` +# Package `COALTON/MATH/FRACTION` ### Values @@ -7286,7 +7286,7 @@ The numerator of a fraction. *** -# Package `COALTON-LIBRARY/MATH/HYPERDUAL` +# Package `COALTON/MATH/HYPERDUAL` An implementation of hyperdual numbers for second-order and @@ -7506,7 +7506,7 @@ Compute ∂²f/∂y²(x, y). *** -# Package `COALTON-LIBRARY/MATH/INTEGRAL` +# Package `COALTON/MATH/INTEGRAL` ### Classes @@ -7686,11 +7686,11 @@ Exponentiate BASE to a signed POWER. *** -# Package `COALTON-LIBRARY/MATH/REAL` +# Package `COALTON/MATH/REAL` ### Structs -#### Quantization :A [STRUCT] · src +#### Quantization :A [STRUCT] · src Represents an integer quantization of `:a`. @@ -7839,7 +7839,7 @@ Methods: ### Values -#### (CEILING/ A B) [FUNCTION] · src +#### (CEILING/ A B) [FUNCTION] · src (Integer → Integer → Integer) Divide two integers and compute the ceiling of the quotient. @@ -7848,7 +7848,7 @@ Divide two integers and compute the ceiling of the quotient. *** -#### (EXACT/ A B) [FUNCTION] · src +#### (EXACT/ A B) [FUNCTION] · src (Integer → Integer → Fraction) Exactly divide two integers and produce a fraction. @@ -7857,7 +7857,7 @@ Exactly divide two integers and produce a fraction. *** -#### (FLOOR/ A B) [FUNCTION] · src +#### (FLOOR/ A B) [FUNCTION] · src (Integer → Integer → Integer) Divide two integers and compute the floor of the quotient. @@ -7866,7 +7866,7 @@ Divide two integers and compute the floor of the quotient. *** -#### (FROMFRAC Q) [FUNCTION] · src +#### (FROMFRAC Q) [FUNCTION] · src ∀ :A. Dividable Integer :A ⇒ (Fraction → :A) Converts a fraction to a target type. @@ -7879,7 +7879,7 @@ This conversion may result in loss of fidelity. *** -#### (INEXACT/ A B) [FUNCTION] · src +#### (INEXACT/ A B) [FUNCTION] · src (Integer → Integer → F64) Compute the quotient of integers as a double-precision float. @@ -7890,7 +7890,7 @@ Note: This does *not* divide double-float arguments. *** -#### (QUANTIZE X) [FUNCTION] · src +#### (QUANTIZE X) [FUNCTION] · src ∀ :A. Real :A ⇒ (:A → (Quantization :A)) Given X, (QUANTIZE X) will return the least integer greater or equal to X, @@ -7910,7 +7910,7 @@ Return the nearest integer to X, with ties breaking towards even numbers. *** -#### (ROUND-HALF-DOWN X) [FUNCTION] · src +#### (ROUND-HALF-DOWN X) [FUNCTION] · src ∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer) Return the nearest integer to X, with ties breaking toward positive infinity. @@ -7919,7 +7919,7 @@ Return the nearest integer to X, with ties breaking toward positive infinity. *** -#### (ROUND-HALF-UP X) [FUNCTION] · src +#### (ROUND-HALF-UP X) [FUNCTION] · src ∀ :A. (Quantizable :A) (Num :A) ⇒ (:A → Integer) Return the nearest integer to X, with ties breaking toward positive infinity. @@ -7928,7 +7928,7 @@ Return the nearest integer to X, with ties breaking toward positive infinity. *** -#### (ROUND/ A B) [FUNCTION] · src +#### (ROUND/ A B) [FUNCTION] · src (Integer → Integer → Integer) Divide two integers and round the quotient. @@ -7937,7 +7937,7 @@ Divide two integers and round the quotient. *** -#### (SAFE/ X Y) [FUNCTION] · src +#### (SAFE/ X Y) [FUNCTION] · src ∀ :A :B. (Num :A) (Dividable :A :B) ⇒ (:A → :A → (Optional :B)) Safely divide X by Y, returning None if Y is zero. @@ -7955,7 +7955,7 @@ Returns the integer closest/equal to `x` that is within `0` and `x`. *** -# Package `COALTON-LIBRARY/MONAD/CLASSES` +# Package `COALTON/MONAD/CLASSES` ### Classes @@ -8030,7 +8030,7 @@ Methods: *** -# Package `COALTON-LIBRARY/MONAD/ENVIRONMENT` +# Package `COALTON/MONAD/ENVIRONMENT` ### Types @@ -8160,7 +8160,7 @@ Retrieve the computation environment. *** -# Package `COALTON-LIBRARY/MONAD/FREE` +# Package `COALTON/MONAD/FREE` ### Types @@ -8245,7 +8245,7 @@ References: [here](https://github.com/purescript/purescript-free/blob/v5.1.0/src *** -# Package `COALTON-LIBRARY/MONAD/FREET` +# Package `COALTON/MONAD/FREET` ### Types @@ -8317,7 +8317,7 @@ wrapped layer of the free monad transformer). *** -# Package `COALTON-LIBRARY/MONAD/IDENTITY` +# Package `COALTON/MONAD/IDENTITY` ### Types @@ -8348,7 +8348,7 @@ A bare computation. Not useful on its own, but is useful for running Monad trans *** -# Package `COALTON-LIBRARY/MONAD/OPTIONALT` +# Package `COALTON/MONAD/OPTIONALT` ### Types @@ -8389,7 +8389,7 @@ A monadic computation that returns an Optional. *** -# Package `COALTON-LIBRARY/MONAD/RESULTT` +# Package `COALTON/MONAD/RESULTT` ### Types @@ -8462,7 +8462,7 @@ Map FERR over the error value of a Result contained in M. *** -# Package `COALTON-LIBRARY/MONAD/STATE` +# Package `COALTON/MONAD/STATE` ### Types @@ -8551,7 +8551,7 @@ A StatefulComputation which returns the current state as the value. *** -# Package `COALTON-LIBRARY/MONAD/STATET` +# Package `COALTON/MONAD/STATET` ### Types @@ -8639,7 +8639,7 @@ A stateful computation which returns the current state as the value. *** -# Package `COALTON-LIBRARY/OPTIONAL` +# Package `COALTON/OPTIONAL` ### Values @@ -8670,7 +8670,7 @@ Is X Some? *** -# Package `COALTON-LIBRARY/ORDMAP` +# Package `COALTON/ORDMAP` ### Types @@ -8915,7 +8915,7 @@ A OrdMap containing no mappings. *** -# Package `COALTON-LIBRARY/ORDTREE` +# Package `COALTON/ORDTREE` ### Types @@ -9130,7 +9130,7 @@ but not in both. *** -# Package `COALTON-LIBRARY/QUEUE` +# Package `COALTON/QUEUE` ### Types @@ -9293,7 +9293,7 @@ Push `item` onto the end of `q`. *** -# Package `COALTON-LIBRARY/RANDOMACCESS` +# Package `COALTON/RANDOMACCESS` ### Classes @@ -9363,7 +9363,7 @@ Rotate the elements at indices `index1` and `index2` of the random-access storag *** -# Package `COALTON-LIBRARY/RESULT` +# Package `COALTON/RESULT` ### Values @@ -9442,7 +9442,7 @@ Convert OPT to a Result, using FAILURE value if None. *** -# Package `COALTON-LIBRARY/SEQ` +# Package `COALTON/SEQ` ### Types @@ -9544,7 +9544,7 @@ Return the number of elements in the `seq`. ### Macros -#### MAKE (&REST ELEMS) [MACRO] +#### MAKE (&REST ELEMS) [MACRO] Create a new `Seq` containing `elems`. @@ -9552,7 +9552,7 @@ Create a new `Seq` containing `elems`. *** -# Package `COALTON-LIBRARY/SLICE` +# Package `COALTON/SLICE` ### Types @@ -9650,7 +9650,7 @@ Set the element at index `idx` in `s` to `item`. *** -# Package `COALTON-LIBRARY/STRING` +# Package `COALTON/STRING` ### Values @@ -9800,7 +9800,7 @@ Returns a new string with uppercase characters. *** -# Package `COALTON-LIBRARY/SYMBOL` +# Package `COALTON/SYMBOL` An interface to Common Lisp symbols. @@ -9882,7 +9882,7 @@ Is the symbol `s` uninterned? *** -# Package `COALTON-LIBRARY/SYSTEM` +# Package `COALTON/SYSTEM` ### Types @@ -10122,7 +10122,7 @@ The number of internal time units per second. This is implementation specific. *** -# Package `COALTON-LIBRARY/TUPLE` +# Package `COALTON/TUPLE` ### Structs @@ -10243,7 +10243,7 @@ Get the second element of a tuple. *** -# Package `COALTON-LIBRARY/TYPES` +# Package `COALTON/TYPES` ### Types @@ -10413,7 +10413,7 @@ Returns the runtime representation of the type of the given value. *** -# Package `COALTON-LIBRARY/VECTOR` +# Package `COALTON/VECTOR` ### Types @@ -10744,7 +10744,7 @@ Create a new vector with `n` elements equal to `x`. ### Macros -#### MAKE (&REST ELEMENTS) [MACRO] +#### MAKE (&REST ELEMENTS) [MACRO] Construct a `Vector' containing the ELEMENTS, in the order listed.