Home
last modified time | relevance | path

Searched refs:function (Results 1 – 6 of 6) sorted by relevance

/leveldb-1.20/table/
H A Diterator.cc10 cleanup_.function = NULL; in Iterator()
15 if (cleanup_.function != NULL) { in ~Iterator()
16 (*cleanup_.function)(cleanup_.arg1, cleanup_.arg2); in ~Iterator()
18 (*c->function)(c->arg1, c->arg2); in ~Iterator()
29 if (cleanup_.function == NULL) { in RegisterCleanup()
36 c->function = func; in RegisterCleanup()
/leveldb-1.20/include/leveldb/
H A Diterator.h76 void RegisterCleanup(CleanupFunction function, void* arg1, void* arg2);
80 CleanupFunction function; member
H A Denv.h140 void (*function)(void* arg),
145 virtual void StartThread(void (*function)(void* arg), void* arg) = 0;
/leveldb-1.20/util/
H A Denv_posix.cc498 virtual void Schedule(void (*function)(void*), void* arg);
500 virtual void StartThread(void (*function)(void* arg), void* arg);
565 struct BGItem { void* arg; void (*function)(void*); }; member
610 void PosixEnv::Schedule(void (*function)(void*), void* arg) { in Schedule()
629 queue_.back().function = function; in Schedule()
643 void (*function)(void*) = queue_.front().function; in BGThread() local
648 (*function)(arg); in BGThread()
665 void PosixEnv::StartThread(void (*function)(void* arg), void* arg) { in StartThread()
668 state->user_function = function; in StartThread()
/leveldb-1.20/doc/
H A Dindex.md8 according to a user-specified comparator function.
247 The preceding examples used the default ordering function for key, which orders
256 // Three-way comparison function:
295 and only if the new key format and comparison function are incompatible with
304 version number for new keys (c) change the comparator function so it uses the
468 is turned on), the `leveldb::RepairDB` function may be used to recover as much
/leveldb-1.20/
H A DREADME.md10 * Callers can provide a custom comparison function to override the sort order.
152 * **include/comparator.h**: Abstraction for user-specified comparison function.