Home
last modified time | relevance | path

Searched refs:min_cap (Results 1 – 25 of 112) sorted by relevance

12345

/dports/math/glucose/glucose-syrup-4.1/mtl/
H A DVecThreads.h71 void capacity (int min_cap);
72 void capacityProtected (int min_cap);
165 inline void vecThreads<T>::capacityProtected(int min_cap) { in capacityProtected() argument
167 capacity(min_cap); in capacityProtected()
172 void vecThreads<T>::capacity(int min_cap) { in capacity() argument
173 if (cap >= min_cap) return; in capacity()
175 …int add = imax((min_cap - cap + 1) & ~1, ((cap >> 1) + 2) & ~1); // NOTE: grow by approximately … in capacity()
H A DAlloc.h40 void capacity(uint32_t min_cap);
97 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
99 if (cap >= min_cap) return; in capacity()
101 while (cap < min_cap){ in capacity()
/dports/lang/yap/yap-6.2.2/packages/swi-minisat2/C/
H A DVec.h39 void grow(int min_cap);
105 void vec<T>::grow(int min_cap) { in grow() argument
106 if (min_cap <= cap) return; in grow()
107 if (cap == 0) cap = (min_cap >= 2) ? min_cap : 2; in grow()
108 else do cap = (cap*3+1) >> 1; while (cap < min_cap); in grow()
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/strings/basic.string/string.capacity/
H A Dreserve.pass.cpp24 test(typename S::size_type min_cap, typename S::size_type erased_index) in test() argument
26 S s(min_cap, 'a'); in test()
29 assert(s.capacity() >= min_cap); // Check that we really have at least this capacity. in test()
/dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/test/std/strings/basic.string/string.capacity/
H A Dreserve.pass.cpp24 test(typename S::size_type min_cap, typename S::size_type erased_index) in test() argument
26 S s(min_cap, 'a'); in test()
29 assert(s.capacity() >= min_cap); // Check that we really have at least this capacity. in test()
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/strings/basic.string/string.capacity/
H A Dreserve.pass.cpp24 test(typename S::size_type min_cap, typename S::size_type erased_index) in test() argument
26 S s(min_cap, 'a'); in test()
29 assert(s.capacity() >= min_cap); // Check that we really have at least this capacity. in test()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/strings/basic.string/string.capacity/
H A Dreserve.pass.cpp24 test(typename S::size_type min_cap, typename S::size_type erased_index) in test() argument
26 S s(min_cap, 'a'); in test()
29 assert(s.capacity() >= min_cap); // Check that we really have at least this capacity. in test()
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/libcxx/test/std/strings/basic.string/string.capacity/
H A Dreserve.pass.cpp24 test(typename S::size_type min_cap, typename S::size_type erased_index) in test() argument
26 S s(min_cap, 'a'); in test()
29 assert(s.capacity() >= min_cap); // Check that we really have at least this capacity. in test()
/dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/strings/basic.string/string.capacity/
H A Dreserve.pass.cpp24 test(typename S::size_type min_cap, typename S::size_type erased_index) in test() argument
26 S s(min_cap, 'a'); in test()
29 assert(s.capacity() >= min_cap); // Check that we really have at least this capacity. in test()
/dports/cad/yosys/yosys-yosys-0.12/libs/minisat/
H A DAlloc.h40 void capacity(uint32_t min_cap);
86 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
88 if (cap >= min_cap) return; in capacity()
91 while (cap < min_cap){ in capacity()
/dports/math/cvc4/CVC4-1.7/src/prop/minisat/mtl/
H A DAlloc.h41 void capacity(uint32_t min_cap);
87 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
89 if (cap >= min_cap) return; in capacity()
92 while (cap < min_cap){ in capacity()
/dports/math/cvc4/CVC4-1.7/src/prop/bvminisat/mtl/
H A DAlloc.h41 void capacity(uint32_t min_cap);
87 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
89 if (cap >= min_cap) return; in capacity()
92 while (cap < min_cap){ in capacity()
/dports/math/minisat/minisat-2.2.1/minisat/mtl/
H A DAlloc.h40 void capacity(uint32_t min_cap);
86 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
88 if (cap >= min_cap) return; in capacity()
91 while (cap < min_cap){ in capacity()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/glucose/
H A DAlloc.h42 void capacity(uint32_t min_cap);
89 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
91 if (cap >= min_cap) return; in capacity()
94 while (cap < min_cap){ in capacity()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/bsat2/
H A DAlloc.h40 void capacity(uint32_t min_cap);
86 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
88 if (cap >= min_cap) return; in capacity()
91 while (cap < min_cap){ in capacity()
/dports/textproc/link-grammar/link-grammar-5.8.0/link-grammar/minisat/minisat/mtl/
H A DAlloc.h40 void capacity(uint32_t min_cap);
86 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
88 if (cap >= min_cap) return; in capacity()
91 while (cap < min_cap){ in capacity()
/dports/math/vampire/vampire-4.5.1/Minisat/mtl/
H A DAlloc.h45 void capacity(uint32_t min_cap);
91 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
93 if (cap >= min_cap) return; in capacity()
96 while (cap < min_cap){ in capacity()
/dports/math/ogdf/OGDF/include/ogdf/lib/minisat/mtl/
H A DAlloc.h40 void capacity(uint32_t min_cap);
90 void RegionAllocator<T>::capacity(uint32_t min_cap) in capacity() argument
92 if (cap >= min_cap) return; in capacity()
95 while (cap < min_cap) { in capacity()
/dports/www/squid/squid-4.15/src/
H A DMemBuf.cc327 MemBuf::grow(mb_size_t min_cap) in grow() argument
333 assert(capacity < min_cap); in grow()
339 if (min_cap > 64 * 1024) { in grow()
342 while (new_cap < (size_t) min_cap) in grow()
345 new_cap = (size_t) min_cap; in grow()
/dports/www/squid/squid-4.15/tools/
H A DMemBuf.cc327 MemBuf::grow(mb_size_t min_cap) in grow() argument
333 assert(capacity < min_cap); in grow()
339 if (min_cap > 64 * 1024) { in grow()
342 while (new_cap < (size_t) min_cap) in grow()
345 new_cap = (size_t) min_cap; in grow()
/dports/devel/sunpromake/schily-2021-09-18/sformat/
H A Dautopart.c51 unsigned long min_cap; member
101 dmin = default_parts[i].min_cap * 1024.0 * 1024.0;
115 default_parts[i].min_cap);
118 default_parts[i].min_cap, default_parts[i].max_cap);
/dports/devel/sccs/schily-2021-09-18/sformat/
H A Dautopart.c51 unsigned long min_cap; member
101 dmin = default_parts[i].min_cap * 1024.0 * 1024.0;
115 default_parts[i].min_cap);
118 default_parts[i].min_cap, default_parts[i].max_cap);
/dports/devel/schilybase/schily-2021-09-18/sformat/
H A Dautopart.c51 unsigned long min_cap; member
101 dmin = default_parts[i].min_cap * 1024.0 * 1024.0;
115 default_parts[i].min_cap);
118 default_parts[i].min_cap, default_parts[i].max_cap);
/dports/net/rscsi/schily-2021-09-18/sformat/
H A Dautopart.c51 unsigned long min_cap; member
101 dmin = default_parts[i].min_cap * 1024.0 * 1024.0;
115 default_parts[i].min_cap);
118 default_parts[i].min_cap, default_parts[i].max_cap);
/dports/archivers/star/schily-2021-09-18/sformat/
H A Dautopart.c51 unsigned long min_cap; member
101 dmin = default_parts[i].min_cap * 1024.0 * 1024.0;
115 default_parts[i].min_cap);
118 default_parts[i].min_cap, default_parts[i].max_cap);

12345