11 using namespace folly;
16 auto trim = trimmed.
size();
17 size_t currentTrim = trim;
20 for (
size_t i = 0;
i < chainElements && currentTrim != 0; ++
i) {
24 trimmed.
begin() + (currentTrim - toTrim),
25 current->
data() + (current->
length() - toTrim),
28 currentTrim -= toTrim;
29 current = current->
prev();
34 CHECK_EQ(first.
size(), second.
size());
35 for (
size_t i = 0;
i < first.
size(); ++
i) {
36 second[
i] ^= first[
i];
void trimBytes(IOBuf &buf, folly::MutableByteRange trimmed)
constexpr size_type size() const
const uint8_t * data() const
—— Concurrent Priority Queue Implementation ——
size_t countChainElements() const
void XOR(ByteRange first, MutableByteRange second)
std::size_t length() const
constexpr Iter begin() const
void trimEnd(std::size_t amount)
constexpr detail::First first