| /external/chromium_org/third_party/leveldatabase/src/include/leveldb/ |
| write_batch.h | 29 class Slice;
37 void Put(const Slice& key, const Slice& value);
40 void Delete(const Slice& key);
49 virtual void Put(const Slice& key, const Slice& value) = 0;
50 virtual void Delete(const Slice& key) = 0;
|
| comparator.h | 12 class Slice;
26 virtual int Compare(const Slice& a, const Slice& b) const = 0;
48 const Slice& limit) const = 0;
|
| filter_policy.h | 23 class Slice;
41 virtual void CreateFilter(const Slice* keys, int n, std::string* dst)
49 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const = 0;
|
| status.h | 17 #include "leveldb/slice.h"
35 static Status NotFound(const Slice& msg, const Slice& msg2 = Slice()) {
38 static Status Corruption(const Slice& msg, const Slice& msg2 = Slice()) {
41 static Status NotSupported(const Slice& msg, const Slice& msg2 = Slice()) {
[all...] |
| db.h | 34 Slice start; // Included in the range
35 Slice limit; // Not included in the range
38 Range(const Slice& s, const Slice& l) : start(s), limit(l) { }
62 const Slice& key,
63 const Slice& value) = 0;
69 virtual Status Delete(const WriteOptions& options, const Slice& key) = 0;
84 const Slice& key, std::string* value) = 0;
118 virtual bool GetProperty(const Slice& property, std::string* value) = 0;
141 virtual void CompactRange(const Slice* begin, const Slice* end) = 0
[all...] |
| slice.h | 5 // Slice is a simple structure containing a pointer into some external
6 // storage and a size. The user of a Slice must ensure that the slice
10 // Multiple threads can invoke const methods on a Slice without
12 // non-const method, all threads accessing the same Slice must use
25 class Slice {
27 // Create an empty slice.
28 Slice() : data_(""), size_(0) { }
30 // Create a slice that refers to d[0,n-1].
31 Slice(const char* d, size_t n) : data_(d), size_(n) {
[all...] |
| table.h | 56 uint64_t ApproximateOffsetOf(const Slice& key) const;
63 static Iterator* BlockReader(void*, const ReadOptions&, const Slice&);
70 const ReadOptions&, const Slice& key,
72 void (*handle_result)(void* arg, const Slice& k, const Slice& v));
76 void ReadFilter(const Slice& filter_handle_value);
|
| cache.h | 22 #include "leveldb/slice.h"
52 virtual Handle* Insert(const Slice& key, void* value, size_t charge,
53 void (*deleter)(const Slice& key, void* value)) = 0;
60 virtual Handle* Lookup(const Slice& key) = 0;
76 virtual void Erase(const Slice& key) = 0;
|
| iterator.h | 18 #include "leveldb/slice.h"
43 virtual void Seek(const Slice& target) = 0;
56 // the returned slice is valid only until the next modification of
59 virtual Slice key() const = 0;
62 // the returned slice is valid only until the next modification of
65 virtual Slice value() const = 0;
|
| table_builder.h | 47 void Add(const Slice& key, const Slice& value);
80 void WriteRawBlock(const Slice& data, CompressionType, BlockHandle* handle);
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| logging.h | 18 class Slice;
26 extern void AppendEscapedStringTo(std::string* str, const Slice& value);
33 extern std::string EscapeString(const Slice& value);
37 extern bool ConsumeChar(Slice* in, char c);
43 extern bool ConsumeDecimalNumber(Slice* in, uint64_t* val);
|
| testutil.cc | 12 Slice RandomString(Random* rnd, int len, std::string* dst) {
17 return Slice(*dst);
34 extern Slice CompressibleString(Random* rnd, double compressed_fraction,
47 return Slice(*dst);
|
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| dbformat.h | 12 #include "leveldb/slice.h"
68 Slice user_key;
73 ParsedInternalKey(const Slice& u, const SequenceNumber& seq, ValueType t)
91 extern bool ParseInternalKey(const Slice& internal_key,
95 inline Slice ExtractUserKey(const Slice& internal_key) {
97 return Slice(internal_key.data(), internal_key.size() - 8);
100 inline ValueType ExtractValueType(const Slice& internal_key) {
116 virtual int Compare(const Slice& a, const Slice& b) const
[all...] |
| write_batch_internal.h | 31 static Slice Contents(const WriteBatch* batch) {
32 return Slice(batch->rep_);
39 static void SetContents(WriteBatch* batch, const Slice& contents);
|
| memtable.cc | 14 static Slice GetLengthPrefixedSlice(const char* data) {
18 return Slice(p, len);
36 Slice a = GetLengthPrefixedSlice(aptr);
37 Slice b = GetLengthPrefixedSlice(bptr);
44 static const char* EncodeKey(std::string* scratch, const Slice& target) {
56 virtual void Seek(const Slice& k) { iter_.Seek(EncodeKey(&tmp_, k)); }
61 virtual Slice key() const { return GetLengthPrefixedSlice(iter_.key()); }
62 virtual Slice value() const {
63 Slice key_slice = GetLengthPrefixedSlice(iter_.key());
83 const Slice& key
[all...] |
| write_batch_test.cc | 65 batch.Put(Slice("foo"), Slice("bar"));
66 batch.Delete(Slice("box"));
67 batch.Put(Slice("baz"), Slice("boo"));
79 batch.Put(Slice("foo"), Slice("bar"));
80 batch.Delete(Slice("box"));
82 Slice contents = WriteBatchInternal::Contents(&batch);
84 Slice(contents.data(),contents.size()-1))
[all...] |
| dbformat.cc | 50 int InternalKeyComparator::Compare(const Slice& akey, const Slice& bkey) const {
70 const Slice& limit) const {
72 Slice user_start = ExtractUserKey(*start);
73 Slice user_limit = ExtractUserKey(limit);
88 Slice user_key = ExtractUserKey(*key);
105 void InternalFilterPolicy::CreateFilter(const Slice* keys, int n,
109 Slice* mkey = const_cast<Slice*>(keys);
117 bool InternalFilterPolicy::KeyMayMatch(const Slice& key, const Slice& f) const
[all...] |
| log_reader.h | 11 #include "leveldb/slice.h"
53 bool ReadRecord(Slice* record, std::string* scratch);
65 Slice buffer_;
93 unsigned int ReadPhysicalRecord(Slice* result);
|
| table_cache.h | 43 const Slice& k,
45 void (*handle_result)(void*, const Slice&, const Slice&));
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| filter_block.h | 16 #include "leveldb/slice.h"
34 void AddKey(const Slice& key);
35 Slice Finish();
44 std::vector<Slice> tmp_keys_; // policy_->CreateFilter() argument
55 FilterBlockReader(const FilterPolicy* policy, const Slice& contents);
56 bool KeyMayMatch(uint64_t block_offset, const Slice& key);
|
| block_builder.h | 11 #include "leveldb/slice.h"
26 void Add(const Slice& key, const Slice& value);
28 // Finish building the block and return a slice that refers to the
29 // block contents. The returned slice will remain valid for the
31 Slice Finish();
|
| two_level_iterator.h | 28 const Slice& index_value),
|
| filter_block.cc | 30 void FilterBlockBuilder::AddKey(const Slice& key) {
31 Slice k = key;
36 Slice FilterBlockBuilder::Finish() {
49 return Slice(result_);
66 tmp_keys_[i] = Slice(base, length);
79 const Slice& contents)
95 bool FilterBlockReader::KeyMayMatch(uint64_t block_offset, const Slice& key) {
101 Slice filter = Slice(data_ + start, limit - start);
|
| iterator.cc | 46 virtual void Seek(const Slice& target) { }
51 Slice key() const { assert(false); return Slice(); }
52 Slice value() const { assert(false); return Slice(); }
|
| /external/chromium_org/tools/telemetry/telemetry/core/timeline/ |
| slice_unittest.py | 7 from telemetry.core.timeline.slice import Slice
14 top = Slice(None, 'cat', 'top', 0, duration=10)
15 a = Slice(None, 'cat', 'a', 1, duration=2)
16 x = Slice(None, 'cat', 'x', 1.5, duration=0.25)
17 b = Slice(None, 'cat', 'b', 5, duration=2)
|
