diff options
author | dos-reis <gdr@axiomatics.org> | 2013-05-17 10:50:48 +0000 |
---|---|---|
committer | dos-reis <gdr@axiomatics.org> | 2013-05-17 10:50:48 +0000 |
commit | a386f6c3b624936b2561b18948997837a88522ef (patch) | |
tree | bd0e2692d01e06351f4776619d2754ec1f4d85be /src/share/algebra/browse.daase | |
parent | fd52eb1ee7ab42be1fdc73d9fc91d79abd0abd25 (diff) | |
download | open-axiom-a386f6c3b624936b2561b18948997837a88522ef.tar.gz |
Update databases
Diffstat (limited to 'src/share/algebra/browse.daase')
-rw-r--r-- | src/share/algebra/browse.daase | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index 2b615b8a..c13e1d9e 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(1962788 . 3577772102) +(1962788 . 3577776433) (-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 \\spadatt{shallowlyMutable} 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 |