diff options
| author | dos-reis <gdr@axiomatics.org> | 2011-08-10 23:30:02 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2011-08-10 23:30:02 +0000 |
| commit | 7c7d44f1dc284e4c4e231d97023aa87ecd5f8e44 (patch) | |
| tree | db90d375dde6576789ad23ae39dc5de66b148e57 /src/share/algebra/browse.daase | |
| parent | e6b1636fe3b19b148f347f6b9f00642db83c5ddc (diff) | |
| download | open-axiom-7c7d44f1dc284e4c4e231d97023aa87ecd5f8e44.tar.gz | |
* algebra/float.spad.pamphlet (Float): Tidy.
* algebra/fortmac.spad.pamphlet (MachineInteger): Likewise.
* algebra/fspace.spad.pamphlet (FunctionSpace): Likewise.
* algebra/integer.spad.pamphlet (Integer): Likewise.
* algebra/mkfunc.spad.pamphlet (InputForm): Likewise.
* algebra/newpoly.spad.pamphlet (RecursivePolynomialCategory):
Likewise.
* input/knot.input.pamphlet: Likewise.
* input/knot2.input.pamphlet: Likewise.
* input/mult3d.input.pamphlet: Likewise.
* input/multKnot.input.pamphlet: Likewise.
* input/r21bugsbig.input.pamphlet: Likewise.
* input/tutchap2.input.pamphlet: Likewise.
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 c2b51aa4..9fb6feef 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2277097 . 3521934608) +(2277097 . 3521998851) (-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 |