/dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/s/ |
H A D | merge_chunks_command.cpp | 61 const BSONObj& minKey, in checkMetadataForSuccess() argument 73 if (!metadataAfterMerge->getNextChunk(minKey, &chunk)) { in checkMetadataForSuccess() 82 const BSONObj& minKey, in mergeChunks() argument 145 if (!metadata->isValidKey(minKey) || !metadata->isValidKey(maxKey)) { in mergeChunks() 161 chunkBoundaries.push_back(minKey); in mergeChunks() 164 itChunk.setMin(minKey); in mergeChunks() 165 itChunk.setMax(minKey); in mergeChunks() 218 bool validRangeStartKey = firstDocMin.woCompare(minKey) == 0; in mergeChunks() 303 checkMetadataForSuccess(opCtx, nss, minKey, maxKey)) { in mergeChunks() 392 BSONObj minKey = bounds[0]; in errmsgRun() local [all …]
|
H A D | split_vector.cpp | 98 BSONObj minKey = Helpers::toKeyFormat(kp.extendRangeBound(min, false)); in splitVector() local 140 log() << "request split points lookup for chunk " << nss.toString() << " " << redact(minKey) in splitVector() 169 minKey, in splitVector() 189 minKey, in splitVector() 206 << " - range " << redact(minKey) << " -->> " << redact(maxKey) in splitVector() 241 << ") before the end of chunk " << nss.toString() << " " << redact(minKey) in splitVector() 270 minKey, in splitVector()
|
/dports/databases/pecl-mongodb/mongodb-1.9.1/tests/bson/ |
H A D | bson-minkey-clone-001.phpt | 8 $minKey = new MongoDB\BSON\MinKey; 9 $minKey->foo = 'bar'; 11 $clone = clone $minKey; 13 var_dump($clone == $minKey); 14 var_dump($clone === $minKey);
|
H A D | bson-minkey-001.phpt | 25 Test#0 { "min" : { "$minKey" : 1 } } 26 string(29) "{ "min" : { "$minKey" : 1 } }" 27 string(29) "{ "min" : { "$minKey" : 1 } }"
|
/dports/graphics/wdune/wdune-1.926/src/ |
H A D | MeshMorphingNode.cpp | 193 float minKey = 0; in addCoordinateInterpolator() local 198 minKey = info.interpolator[i]->getKey(j); in addCoordinateInterpolator() 201 minKey = info.interpolator[i]->getKey(j); in addCoordinateInterpolator() 204 keys.append(minKey); in addCoordinateInterpolator() 205 currentKey = minKey; in addCoordinateInterpolator() 376 float minKey = 0; in getMinBoundingBox() local 387 keys.append(minKey); in getMinBoundingBox() 388 currentKey = minKey; in getMinBoundingBox() 471 float minKey = 0; in getMaxBoundingBox() local 482 keys.append(minKey); in getMaxBoundingBox() [all …]
|
/dports/math/combblas/CombBLAS_beta_16_2/include/CombBLAS/SequenceHeaps/ |
H A D | heap4.h | 84 Key minKey, otherKey; in deleteMinBasic() local 100 minKey = data[succ].key; in deleteMinBasic() 107 if (otherKey < minKey) { minKey = otherKey; delta = 1; } in deleteMinBasic() 109 if (otherKey < minKey) { minKey = otherKey; delta = 2; } in deleteMinBasic() 111 if (otherKey < minKey) { minKey = otherKey; delta = 3; } in deleteMinBasic() 116 data[hole].key = minKey; in deleteMinBasic()
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/s/commands/ |
H A D | cluster_merge_chunks_cmd.cpp | 129 BSONObj minKey = bounds[0]; in errmsgRun() local 132 if (minKey.isEmpty()) { in errmsgRun() 142 if (!cm->getShardKeyPattern().isShardKey(minKey) || in errmsgRun() 145 << "[" << minKey << "," << maxKey << ")" in errmsgRun() 151 minKey = cm->getShardKeyPattern().normalizeShardKey(minKey); in errmsgRun() 154 const auto firstChunk = cm->findIntersectingChunkWithSimpleCollation(minKey); in errmsgRun()
|
H A D | cluster_move_chunk_cmd.cpp | 171 BSONObj minKey = cm->getShardKeyPattern().normalizeShardKey(bounds[0].Obj()); in errmsgRun() local 174 chunk = cm->findIntersectingChunkWithSimpleCollation(minKey); in errmsgRun() 176 if (chunk->getMin().woCompare(minKey) != 0 || chunk->getMax().woCompare(maxKey) != 0) { in errmsgRun() 178 << ChunkRange(minKey, maxKey).toString(); in errmsgRun()
|
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/siddontang/ledisdb/ledis/ |
H A D | scan.go | 65 func (db *DB) buildScanIterator(minKey []byte, maxKey []byte, inclusive bool, reverse bool) *store.… 80 it = db.bucket.RangeIterator(minKey, maxKey, tp) 82 it = db.bucket.RevRangeIterator(minKey, maxKey, tp) 90 if minKey, err = db.encodeScanMinKey(storeDataType, key); err != nil { 97 if minKey, err = db.encodeScanMinKey(storeDataType, nil); err != nil { 123 minKey, maxKey, err := db.buildScanKeyRange(storeDataType, key, reverse) 130 it := db.buildScanIterator(minKey, maxKey, inclusive, reverse) 204 if minKey, err = db.encodeDataScanMinKey(storeDataType, key, cursor); err != nil { 211 if minKey, err = db.encodeDataScanMinKey(storeDataType, key, nil); err != nil { 260 minKey, maxKey, err := db.buildDataScanKeyRange(storeDataType, key, cursor, reverse) [all …]
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/s/catalog/ |
H A D | type_chunk.cpp | 86 ChunkRange::ChunkRange(BSONObj minKey, BSONObj maxKey) in ChunkRange() argument 87 : _minKey(std::move(minKey)), _maxKey(std::move(maxKey)) { in ChunkRange() 92 BSONElement minKey; in fromBSON() local 94 Status minKeyStatus = extractObject(obj, kMinKey, &minKey); in fromBSON() 108 if (SimpleBSONObjComparator::kInstance.evaluate(minKey.Obj() >= maxKey.Obj())) { in fromBSON() 110 str::stream() << "min: " << minKey.Obj() << " should be less than max: " in fromBSON() 114 return ChunkRange(minKey.Obj().getOwned(), maxKey.Obj().getOwned()); in fromBSON() 245 BSONElement minKey; in fromShardBSON() local 246 Status minKeyStatus = extractObject(source, minShardID.name(), &minKey); in fromShardBSON() 257 if (SimpleBSONObjComparator::kInstance.evaluate(minKey.Obj() >= maxKey.Obj())) { in fromShardBSON() [all …]
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/s/balancer/ |
H A D | scoped_migration_request.cpp | 56 const BSONObj& minKey) in ScopedMigrationRequest() argument 57 : _opCtx(opCtx), _nss(nss), _minKey(minKey) {} in ScopedMigrationRequest() 165 opCtx, NamespaceString(migrateInfo.ns), migrateInfo.minKey); in writeMigration() 179 << ChunkRange(migrateInfo.minKey, migrateInfo.maxKey).toString() in writeMigration() 187 const BSONObj& minKey) { in createForRecovery() argument 188 return ScopedMigrationRequest(opCtx, nss, minKey); in createForRecovery()
|
H A D | balancer_policy_test.cpp | 134 ASSERT_BSONOBJ_EQ(cluster.second[kShardId0][0].getMin(), migrations[0].minKey); in TEST() 149 ASSERT_BSONOBJ_EQ(cluster.second[kShardId1][0].getMin(), migrations[0].minKey); in TEST() 190 ASSERT_BSONOBJ_EQ(cluster.second[kShardId0][0].getMin(), migrations[0].minKey); in TEST() 195 ASSERT_BSONOBJ_EQ(cluster.second[kShardId1][0].getMin(), migrations[1].minKey); in TEST() 214 ASSERT_BSONOBJ_EQ(cluster.second[kShardId0][0].getMin(), migrations[0].minKey); in TEST() 219 ASSERT_BSONOBJ_EQ(cluster.second[kShardId1][0].getMin(), migrations[1].minKey); in TEST() 236 ASSERT_BSONOBJ_EQ(cluster.second[kShardId0][0].getMin(), migrations[0].minKey); in TEST() 255 ASSERT_BSONOBJ_EQ(cluster.second[kShardId1][0].getMin(), migrations[0].minKey); in TEST() 288 ASSERT_BSONOBJ_EQ(cluster.second[kShardId0][0].getMin(), migrations[0].minKey); in TEST() 307 ASSERT_BSONOBJ_EQ(cluster.second[kShardId0][1].getMin(), migrations[0].minKey); in TEST() [all …]
|
/dports/java/berkeley-db/je-6.2.31/test/com/sleepycat/je/tree/ |
H A D | TreeTestBase.java | 42 protected byte[] minKey = null; field in TreeTestBase 70 minKey = null; in initEnv() 85 minKey = null; in tearDown() 108 if (minKey == null) { in insertAndRetrieve() 109 minKey = key; in insertAndRetrieve() 110 } else if (Key.compareKeys(key, minKey, null) < 0) { in insertAndRetrieve() 111 minKey = key; in insertAndRetrieve()
|
/dports/audio/polyphone/polyphone-75a5e88/sources/editor/tools/mixture_creation/ |
H A D | toolmixturecreation_parameters.h | 66 DivisionInfo(int minKey, int maxKey) : 67 _minKey(minKey), 73 void setMinKey(int minKey) { _minKey = minKey; }
|
/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/core/model/ |
H A D | calendar-scheduler.cc | 223 Scheduler::EventKey minKey; in DoRemoveNext() local 225 minKey.m_ts = uint64_t (-int64_t (1)); in DoRemoveNext() 226 minKey.m_uid = 0; in DoRemoveNext() 227 minKey.m_context = 0xffffffff; in DoRemoveNext() 241 if (next.key < minKey) in DoRemoveNext() 243 minKey = next.key; in DoRemoveNext() 253 m_lastPrio = minKey.m_ts; in DoRemoveNext() 254 m_lastBucket = Hash (minKey.m_ts); in DoRemoveNext() 255 m_bucketTop = (minKey.m_ts / m_width + 1) * m_width; in DoRemoveNext()
|
/dports/math/octomap/octomap-1.9.7/octomap/include/octomap/ |
H A D | OcTreeIterator.hxx | 358 … if (!this->tree->coordToKeyChecked(min, minKey) || !this->tree->coordToKeyChecked(max, maxKey)){ in leaf_bbx_iterator() 382 : iterator_base(ptree, depth), minKey(min), maxKey(max) in leaf_bbx_iterator() 393 minKey = other.minKey; in leaf_bbx_iterator() 445 … if ((minKey[0] <= (s.key[0] + center_offset_key)) && (maxKey[0] >= (s.key[0] - center_offset_key)) in singleIncrement() 446 … && (minKey[1] <= (s.key[1] + center_offset_key)) && (maxKey[1] >= (s.key[1] - center_offset_key)) in singleIncrement() 447 … && (minKey[2] <= (s.key[2] + center_offset_key)) && (maxKey[2] >= (s.key[2] - center_offset_key))) in singleIncrement() 458 OcTreeKey minKey; member in leaf_bbx_iterator
|
/dports/audio/polyphone/polyphone-75a5e88/sources/editor/tools/global_settings/ |
H A D | toolglobalsettings_gui.cpp | 141 int minKey = -1; in updateInterface() local 176 if (minKey == -1 || minKey > rangeTmp.byLo) in updateInterface() 177 minKey = rangeTmp.byLo; in updateInterface() 184 if (minKey == -1 || minKey > defRange.byLo) in updateInterface() 185 minKey = defRange.byLo; in updateInterface() 191 ui->graphParamGlobal->setHighlightedRange(minKey, maxKey); in updateInterface()
|
/dports/databases/zodb/ZODB-5.6.0/src/ZODB/ |
H A D | fsIndex.py | 234 def minKey(self, key=None): member in fsIndex 236 smallest_prefix = self._data.minKey() 238 smallest_prefix = self._data.minKey(key[:6]) 245 smallest_suffix = tree.minKey() 248 smallest_suffix = tree.minKey(key[6:]) 251 smallest_prefix = self._data.minKey(next_prefix) 254 smallest_suffix = tree.minKey()
|
/dports/lang/sdcc/sdcc-4.0.0/src/ |
H A D | SDCChasht.c | 68 htab->minKey = htab->size = size; in newHashTable() 96 if ((*htab)->minKey > key) in hTabAddItemLong() 97 (*htab)->minKey = key; in hTabAddItemLong() 220 htab->minKey = htab->size; in hTabClearAll() 346 for (key = htab->minKey; key <= htab->maxKey; key++) in hTabFirstItem() 401 if (wk < htab->minKey || wk > htab->maxKey) in hTabFirstItemWK() 444 for (key = htab->minKey; key <= htab->maxKey; key++) in hTabFromTable() 493 if ((key < htab->minKey) || (key > htab->maxKey)) in hTabSearch()
|
/dports/audio/polyphone/polyphone-75a5e88/sources/core/output/sfz/ |
H A D | sfzparamlist.cpp | 346 int minKey = 0, maxKey = 127; in adaptKeynum2() local 350 minKey = qRound(keyRange / 1000); in adaptKeynum2() 351 maxKey = qRound(keyRange - 1000 * minKey); in adaptKeynum2() 354 adaptKeynum2(minKey, maxKey, champ_decayModEnv, champ_keynumToModEnvDecay); in adaptKeynum2() 355 adaptKeynum2(minKey, maxKey, champ_holdModEnv, champ_keynumToModEnvHold); in adaptKeynum2() 356 adaptKeynum2(minKey, maxKey, champ_decayVolEnv, champ_keynumToVolEnvDecay); in adaptKeynum2() 357 adaptKeynum2(minKey, maxKey, champ_holdVolEnv, champ_keynumToVolEnvHold); in adaptKeynum2() 374 valMin = getValKeynum(valBase, minKey, keyNum); in adaptKeynum2() 376 if (minKey == maxKey) in adaptKeynum2() 390 keyNum = 127. * (valMin - valMax) / (double)(minKey - maxKey); in adaptKeynum2() [all …]
|
/dports/databases/gigabase/gigabase/ |
H A D | testidx.cpp | 39 int4 key, minKey, maxKey; in main() local 47 q2 = "key between",minKey,"and",maxKey; in main() 48 q3 = "key between",minKey,"and",maxKey," order by key desc"; in main() 55 minKey = (int4)(delKey-delta); in main()
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/libjava/java/util/ |
H A D | TreeMap.java | 1496 final Object minKey; field in TreeMap.SubMap 1518 SubMap(Object minKey, Object maxKey) in SubMap() argument 1520 if (minKey != nil && maxKey != nil && compare(minKey, maxKey) > 0) in SubMap() 1522 this.minKey = minKey; in SubMap() 1536 return ((minKey == nil || compare(key, minKey) >= 0) in keyInRange() 1542 Node next = lowestGreaterThan(minKey, true); in clear() 1564 Node node = lowestGreaterThan(minKey, true); in containsValue() 1589 Node first = lowestGreaterThan(minKey, true); in entrySet() 1633 Node node = lowestGreaterThan(minKey, true); in firstKey() 1650 return new SubMap(minKey, toKey); in headMap() [all …]
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/libjava/java/util/ |
H A D | TreeMap.java | 1496 final Object minKey; field in TreeMap.SubMap 1518 SubMap(Object minKey, Object maxKey) in SubMap() argument 1520 if (minKey != nil && maxKey != nil && compare(minKey, maxKey) > 0) in SubMap() 1522 this.minKey = minKey; in SubMap() 1536 return ((minKey == nil || compare(key, minKey) >= 0) in keyInRange() 1542 Node next = lowestGreaterThan(minKey, true); in clear() 1564 Node node = lowestGreaterThan(minKey, true); in containsValue() 1589 Node first = lowestGreaterThan(minKey, true); in entrySet() 1633 Node node = lowestGreaterThan(minKey, true); in firstKey() 1650 return new SubMap(minKey, toKey); in headMap() [all …]
|
/dports/java/sablevm-classpath/sablevm-classpath-1.13/java/util/ |
H A D | TreeMap.java | 1501 final Object minKey; field in TreeMap.SubMap 1523 SubMap(Object minKey, Object maxKey) in SubMap() argument 1525 if (minKey != nil && maxKey != nil && compare(minKey, maxKey) > 0) in SubMap() 1527 this.minKey = minKey; in SubMap() 1541 return ((minKey == nil || compare(key, minKey) >= 0) in keyInRange() 1547 Node next = lowestGreaterThan(minKey, true); in clear() 1569 Node node = lowestGreaterThan(minKey, true); in containsValue() 1594 Node first = lowestGreaterThan(minKey, true); in entrySet() 1638 Node node = lowestGreaterThan(minKey, true); in firstKey() 1655 return new SubMap(minKey, toKey); in headMap() [all …]
|
/dports/graphics/kqtquickcharts/kqtquickcharts-21.12.3/src/ |
H A D | xychartcore.cpp | 105 const qreal minKey = xAxis()->minimumValue(); in paintAxis() local 111 const QPointF p1 = translatePoint(QPointF(minKey, 0.0)); in paintAxis() 241 const qreal minKey = xAxis()->minimumValue(); in updateAxis() local 243 m_xAxisLabels = generateAxisLabels(minKey, maxKey); in updateAxis() 251 const int minKeyStringLength = formatLabel(minKey, xAxis()).length(); in updateAxis() 271 const qreal minKey = xAxis()->minimumValue(); in translatePoint() local 276 …const qreal x = m_lowerLeftCorner.x() + (m_graphWidth * (point.x() - minKey) / (maxKey - minKey)); in translatePoint()
|