aboutsummaryrefslogtreecommitdiff
path: root/src/share/algebra/browse.daase
diff options
context:
space:
mode:
authordos-reis <gdr@axiomatics.org>2013-06-17 15:07:17 +0000
committerdos-reis <gdr@axiomatics.org>2013-06-17 15:07:17 +0000
commit7db3376a614a5aeacc114c38002ea65e57046dc5 (patch)
treeeb210656e993e236392080ed3fe05be391886377 /src/share/algebra/browse.daase
parentd69a5741c16f450e981b7d8f4b28c217f388890d (diff)
downloadopen-axiom-7db3376a614a5aeacc114c38002ea65e57046dc5.tar.gz
* algebra/aggcat.spad.pamphlet (EltableAggregate): Weaken
requirement on first parameter. (IndexedAggregate): Likewise.
Diffstat (limited to 'src/share/algebra/browse.daase')
-rw-r--r--src/share/algebra/browse.daase2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase
index fd6957e1..2580538e 100644
--- a/src/share/algebra/browse.daase
+++ b/src/share/algebra/browse.daase
@@ -1,5 +1,5 @@
-(1965557 . 3580441379)
+(1965557 . 3580468866)
(-18 A S)
((|constructor| (NIL "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the shallowly mutable property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result.")))
NIL