From 541011621b8469cb64fa54a53c29f32f1b1bd2bd Mon Sep 17 00:00:00 2001 From: dos-reis Date: Sun, 21 Aug 2011 08:40:22 +0000 Subject: * interp/lisplib.boot (leaveIfErrors): Take kind as argument. (writeInfo): New. (writeSuperDomain): Likewise. (finalizeLisplib): Use it. Take constructor as argument. * interp/define.boot ($lisplibSuperDomain): Remove. Adjust users. ($lisplibKind): Remove Adjust users. (emitSubdomainInfo): Set dbSuperDomain. (incompleteFunctorBody): Likewise. * interp/daase.lisp: Add new database accessors. (GETDATABASE): Fix handling of superDomain property. * interp/br-util.boot (dbConstructorKind): Remove. * interp/br-con.boot: Remove deadcode. (dbShowCons1): Adjust. * interp/br-saturn.boot (dbShowConsKinds): Likewise. --- 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 c81fd57e..3cdff610 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2276906 . 3522866252) +(2276906 . 3522901376) (-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