Home
last modified time | relevance | path

Searched refs:AVL_Tree (Results 1 – 25 of 56) sorted by relevance

123

/dports/math/asl/solvers/
H A Davltree.h22 typedef struct AVL_Tree AVL_Tree; typedef
34 extern void AVL_Tree_free(AVL_Tree**);
35 extern size_t AVL_Tree_size(AVL_Tree*);
36 extern Element *AVL_find(const Element *, AVL_Tree*);
37 extern Element *AVL_insert(const Element *, AVL_Tree*);
38 extern int AVL_visit(void*, AVL_Tree*, AVL_Visitor);
39 extern Element *AVL_delete(const Element *, AVL_Tree*);
40 extern void *AVL_setv(AVL_Tree *, void*);
55 extern Element *AVL_delnode(AVL_Tree*, AVL_Node **);
56 extern Element *AVL_first(const AVL_Tree*, AVL_Node**);
[all …]
H A Davltree.c46 AVL_Tree { struct
57 AVL_Tree* argument
61 AVL_Tree *T; in AVL_Tree_alloc2()
67 T = (AVL_Tree*)(mb + 1); in AVL_Tree_alloc2()
86 AVL_Tree_free(AVL_Tree **Tp) in AVL_Tree_free()
89 AVL_Tree *T; in AVL_Tree_free()
102 AVL_Tree_size(AVL_Tree *T) in AVL_Tree_size()
108 Node_alloc(AVL_Tree *T) in Node_alloc()
204 rebalance(AVL_Tree *T, AVL_Node *N) in rebalance()
610 AVL_Tree*
[all …]
/dports/devel/adabooch/bc-20160321/src/
H A Dbc-trees-avl_trees.ads34 type AVL_Tree is private; type
36 function "=" (L, R : AVL_Tree) return Boolean;
39 procedure Clear (T : in out AVL_Tree);
42 procedure Insert (T : in out AVL_Tree;
55 function Extent (T : AVL_Tree) return Natural;
58 function Is_Null (T : AVL_Tree) return Boolean;
75 procedure Visit (Over_The_Tree : AVL_Tree);
81 procedure Modify (Over_The_Tree : AVL_Tree);
105 procedure Initialize (T : in out AVL_Tree);
107 procedure Adjust (T : in out AVL_Tree);
[all …]
H A Dbc-containers-trees-avl.ads34 type AVL_Tree is new BC.Containers.Container with private; type
36 function "=" (L, R : AVL_Tree) return Boolean;
39 function Null_Container return AVL_Tree;
41 procedure Clear (T : in out AVL_Tree);
44 procedure Insert (T : in out AVL_Tree;
57 function Extent (T : AVL_Tree) return Natural;
60 function Is_Null (T : AVL_Tree) return Boolean;
71 procedure Access_Actual_Item (In_The_Tree : AVL_Tree;
87 procedure Visit (Over_The_Tree : AVL_Tree);
93 procedure Modify (Over_The_Tree : AVL_Tree);
[all …]
H A Dbc-support-avl_trees.ads48 type AVL_Tree is new Ada.Finalization.Controlled with record type
53 function "=" (L, R : AVL_Tree) return Boolean;
56 procedure Clear (T : in out AVL_Tree);
59 procedure Insert (T : in out AVL_Tree;
67 (T : in out AVL_Tree; Element : Item; Found : out Boolean);
72 function Extent (T : AVL_Tree) return Natural;
75 function Is_Null (T : AVL_Tree) return Boolean;
78 function Is_Member (T : AVL_Tree; Element : Item) return Boolean;
81 procedure Adjust (T : in out AVL_Tree);
83 procedure Finalize (T : in out AVL_Tree);
H A Dbc-containers-trees-avl.adb28 function "=" (L, R : AVL_Tree) return Boolean is
33 procedure Clear (T : in out AVL_Tree) is
38 procedure Insert (T : in out AVL_Tree;
51 function Extent (T : in AVL_Tree) return Natural is
56 function Is_Null (T : in AVL_Tree) return Boolean is
66 procedure Access_Actual_Item (In_The_Tree : AVL_Tree;
89 procedure Visit (Over_The_Tree : AVL_Tree) is
111 procedure Modify (Over_The_Tree : AVL_Tree) is
133 function Null_Container return AVL_Tree is
134 Empty_Container : AVL_Tree;
[all …]
H A Dbc-trees-avl_trees.adb34 procedure Search_Insert (T : in out AVL_Tree;
40 procedure Search_Delete (T : in out AVL_Tree;
56 function Search (T : AVL_Tree;
69 procedure Search_Insert (T : in out AVL_Tree;
311 procedure Search_Delete (T : in out AVL_Tree;
350 function Search (T : AVL_Tree;
391 procedure Clear (T : in out AVL_Tree) is
397 procedure Insert (T : in out AVL_Tree;
531 procedure Adjust (T : in out AVL_Tree) is
532 New_Tree : AVL_Tree;
[all …]
H A Dbc-support-avl_trees.adb34 procedure Search_Insert (T : in out AVL_Tree'Class;
40 procedure Search_Delete (T : in out AVL_Tree'Class;
56 function Search (T : AVL_Tree'Class;
62 procedure Visit (Over_The_Tree : AVL_Tree);
355 function Search (T : AVL_Tree'Class;
396 procedure Clear (T : in out AVL_Tree) is
402 procedure Insert (T : in out AVL_Tree;
446 procedure Visit (Over_The_Tree : AVL_Tree) is
467 procedure Adjust (T : in out AVL_Tree) is
468 New_Tree : AVL_Tree;
[all …]
H A Dbc-trees-avl_trees-iterators.ads27 function New_Iterator (For_The_Container : AVL_Tree) return Iterator;
39 type Container_Ptr is access all AVL_Tree;
H A Dbc-trees-avl_trees-iterators.adb27 is new System.Address_To_Access_Conversions (AVL_Tree);
29 function New_Iterator (For_The_Container : AVL_Tree) return Iterator is
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/nidr/
H A Davltree.h21 typedef struct AVL_Tree AVL_Tree; typedef
27 extern AVL_Tree *AVL_Tree_alloc(void*, AVL_Elcomp, void *(Mallocfunc)(size_t));
28 …extern AVL_Tree *AVL_Tree_alloc2(void*, AVL_Elcomp, void *(Mallocfunc)(size_t), void (*Free)(void*…
29 extern void AVL_Tree_free(AVL_Tree**);
30 extern size_t AVL_Tree_size(AVL_Tree*);
31 extern const Element *AVL_find(const Element *, AVL_Tree*);
32 extern const Element *AVL_insert(const Element *, AVL_Tree*);
33 extern int AVL_visit(void*, AVL_Tree*, AVL_Visitor);
34 extern const Element *AVL_delete(const Element *, AVL_Tree*);
35 extern void *AVL_setv(AVL_Tree *, void*);
H A Davltree.c45 AVL_Tree { struct
58 AVL_Tree* argument
62 AVL_Tree *T; in AVL_Tree_alloc2()
68 T = (AVL_Tree*)(mb + 1); in AVL_Tree_alloc2()
81 AVL_Tree*
86 AVL_Tree_free(AVL_Tree **Tp) in AVL_Tree_free()
89 AVL_Tree *T; in AVL_Tree_free()
102 Node_alloc(AVL_Tree *T) in Node_alloc()
120 AVL_find(const Element *e, AVL_Tree *T) in AVL_find()
141 AVL_setv(AVL_Tree *T, void *v) in AVL_setv()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/ampl/
H A Davltree.h21 typedef struct AVL_Tree AVL_Tree; typedef
27 extern AVL_Tree *AVL_Tree_alloc(void*, AVL_Elcomp, void *(Mallocfunc)(size_t));
28 …extern AVL_Tree *AVL_Tree_alloc2(void*, AVL_Elcomp, void *(Mallocfunc)(size_t), void (*Free)(void*…
29 extern void AVL_Tree_free(AVL_Tree**);
30 extern size_t AVL_Tree_size(AVL_Tree*);
31 extern const Element *AVL_find(const Element *, AVL_Tree*);
32 extern const Element *AVL_insert(const Element *, AVL_Tree*);
33 extern int AVL_visit(void*, AVL_Tree*, AVL_Visitor);
34 extern const Element *AVL_delete(const Element *, AVL_Tree*);
35 extern void *AVL_setv(AVL_Tree *, void*);
H A Davltree.c45 AVL_Tree { struct
58 AVL_Tree* argument
62 AVL_Tree *T; in AVL_Tree_alloc2()
68 T = (AVL_Tree*)(mb + 1); in AVL_Tree_alloc2()
81 AVL_Tree*
86 AVL_Tree_free(AVL_Tree **Tp) in AVL_Tree_free()
89 AVL_Tree *T; in AVL_Tree_free()
102 Node_alloc(AVL_Tree *T) in Node_alloc()
120 AVL_find(const Element *e, AVL_Tree *T) in AVL_find()
141 AVL_setv(AVL_Tree *T, void *v) in AVL_setv()
[all …]
H A Davldelete.c24 avl_delhelp(Node **pA, AVL_Tree *T, const Element **pE, int rt) in avl_delhelp()
106 avl_finddel(const Element *e, Node **pThis, AVL_Tree *T, const Element **found) in avl_finddel()
221 AVL_delete(const Element *e, AVL_Tree *T) in AVL_delete()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/tpl/ampl/
H A Davltree.h21 typedef struct AVL_Tree AVL_Tree; typedef
27 extern AVL_Tree *AVL_Tree_alloc(void*, AVL_Elcomp, void *(Mallocfunc)(size_t));
28 …extern AVL_Tree *AVL_Tree_alloc2(void*, AVL_Elcomp, void *(Mallocfunc)(size_t), void (*Free)(void*…
29 extern void AVL_Tree_free(AVL_Tree**);
30 extern size_t AVL_Tree_size(AVL_Tree*);
31 extern const Element *AVL_find(const Element *, AVL_Tree*);
32 extern const Element *AVL_insert(const Element *, AVL_Tree*);
33 extern int AVL_visit(void*, AVL_Tree*, AVL_Visitor);
34 extern const Element *AVL_delete(const Element *, AVL_Tree*);
35 extern void *AVL_setv(AVL_Tree *, void*);
H A Davltree.c45 AVL_Tree { struct
58 AVL_Tree* argument
62 AVL_Tree *T; in AVL_Tree_alloc2()
68 T = (AVL_Tree*)(mb + 1); in AVL_Tree_alloc2()
81 AVL_Tree*
86 AVL_Tree_free(AVL_Tree **Tp) in AVL_Tree_free()
89 AVL_Tree *T; in AVL_Tree_free()
102 Node_alloc(AVL_Tree *T) in Node_alloc()
120 AVL_find(const Element *e, AVL_Tree *T) in AVL_find()
141 AVL_setv(AVL_Tree *T, void *v) in AVL_setv()
[all …]
H A Davldelete.c24 avl_delhelp(Node **pA, AVL_Tree *T, const Element **pE, int rt) in avl_delhelp()
106 avl_finddel(const Element *e, Node **pThis, AVL_Tree *T, const Element **found) in avl_finddel()
221 AVL_delete(const Element *e, AVL_Tree *T) in AVL_delete()
/dports/cad/ghdl/ghdl-1.0.0/src/grt/
H A Dgrt-avls.adb26 function Get_Height (Tree: AVL_Tree; N : AVL_Nid) return Ghdl_I32 is
35 procedure Check_AVL (Tree : AVL_Tree; N : AVL_Nid)
76 procedure Compute_Height (Tree : in out AVL_Tree; N : AVL_Nid)
84 procedure Simple_Rotate_Right (Tree : in out AVL_Tree; N : AVL_Nid)
104 procedure Simple_Rotate_Left (Tree : in out AVL_Tree; N : AVL_Nid)
121 procedure Double_Rotate_Right (Tree : in out AVL_Tree; N : AVL_Nid)
130 procedure Double_Rotate_Left (Tree : in out AVL_Tree; N : AVL_Nid)
139 procedure Insert (Tree : in out AVL_Tree;
208 procedure Get_Node (Tree : in out AVL_Tree;
221 function Find_Node (Tree : AVL_Tree;
H A Dgrt-avls.ads63 type AVL_Tree is array (AVL_Nid range <>) of AVL_Node; type
71 procedure Get_Node (Tree : in out AVL_Tree;
76 function Find_Node (Tree : AVL_Tree;
/dports/devel/adabooch/bc-20160321/tests/
H A Dtests-avl_trees.adb47 function To_String (The_Tree : AVL_Tree) return String;
65 T : AVL_Tree;
84 T : AVL_Tree;
100 T2 : AVL_Tree := T;
108 T2 : AVL_Tree := T;
137 (The_Tree : AVL_Tree) return String is
/dports/editors/lazarus/lazarus/test/lazutils/
H A Dtestavglvltree.pas21 AVL_Tree, // the unit from FPC
97 Tree: AVL_Tree.TAVLTree;
110 Tree: AVL_Tree.TAVLTree;
111 LastAdded, Succesor: AVL_Tree.TAVLTreeNode;
184 fTreeClass:=AVL_Tree.TAVLTree;
/dports/editors/lazarus-qt5/lazarus/test/lazutils/
H A Dtestavglvltree.pas21 AVL_Tree, // the unit from FPC
97 Tree: AVL_Tree.TAVLTree;
110 Tree: AVL_Tree.TAVLTree;
111 LastAdded, Succesor: AVL_Tree.TAVLTreeNode;
184 fTreeClass:=AVL_Tree.TAVLTree;
/dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/test/lazutils/
H A Dtestavglvltree.pas21 AVL_Tree, // the unit from FPC
97 Tree: AVL_Tree.TAVLTree;
110 Tree: AVL_Tree.TAVLTree;
111 LastAdded, Succesor: AVL_Tree.TAVLTreeNode;
184 fTreeClass:=AVL_Tree.TAVLTree;
/dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/test/lazutils/
H A Dtestavglvltree.pas21 AVL_Tree, // the unit from FPC
97 Tree: AVL_Tree.TAVLTree;
110 Tree: AVL_Tree.TAVLTree;
111 LastAdded, Succesor: AVL_Tree.TAVLTreeNode;
184 fTreeClass:=AVL_Tree.TAVLTree;

123