From 6634594622ba229e94c7fba18430a5edbb8c22bc Mon Sep 17 00:00:00 2001 From: dos-reis Date: Sun, 28 Aug 2011 02:57:57 +0000 Subject: * interp/lisplib.boot (writeInstanceCache): Remove. (finalizeLisplib): Don't call it. --- src/share/algebra/browse.daase | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/share/algebra/browse.daase') diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index 24419aa9..0e884d21 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2276906 . 3523272525) +(2276906 . 3523487209) (-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 -- cgit v1.2.3