| /dports/security/vault/vault-1.8.2/vendor/github.com/aerospike/aerospike-client-go/ |
| H A D | connection_heap.go | 172 for i := range h.heaps {
173 h.heaps[i].cleanup()
191 for i := range heaps {
197 heaps = append(heaps, *newSingleConnectionHeap(maxSize - heapCount*perHeapSize))
203 heaps: heaps,
212 end := idx + len(h.heaps)
214 if h.heaps[i%len(h.heaps)].Offer(conn) {
227 end := idx + len(h.heaps)
229 if conn := h.heaps[i%len(h.heaps)].Poll(); conn != nil {
271 for i := range h.heaps {
[all …]
|
| /dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/debug/ |
| H A D | heap.cpp | 25 HeapCollection &heaps() { in heaps() function
27 static HeapCollection heaps; in heaps() local
29 heaps.push_back(new SysVHeap()); in heaps()
30 heaps.push_back(new GCHeap()); in heaps()
33 return heaps; in heaps()
39 return heaps().size(); in heap_count()
43 return heaps()[i]; in get_heap()
47 heaps().push_back(&heap); in register_extra_heap()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/gfx-backend-dx12/src/ |
| H A D | descriptors_cpu.rs | 132 heaps: Vec<Heap>, field
147 heaps: Vec::new(), in new()
159 let id = self.heaps.len(); in alloc_handle()
165 let heap = &mut self.heaps[heap_index]; in alloc_handle()
183 for heap in &self.heaps { in destroy()
251 heaps: Vec<HeapLinear>, field
260 heaps: vec![Self::create_heap(device)], in new()
268 for heap in self.heaps.drain(..) { in destroy()
278 for heap in self.heaps.iter_mut() { in reset()
290 if self.heaps[self.heap_index].is_full() { in alloc_handle()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/gfx-backend-dx12/src/ |
| H A D | descriptors_cpu.rs | 132 heaps: Vec<Heap>, field
147 heaps: Vec::new(), in new()
159 let id = self.heaps.len(); in alloc_handle()
165 let heap = &mut self.heaps[heap_index]; in alloc_handle()
183 for heap in &self.heaps { in destroy()
251 heaps: Vec<HeapLinear>, field
260 heaps: vec![Self::create_heap(device)], in new()
268 for heap in self.heaps.drain(..) { in destroy()
278 for heap in self.heaps.iter_mut() { in reset()
290 if self.heaps[self.heap_index].is_full() { in alloc_handle()
[all …]
|
| /dports/devel/hs-shake/shake-0.19.6/_cabal_deps/heaps-0.3.6.1/ |
| H A D | README.markdown | 1 heaps chapter
4 …heaps.svg)](https://hackage.haskell.org/package/heaps) [; in TEST()
91 EXPECT_EQ(cli_config.heaps[0].interval, 4096u); in TEST()
101 EXPECT_EQ(cli_config.heaps[0].interval, 4096u); in TEST()
112 EXPECT_STREQ(cli_config.heaps[0].name, "foo"); in TEST()
113 EXPECT_STREQ(cli_config.heaps[1].name, "bar"); in TEST()
114 EXPECT_EQ(cli_config.heaps[0].interval, 4096u); in TEST()
115 EXPECT_EQ(cli_config.heaps[1].interval, 4096u); in TEST()
127 EXPECT_STREQ(cli_config.heaps[0].name, "foo"); in TEST()
128 EXPECT_STREQ(cli_config.heaps[1].name, "bar"); in TEST()
130 EXPECT_EQ(cli_config.heaps[1].interval, 1u); in TEST()
[all …]
|
| /dports/devel/hs-hls-install/haskell-language-server-1.4.0/install/_cabal_deps/heaps-0.4/ |
| H A D | README.markdown | 1 heaps chapter
4 …heaps.svg)](https://hackage.haskell.org/package/heaps) [](https://hackage.haskell.org/package/heaps) [![Build Status](https://github.com/ekmett/…
6 This package provides Brodal/Okasaki heaps. These are asymptotically optimal purely functional heap…
|
| H A D | heaps.cabal | 1 name: heaps
8 homepage: http://github.com/ekmett/heaps/
9 bug-reports: http://github.com/ekmett/heaps/issues
11 synopsis: Asymptotically optimal Brodal/Okasaki heaps.
12 description: Asymptotically optimal Brodal\/Okasaki bootstrapped skew-binomial heaps from the pa…
36 location: git://github.com/ekmett/heaps.git
|
| /dports/devel/libhoard/Hoard/src/Heap-Layers/heaps/ |
| H A D | README | 3 top/ - "source" heaps that have no superheap.
4 combining/ - heaps whose purpose is to combine two existing superheaps.
5 debug/ - heaps whose only purpose is debugging or statistics-gathering.
6 threads/ - heaps designed to support multiple threads.
7 special/ - esoteric heaps to support custom allocation schemes like obstacks.
9 …ldingblock/ - layers that cannot be used standalone but rather are useful for building other heaps.
10 objectrep/ - heaps that change the representation of individual objects (e.g., by adding headers).
|
| /dports/games/vkquake/vkQuake-1.12.2/Quake/ |
| H A D | gl_heap.c | 191 VkDeviceSize GL_AllocateFromHeaps(int * num_heaps, glheap_t *** heaps, VkDeviceSize heap_size, uint… in GL_AllocateFromHeaps() argument
201 *heaps = realloc(*heaps, sizeof(glheap_t*) * (num_heaps_allocated + 1)); in GL_AllocateFromHeaps()
202 (*heaps)[i] = NULL; in GL_AllocateFromHeaps()
207 if(!(*heaps)[i]) in GL_AllocateFromHeaps()
209 (*heaps)[i] = GL_CreateHeap(heap_size, memory_type_index, memory_type, heap_name); in GL_AllocateFromHeaps()
215 glheapnode_t * node = GL_HeapAllocate((*heaps)[i], size, alignment, &aligned_offset); in GL_AllocateFromHeaps()
219 *heap = (*heaps)[i]; in GL_AllocateFromHeaps()
234 void GL_FreeFromHeaps(int num_heaps, glheap_t ** heaps, glheap_t * heap, glheapnode_t * heap_node, … in GL_FreeFromHeaps() argument
243 if(heaps[i] == heap) in GL_FreeFromHeaps()
244 heaps[i] = NULL; in GL_FreeFromHeaps()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/dawn/src/tests/white_box/ |
| H A D | D3D12DescriptorHeapTests.cpp | 237 EXPECT_TRUE(std::find(heaps.begin(), heaps.end(), heap) == heaps.end()); in TEST_P()
249 heaps.pop_front(); in TEST_P()
278 EXPECT_TRUE(std::find(heaps.begin(), heaps.end(), heap) == heaps.end()); in TEST_P()
279 heaps.insert(heap); in TEST_P()
309 EXPECT_TRUE(std::find(heaps.begin(), heaps.end(), heap) == heaps.end()); in TEST_P()
326 EXPECT_TRUE(std::find(heaps.begin(), heaps.end(), heap) != heaps.end()); in TEST_P()
327 heaps.erase(heap); in TEST_P()
351 EXPECT_TRUE(std::find(heaps.begin(), heaps.end(), heap) == heaps.end()); in TEST_P()
377 EXPECT_TRUE(std::find(heaps.begin(), heaps.end(), heap) == heaps.end()); in TEST_P()
402 EXPECT_TRUE(std::find(heaps.begin(), heaps.end(), heap) == heaps.end()); in TEST_P()
[all …]
|
| /dports/math/faiss/faiss-1.7.1/benchs/ |
| H A D | bench_for_interrupt.py | 92 heaps = faiss.float_maxheap_array_t()
93 heaps.k = k
94 heaps.nh = nq
95 heaps.val = faiss.swig_ptr(self.D)
96 heaps.ids = faiss.swig_ptr(self.I)
97 heaps.heapify()
98 self.heaps = heaps
104 self.heaps.addn_with_ids(
109 self.heaps.reorder()
|
| /dports/security/nmap/nmap-7.91/nsock/tests/ |
| H A D | ghheaps.c | 80 gh_heap_t heaps[HEAP_COUNT]; in ghheap_stress() local
84 gh_heap_init(&heaps[i], hnode_int_cmp); in ghheap_stress()
88 gh_heap_push(&heaps[i], mknode(num)); in ghheap_stress()
94 gh_heap_push(&heaps[i], mknode(num)); in ghheap_stress()
103 r_min = node2int(gh_heap_min(&heaps[i])); in ghheap_stress()
104 hnode = gh_heap_pop(&heaps[i]); in ghheap_stress()
124 ret = gh_heap_pop(&heaps[i]); in ghheap_stress()
132 gh_heap_free(&heaps[i]); in ghheap_stress()
|
| /dports/security/ncrack/ncrack-0.7/nsock/tests/ |
| H A D | ghheaps.c | 80 gh_heap_t heaps[HEAP_COUNT]; in ghheap_stress() local
84 gh_heap_init(&heaps[i], hnode_int_cmp); in ghheap_stress()
88 gh_heap_push(&heaps[i], mknode(num)); in ghheap_stress()
94 gh_heap_push(&heaps[i], mknode(num)); in ghheap_stress()
103 r_min = node2int(gh_heap_min(&heaps[i])); in ghheap_stress()
104 hnode = gh_heap_pop(&heaps[i]); in ghheap_stress()
124 ret = gh_heap_pop(&heaps[i]); in ghheap_stress()
132 gh_heap_free(&heaps[i]); in ghheap_stress()
|
| /dports/lang/clisp/clisp-df3b9f6fdcff22832898e89a989eb499c0f842ed/src/ |
| H A D | spvw_global_old.d | 31 Heap heaps[heapcount]; member
42 #define varobjects heaps[0] /* objects of various lengths */
179 var Heap* heapvar = &mem.heaps[heapnr]; statement; \
192 map_heap(mem.heaps[heapnr],pagevar,statement); \
218 var Heap* heapvar = &mem.heaps[heapnr]; statement; \
226 var Heap* heapvar = &mem.heaps[heapnr]; statement; \
244 map_heap(mem.heaps[heapnr],pagevar,statement); \
251 map_heap(mem.heaps[heapnr],pagevar,statement); \
258 map_heap(mem.heaps[heapnr],pagevar,statement); \
265 map_heap(mem.heaps[heapnr],pagevar,statement); \
[all …]
|
| /dports/games/kodi-addon-game.libretro.beetle-psx/game.libretro.beetle-psx-0.9.44.22-Matrix/depends/common/beetle-psx/parallel-psx/vulkan/ |
| H A D | memory_allocator.cpp | 131 auto itr = m.heaps[index].begin(); in allocate()
142 if (!m.heaps[index].begin()) in allocate()
150 if (!m.heaps[index].begin()) in allocate()
216 for (auto &h : m.heaps) in ~ClassAllocator()
249 m.heaps[index].erase(heap); in free()
250 if (!m.heaps[index].begin()) in free()
263 m.heaps[new_index].move_to_front(m.heaps[index], heap); in free()
265 if (!m.heaps[index].begin()) in free()
362 heaps.clear(); in init()
418 for (auto &heap : heaps) in ~DeviceAllocator()
[all …]
|
| /dports/games/libretro-beetle_psx/beetle-psx-libretro-3ec155d/parallel-psx/vulkan/ |
| H A D | memory_allocator.cpp | 131 auto itr = m.heaps[index].begin(); in allocate()
142 if (!m.heaps[index].begin()) in allocate()
150 if (!m.heaps[index].begin()) in allocate()
216 for (auto &h : m.heaps) in ~ClassAllocator()
249 m.heaps[index].erase(heap); in free()
250 if (!m.heaps[index].begin()) in free()
263 m.heaps[new_index].move_to_front(m.heaps[index], heap); in free()
265 if (!m.heaps[index].begin()) in free()
362 heaps.clear(); in init()
418 for (auto &heap : heaps) in ~DeviceAllocator()
[all …]
|
| /dports/games/libretro-paralleln64/parallel-n64-6e26fbb/mupen64plus-video-paraLLEl/parallel-rdp/vulkan/ |
| H A D | memory_allocator.cpp | 132 auto itr = m.heaps[index].begin(); in allocate()
143 if (!m.heaps[index].begin()) in allocate()
151 if (!m.heaps[index].begin()) in allocate()
217 for (auto &h : m.heaps) in ~ClassAllocator()
250 m.heaps[index].erase(heap); in free()
251 if (!m.heaps[index].begin()) in free()
264 m.heaps[new_index].move_to_front(m.heaps[index], heap); in free()
266 if (!m.heaps[index].begin()) in free()
362 heaps.clear(); in init()
421 for (auto &heap : heaps) in ~DeviceAllocator()
[all …]
|
| /dports/math/faiss/faiss-1.7.1/benchs/link_and_code/ |
| H A D | datasets.py | 84 heaps = faiss.float_maxheap_array_t()
85 heaps.k = k
86 heaps.nh = nq
87 heaps.val = faiss.swig_ptr(self.D)
88 heaps.ids = faiss.swig_ptr(self.I)
89 heaps.heapify()
90 self.heaps = heaps
96 self.heaps.addn_with_ids(
101 self.heaps.reorder()
|
| /dports/graphics/rx/rx-0.4.0/cargo-crates/rendy-memory-0.5.0/src/heaps/ |
| H A D | mod.rs | 61 heaps: Vec<MemoryHeap>, field
69 pub unsafe fn new<P, H>(types: P, heaps: H) -> Self in new()
74 let heaps = heaps in new() localVariable
93 assert!(heap_index < heaps.len()); in new()
97 heaps, in new()
141 .filter(|(_, mt, _)| self.heaps[mt.heap_index()].available() > size + align) in allocate()
175 let ref mut memory_heap = self.heaps[memory_type.heap_index()]; in allocate_from()
200 let ref mut memory_heap = self.heaps[memory_type.heap_index()]; in free()
217 heaps: self.heaps.iter().map(MemoryHeap::utilization).collect(), in utilization()
|
| /dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-database/src/main/java/de/lmu/ifi/dbs/elki/database/query/knn/ |
| H A D | LinearScanPrimitiveDistanceKNNQuery.java | 103 final List<KNNHeap> heaps = new ArrayList<>(size); in getKNNForBulkDBIDs() local
106 heaps.add(DBIDUtil.newHeap(k)); in getKNNForBulkDBIDs()
109 linearScanBatchKNN(objs, heaps); in getKNNForBulkDBIDs()
111 List<KNNList> result = new ArrayList<>(heaps.size()); in getKNNForBulkDBIDs()
112 for(KNNHeap heap : heaps) { in getKNNForBulkDBIDs()
124 protected void linearScanBatchKNN(List<O> objs, List<KNNHeap> heaps) { in linearScanBatchKNN() argument
132 final KNNHeap heap = heaps.get(index); in linearScanBatchKNN()
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/include/engine/ |
| H A D | routing_algorithms.hpp | 67 RoutingAlgorithms(SearchEngineData<Algorithm> &heaps, in RoutingAlgorithms() argument
69 : heaps(heaps), facade(facade) in RoutingAlgorithms()
148 SearchEngineData<Algorithm> &heaps; member in osrm::engine::RoutingAlgorithms
158 heaps, *facade, phantom_node_pair, number_of_alternatives); in AlternativePathSearch()
167 heaps, *facade, phantom_node_pair, continue_straight_at_waypoint); in ShortestPathSearch()
174 return routing_algorithms::directShortestPathSearch(heaps, *facade, phantom_nodes); in DirectShortestPathSearch()
185 return routing_algorithms::mapMatching(heaps, in MapMatching()
217 return routing_algorithms::manyToManySearch(heaps, in ManyToManySearch()
|