Home
last modified time | relevance | path

Searched refs:sequence (Results 1 – 13 of 13) sorted by relevance

/leveldb-1.20/db/
H A Ddbformat.h72 SequenceNumber sequence; member
77 : user_key(u), sequence(seq), type(t) { } in ParsedInternalKey()
182 result->sequence = num >> 8; in ParseInternalKey()
193 LookupKey(const Slice& user_key, SequenceNumber sequence);
H A Ddb_iter.cc179 if (ParseKey(&ikey) && ikey.sequence <= sequence_) { in FindNextUserEntry()
239 if (ParseKey(&ikey) && ikey.sequence <= sequence_) { in FindPrevUserEntry()
312 SequenceNumber sequence, in NewDBIterator() argument
314 return new DBIter(db, user_key_comparator, internal_iter, sequence, seed); in NewDBIterator()
H A Ddb_iter.h23 SequenceNumber sequence,
H A Ddbformat.cc20 PutFixed64(result, PackSequenceAndType(key.sequence, key.type)); in AppendInternalKey()
26 (unsigned long long) sequence, in DebugString()
H A Ddbformat_test.cc41 ASSERT_EQ(seq, decoded.sequence); in TestKey()
H A Dwrite_batch_test.cc43 state.append(NumberToString(ikey.sequence)); in PrintContents()
H A Drepair.cc301 if (parsed.sequence > t.max_sequence) { in ScanTable()
302 t.max_sequence = parsed.sequence; in ScanTable()
H A Ddumpfile.cc182 AppendNumberTo(&r, key.sequence); in DumpTable()
H A Ddb_impl.cc959 ikey.sequence <= compact->smallest_snapshot && in DoCompactionWork()
971 last_sequence_for_key = ikey.sequence; in DoCompactionWork()
978 (int)ikey.sequence, ikey.type, kTypeValue, drop, in DoCompactionWork()
/leveldb-1.20/doc/
H A Dlog_format.md3 The log file contents are a sequence of 32KB blocks. The only exception is that
6 Each block consists of a sequence of records:
40 Example: consider a sequence of user records:
H A Dtable_format.md26 1. The sequence of key/value pairs in the file are stored in sorted
27 order and partitioned into a sequence of data blocks. These blocks
63 The filter block stores a sequence of filters, where filter i contains
H A Dimpl.md13 A log file (*.log) stores a sequence of recent updates. Each update is appended
24 A sorted table (*.ldb) stores a sequence of entries sorted by key. Each entry is
28 The set of sorted tables are organized into a sequence of levels. The sorted
32 overlapping level-1 files to produce a sequence of new level-1 files (we create
86 A compaction merges the contents of the picked files to produce a sequence of
163 * Start directing new writes to a new log file with recovered sequence#
H A Dindex.md87 The `WriteBatch` holds a sequence of edits to be made to the database, and these
341 each file stores a sequence of compressed blocks. If options.cache is non-NULL,