Searched refs:upper (Results 1 – 9 of 9) sorted by relevance
| /rocksdb-6.9/db/ |
| D | range_tombstone_fragmenter.cc | 212 SequenceNumber upper) const { in ContainsRange()
214 return seq_it != seq_set_.end() && *seq_it <= upper; in ContainsRange()
422 SequenceNumber upper; in SplitBySnapshot() local
425 upper = kMaxSequenceNumber; in SplitBySnapshot()
427 upper = snapshots[i]; in SplitBySnapshot()
429 if (tombstones_->ContainsRange(lower, upper)) { in SplitBySnapshot()
430 splits.emplace(upper, std::unique_ptr<FragmentedRangeTombstoneIterator>( in SplitBySnapshot()
432 tombstones_, *icmp_, upper, lower))); in SplitBySnapshot()
434 lower = upper + 1; in SplitBySnapshot()
|
| D | range_tombstone_fragmenter.h | 69 bool ContainsRange(SequenceNumber lower, SequenceNumber upper) const;
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2017-12-18-17-auto-tuned-rate-limiter.markdown | 12 …cRateLimiter()` call. In this case `rate_bytes_per_sec` will indicate the upper-bound of the windo…
16 …upper-bound, and a lower-bound that we derive internally. Users can expect this lower bound to be …
20 Data is ingested at 10MB/s and the rate limiter was created with 1000MB/s as its upper bound. The d…
|
| D | 2014-04-21-indexing-sst-files-for-better-lookup-performance.markdown | 16 Compaction is scheduled periodically to pick up files from an upper level and merges them with file…
|
| /rocksdb-6.9/util/ |
| D | bloom_impl.h | 277 __m256i upper = _mm256_loadu_si256(mm_data + 1); in HashMayMatchPrepared() local
287 upper = _mm256_permutevar8x32_epi32(upper, word_addresses); in HashMayMatchPrepared()
292 _mm256_blendv_epi8(lower, upper, upper_lower_selector); in HashMayMatchPrepared()
|
| D | xxh3p.h | 398 xxh_u64 const upper = (hi_lo >> 32) + (cross >> 32) + hi_hi; in XXH_mult64to128()
401 XXH128_hash_t r128 = { lower, upper }; in XXH_mult64to128()
|
| /rocksdb-6.9/java/ |
| D | RELEASE.md | 55 …://oss.sonatype.org/#stagingRepositories) and search for "rocksdb" in the upper right hand search …
|
| /rocksdb-6.9/build_tools/ |
| D | gnu_parallel | 5113 my $upper = 8_000_000;
7103 my $upper = 8_000_000;
7106 if($len > $upper) { return $len };
7117 my ($lower, $upper) = (@_);
7118 if($lower == $upper or $lower == $upper-1) { return $lower; }
7119 my $middle = int (($upper-$lower)/2 + $lower);
7120 ::debug("init", "Maxlen: $lower,$upper,$middle : ");
7122 return binary_find_max_length($middle,$upper);
|
| /rocksdb-6.9/ |
| D | HISTORY.md | 20 * Basic support for user timestamp in iterator. Seek/SeekToFirst/Next and lower/upper bounds are su…
73 …rder seek, but may choose to use prefix seek internally based on seek key and iterator upper bound.
96 …86)" since it might cause strong results when reseek happens with a different iterator upper bound.
151 …6)" since it might cause strange results when reseek happens with a different iterator upper bound.
152 …ator that might return incorrect results when reseek happens with a different iterator upper bound.
202 * Reduce iterator key comparison for upper/lower bound check.
264 * Improve range scan performance by avoiding per-key upper bound check in BlockBasedTableIterator.
266 * Block-based table index now contains exact highest key in the file, rather than an upper bound. T…
567 …RateLimiter()`. The value passed as `rate_bytes_per_sec` will still be respected as an upper-bound.
|