Next: BTree API, Previous: Persistent Object Indexing API, Up: User API Reference
Persistent sets are a simple persistent collection abstraction. They
maintain an unordered collection of objects. Unlike the normal
list-oriented sets of Lisp, persistent sets use the equivalent of
pushnew
such that only one copy of any object or value is
maintained using the serializer's equal
implementation.
Class precedence list:
pset, persistent-collection, persistent, standard-object, t
An unordered persistent collection of unique elements according to serializer equal comparison