Searched refs:byte (Results 1 – 6 of 6) sorted by relevance
117 uint32_t byte = *(reinterpret_cast<const unsigned char*>(p)); in GetVarint32PtrFallback() local119 if (byte & 128) { in GetVarint32PtrFallback()121 result |= ((byte & 127) << shift); in GetVarint32PtrFallback()123 result |= (byte << shift); in GetVarint32PtrFallback()146 uint64_t byte = *(reinterpret_cast<const unsigned char*>(p)); in GetVarint64Ptr() local148 if (byte & 128) { in GetVarint64Ptr()150 result |= ((byte & 127) << shift); in GetVarint64Ptr()152 result |= (byte << shift); in GetVarint64Ptr()
57 const uint8_t byte = (*key)[i]; in FindShortSuccessor() local58 if (byte != static_cast<uint8_t>(0xff)) { in FindShortSuccessor()59 (*key)[i] = byte + 1; in FindShortSuccessor()
4 Fixes for larger databases (tested up to one billion 100-byte entries,
8 * Keys and values are arbitrary byte arrays.66 We use a database with a million entries. Each entry has a 16 byte67 key, and a 100 byte value. Values used by the benchmark compress to164 length into some other byte array.
90 lg(base) : 1 byte
7 arbitrary byte arrays. The keys are ordered within the key value store206 and a pointer to an external byte array. Returning a Slice is a cheaper230 external byte array into which the Slice points remains live while the Slice is301 each key (one byte should suffice for most uses). When you wish to switch to a