aboutsummaryrefslogtreecommitdiff
path: root/src/share/algebra/browse.daase
diff options
context:
space:
mode:
authordos-reis <gdr@axiomatics.org>2013-05-13 01:01:50 +0000
committerdos-reis <gdr@axiomatics.org>2013-05-13 01:01:50 +0000
commite410b4f8bb671c49d0b46add881b028f47e93439 (patch)
treed9a0597a0be3995920e5d87b1ea90544a24971bd /src/share/algebra/browse.daase
parent821a49c72bd7f1f511c0644641af6faffe360906 (diff)
downloadopen-axiom-e410b4f8bb671c49d0b46add881b028f47e93439.tar.gz
* algebra/carten.spad.pamphlet (CartesianTensor): Use
PrimitiveArray in lieu of 0-based IndexedVector.
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 c97716df..111cb2bf 100644
--- a/src/share/algebra/browse.daase
+++ b/src/share/algebra/browse.daase
@@ -1,5 +1,5 @@
-(1961899 . 3577306241)
+(1961899 . 3577395494)
(-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