Home
last modified time | relevance | path

Searched refs:values (Results 1 – 5 of 5) sorted by relevance

/leveldb-1.20/util/
H A Dcoding_test.cc100 std::vector<uint64_t> values; in TEST() local
102 values.push_back(0); in TEST()
103 values.push_back(100); in TEST()
104 values.push_back(~static_cast<uint64_t>(0)); in TEST()
109 values.push_back(power); in TEST()
110 values.push_back(power-1); in TEST()
111 values.push_back(power+1); in TEST()
115 for (size_t i = 0; i < values.size(); i++) { in TEST()
116 PutVarint64(&s, values[i]); in TEST()
121 for (size_t i = 0; i < values.size(); i++) { in TEST()
[all …]
/leveldb-1.20/doc/
H A Dindex.md6 The leveldb library provides a persistent key value store. Keys and values are
208 potentially large keys and values. In addition, leveldb methods do not return
209 null-terminated C-style strings since leveldb keys and values are allowed to
309 Performance can be tuned by changing the default values of the types defined in
318 that do a lot of point reads of small values may wish to switch to a smaller
H A Dimpl.md26 are kept around to hide obsolete values present in older sorted tables).
102 Compactions drop overwritten values. They also drop deletion markers if there
/leveldb-1.20/
H A DREADME.md1 …age library written at Google that provides an ordered mapping from string keys to string values.**
8 * Keys and values are arbitrary byte arrays.
/leveldb-1.20/db/
H A Ddb_test.cc988 std::vector<std::string> values; in TEST() local
990 values.push_back(RandomString(&rnd, 100000)); in TEST()
991 ASSERT_OK(Put(Key(i), values[i])); in TEST()
1001 ASSERT_EQ(Get(Key(i)), values[i]); in TEST()