Idris2Doc : Data.Prim.String

Data.Prim.String

(source)

Reexports

import public Control.Order
import public Control.Relation
import public Control.Relation.ReflexiveClosure
import public Control.Relation.Trichotomy
import public Data.Maybe0

Definitions

data (<) : String -> String -> Type
  Witness that `m < n === True`.

Totality: total
Visibility: export
Constructor: 
LT : (0 _ : m < n = True) -> m < n

Hints:
(0 _ : m < n = True) -> m < n
Transitive String (<)
Trichotomous String (<)

Fixity Declaration: infix operator, level 6
0 mkLT : (0 _ : m < n = True) -> m < n
  Contructor for `(<)`.

This can only be used in an erased context.

Totality: total
Visibility: export
0 runLT : m < n -> m < n = True
  Extractor for `(<)`.

This can only be used in an erased context.

Totality: total
Visibility: export
strictLT : (0 _ : m < n) -> Lazy c -> c
  We don't trust values of type `(<)` too much,
so we use this when creating magical results.

Totality: total
Visibility: export
0 (>) : String -> String -> Type
  Flipped version of `(<)`.

Totality: total
Visibility: public export
Fixity Declaration: infix operator, level 6
0 (<=) : String -> String -> Type
  `m <= n` mean that either `m < n` or `m === n` holds.

Totality: total
Visibility: public export
Fixity Declaration: infix operator, level 6
lt : (x : String) -> (y : String) -> Maybe0 (x < y)
Totality: total
Visibility: public export
lte : (x : String) -> (y : String) -> Maybe0 (x <= y)
Totality: total
Visibility: public export
comp : (m : String) -> (n : String) -> Trichotomy (<) m n
Totality: total
Visibility: export
MinString : String
  Lower bound of `String`

Totality: total
Visibility: public export
0 GTE_MinString : (m : String) -> MinString <= m
  `m >= MinString` for all `m` of type `String`.

Totality: total
Visibility: export
0 Not_LT_MinString : m < MinString -> Void
  Not value of type `String` is less than `MinString`.

Totality: total
Visibility: export