Home
last modified time | relevance | path

Searched refs:a (Results 1 – 25 of 29) sorted by relevance

12

/leveldb-1.20/util/
H A Dtestharness.h107 #define ASSERT_EQ(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsEq((a),(b)) argument
108 #define ASSERT_NE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsNe((a),(b)) argument
109 #define ASSERT_GE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsGe((a),(b)) argument
110 #define ASSERT_GT(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsGt((a),(b)) argument
111 #define ASSERT_LE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsLe((a),(b)) argument
112 #define ASSERT_LT(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsLt((a),(b)) argument
114 #define TCONCAT(a,b) TCONCAT1(a,b) argument
115 #define TCONCAT1(a,b) a##b argument
H A Dcomparator.cc25 virtual int Compare(const Slice& a, const Slice& b) const { in Compare() argument
26 return a.compare(b); in Compare()
H A Dcache_test.cc204 uint64_t a = cache_->NewId(); in TEST() local
206 ASSERT_NE(a, b); in TEST()
/leveldb-1.20/doc/
H A Dlog_format.md3 The log file contents are a sequence of 32KB blocks. The only exception is that
4 the tail of the file may contain a partial block.
6 Each block consists of a sequence of records:
15 A record never starts within the last six bytes of a block (since it won't fit).
19 Aside: if exactly seven bytes are left in the current block, and a new non-zero
37 a user record, and MIDDLE is the type of all interior fragments of a user
40 Example: consider a sequence of user records:
46 **A** will be stored as a FULL record in the first block.
53 **C** will be stored as a FULL record in the fourth block.
60 and scan. If there is a corruption, skip to the next block. As a
[all …]
H A Dindex.md12 A leveldb database has a name which corresponds to a file system directory. All
124 write can update a marker that describes where to restart on a crash.)
205 of the `leveldb::Slice` type. Slice is a simple structure that contains a length
206 and a pointer to an external byte array. Returning a Slice is a cheaper
257 // if a < b: negative result
258 // if a > b: positive result
262 ParseKey(a, &a1, &a2);
318 that do a lot of point reads of small values may wish to switch to a smaller
413 a 100. Increasing the bits per key will lead to a larger reduction at the cost
415 fit in memory and that do a lot of random reads set a filter policy.
[all …]
H A Dimpl.md3 The implementation of leveldb is similar in spirit to the representation of a
8 Each database is represented by a set of files stored in a directory. There are
14 to the current log file. When the log file reaches a pre-determined size
16 and a new log file is created for future updates.
25 either a value for the key, or a deletion marker for the key. (Deletion markers
29 table generated from a log file is placed in a special **young** level (also
33 a new level-1 file for every 2MB of data.)
67 When the log file grows above a certain size (1MB by default):
79 the next level L+1. Note that if a level-L file overlaps only part of a
148 | Files in directory | Microseconds to open a file |
[all …]
H A Dtable_format.md18 a BlockHandle and contains the following information:
27 order and partitioned into a sequence of data blocks. These blocks
32 2. After the data blocks we store a bunch of meta blocks. The
38 block where the key is the name of the meta block and the value is a
42 where the key is a string >= last key in that data block and before
46 5. At the very end of the file is a fixed length footer that contains
57 If a `FilterPolicy` was specified when the database was opened, a
63 The filter block stores a sequence of filters, where filter i contains
65 in a block whose file offset falls within the range
93 mapping from a data block offset to the corresponding filter.
[all …]
/leveldb-1.20/
H A DREADME.md13 * Users can create a transient snapshot to get a consistent view of data.
23 …* This is not a SQL database. It does not have a relational data model, it does not support SQL q…
24 * Only a single process (possibly multi-threaded) can access a particular database at a time.
45 a sufficient explanation as to why a new (or changed) test is not required.
47 ## Submitting a Pull Request
62 be enough to get a ballpark performance estimate.
66 We use a database with a million entries. Each entry has a 16 byte
94 Each "op" above corresponds to a write of a single key/value pair.
158 an iterator from a DB object.
161 updates to a database.
[all …]
H A DCONTRIBUTING.md4 have to jump a couple of legal hurdles.
13 * If you work for a company that wants to allow you to contribute your work,
14 then sign a [corporate CLA](https://developers.google.com/open-source/cla/corporate).
19 ## Submitting a Patch
22 2. Decide which code you want to submit. A submission should be a set of changes
25 the history hard to follow. If you want to make a change
26 (e.g. add a sample or feature) that doesn't have a corresponding issue in the
28 3. **Submitting**: When you are ready to submit, send us a Pull Request. Be
H A DMakefile121 SHARED_MEMENVLIB = $(SHARED_OUTDIR)/libmemenv.a
134 SHARED_MEMENVLIB = $(SHARED_OUTDIR)/libmemenv.a
142 all: $(SHARED_LIBS) $(SHARED_PROGRAMS) $(STATIC_OUTDIR)/libleveldb.a $(STATIC_OUTDIR)/libmemenv.a $…
262 $(DEVICE_OUTDIR)/libleveldb.a: $(DEVICE_LIBOBJECTS)
270 $(DEVICE_OUTDIR)/libmemenv.a: $(DEVICE_MEMENVOBJECTS)
280 $(STATIC_OUTDIR)/libleveldb.a: $(STATIC_OUTDIR) $(DEVICE_OUTDIR)/libleveldb.a $(SIMULATOR_OUTDIR)/l…
281 lipo -create $(DEVICE_OUTDIR)/libleveldb.a $(SIMULATOR_OUTDIR)/libleveldb.a -output $@
283 $(STATIC_OUTDIR)/libmemenv.a: $(STATIC_OUTDIR) $(DEVICE_OUTDIR)/libmemenv.a $(SIMULATOR_OUTDIR)/lib…
284 lipo -create $(DEVICE_OUTDIR)/libmemenv.a $(SIMULATOR_OUTDIR)/libmemenv.a -output $@
286 $(STATIC_OUTDIR)/libleveldb.a:$(STATIC_LIBOBJECTS)
[all …]
H A DNEWS10 (2) Fixed memtable management. Before the fix, a heavy write burst
13 A fix for a logging bug where the reader would incorrectly complain
17 wrap a DB.
H A D.gitignore2 *.a
H A DTODO12 After a range is completely deleted, what gets rid of the
/leveldb-1.20/port/
H A DREADME5 "port.h" in turn includes a platform specific "port_<platform>.h" file
8 See port_posix.h for an example of what must be provided in a platform
/leveldb-1.20/db/
H A Ddbformat.h119 virtual int Compare(const Slice& a, const Slice& b) const;
127 int Compare(const InternalKey& a, const InternalKey& b) const;
172 const InternalKey& a, const InternalKey& b) const { in Compare() argument
173 return Compare(a.Encode(), b.Encode()); in Compare()
H A Dc.cc65 const char* a, size_t alen,
73 virtual int Compare(const Slice& a, const Slice& b) const { in Compare()
74 return (*compare_)(state_, a.data(), a.size(), b.data(), b.size()); in Compare()
271 Slice a, b; in leveldb_compact_range() local
274 (start_key ? (a = Slice(start_key, start_key_len), &a) : NULL), in leveldb_compact_range()
458 const char* a, size_t alen, in leveldb_comparator_create() argument
H A Dmemtable.cc36 Slice a = GetLengthPrefixedSlice(aptr); in operator ()() local
38 return comparator.Compare(a, b); in operator ()()
H A Dmemtable.h69 int operator()(const char* a, const char* b) const;
H A Dlog_reader.cc228 const uint32_t a = static_cast<uint32_t>(header[4]) & 0xff; in ReadPhysicalRecord() local
231 const uint32_t length = a | (b << 8); in ReadPhysicalRecord()
H A Dskiplist_test.cc18 int operator()(const Key& a, const Key& b) const { in operator ()()
19 if (a < b) { in operator ()()
21 } else if (a > b) { in operator ()()
H A Dskiplist.h120 bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); } in Equal() argument
H A Dc_test.c117 static int CmpCompare(void* arg, const char* a, size_t alen, in CmpCompare() argument
120 int r = memcmp(a, b, n); in CmpCompare()
/leveldb-1.20/include/leveldb/
H A Denv.h327 void Schedule(void (*f)(void*), void* a) { in Schedule() argument
328 return target_->Schedule(f, a); in Schedule()
330 void StartThread(void (*f)(void*), void* a) { in StartThread() argument
331 return target_->StartThread(f, a); in StartThread()
H A Dcomparator.h26 virtual int Compare(const Slice& a, const Slice& b) const = 0;
/leveldb-1.20/table/
H A Dblock.cc90 inline int Compare(const Slice& a, const Slice& b) const { in Compare() argument
91 return comparator_->Compare(a, b); in Compare()

12