From 2227d0b0e896b63b8f27ff3ba8b9fc74495a8acb Mon Sep 17 00:00:00 2001 From: dos-reis Date: Wed, 19 Oct 2011 20:57:45 +0000 Subject: * interp/postpar.boot (postNormalizeName): New. (postAtom): Use it. (postMDef): Do not generate artificial list of nils. Leave left-hand-side as written in source code. * interp/compiler.boot (compMacro): Tidy. * interp/define.boot (checkRepresentation): Likewise. * interp/parse.boot (parseMDEF): Likewise. * algebra/syntax.spad.pamphlet (MacroAst): Adjust. --- 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 8a8d280d..353527d1 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2004998 . 3527958790) +(2004998 . 3528046424) (-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