| collection | The root class of the FSet functional collections hierarchy. It is a structure class. |
|---|
| bounded-set | A “bounded set” is a subset (not necessarily proper) of a specified set, called the “universe”. ... |
|---|---|
| complement-set | A “complement set” is the complement of an ordinary set. It's infinite, so it can't be enumerate... |
| interval-set | |
| wb-set | A class of functional sets represented as weight-balanced binary trees. This is the default impl... |
| closure | The transitive closure of the set over the relation. The relation may also be supplied as a func... |
|---|---|
| compare | Returns one of :less, :greater, :equal, or :unequal according as xis less than, greate... |
| complement | Returns the complement of the set. |
| convert | Converts the collection to the specified type. Some methods may take additional keyword argument... |
| count | If collection is a Lisp sequence, this simply calls cl:count. On an FSetcollection, the def... |
| count-if | If collection is a Lisp sequence, this simply calls cl:count-if. On anFSet collection, the ... |
| count-if-not | If collection is a Lisp sequence, this simply calls cl:count-if-not.On an FSet collection, t... |
| disjoint? | Returns true iff set1 and set2 have a null intersection (withoutactually constructing said i... |
| filter | Returns a new collection containing those members or pairs of collectionfor which fn returns... |
| find | If collection is a Lisp sequence, this simply calls cl:find. On an FSetcollection, the defa... |
| find-if | If collection is a Lisp sequence, this simply calls cl:find-if. On anFSet collection, the ... |
| find-if-not | If collection is a Lisp sequence, this simply calls cl:find-if-not.On an FSet collection, th... |
| image | Returns a new collection containing the result of applying fn to eachmember of collection, w... |
| intersection | Returns the intersection of the two sets/bags. The result is a bag if both arguments are bags; o... |
| multiplicity | Returns the multiplicity of x in the bag. |
| reduce | If collection is a Lisp sequence, this simply calls cl:reduce (q.v.).On an FSet collection, ... |
| set-difference | Returns the set difference of set1 and set2, i.e., the set containing every member of set1 that... |
| sort | Returns seq sorted by pred, a function of two arguments; if key issupplied, it is a functi... |
| stable-sort | Returns seq sorted by pred, a function of two arguments; if key issupplied, it is a functi... |
| subset? | Returns true iff sub is a subset of super. |
| union | Returns the union of the two sets/bags. The result is a set if both arguments are sets; otherwis... |