From 3f502123ea3685dc5c4ba4544cbda67c84196d13 Mon Sep 17 00:00:00 2001 From: Clay Sweetser Date: Sun, 20 Oct 2013 11:36:19 -0400 Subject: [PATCH] Added some information on sequences. --- doc/manual.txt | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) diff --git a/doc/manual.txt b/doc/manual.txt index 4351d72325..c63df03040 100644 --- a/doc/manual.txt +++ b/doc/manual.txt @@ -893,11 +893,12 @@ integers from 0 to ``len(A)-1``. An array expression may be constructed by the array constructor ``[]``. `Sequences`:idx: are similar to arrays but of dynamic length which may change -during runtime (like strings). A sequence ``S`` is always indexed by integers -from 0 to ``len(S)-1`` and its bounds are checked. Sequences can be -constructed by the array constructor ``[]`` in conjunction with the array to -sequence operator ``@``. Another way to allocate space for a sequence is to -call the built-in ``newSeq`` procedure. +during runtime (like strings). Sequences are implemented as growable arrays, +allocating pieces of memory as items are added. A sequence ``S`` is always +indexed by integers from 0 to ``len(S)-1`` and its bounds are checked. +Sequences can be constructed by the array constructor ``[]`` in conjunction +with the array to sequence operator ``@``. Another way to allocate space for a +sequence is to call the built-in ``newSeq`` procedure. A sequence may be passed to a parameter that is of type *open array*.