KeyedDictionary(Key, Entry)ΒΆ

aggcat.spad line 727

A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.

=: (%, %) -> Boolean if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate or Record(key: Key, entry: Entry) has SetCategory
from BasicType
~=: (%, %) -> Boolean if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate or Record(key: Key, entry: Entry) has SetCategory
from BasicType
coerce: % -> OutputForm if Record(key: Key, entry: Entry) has CoercibleTo OutputForm
from CoercibleTo OutputForm
construct: List Record(key: Key, entry: Entry) -> %
from Collection Record(key: Key, entry: Entry)
convert: % -> InputForm if Record(key: Key, entry: Entry) has ConvertibleTo InputForm
from ConvertibleTo InputForm
copy: % -> %
from Aggregate
count: (Record(key: Key, entry: Entry), %) -> NonNegativeInteger if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate
from HomogeneousAggregate Record(key: Key, entry: Entry)
dictionary: () -> %
from DictionaryOperations Record(key: Key, entry: Entry)
dictionary: List Record(key: Key, entry: Entry) -> %
from DictionaryOperations Record(key: Key, entry: Entry)
empty: () -> %
from Aggregate
empty?: % -> Boolean
from Aggregate
eq?: (%, %) -> Boolean
from Aggregate
eval: (%, Equation Record(key: Key, entry: Entry)) -> % if Record(key: Key, entry: Entry) has Evalable Record(key: Key, entry: Entry) and Record(key: Key, entry: Entry) has SetCategory
from Evalable Record(key: Key, entry: Entry)
eval: (%, List Equation Record(key: Key, entry: Entry)) -> % if Record(key: Key, entry: Entry) has Evalable Record(key: Key, entry: Entry) and Record(key: Key, entry: Entry) has SetCategory
from Evalable Record(key: Key, entry: Entry)
eval: (%, List Record(key: Key, entry: Entry), List Record(key: Key, entry: Entry)) -> % if Record(key: Key, entry: Entry) has Evalable Record(key: Key, entry: Entry) and Record(key: Key, entry: Entry) has SetCategory
from InnerEvalable(Record(key: Key, entry: Entry), Record(key: Key, entry: Entry))
eval: (%, Record(key: Key, entry: Entry), Record(key: Key, entry: Entry)) -> % if Record(key: Key, entry: Entry) has Evalable Record(key: Key, entry: Entry) and Record(key: Key, entry: Entry) has SetCategory
from InnerEvalable(Record(key: Key, entry: Entry), Record(key: Key, entry: Entry))
extract!: % -> Record(key: Key, entry: Entry)
from BagAggregate Record(key: Key, entry: Entry)
find: (Record(key: Key, entry: Entry) -> Boolean, %) -> Union(Record(key: Key, entry: Entry), failed)
from Collection Record(key: Key, entry: Entry)
hash: % -> SingleInteger if Record(key: Key, entry: Entry) has SetCategory
from SetCategory
hashUpdate!: (HashState, %) -> HashState if Record(key: Key, entry: Entry) has SetCategory
from SetCategory
insert!: (Record(key: Key, entry: Entry), %) -> %
from BagAggregate Record(key: Key, entry: Entry)
inspect: % -> Record(key: Key, entry: Entry)
from BagAggregate Record(key: Key, entry: Entry)
key?: (Key, %) -> Boolean
key?(k, t) tests if k is a key in table t.
keys: % -> List Key
keys(t) returns the list the keys in table t.
latex: % -> String if Record(key: Key, entry: Entry) has SetCategory
from SetCategory
less?: (%, NonNegativeInteger) -> Boolean
from Aggregate
map: (Record(key: Key, entry: Entry) -> Record(key: Key, entry: Entry), %) -> %
from HomogeneousAggregate Record(key: Key, entry: Entry)
member?: (Record(key: Key, entry: Entry), %) -> Boolean if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate
from HomogeneousAggregate Record(key: Key, entry: Entry)
more?: (%, NonNegativeInteger) -> Boolean
from Aggregate
reduce: ((Record(key: Key, entry: Entry), Record(key: Key, entry: Entry)) -> Record(key: Key, entry: Entry), %, Record(key: Key, entry: Entry), Record(key: Key, entry: Entry)) -> Record(key: Key, entry: Entry) if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate
from Collection Record(key: Key, entry: Entry)
remove!: (Key, %) -> Union(Entry, failed)
remove!(k, t) searches the table t for the key k removing (and return) the entry if there. If t has no such key, remove!(k,t) returns “failed”.
remove!: (Record(key: Key, entry: Entry), %) -> % if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate
from DictionaryOperations Record(key: Key, entry: Entry)
remove: (Record(key: Key, entry: Entry), %) -> % if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate
from Collection Record(key: Key, entry: Entry)
removeDuplicates: % -> % if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate
from Collection Record(key: Key, entry: Entry)
sample: %
from Aggregate
search: (Key, %) -> Union(Entry, failed)
search(k, t) searches the table t for the key k, returning the entry stored in t for key k. If t has no such key, search(k,t) returns “failed”.
size?: (%, NonNegativeInteger) -> Boolean
from Aggregate

Aggregate

BagAggregate Record(key: Key, entry: Entry)

BasicType if Record(key: Key, entry: Entry) has BasicType and % has finiteAggregate or Record(key: Key, entry: Entry) has SetCategory

CoercibleTo OutputForm if Record(key: Key, entry: Entry) has CoercibleTo OutputForm

Collection Record(key: Key, entry: Entry)

ConvertibleTo InputForm if Record(key: Key, entry: Entry) has ConvertibleTo InputForm

Dictionary Record(key: Key, entry: Entry)

DictionaryOperations Record(key: Key, entry: Entry)

Evalable Record(key: Key, entry: Entry) if Record(key: Key, entry: Entry) has Evalable Record(key: Key, entry: Entry) and Record(key: Key, entry: Entry) has SetCategory

HomogeneousAggregate Record(key: Key, entry: Entry)

InnerEvalable(Record(key: Key, entry: Entry), Record(key: Key, entry: Entry)) if Record(key: Key, entry: Entry) has Evalable Record(key: Key, entry: Entry) and Record(key: Key, entry: Entry) has SetCategory

SetCategory if Record(key: Key, entry: Entry) has SetCategory

shallowlyMutable