/dports/biology/seqan1/seqan-1.3.1/seqan/graph_algorithms/ |
H A D | graph_algorithm_heap_tree.h | 199 resize(mHeap.data_value, mHeap.data_heap_size + 1, Generous() ); 202 …while ((i>1) && (!(mHeap.data_predicate(value(mHeap.data_value, _parent(i)), value(mHeap.data_valu… 219 …if ((l <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, l), value… 220 …if ((r <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, r), value… 244 _insertObject(mHeap, mHeap.data_heap_size + 1, value(itBeg)); 259 value(mHeap.data_value, i) = value(mHeap.data_value, j); 283 value(mHeap.data_value, 1) = value(mHeap.data_value, mHeap.data_heap_size); 316 value(mHeap.data_value, 1) = value(mHeap.data_value, i); 421 value(mHeap.data_value, i) = value(mHeap.data_value, j); 450 mHeap.data_map.erase(mHeap.data_map.find(rootVal.i1)); [all …]
|
H A D | graph_algorithms_generated_forwards.h | 249 …pename TITEnd> inline void buildHeap(HeapTree<TValue, TPredicate, TSpec>& mHeap, TITBegin itBeg, T… 254 …e, typename TSpec> inline void clear(HeapTree<TValue, TPredicate, TSpec>& mHeap); // "seqan… 255 …e void clear(HeapTree<Pair<TKey, TValue>, TPredicate, KeyedHeap<TSpec> >& mHeap); // "seqan… 280 …ename TSpec> inline bool empty(HeapTree<TValue, TPredicate, TSpec> const& mHeap); // "seqan… 321 …TValue heapExtractRoot(HeapTree<TValue, TPredicate, KeylessHeap<TSpec> >& mHeap); // "seqan… 322 …pExtractRoot(HeapTree<Pair<TKey, TValue>, TPredicate, KeyedHeap<TSpec> >& mHeap); // "seqan… 332 …name TObject> inline void heapInsert(HeapTree<TValue, TPredicate, TSpec>& mHeap, TObject object); … 337 …pename TSpec> inline TValue heapRoot(HeapTree<TValue, TPredicate, TSpec>& mHeap); // "seqan… 338 … TSpec> inline TValue heapRoot(HeapTree<TValue, TPredicate, TSpec> const& mHeap); // "seqan… 349 … typename TSize> inline void heapify(HeapTree<TValue, TPredicate, TSpec>& mHeap, TSize i); … [all …]
|
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_algorithms/ |
H A D | graph_algorithm_heap_tree.h | 191 resize(mHeap.data_value, mHeap.data_heap_size + 1, Generous() ); 194 …while ((i>1) && (!(mHeap.data_predicate(value(mHeap.data_value, _parent(i)), value(mHeap.data_valu… 210 …if ((l <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, l), value… 211 …if ((r <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, r), value… 248 value(mHeap.data_value, i) = value(mHeap.data_value, j); 270 value(mHeap.data_value, 1) = value(mHeap.data_value, mHeap.data_heap_size); 302 value(mHeap.data_value, 1) = value(mHeap.data_value, i); 401 value(mHeap.data_value, i) = value(mHeap.data_value, j); 428 mHeap.data_map.erase(mHeap.data_map.find(rootVal.i1)); 430 value(mHeap.data_value, 1) = value(mHeap.data_value, mHeap.data_heap_size); [all …]
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_algorithms/ |
H A D | graph_algorithm_heap_tree.h | 191 resize(mHeap.data_value, mHeap.data_heap_size + 1, Generous() ); 194 …while ((i>1) && (!(mHeap.data_predicate(value(mHeap.data_value, _parent(i)), value(mHeap.data_valu… 210 …if ((l <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, l), value… 211 …if ((r <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, r), value… 248 value(mHeap.data_value, i) = value(mHeap.data_value, j); 270 value(mHeap.data_value, 1) = value(mHeap.data_value, mHeap.data_heap_size); 302 value(mHeap.data_value, 1) = value(mHeap.data_value, i); 401 value(mHeap.data_value, i) = value(mHeap.data_value, j); 428 mHeap.data_map.erase(mHeap.data_map.find(rootVal.i1)); 430 value(mHeap.data_value, 1) = value(mHeap.data_value, mHeap.data_heap_size); [all …]
|
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_algorithms/ |
H A D | graph_algorithm_heap_tree.h | 201 resize(mHeap.data_value, mHeap.data_heap_size + 1, Generous() ); 204 …while ((i>1) && (!(mHeap.data_predicate(value(mHeap.data_value, _parent(i)), value(mHeap.data_valu… 221 …if ((l <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, l), value… 222 …if ((r <= (TSize) mHeap.data_heap_size) && (mHeap.data_predicate(value(mHeap.data_value, r), value… 261 value(mHeap.data_value, i) = value(mHeap.data_value, j); 285 value(mHeap.data_value, 1) = value(mHeap.data_value, mHeap.data_heap_size); 318 value(mHeap.data_value, 1) = value(mHeap.data_value, i); 423 value(mHeap.data_value, i) = value(mHeap.data_value, j); 452 mHeap.data_map.erase(mHeap.data_map.find(rootVal.i1)); 454 value(mHeap.data_value, 1) = value(mHeap.data_value, mHeap.data_heap_size); [all …]
|
/dports/games/openjk/OpenJK-07675e2/code/qcommon/ |
H A D | MiniHeap.h | 29 char *mHeap; variable 41 if ((intptr_t)mCurrentHeap - (intptr_t)mHeap>mMaxAlloc) in ResetHeap() 43 mMaxAlloc=(intptr_t)mCurrentHeap - (intptr_t)mHeap; in ResetHeap() 46 mCurrentHeap = mHeap; in ResetHeap() 52 mHeap = (char *)Z_Malloc(size, TAG_GHOUL2, qtrue); in CMiniHeap() 57 if (mHeap) in CMiniHeap() 66 if (mHeap) in ~CMiniHeap() 75 if (size < (mSize - ((intptr_t)mCurrentHeap - (intptr_t)mHeap))) in MiniHeapAlloc()
|
/dports/games/openjk/OpenJK-07675e2/codemp/qcommon/ |
H A D | MiniHeap.h | 39 char *mHeap; 47 mCurrentHeap = mHeap; in ResetHeap() 53 mHeap = (char *)malloc(size); in CMiniHeap() 55 if (mHeap) in CMiniHeap() 64 if (mHeap) in ~CMiniHeap() 66 free(mHeap); in ~CMiniHeap() 73 if ((size_t)size < (mSize - ((size_t)mCurrentHeap - (size_t)mHeap))) in MiniHeapAlloc()
|
/dports/games/openjk/OpenJK-07675e2/code/Ratl/ |
H A D | scheduler_vs.h | 97 heap_vs<timed_event, CAPACITY> mHeap; variable 131 mHeap.clear(); in clear() 140 mHeap.push(timed_event(time, nLoc)); in add() 149 mHeap.push(timed_event(time, nLoc)); in add() 159 mHeap.push(timed_event(time, mEvents.pointer_to_index(ret))); in add_raw() 166 while (!mHeap.empty()) in update() 168 timed_event Next = mHeap.top(); in update() 173 mHeap.pop(); in update() 181 while (!mHeap.empty()) in update() 183 timed_event Next = mHeap.top(); in update() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Modifiable_priority_queue.h | 86 …Modifiable_priority_queue( size_type largest_ID, Compare const& c, ID const& id ) : mHeap(largest_… in Modifiable_priority_queue() 88 handle push ( value_type const& v ) { mHeap.push(v) ; return handle(true) ; } in push() 90 handle update ( value_type const& v, handle h ) { mHeap.update(v); return h ; } in update() 92 handle erase ( value_type const& v, handle ) { mHeap.remove(v); return null_handle() ; } in erase() 93 handle erase ( value_type const& v ) { mHeap.remove(v); return null_handle() ; } in erase() 95 value_type top() const { return mHeap.top() ; } in top() 97 void pop() { mHeap.pop(); } in pop() 99 bool empty() const { return mHeap.empty() ; } in empty() 101 bool contains ( value_type const& v ) { return mHeap.contains(v) ; } in contains() 119 Heap mHeap ;
|
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/BulletMultiThreaded/ |
H A D | HeapManager.h | 32 ATTRIBUTE_ALIGNED16(unsigned char *mHeap); 42 mHeap = buf; in HeapManager() 53 return (int)(mPoolStack[mCurStack]-mHeap); in getAllocated() 77 btAssert(bytes <=(mHeapBytes-(p-(unsigned long long )mHeap)) ); 88 btAssert(bytes <=(mHeapBytes-(p-(unsigned long)mHeap)) ); 103 mPoolStack[0] = mHeap; in clear()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/dawn/src/dawn_native/d3d12/ |
H A D | ShaderVisibleDescriptorAllocatorD3D12.cpp | 100 ASSERT(mHeap != nullptr); in AllocateGPUDescriptors() 106 ID3D12DescriptorHeap* descriptorHeap = mHeap->GetD3D12DescriptorHeap(); in AllocateGPUDescriptors() 128 return mHeap->GetD3D12DescriptorHeap(); in GetShaderVisibleHeap() 170 if (mHeap != nullptr) { in AllocateAndSwitchShaderVisibleHeap() 171 mDevice->GetResidencyManager()->UnlockAllocation(mHeap.get()); in AllocateAndSwitchShaderVisibleHeap() 178 mDevice->ReferenceUntilUnused(mHeap->GetD3D12DescriptorHeap()); in AllocateAndSwitchShaderVisibleHeap() 186 mPool.push_back({mDevice->GetPendingCommandSerial(), std::move(mHeap)}); in AllocateAndSwitchShaderVisibleHeap() 201 mHeap = std::move(descriptorHeap); in AllocateAndSwitchShaderVisibleHeap() 225 return mHeap->IsResidencyLocked(); in IsShaderVisibleHeapLockedResidentForTesting()
|
/dports/science/chrono/chrono-7.0.1/src/chrono_thirdparty/HACD/ |
H A D | hacdMicroAllocator.cpp | 267 ret = scan->mChunks[i].allocate(mHeap,mChunkSize,mMaxChunks,update); in allocate() 286 ret = mcc->mChunks[0].allocate(mHeap,mChunkSize,mMaxChunks,update); in allocate() 295 mHeap = heap; in init() 303 MicroHeap *mHeap; member in HACD::MemoryChunkChunk 320 void *ret = mCurrent->allocate(mChunks.mHeap,mChunks.mChunkSize,mChunks.mMaxChunks,update); in allocate() 374 mHeap = heap; in MyMicroAllocator() 442 mHeap->micro_free(mMicroChunks); in ~MyMicroAllocator() 468 chunk->deallocate(p,mHeap,this); in free() 569 MicroHeap * getMicroHeap(void) const { return mHeap; }; in getMicroHeap() 654 chunk->deallocate(p,mHeap,this); in inline_free() [all …]
|
/dports/emulators/qemu60/qemu-6.0.0/roms/edk2/BaseTools/Source/C/Common/ |
H A D | EfiCompress.c | 237 STATIC INT16 mHeap[NC + 1]; variable 1457 k = mHeap[i]; in DownHeap() 1459 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap() 1465 mHeap[i] = mHeap[j]; in DownHeap() 1468 mHeap[i] = (INT16)k; in DownHeap() 1544 mHeap[1] = 0; in MakeTree() 1553 return mHeap[1]; in MakeTree() 1564 i = mHeap[1]; in MakeTree() 1568 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() 1570 j = mHeap[1]; in MakeTree() [all …]
|
/dports/emulators/qemu60/qemu-6.0.0/roms/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
H A D | Compress.c | 85 STATIC INT16 mHeap[NC + 1]; variable 643 LoopVar2 = mHeap[i]; in DownHeap() 646 if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) { in DownHeap() 654 mHeap[i] = mHeap[LoopVar1]; in DownHeap() 659 mHeap[i] = (INT16) LoopVar2; in DownHeap() 796 mHeap[1] = 0; in MakeTree() 806 CodeParm[mHeap[1]] = 0; in MakeTree() 807 return mHeap[1]; in MakeTree() 819 LoopVar1 = mHeap[1]; in MakeTree() 824 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() [all …]
|
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/EdkCompatibilityPkg/Sample/Tools/Source/Common/ |
H A D | EfiCompress.c | 253 STATIC INT16 mHeap[NC + 1]; variable 1466 k = mHeap[i]; in DownHeap() 1468 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap() 1474 mHeap[i] = mHeap[j]; in DownHeap() 1477 mHeap[i] = (INT16)k; in DownHeap() 1553 mHeap[1] = 0; in MakeTree() 1562 return mHeap[1]; in MakeTree() 1573 i = mHeap[1]; in MakeTree() 1577 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() 1579 j = mHeap[1]; in MakeTree() [all …]
|
/dports/emulators/qemu42/qemu-4.2.1/roms/edk2/BaseTools/Source/C/Common/ |
H A D | EfiCompress.c | 237 STATIC INT16 mHeap[NC + 1]; variable 1457 k = mHeap[i]; in DownHeap() 1459 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap() 1465 mHeap[i] = mHeap[j]; in DownHeap() 1468 mHeap[i] = (INT16)k; in DownHeap() 1544 mHeap[1] = 0; in MakeTree() 1553 return mHeap[1]; in MakeTree() 1564 i = mHeap[1]; in MakeTree() 1568 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() 1570 j = mHeap[1]; in MakeTree() [all …]
|
/dports/emulators/qemu/qemu-6.2.0/roms/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
H A D | Compress.c | 85 STATIC INT16 mHeap[NC + 1]; variable 643 LoopVar2 = mHeap[i]; in DownHeap() 646 if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) { in DownHeap() 654 mHeap[i] = mHeap[LoopVar1]; in DownHeap() 659 mHeap[i] = (INT16) LoopVar2; in DownHeap() 796 mHeap[1] = 0; in MakeTree() 806 CodeParm[mHeap[1]] = 0; in MakeTree() 807 return mHeap[1]; in MakeTree() 819 LoopVar1 = mHeap[1]; in MakeTree() 824 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() [all …]
|
/dports/emulators/qemu/qemu-6.2.0/roms/edk2/BaseTools/Source/C/Common/ |
H A D | EfiCompress.c | 237 STATIC INT16 mHeap[NC + 1]; variable 1457 k = mHeap[i]; in DownHeap() 1459 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap() 1465 mHeap[i] = mHeap[j]; in DownHeap() 1468 mHeap[i] = (INT16)k; in DownHeap() 1544 mHeap[1] = 0; in MakeTree() 1553 return mHeap[1]; in MakeTree() 1564 i = mHeap[1]; in MakeTree() 1568 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() 1570 j = mHeap[1]; in MakeTree() [all …]
|
/dports/emulators/qemu5/qemu-5.2.0/roms/edk2/BaseTools/Source/C/Common/ |
H A D | EfiCompress.c | 237 STATIC INT16 mHeap[NC + 1]; variable 1457 k = mHeap[i]; in DownHeap() 1459 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap() 1465 mHeap[i] = mHeap[j]; in DownHeap() 1468 mHeap[i] = (INT16)k; in DownHeap() 1544 mHeap[1] = 0; in MakeTree() 1553 return mHeap[1]; in MakeTree() 1564 i = mHeap[1]; in MakeTree() 1568 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() 1570 j = mHeap[1]; in MakeTree() [all …]
|
/dports/emulators/qemu-utils/qemu-4.2.1/roms/edk2/BaseTools/Source/C/Common/ |
H A D | EfiCompress.c | 237 STATIC INT16 mHeap[NC + 1]; variable 1457 k = mHeap[i]; in DownHeap() 1459 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap() 1465 mHeap[i] = mHeap[j]; in DownHeap() 1468 mHeap[i] = (INT16)k; in DownHeap() 1544 mHeap[1] = 0; in MakeTree() 1553 return mHeap[1]; in MakeTree() 1564 i = mHeap[1]; in MakeTree() 1568 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() 1570 j = mHeap[1]; in MakeTree() [all …]
|
/dports/emulators/qemu-utils/qemu-4.2.1/roms/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
H A D | Compress.c | 85 STATIC INT16 mHeap[NC + 1]; variable 643 LoopVar2 = mHeap[i]; in DownHeap() 646 if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) { in DownHeap() 654 mHeap[i] = mHeap[LoopVar1]; in DownHeap() 659 mHeap[i] = (INT16) LoopVar2; in DownHeap() 796 mHeap[1] = 0; in MakeTree() 806 CodeParm[mHeap[1]] = 0; in MakeTree() 807 return mHeap[1]; in MakeTree() 819 LoopVar1 = mHeap[1]; in MakeTree() 824 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() [all …]
|
/dports/emulators/qemu5/qemu-5.2.0/roms/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
H A D | Compress.c | 85 STATIC INT16 mHeap[NC + 1]; variable 643 LoopVar2 = mHeap[i]; in DownHeap() 646 if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) { in DownHeap() 654 mHeap[i] = mHeap[LoopVar1]; in DownHeap() 659 mHeap[i] = (INT16) LoopVar2; in DownHeap() 796 mHeap[1] = 0; in MakeTree() 806 CodeParm[mHeap[1]] = 0; in MakeTree() 807 return mHeap[1]; in MakeTree() 819 LoopVar1 = mHeap[1]; in MakeTree() 824 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() [all …]
|
/dports/emulators/qemu42/qemu-4.2.1/roms/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
H A D | Compress.c | 85 STATIC INT16 mHeap[NC + 1]; variable 643 LoopVar2 = mHeap[i]; in DownHeap() 646 if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) { in DownHeap() 654 mHeap[i] = mHeap[LoopVar1]; in DownHeap() 659 mHeap[i] = (INT16) LoopVar2; in DownHeap() 796 mHeap[1] = 0; in MakeTree() 806 CodeParm[mHeap[1]] = 0; in MakeTree() 807 return mHeap[1]; in MakeTree() 819 LoopVar1 = mHeap[1]; in MakeTree() 824 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() [all …]
|
/dports/net/ipxe/ipxe-2265a65/src/util/ |
H A D | eficompress.c | 234 STATIC INT16 mHeap[NC + 1]; variable 1454 k = mHeap[i]; in DownHeap() 1456 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap() 1462 mHeap[i] = mHeap[j]; in DownHeap() 1465 mHeap[i] = (INT16)k; in DownHeap() 1541 mHeap[1] = 0; in MakeTree() 1550 return mHeap[1]; in MakeTree() 1561 i = mHeap[1]; in MakeTree() 1565 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() 1567 j = mHeap[1]; in MakeTree() [all …]
|
/dports/sysutils/uefi-edk2-bhyve/edk2-edk2-stable202102/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
H A D | Compress.c | 85 STATIC INT16 mHeap[NC + 1]; variable 643 LoopVar2 = mHeap[i]; in DownHeap() 646 if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) { in DownHeap() 654 mHeap[i] = mHeap[LoopVar1]; in DownHeap() 659 mHeap[i] = (INT16) LoopVar2; in DownHeap() 796 mHeap[1] = 0; in MakeTree() 806 CodeParm[mHeap[1]] = 0; in MakeTree() 807 return mHeap[1]; in MakeTree() 819 LoopVar1 = mHeap[1]; in MakeTree() 824 mHeap[1] = mHeap[mHeapSize--]; in MakeTree() [all …]
|