Home
last modified time | relevance | path

Searched refs:HeapNode (Results 1 – 25 of 105) sorted by relevance

12345

/dports/graphics/blender/blender-2.91.0/extern/curve_fit_nd/intern/
H A Dgeneric_heap.h35 struct HeapNode;
37 typedef struct HeapNode HeapNode; typedef
44 void *HEAP_node_ptr(HeapNode *node);
45 void HEAP_remove(Heap *heap, HeapNode *node);
46 HeapNode *HEAP_insert(Heap *heap, double value, void *ptr);
47 void HEAP_insert_or_update(Heap *heap, HeapNode **node_p, double value, void *ptr);
51 HeapNode *HEAP_top(Heap *heap);
53 void HEAP_node_value_update(Heap *heap, HeapNode *node, double value);
54 void HEAP_node_value_update_ptr(Heap *heap, HeapNode *node, double value, void *ptr);
55 double HEAP_node_value(const HeapNode *node);
H A Dgeneric_heap.c55 struct HeapNode { struct
63 #define TPOOL_ALLOC_TYPE HeapNode argument
73 HeapNode **tree;
95 SWAP(HeapNode *, heap->tree[i], heap->tree[j]); in heap_swap()
97 HeapNode **tree = heap->tree; in heap_swap()
100 HeapNode *node; in heap_swap()
197 HeapNode *node; in HEAP_insert()
239 HeapNode *HEAP_top(Heap *heap) in HEAP_top()
265 void HEAP_remove(Heap *heap, HeapNode *node) in HEAP_remove()
299 double HEAP_node_value(const HeapNode *node) in HEAP_node_value()
[all …]
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/
H A DBLI_heap.h31 struct HeapNode;
33 typedef struct HeapNode HeapNode; typedef
41 HeapNode *BLI_heap_insert(Heap *heap, float value, void *ptr) ATTR_NONNULL(1);
42 void BLI_heap_insert_or_update(Heap *heap, HeapNode **node_p, float value, void *ptr)
44 void BLI_heap_remove(Heap *heap, HeapNode *node) ATTR_NONNULL(1, 2);
47 HeapNode *BLI_heap_top(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1);
50 void BLI_heap_node_value_update(Heap *heap, HeapNode *node, float value) ATTR_NONNULL(1, 2);
51 void BLI_heap_node_value_update_ptr(Heap *heap, HeapNode *node, float value, void *ptr)
55 float BLI_heap_node_value(const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1);
56 void *BLI_heap_node_ptr(const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1);
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
H A DUnionIterator.java44 extends MultiValuedNodeHeapIterator.HeapNode
58 public HeapNode cloneHeapNode() { in cloneHeapNode()
74 public boolean isLessThan(HeapNode heapNode) { in isLessThan()
79 public HeapNode setStartNode(int node) { in setStartNode()
84 public HeapNode reset() { in reset()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
H A DUnionIterator.java44 extends MultiValuedNodeHeapIterator.HeapNode
58 public HeapNode cloneHeapNode() { in cloneHeapNode()
74 public boolean isLessThan(HeapNode heapNode) { in isLessThan()
79 public HeapNode setStartNode(int node) { in setStartNode()
84 public HeapNode reset() { in reset()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
H A DUnionIterator.java44 extends MultiValuedNodeHeapIterator.HeapNode
58 public HeapNode cloneHeapNode() { in cloneHeapNode()
74 public boolean isLessThan(HeapNode heapNode) { in isLessThan()
79 public HeapNode setStartNode(int node) { in setStartNode()
84 public HeapNode reset() { in reset()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
H A DUnionIterator.java44 extends MultiValuedNodeHeapIterator.HeapNode
58 public HeapNode cloneHeapNode() { in cloneHeapNode()
74 public boolean isLessThan(HeapNode heapNode) { in isLessThan()
79 public HeapNode setStartNode(int node) { in setStartNode()
84 public HeapNode reset() { in reset()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
H A DUnionIterator.java44 extends MultiValuedNodeHeapIterator.HeapNode
58 public HeapNode cloneHeapNode() { in cloneHeapNode()
74 public boolean isLessThan(HeapNode heapNode) { in isLessThan()
79 public HeapNode setStartNode(int node) { in setStartNode()
84 public HeapNode reset() { in reset()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
H A DUnionIterator.java44 extends MultiValuedNodeHeapIterator.HeapNode
58 public HeapNode cloneHeapNode() { in cloneHeapNode()
74 public boolean isLessThan(HeapNode heapNode) { in isLessThan()
79 public HeapNode setStartNode(int node) { in setStartNode()
84 public HeapNode reset() { in reset()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java58 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
76 public HeapNode cloneHeapNode() { in cloneHeapNode()
77 HeapNode clone; in cloneHeapNode()
80 clone = (HeapNode) super.clone(); in cloneHeapNode()
132 public abstract HeapNode reset(); in reset()
139 private HeapNode[] _heap = new HeapNode[InitSize];
155 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
174 protected void addHeapNode(HeapNode node) { in addHeapNode()
176 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
190 final HeapNode temp = _heap[0]; in next()
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java57 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
75 public HeapNode cloneHeapNode() { in cloneHeapNode()
76 HeapNode clone; in cloneHeapNode()
79 clone = (HeapNode) super.clone(); in cloneHeapNode()
131 public abstract HeapNode reset(); in reset()
138 private HeapNode[] _heap = new HeapNode[InitSize];
154 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
173 protected void addHeapNode(HeapNode node) { in addHeapNode()
175 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
189 final HeapNode temp = _heap[0]; in next()
[all …]
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java57 public abstract class HeapNode implements Cloneable { class in MultiValuedNodeHeapIterator
75 public HeapNode cloneHeapNode() { in cloneHeapNode()
76 HeapNode clone; in cloneHeapNode()
79 clone = (HeapNode) super.clone(); in cloneHeapNode()
131 public abstract HeapNode reset(); in reset()
138 private HeapNode[] _heap = new HeapNode[InitSize];
154 final HeapNode[] heapCopy = new HeapNode[_heap.length]; in cloneIterator()
173 protected void addHeapNode(HeapNode node) { in addHeapNode()
175 HeapNode[] newArray = new HeapNode[_size *= 2]; in addHeapNode()
189 final HeapNode temp = _heap[0]; in next()
[all …]
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/intern/
H A DBLI_heap.c34 struct HeapNode { struct
44 struct HeapNode buf[0]; argument
60 HeapNode **tree;
66 HeapNode *free;
85 HeapNode **tree = heap->tree; in heap_swap()
95 HeapNode **tree = heap->tree; in heap_swap()
98 HeapNode *node; in heap_swap()
108 HeapNode **const tree = heap->tree; in heap_down()
134 HeapNode **const tree = heap->tree; in heap_up()
165 HeapNode *node; in heap_node_alloc()
[all …]
/dports/devel/pecl-swoole/swoole-4.8.5/src/core/
H A Dheap.cc52 HeapNode *child_node = nodes[child_i]; in maxchild()
60 HeapNode *moving_node = nodes[i]; in bubble_up()
75 HeapNode *moving_node = nodes[i]; in percolate_down()
87 HeapNode *Heap::push(uint64_t priority, void *data) { in push()
88 HeapNode **tmp; in push()
94 if (!(tmp = (HeapNode **) sw_realloc(nodes, sizeof(HeapNode *) * newsize))) { in push()
101 HeapNode *node = new HeapNode; in push()
110 void Heap::change_priority(uint64_t new_priority, HeapNode *node) { in change_priority()
122 void Heap::remove(HeapNode *node) { in remove()
135 HeapNode *head; in pop()
[all …]
/dports/devel/pecl-swoole/swoole-4.8.5/include/
H A Dswoole_heap.h21 struct HeapNode { struct
41 HeapNode *push(uint64_t priority, void *data); argument
43 void change_priority(uint64_t new_priority, HeapNode *ptr);
44 void remove(HeapNode *node);
49 HeapNode *top() { in top()
60 HeapNode **nodes;
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/tests/
H A DBLI_heap_test.cc82 HeapNode **nodes = (HeapNode **)MEM_mallocN(sizeof(HeapNode *) * items_total, __func__); in TEST()
146 HeapNode **nodes = (HeapNode **)MEM_mallocN(sizeof(HeapNode *) * items_total, __func__); in TEST()
166 HeapNode **nodes = (HeapNode **)MEM_mallocN(sizeof(HeapNode *) * items_total, __func__); in random_heap_reinsert_helper()
170 BLI_array_randomize(nodes, sizeof(HeapNode *), items_total, random_seed); in random_heap_reinsert_helper()
177 HeapNode *node_top = BLI_heap_top(heap); in random_heap_reinsert_helper()
/dports/net-im/tdlib/td-a53cb30e99f937cfd64e0266fa558785a184a553/tdutils/td/utils/
H A DHeap.h13 struct HeapNode { struct
40 KeyT get_key(const HeapNode *node) const { in get_key() argument
46 const HeapNode *top() const { in top()
50 HeapNode *pop() { in pop()
52 HeapNode *result = array_[0].node_; in pop()
58 void insert(KeyT key, HeapNode *node) { in insert()
64 void fix(KeyT key, HeapNode *node) { in fix()
76 void erase(HeapNode *node) { in erase()
108 HeapNode *node_;
/dports/graphics/nip2/nip2-8.7.1/src/
H A Daction.h7 int, const char *, HeapNode **, PElement *, void * );
22 int op, const char *name, HeapNode **arg, PElement *out );
24 HeapNode **arg, PElement *out );
27 BinOp bop, HeapNode **arg );
31 ActionFn afn, int nargs, HeapNode **arg, void *user );

12345