| /dports/biology/stringtie/stringtie-2.1.1/SuperReads_RNA/global-1/jellyfish/include/jellyfish/ |
| H A D | mer_heap.hpp | 25 struct heap_item { struct
31 heap_item() : it_(0) { } in heap_item() function
32 heap_item(Iterator& iter) : key_(iter.key()), val_(iter.val()), pos_(iter.pos()), it_(&iter) { } in heap_item() argument
34 bool operator>(const heap_item& other) const { in operator >() argument
45 bool operator()(const heap_item<Key, Iterator>* i1, const heap_item<Key, Iterator>* i2) { in operator ()()
52 heap_item<Key, Iterator>* storage_; // Storage of the elements
53 heap_item<Key, Iterator>** elts_; // Pointers to storage. Create a heap of pointers
59 typedef const heap_item<Key, Iterator> *const_item_t;
71 storage_ = new heap_item<Key, Iterator>[capacity_]; in initialize()
72 elts_ = new heap_item<Key, Iterator>*[capacity_]; in initialize()
|
| H A D | sorted_dumper.hpp | 40 typedef typename heap_type::const_item_t heap_item; typedef in jellyfish::sorted_dumper
93 heap_item item = heap.head(); in start()
|
| H A D | text_dumper.hpp | 51 void write_key_value_pair(std::ostream& out, typename super::heap_item item) { in write_key_value_pair()
|
| H A D | binary_dumper.hpp | 79 void write_key_value_pair(std::ostream& out, typename super::heap_item item) { in write_key_value_pair()
|
| /dports/biology/jellyfish/jellyfish-2.3.0/include/jellyfish/ |
| H A D | mer_heap.hpp | 17 struct heap_item { struct
23 heap_item() : it_(0) { } in heap_item() argument
24 heap_item(Iterator& iter) : key_(iter.key()), val_(iter.val()), pos_(iter.pos()), it_(&iter) { } in heap_item() argument
26 bool operator>(const heap_item& other) const { in operator >() argument
37 bool operator()(const heap_item<Key, Iterator>* i1, const heap_item<Key, Iterator>* i2) { in operator ()()
44 heap_item<Key, Iterator>* storage_; // Storage of the elements
45 heap_item<Key, Iterator>** elts_; // Pointers to storage. Create a heap of pointers
51 typedef const heap_item<Key, Iterator> *const_item_t;
63 storage_ = new heap_item<Key, Iterator>[capacity_]; in initialize()
64 elts_ = new heap_item<Key, Iterator>*[capacity_]; in initialize()
|
| H A D | sorted_dumper.hpp | 32 typedef typename heap_type::const_item_t heap_item; typedef in jellyfish::sorted_dumper
85 heap_item item = heap.head(); in start()
|
| H A D | text_dumper.hpp | 43 void write_key_value_pair(std::ostream& out, typename super::heap_item item) { in write_key_value_pair()
|
| H A D | binary_dumper.hpp | 71 void write_key_value_pair(std::ostream& out, typename super::heap_item item) { in write_key_value_pair()
|
| /dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/future/graph/ |
| H A D | graph_merge.py | 36 heap_item = [wt, node, nbr, True]
37 data['heap item'] = heap_item
38 heapq.heappush(heap_list, heap_item)
102 heap_item = [wt, n1, n2, True]
103 heapq.heappush(edge_heap, heap_item)
106 data['heap item'] = heap_item
|
| /dports/net/zebra-server/idzebra-2.0.55/rset/ |
| H A D | rsmultiandor.c | 96 struct heap_item { struct
107 struct heap_item **heap; /* ptrs to the rfd */ argument
118 struct heap_item *items; /* we alloc and free them here */
135 struct heap_item *swap; in heap_swap()
195 static void heap_insert(HEAP h, struct heap_item *hi) in heap_insert()
221 h->heap = (struct heap_item**) nmem_malloc(nmem, size * sizeof(*h->heap)); in heap_create()
242 { const struct heap_item *hx = x; in compare_ands()
243 const struct heap_item *hy = y; in compare_ands()
323 p->items = (struct heap_item *) in r_open_andor()
415 struct heap_item *it; in r_read_or()
|
| /dports/net/frr7-pythontools/frr-frr-7.5.1/lib/ |
| H A D | typesafe.c | 431 int (*cmpfn)(const struct heap_item *a,
432 const struct heap_item *b),
482 newsize * sizeof(struct heap_item *)); in typesafe_heap_resize()
487 struct heap_item *item, in typesafe_heap_pushdown()
488 int (*cmpfn)(const struct heap_item *a, in typesafe_heap_pushdown()
489 const struct heap_item *b)) in typesafe_heap_pushdown()
545 struct heap_item *item, in typesafe_heap_pullup()
546 int (*cmpfn)(const struct heap_item *a, in typesafe_heap_pullup()
547 const struct heap_item *b)) in typesafe_heap_pullup()
|
| H A D | typesafe.h | 305 struct heap_item { struct
310 struct heap_item **array; argument
322 struct prefix ## _item { struct heap_item hi; };
338 const struct heap_item *b) \
354 struct heap_item *other; \
409 struct heap_item *item,
410 int (*cmpfn)(const struct heap_item *a,
411 const struct heap_item *b));
413 struct heap_item *item,
414 int (*cmpfn)(const struct heap_item *a,
[all …]
|
| /dports/net/frr7/frr-frr-7.5.1/lib/ |
| H A D | typesafe.c | 431 int (*cmpfn)(const struct heap_item *a,
432 const struct heap_item *b),
482 newsize * sizeof(struct heap_item *)); in typesafe_heap_resize()
487 struct heap_item *item, in typesafe_heap_pushdown()
488 int (*cmpfn)(const struct heap_item *a, in typesafe_heap_pushdown()
489 const struct heap_item *b)) in typesafe_heap_pushdown()
545 struct heap_item *item, in typesafe_heap_pullup()
546 int (*cmpfn)(const struct heap_item *a, in typesafe_heap_pullup()
547 const struct heap_item *b)) in typesafe_heap_pullup()
|
| H A D | typesafe.h | 305 struct heap_item { struct
310 struct heap_item **array; argument
322 struct prefix ## _item { struct heap_item hi; };
338 const struct heap_item *b) \
354 struct heap_item *other; \
409 struct heap_item *item,
410 int (*cmpfn)(const struct heap_item *a,
411 const struct heap_item *b));
413 struct heap_item *item,
414 int (*cmpfn)(const struct heap_item *a,
[all …]
|
| /dports/science/libctl/libctl-4.5.0/src/ |
| H A D | cintegrator.c | 542 typedef region heap_item; typedef
547 heap_item *items;
553 h->items = (heap_item *)realloc(h->items, sizeof(heap_item) * nalloc); in heap_resize()
572 static void heap_push(heap *h, heap_item hi) { in heap_push()
589 static heap_item heap_pop(heap *h) { in heap_pop()
590 heap_item ret; in heap_pop()
602 heap_item swap; in heap_pop()
|
| H A D | integrator.c | 528 typedef region heap_item; typedef
533 heap_item *items;
539 h->items = (heap_item *)realloc(h->items, sizeof(heap_item) * nalloc); in heap_resize()
558 static void heap_push(heap *h, heap_item hi) { in heap_push()
575 static heap_item heap_pop(heap *h) { in heap_pop()
576 heap_item ret; in heap_pop()
588 heap_item swap; in heap_pop()
|
| /dports/biology/stringtie/stringtie-2.1.1/SuperReads_RNA/global-1/jellyfish/jellyfish/ |
| H A D | merge_files.cc | 57 typedef typename heap_type::const_item_t heap_item; in do_merge() typedef
66 heap_item head = heap.head(); in do_merge()
|
| /dports/biology/jellyfish/jellyfish-2.3.0/jellyfish/ |
| H A D | merge_files.cc | 49 typedef typename heap_type::const_item_t heap_item; in do_merge() typedef
60 heap_item head = heap.head(); in do_merge()
|
| /dports/devel/sobjectizer/sobjectizer-v.5.7.2.5/dev/so_5/3rd_party/timertt/ |
| H A D | all.hpp | 2725 auto parent = heap_item( timer->m_position / 2 ); in heap_add()
2760 heap_item( left_index )->m_when <= in heap_remove()
2761 heap_item( min_index )->m_when ) in heap_remove()
2765 heap_item( right_index )->m_when <= in heap_remove()
2766 heap_item( min_index )->m_when ) in heap_remove()
2770 heap_swap( last_item, heap_item( min_index ) ); in heap_remove()
2793 heap_item( std::size_t position ) const in heap_item() function in timertt::details::timer_heap_engine
|
| /dports/science/py-avogadrolibs/avogadrolibs-1.94.0/avogadro/qtplugins/qtaim/ |
| H A D | qtaimcubature.cpp | 841 typedef region heap_item; typedef
847 heap_item* items;
855 h->items = (heap_item*)realloc(h->items, sizeof(heap_item) * nalloc); in heap_resize()
884 static int heap_push(heap* h, heap_item hi) in heap_push()
911 static int heap_push_many(heap* h, unsigned int ni, heap_item* hi) in heap_push_many()
920 static heap_item heap_pop(heap* h) in heap_pop()
922 heap_item ret; in heap_pop()
934 heap_item swap; in heap_pop()
|
| /dports/science/avogadrolibs/avogadrolibs-1.94.0/avogadro/qtplugins/qtaim/ |
| H A D | qtaimcubature.cpp | 841 typedef region heap_item; typedef
847 heap_item* items;
855 h->items = (heap_item*)realloc(h->items, sizeof(heap_item) * nalloc); in heap_resize()
884 static int heap_push(heap* h, heap_item hi) in heap_push()
911 static int heap_push_many(heap* h, unsigned int ni, heap_item* hi) in heap_push_many()
920 static heap_item heap_pop(heap* h) in heap_pop()
922 heap_item ret; in heap_pop()
934 heap_item swap; in heap_pop()
|
| /dports/games/abstreet/fast_paths-192ae1997f9857791826ac5ed16892b2f692920c/src/ |
| H A D | dijkstra.rs | 24 use crate::heap_item::HeapItem;
|
| H A D | lib.rs | 42 mod heap_item; module
|
| H A D | path_calculator.rs | 28 use crate::heap_item::HeapItem;
|