diff options
| author | dos-reis <gdr@axiomatics.org> | 2013-05-11 01:24:23 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2013-05-11 01:24:23 +0000 |
| commit | 157ed93b6265cbae38aa14127cdeb9c2d3048961 (patch) | |
| tree | 0a755ce00ef09931a23968937b0d3ede5d5e649d /src/share/algebra/browse.daase | |
| parent | 1570ef4a2c61066611edaf7c7e34c9dd3baec27b (diff) | |
| download | open-axiom-157ed93b6265cbae38aa14127cdeb9c2d3048961.tar.gz | |
Introduce opcodes for arrays constructions
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 a099c5fb..c98de5cc 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(1963183 . 3577141751) +(1963183 . 3577223100) (-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 |