Index

The entries in the alphabetic index consists of selected words and symbols from the body files of this manual - these are in bold font - as well as the identifiers defined in the public interfaces of the libraries - set in regular font.
In the manual, the entries, which can be found in the index are typeset like this. This can help localizing the identifier, when the link from the index if followed - especially in the case where the browser does not scroll the line to the top, e.g. because there is less than a page of text left.
In the small table of letters and symbols below, each entry links directly to the section of the index containing entries starting with the corresponding letter or symbol.

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

A

add
append
ArrayContainer
arrayContainer
    bubbleSort
    capacity
    capacityExtend
    capacityIncrement
    capacityInitial
    clear
     copy
    delete
    doEnter
    empty
    find
    get
    has
    init
    less
    private
     put
    quickSort
    shellSort
    size
    theCellType
    theScanner
associate
at

B

back
 bubbleSort

C

capacity [2] [3]
capacityExtend
capacityIncrement
capacityInitial
cellPredicate
ClassificationSet
classificationSet
    clear
    copy
    delete
    doEnter
    has
    insert
    insertSubset
    scanUnclassified
    size
    subsets
    superSet
     theScanner
clear [2] [3] [4] [5] [6] [7] [8] [9]
Collection
collection
    delete
    diff
    insert
    sect
    symDiff
    union
concatenate
Container Libraries [2]
Container
container
    capacity
    clear
    copy
    doEnter
     element
    elementPredicate
    empty
    emptyContainer
    emptyContainerError
    equal
    find
    has
    illegalCellReference
    init
    scan
    size
    theCellType
    theScanner
copy [2] [3] [4] [5] [6] [7] [8] [9]
   [10]
cyclicList
    theCellType

D

delete [2] [3] [4] [5] [6]
deleteAfter
deleteBefore
deleteMin
Deque
deque
    back
    doEnter
    find
    front
    insertBack
    insertFront
     removeBack
    removeFront
dictionary
    associate
    clear
    copy
    disassociate
    empty
    find
    has
    hashFunction
    init
     key
    keyEqual
    lookup
    scanAssociations
    size
    storage
    theScanner
diff
disassociate
doEnter [2] [3] [4] [5] [6] [7] [8] [9]
   [10] [11] [12]

E

element
elementPredicate
empty [2] [3] [4] [5] [6] [7] [8]
emptyContainer [2]
 emptyContainerError
equal
Examples of Use of the Container Libraries
extend
 ExtensibleHashTable [2]
    extend
    rehash

F

find [2] [3] [4] [5] [6] [7] [8] [9]
 findIndexed
 front [2] [3]

G

get

H

has [2] [3] [4] [5] [6] [7] [8] [9]
   [10]
hashFunction [2]
HashTable
hashTable
    clear
    copy
    delete
    doEnter
    empty
     find
    findIndexed
    has
    hashFunction
    index
    indexValue
    init
    insert
    private
    range
     rangeInitial
    scanIndexed
    size
    statistics
    theCellType
    theIndex
    theScanner
head

I

illegalCellReference
illegalSublistException
index
indexValue
init [2] [3] [4] [5]
insert [2] [3] [4] [5] [6] [7] [8]
 insertAfter
insertBack
insertBefore
insertFront
insertSublistAfter
insertSublistBefore
 insertSubset
iterate
iterateFrom
iterateReverse
iterateReverseFrom

K

key
 keyEqual

L

last
less [2] [3]
List
list
    append
    at
    cellPredicate
    clear
    concatenate
    copy
    delete
    deleteAfter
    deleteBefore
    doEnter
     empty
    find
    has
    head
    insertAfter
    insertBefore
    iterate
    iterateFrom
    iterateReverse
    iterateReverseFrom
    last
    locate
    preample
    prepend
     private
    scanFrom
    scanReverse
    scanReverseFrom
    size
    splitAfter
    splitBefore
    tail
    theCellType
    theFromScanner
    theReverseScanner
    thescanner
locate
lookup

M

min
MultiSet
multiSet
    capacity
    clear
    copy
     delete
    doEnter
    empty
    find
    has
    insert
     private
    size
    theCellType
    theScanner

P

pop
preample
prepend
PrioQueue
prioQueue
    copy
    doEnter
    front
    insert
    remove
    scanPriority
     theCellType
    theScanner
priorityList
    add
    less
PriorityQueue
    clear
    deleteMin
    empty
    emptyContainer
    has
     init
    insert
    less
    min
    scan
    size
    storage
private [2] [3] [4] [5]
push
put

Q

Queue
queue
    copy
    doEnter
     find
    front
    has
    insert
     remove
quickSort

R

range
rangeInitial
RecList
recList
    doEnter
    illegalSublistException
     insertSublistAfter
    insertSublistBefore
    theCellType
    theFromScanner
    theReverseScanner
    theScanner
 rehash
remove [2]
removeBack
removeFront

S

scan [2]
scanAssociations
scanFrom
scanIndexed
scanPriority
scanReverse
scanReverseFrom
scanUnclassified
sect
SequentialContainer
sequentialContainer
    clear
    empty
     has
    private
    size
    theCellType
    theScanner
Set
set
    doEnter
    insert
shellSort
size [2] [3] [4] [5] [6] [7] [8] [9]
splitAfter
splitBefore
 Stack
stack
    copy
    doEnter
    find
    pop
    push
    top
statistics
storage [2]
subsets
superSet
symDiff

T

tail
theCellType [2] [3] [4] [5] [6] [7] [8] [9]
theFromScanner [2]
 theIndex
theReverseScanner [2]
theScanner [2] [3] [4] [5] [6]
 thescanner
theScanner [2] [3]
top

U

union

Container Libraries - Reference Manual: Index
 © 1992-2002 Mjølner Informatics
[Generated: Tuesday June 29th 2004 at 13:04]