Home
last modified time | relevance | path

Searched refs:_buckets (Results 1 – 25 of 359) sorted by relevance

12345678910>>...15

/dports/graphics/opencv/opencv-4.5.3/contrib/modules/wechat_qrcode/src/zxing/common/binarizer/
H A Dglobal_histogram_binarizer.cpp65 int numBuckets = _buckets->size(); in estimateBlackPoint()
70 if (_buckets[x] > firstPeakSize) { in estimateBlackPoint()
72 firstPeakSize = _buckets[x]; in estimateBlackPoint()
74 if (_buckets[x] > maxBucketCount) { in estimateBlackPoint()
75 maxBucketCount = _buckets[x]; in estimateBlackPoint()
142 if (_buckets[i] < _buckets[i + 1] && _buckets[i] < _buckets[i + 2] && in estimateBlackPoint2()
143 _buckets[i] < _buckets[i - 1] && _buckets[i] < _buckets[i - 2]) { in estimateBlackPoint2()
145 } else if (_buckets[i] > _buckets[i + 1] && _buckets[i] > _buckets[i + 2] && in estimateBlackPoint2()
146 _buckets[i] > _buckets[i - 1] && _buckets[i] > _buckets[i - 2]) { in estimateBlackPoint2()
148 if (_buckets[i] > maxValue) { in estimateBlackPoint2()
[all …]
/dports/devel/poco/poco-1.10.1-all/Foundation/include/Poco/
H A DLinearHashTable.h243 _buckets.push_back(Bucket());
247 _buckets(table._buckets), in LinearHashTable()
272 swap(_buckets, table._buckets); in swap()
296 return ConstIterator(_buckets.end(), _buckets.end(), _buckets.front().end()); in end()
317 return Iterator(_buckets.end(), _buckets.end(), _buckets.front().end()); in end()
420 return _buckets.size(); in buckets()
450 _buckets.push_back(tmp); in split()
451 _buckets[_split].swap(tmp); in split()
471 tmp.swap(_buckets.back()); in merge()
472 _buckets.pop_back(); in merge()
[all …]
/dports/devel/qtcreator/qt-creator-opensource-src-5.0.3/src/libs/3rdparty/cplusplus/
H A DLiteralTable.h40 _buckets(nullptr), in LiteralTable()
59 if (_buckets) in reset()
60 std::free(_buckets); in reset()
63 _buckets = nullptr; in reset()
86 if (_buckets) { in findLiteral()
100 if (_buckets) { in findOrInsertLiteral()
127 _buckets[h] = literal; in findOrInsertLiteral()
136 if (_buckets) in rehash()
137 std::free(_buckets); in rehash()
153 _buckets[h] = literal; in rehash()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Runtime.Extensions/src/System/Collections/
H A DHashtable.cs138 private bucket[] _buckets; field in System.Collections.Hashtable
447 _buckets[i].key = null; in Clear()
448 _buckets[i].val = null; in Clear()
462 bucket[] lbuckets = _buckets; in Clone()
536 … if (_buckets[i].key != null && _buckets[i].key != _buckets && _buckets[i].val == null) in ContainsValue()
737 rehash(_buckets.Length); in rehash()
774 _buckets = newBuckets; in rehash()
927 …(_buckets[bucketNumber].key == _buckets && ((_buckets[bucketNumber].hash_coll & unchecked(0x800000… in Insert()
1051 b = _buckets[bn]; in Remove()
1060 _buckets[bn].key = _buckets; in Remove()
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/libphobos/libdruntime/core/internal/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
96 if (_buckets.length) in HashTab()
113 foreach (p; _buckets) in HashTab()
134 if (!_buckets.length) in HashTab()
135 _buckets.length = 4; in HashTab()
142 _buckets[hash] = p; in HashTab()
164 assert(_buckets.length); in HashTab()
216 _buckets.length = ncnt; in HashTab()
[all …]
/dports/lang/gcc10/gcc-10.3.0/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/lang/gcc11/gcc-11.2.0/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets)
41 _buckets.reset();
62 auto pp = &_buckets[hash];
95 if (_buckets.length)
112 foreach (p; _buckets)
133 if (!_buckets.length)
134 _buckets.length = 4;
141 _buckets[hash] = p;
163 assert(_buckets.length);
215 _buckets.length = ncnt;
[all …]
/dports/lang/gcc9/gcc-9.4.0/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libphobos/libdruntime/rt/util/container/
H A Dhashtab.d31 foreach (p; _buckets) in HashTab()
41 _buckets.reset(); in HashTab()
62 auto pp = &_buckets[hash]; in HashTab()
95 if (_buckets.length) in HashTab()
112 foreach (p; _buckets) in HashTab()
133 if (!_buckets.length) in HashTab()
134 _buckets.length = 4; in HashTab()
141 _buckets[hash] = p; in HashTab()
163 assert(_buckets.length); in HashTab()
215 _buckets.length = ncnt; in HashTab()
[all …]
/dports/net/ipsumdump/ipsumdump-1.86/libclick-2.1/include/click/
H A Dhashmap.cc36 _buckets[i] = 0; in initialize()
163 _buckets[b] = e; in find_pair()
236 _buckets[b] = e; in insert()
283 _buckets[b] = e; in find_pair_force()
302 _buckets[i] = 0; in clear()
316 t_elts = _buckets; _buckets = o._buckets; o._buckets = t_elts; in swap()
403 _buckets[i] = 0; in initialize()
527 _buckets[b] = e; in find_pair()
600 _buckets[b] = e; in insert()
646 _buckets[b] = e; in find_pair_force()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Private.Xml.Linq/src/System/Xml/Linq/
H A DXHashtable.cs160 _buckets = new int[capacity]; in XHashtableState()
174 if (_numEntries < _buckets.Length) in Resize()
183 int entryIdx = _buckets[bucketIdx]; in Resize()
213 if (newSize < _buckets.Length / 2) in Resize()
215 newSize = _buckets.Length; in Resize()
219 newSize = _buckets.Length * 2; in Resize()
233 int entryIdx = _buckets[bucketIdx]; in Resize()
297 if (newEntry < 0 || newEntry >= _buckets.Length) in TryAdd()
322 …entryIndex = Interlocked.CompareExchange(ref _buckets[hashCode & (_buckets.Length - 1)], newEntry,… in TryAdd()
357 currentIndex = _buckets[hashCode & (_buckets.Length - 1)]; in FindEntry()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corert/src/Common/src/System/Collections/Concurrent/
H A DConcurrentUnifierW.cs164 _buckets = new int[_initialCapacity]; in Container()
166 _buckets[i] = -1; in Container()
174 _buckets = buckets; in Container()
185 int i = Volatile.Read(ref _buckets[bucket]); in TryGetValue()
214 int idx = _buckets[bucket]; in Add()
240 _entries[newEntryIdx]._next = _buckets[bucket]; in Add()
246 Volatile.Write(ref _buckets[bucket], newEntryIdx); in Add()
281 newSize = _buckets.Length; in Resize()
287 newSize = _buckets.Length + 3; in Resize()
351 int walk1 = _buckets[bucket]; in VerifyUnifierConsistency()
[all …]
H A DConcurrentUnifierWKeyed.cs181 _buckets = new int[_initialCapacity]; in Container()
183 _buckets[i] = -1; in Container()
191 _buckets = buckets; in Container()
201 int bucket = ComputeBucket(hashCode, _buckets.Length); in TryGetValue()
202 int i = Volatile.Read(ref _buckets[bucket]); in TryGetValue()
230 _entries[newEntryIdx]._next = _buckets[bucket]; in Add()
236 Volatile.Write(ref _buckets[bucket], newEntryIdx); in Add()
271 newSize = _buckets.Length; in Resize()
277 newSize = _buckets.Length + 3; in Resize()
340 int walk1 = _buckets[bucket]; in VerifyUnifierConsistency()
[all …]
H A DConcurrentUnifier.cs137 _buckets = new int[_initialCapacity]; in Container()
139 _buckets[i] = -1; in Container()
147 _buckets = buckets; in Container()
157 int bucket = ComputeBucket(hashCode, _buckets.Length); in TryGetValue()
158 int i = Volatile.Read(ref _buckets[bucket]); in TryGetValue()
177 int bucket = ComputeBucket(hashCode, _buckets.Length); in Add()
183 _entries[newEntryIdx]._next = _buckets[bucket]; in Add()
189 Volatile.Write(ref _buckets[bucket], newEntryIdx); in Add()
209 newSize = _buckets.Length + 3; in Resize()
267 int walk1 = _buckets[bucket]; in VerifyUnifierConsistency()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections/src/System/Collections/Generic/
H A DHashSet.cs74 private int[] _buckets; field in System.Collections.Generic.HashSet
177 _buckets = (int[])source._buckets.Clone(); in CopyFrom()
245 Array.Clear(_buckets, 0, _buckets.Length); in Clear()
260 if (_buckets != null) in Contains()
264 for (int i = _buckets[hashCode % _buckets.Length] - 1; i >= 0; i = _slots[i].next) in Contains()
293 if (_buckets != null) in Remove()
386 info.AddValue(CapacityName, _buckets == null ? 0 : _buckets.Length); in GetObjectData()
388 if (_buckets != null) in GetObjectData()
434 _buckets = null; in OnDeserialization()
470 if (_buckets != null) in TryGetValue()
[all …]
/dports/math/vampire/vampire-4.5.1/Lib/
H A DBucketSorter.hpp56 _buckets=static_cast<Stack<T>*>(ALLOC_KNOWN(_bucketCnt*sizeof(Stack<T>), "BucketSorter")); in BucketSorter()
58 new (&_buckets[i]) Stack<T>(8); in BucketSorter()
68 _buckets[i].~Stack<T>(); in ~BucketSorter()
70 DEALLOC_KNOWN(_buckets, _bucketCnt*sizeof(Stack<T>), "BucketSorter"); in ~BucketSorter()
83 _buckets[i].push(obj); in insert()
96 T res=_buckets[_minOccupied].pop(); in pop()
97 if(_buckets[_minOccupied].isEmpty()) { in pop()
99 while(_buckets[++_minOccupied].isEmpty()) {}; in pop()
111 Stack<T>* _buckets; member in Lib::BucketSorter
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/circuits/
H A D_bucket_priority_queue.py52 self._buckets: List[List[TItem]] = []
74 for i, bucket in enumerate(self._buckets):
100 if not self._buckets:
101 self._buckets.append([item])
111 self._buckets[:0] = [[] for _ in range(-i)]
116 while i >= len(self._buckets):
117 self._buckets.append([])
120 self._buckets[i].append(item)
139 while self._buckets and not self._buckets[0]:
140 self._buckets.pop(0)
[all …]
/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/circuits/
H A D_bucket_priority_queue.py52 self._buckets: List[List[TItem]] = []
74 for i, bucket in enumerate(self._buckets):
100 if not self._buckets:
101 self._buckets.append([item])
111 self._buckets[:0] = [[] for _ in range(-i)]
116 while i >= len(self._buckets):
117 self._buckets.append([])
120 self._buckets[i].append(item)
139 while self._buckets and not self._buckets[0]:
140 self._buckets.pop(0)
[all …]
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/circuits/
H A D_bucket_priority_queue.py52 self._buckets: List[List[TItem]] = []
74 for i, bucket in enumerate(self._buckets):
100 if not self._buckets:
101 self._buckets.append([item])
111 self._buckets[:0] = [[] for _ in range(-i)]
116 while i >= len(self._buckets):
117 self._buckets.append([])
120 self._buckets[i].append(item)
139 while self._buckets and not self._buckets[0]:
140 self._buckets.pop(0)
[all …]
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/circuits/
H A D_bucket_priority_queue.py52 self._buckets: List[List[TItem]] = []
74 for i, bucket in enumerate(self._buckets):
100 if not self._buckets:
101 self._buckets.append([item])
111 self._buckets[:0] = [[] for _ in range(-i)]
116 while i >= len(self._buckets):
117 self._buckets.append([])
120 self._buckets[i].append(item)
139 while self._buckets and not self._buckets[0]:
140 self._buckets.pop(0)
[all …]

12345678910>>...15