1 -- Created on: 1993-02-09
2 -- Created by: Mireille MERCIEN
3 -- Copyright (c) 1993-1999 Matra Datavision
4 -- Copyright (c) 1999-2014 OPEN CASCADE SAS
6 -- This file is part of Open CASCADE Technology software library.
8 -- This library is free software; you can redistribute it and/or modify it under
9 -- the terms of the GNU Lesser General Public License version 2.1 as published
10 -- by the Free Software Foundation, with special exception defined in the file
11 -- OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
12 -- distribution for complete text of the license and disclaimer of any warranty.
14 -- Alternatively, this file may be used under the terms of Open CASCADE
15 -- commercial license or contractual agreement.
28 enumeration AccessMode is
34 generic class HArray1, FieldOfHArray1 ;
36 generic class HArray2, FieldOfHArray2 ;
38 generic class HSingleList;
39 ---Purpose: The private generic class SingleList represents
40 -- a sequence of 0 or more linked items.
42 generic class HDoubleList;
43 ---Purpose: A List is a sequence of zero or more items
44 -- Each item has two pointers (backward,forward)
47 generic class HSequence,SeqNode,SeqExplorer;
49 ---Purpose: Generic sequence of elements
50 -- indexed by an integer in the range 1..N.
52 generic class HQueue,QueueNode,QueueIterator;
54 ---Purpose: A queue is a sequence of items in which items
55 -- are added at one end (called the back of the queue)
56 -- and removed at the other end (calledthe front).
57 -- The Queue is empty if there are no elements.
60 generic class HSet,SetNode,SetIterator;
62 ---Purpose: A set is an unordered collection of items
63 -- We can not have duplicated items in a given set.
66 generic class HStack,StackNode,StackIterator;
68 ---Purpose: A stack is a list of items in which items are
69 -- added and removed from the same end, called the
74 ---Purpose: Definition of hash function. This class is used by Map
75 -- class and may be redefined by user.
77 generic class HDataMap,MapNode,Array,MapIterator;
79 ---Purpose: A map is a Collection of bindings
80 -- between two objects. One is considered as
81 -- the key and a hash code value must be
84 generic class HDoubleMap,
88 ---Purpose: A double map is a collection of bindings
89 -- between two objects.
90 -- It can be retrieved either by its Key or its Item;
91 -- A hash code value must be computed for both.
93 generic class HIndexedDataMap,
96 ---Purpose: The IndexedDataMap is a hashed set of objects of
97 -- Type Key, called Keys. Keys can be inserted in
98 -- the Map but not removed. The Map keeps the number
99 -- of keys called NbKeys. Each time a Key is inserted
100 -- the Map tests if this Key is already in the Map.
101 -- If it is, nothing is done. If not, NbKeys is
102 -- incremented and it's value is bound to the Key
103 -- and called the Index.
105 deferred generic class Compare ;
107 ---Purpose: Defines a comparison operator which can be used by
108 -- any ordered structure. The way to compare items
109 -- has to be described in subclasses, which inherit
110 -- from instantiations of Compare.
112 private deferred class PrivCompareOfInteger
113 instantiates Compare from PCollection(Integer);
115 private deferred class PrivCompareOfReal
116 instantiates Compare from PCollection(Real);
118 class CompareOfInteger;
122 enumeration Side is Left , Right;
124 generic class HAVLSearchTree,
129 exception IsNotRoot inherits Failure;
130 exception IsNullTree inherits Failure;
131 exception IsContained inherits Failure;
133 generic class HArbitraryTree,
140 generic class HDirectedGraph,
150 BreadthFirstIterator,
151 AdjacentVerticesIterator,
159 class HExtendedString;