37 using leveldb::Slice;
73   virtual int Compare(const Slice& a, const Slice& b) const {  in Compare()
82   virtual void FindShortestSeparator(std::string*, const Slice&) const { }  in FindShortestSeparator()
108   virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const {  in CreateFilter()
121   virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const {  in KeyMayMatch()
177             db->rep->Put(options->rep, Slice(key, keylen), Slice(val, vallen)));  in leveldb_put()
185   SaveError(errptr, db->rep->Delete(options->rep, Slice(key, keylen)));  in leveldb_delete()
205   Status s = db->rep->Get(options->rep, Slice(key, keylen), &tmp);  in leveldb_get()
244   if (db->rep->GetProperty(Slice(propname), &tmp)) {  in leveldb_property_value()
260     ranges[i].start = Slice(range_start_key[i], range_start_key_len[i]);  in leveldb_approximate_sizes()
261     ranges[i].limit = Slice(range_limit_key[i], range_limit_key_len[i]);  in leveldb_approximate_sizes()
271   Slice a, b;  in leveldb_compact_range()
274       (start_key ? (a = Slice(start_key, start_key_len), &a) : NULL),  in leveldb_compact_range()
275       (limit_key ? (b = Slice(limit_key, limit_key_len), &b) : NULL));  in leveldb_compact_range()
310   iter->rep->Seek(Slice(k, klen));  in leveldb_iter_seek()
322   Slice s = iter->rep->key();  in leveldb_iter_key()
328   Slice s = iter->rep->value();  in leveldb_iter_value()
353   b->rep.Put(Slice(key, klen), Slice(val, vlen));  in leveldb_writebatch_put()
359   b->rep.Delete(Slice(key, klen));  in leveldb_writebatch_delete()
372     virtual void Put(const Slice& key, const Slice& value) {  in leveldb_writebatch_iterate()
375     virtual void Delete(const Slice& key) {  in leveldb_writebatch_iterate()
507     void CreateFilter(const Slice* keys, int n, std::string* dst) const {  in leveldb_filterpolicy_create_bloom()
510     bool KeyMayMatch(const Slice& key, const Slice& filter) const {  in leveldb_filterpolicy_create_bloom()