diff options
| author | dos-reis <gdr@axiomatics.org> | 2011-08-14 03:30:48 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2011-08-14 03:30:48 +0000 |
| commit | 775f2c3cca11ab64df713afb7f35363afe5d4ce0 (patch) | |
| tree | aec69a68ef31a45f12368475b501841bada1f010 /src/share/algebra/browse.daase | |
| parent | 1734e62de427defcd090a95bc8b3b879c67d3fbf (diff) | |
| download | open-axiom-775f2c3cca11ab64df713afb7f35363afe5d4ce0.tar.gz | |
* interp/compiler.boot (compRepeatOrCollect): Set $loopKind directly.
(complainIfShadowing): Don't complain when collecting.
* algebra/contfrac.spad.pamphlet: Remove capsule-level declaration
of local variables.
* algebra/cycles.spad.pamphlet: Likewise.
* algebra/cyclotom.spad.pamphlet: Likewise.
* algebra/ddfact.spad.pamphlet: Likewise.
* algebra/fortpak.spad.pamphlet: Likewise.
* algebra/lingrob.spad.pamphlet: Likewise.
* algebra/numode.spad.pamphlet: Likewise.
* algebra/numquad.spad.pamphlet: Likewise.
* algebra/out.spad.pamphlet: Likewise.
* algebra/perman.spad.pamphlet: Likewise.
* algebra/view2D.spad.pamphlet: Likewise.
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 4250d407..9caed1a4 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2276906 . 3522243819) +(2276906 . 3522279582) (-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 |