|
|
|
last edited 5 years ago by Bill Page |
Edit detail for OrderedSet revision 1 of 1
| 1 | ||
|
Editor: Bill Page
Time: 2018/07/06 22:43:45 GMT+0 |
||
| Note: | ||
changed: - The class of totally ordered sets, that is, sets such that for each pair of elements <code>(a, b)</code> exactly one of the following relations holds <code>a < b or a=b or b < a</code> and the relation is transitive, i.e. <code>a < b and b < c => a < c</code>. This order should be the natural order on given structure. \begin{axiom} )sh OrderedSet \end{axiom}
The class of totally ordered sets, that is, sets such that for each pair of elements (a, b)
exactly one of the following relations holds a < b or a=b or b < a
and the relation is transitive, i.e. a < b and b < c => a < c.
This order should be the natural order on given structure.
fricas
)sh OrderedSet
OrderedSet is a category constructor Abbreviation for OrderedSet is ORDSET This constructor is exposed in this frame. ------------------------------- Operations --------------------------------
?<? : (%,%) -> Boolean ?<=? : (%, %) -> Boolean ?=? : (%, %) -> Boolean ?>? : (%, %) -> Boolean ?>=? : (%, %) -> Boolean coerce : % -> OutputForm hash : % -> SingleInteger latex : % -> String max : (%, %) -> % min : (%, %) -> % smaller? : (%, %) -> Boolean ?~=? : (%, %) -> Boolean hashUpdate! : (HashState, %) -> HashState