aboutsummaryrefslogtreecommitdiff
path: root/src/share/algebra/browse.daase
diff options
context:
space:
mode:
authordos-reis <gdr@axiomatics.org>2011-08-11 14:12:54 +0000
committerdos-reis <gdr@axiomatics.org>2011-08-11 14:12:54 +0000
commita1de530b8c7a40177f1e8c0ebf84d8e9359ef503 (patch)
tree07f84445aaca4d4eebf6ee2f8d2583fe1a058066 /src/share/algebra/browse.daase
parent7d8802bb51e5f907e661469b94bf352766d7ffde (diff)
downloadopen-axiom-a1de530b8c7a40177f1e8c0ebf84d8e9359ef503.tar.gz
* interp/define.boot (extendsCategoryBasic): Handle attribute
third argument too.
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 9fb6feef..54a96203 100644
--- a/src/share/algebra/browse.daase
+++ b/src/share/algebra/browse.daase
@@ -1,5 +1,5 @@
-(2277097 . 3521998851)
+(2277097 . 3522040293)
(-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