diff options
| author | dos-reis <gdr@axiomatics.org> | 2011-08-20 23:25:37 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2011-08-20 23:25:37 +0000 |
| commit | a0601001a4a8df331cbb9b95d5c0af20405eef03 (patch) | |
| tree | 2be9e48ed72b3c1d8010cb6f8910374122530af2 /src/share/algebra/browse.daase | |
| parent | c18e433b18430e31ac9b38fef9fc0a48b4ca77da (diff) | |
| download | open-axiom-a0601001a4a8df331cbb9b95d5c0af20405eef03.tar.gz | |
* interp/sys-utility.boot (constructorDB): New.
* interp/daase.lisp (dbNiladic?): New. Use it to access niladic
property. of a constructor.
* interp/database.boot: Import daase.
(niladicContructorFromDB): Use it.
* interp/define.boot (compDefineCategory): Don't write
compilerInfo garbage.
(compDefineFunctor1): Likewise.
(compDefineCategory2): Set niladic property.
(compDefineFunctor): Likewise.
* interp/lisplib.boot (loadLib): Do not set niladic property. It
is now a side-effect of loading.
(loadLibNoUpdate): Do not check for version.
(makeConstructorAutoload): Do not set niladic property.
(initializeLisplib): Do not emit code to check version.
(mkCtorDBForm): New.
(writeNiladic?): Likewise.
(finalizeLisplib): Do not set niladic property.
* interp/patches.lisp: Remove deadcode.
* interp/sys-constants.boot (MAJOR-VERSION): Remove.
Diffstat (limited to 'src/share/algebra/browse.daase')
| -rw-r--r-- | src/share/algebra/browse.daase | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index df370548..c81fd57e 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2276906 . 3522680061) +(2276906 . 3522866252) (-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 |