diff options
| author | dos-reis <gdr@axiomatics.org> | 2013-05-18 06:14:27 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2013-05-18 06:14:27 +0000 |
| commit | 979b28507f84eff5c739879f4b15e595eeab00f9 (patch) | |
| tree | 4fb4f1ee6472e1ef7290264c83dde41d21031b67 /src/algebra/sets.spad.pamphlet | |
| parent | a6ba684e87ea28ea0a5ad8746a15d3575eb5c8f9 (diff) | |
| download | open-axiom-979b28507f84eff5c739879f4b15e595eeab00f9.tar.gz | |
Define members, not parts
Diffstat (limited to 'src/algebra/sets.spad.pamphlet')
| -rw-r--r-- | src/algebra/sets.spad.pamphlet | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/algebra/sets.spad.pamphlet b/src/algebra/sets.spad.pamphlet index 6e57f8e4..e467aa7b 100644 --- a/src/algebra/sets.spad.pamphlet +++ b/src/algebra/sets.spad.pamphlet @@ -30,7 +30,7 @@ ++ a set and the usual operations such as union and intersection are available ++ to form new sets. ++ In our implementation, \Language{} maintains the entries in -++ sorted order. Specifically, the parts function returns the entries +++ sorted order. Specifically, the members function returns the entries ++ as a list in ascending order and ++ the extract operation returns the maximum entry. ++ Given two sets s and t where \spad{#s = m} and \spad{#t = n}, @@ -47,7 +47,7 @@ Set(S:SetCategory): FiniteSetAggregate S == add set() == empty() empty() == empty()$Rep copy s == copy(s)$Rep - parts s == parts(s)$Rep + members s == members(s)$Rep inspect s == (empty? s => error "Empty set"; s(maxIndex s)) extract! s == @@ -72,7 +72,7 @@ Set(S:SetCategory): FiniteSetAggregate S == add if S has ConvertibleTo InputForm then convert(x:%):InputForm == convert [convert('set)@InputForm, - convert(parts x)@InputForm] + convert(members x)@InputForm] if S has OrderedSet then s = t == s =$Rep t |