Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Fullstop000/wickdb
/ functions
Functions
886 in github.com/Fullstop000/wickdb
⨍
Functions
886
◇
Types & classes
135
↓ 1 callers
Function
hash
Extract hash
src/mem/skiplist.rs:653
↓ 1 callers
Function
hash
Returns a `u32` crc checksum for give data
src/util/crc32.rs:19
↓ 1 callers
Method
hash
(&self, state: &mut H)
src/cache/lru.rs:34
↓ 1 callers
Method
initialize
Initialize Options by limiting ranges of some flags, applying customized Logger and etc.
src/options.rs:206
↓ 1 callers
Method
insert_with_charge
(&self, key: u32, value: u32, charge: usize)
src/cache/lru.rs:285
↓ 1 callers
Method
internal_key
Returns an internal key (suitable for passing to an internal iterator)
src/db/format.rs:246
↓ 1 callers
Method
into_file
(self)
src/record/reader.rs:102
↓ 1 callers
Method
is_exist_dir
Whether the given `path` is a existed directory
src/storage/mem.rs:126
↓ 1 callers
Method
is_file
(&self)
src/storage/mem.rs:367
↓ 1 callers
Method
is_ok_to_create
Checking whether the path is good for create a file. Return `Err` when the parent dir is not exist
src/storage/mem.rs:90
↓ 1 callers
Method
iter_all
(&self)
src/compaction.rs:60
↓ 1 callers
Function
iter_to_string
(iter: &dyn Iterator)
src/db/mod.rs:1564
↓ 1 callers
Method
key
(&self)
src/version/mod.rs:716
↓ 1 callers
Method
key
(&self)
src/mem/inlineskiplist.rs:55
↓ 1 callers
Method
key
(&self)
src/sstable/block.rs:322
↓ 1 callers
Method
key_exist_in_deeper_level
Reports whether it is guaranteed that there are no key/value pairs at c.level+2 or higher that have the user key ukey.
src/compaction.rs:256
↓ 1 callers
Function
key_is_after_file
used for smallest user key
src/version/mod.rs:610
↓ 1 callers
Method
key_is_less_than_or_equal
Return whether the give key is less than the given node's key.
src/mem/skiplist.rs:257
↓ 1 callers
Method
key_may_match
Returns true if the given key is probably contained in the given `block_offset` block
src/sstable/filter_block.rs:147
↓ 1 callers
Method
last_seq
(&self)
src/snapshot.rs:114
↓ 1 callers
Method
len
(&self)
src/storage/file.rs:129
↓ 1 callers
Method
len
(&self)
src/mem/inlineskiplist.rs:273
↓ 1 callers
Method
live_files
(&self)
src/version/version_set.rs:657
↓ 1 callers
Method
lock_live_files
(&mut self)
src/version/version_set.rs:645
↓ 1 callers
Function
log_to_slog_level
(level: log::Level)
src/logger.rs:111
↓ 1 callers
Method
make_room_for_write
Make sure there is enough space in memtable. This method acquires the mutex of `VersionSet` and deliver it to the caller. The `force` flag is used for
src/db/mod.rs:900
↓ 1 callers
Method
manifest_number
(&self)
src/version/version_set.rs:281
↓ 1 callers
Method
max_bytes_for_level
Maximum bytes of total files in a given level
src/options.rs:187
↓ 1 callers
Method
may_contain
(&self, filter: &[u8], key: &[u8])
src/sstable/filter_block.rs:188
↓ 1 callers
Method
may_contain
(&self, filter: &[u8], key: &[u8])
src/filter/bloom.rs:51
↓ 1 callers
Method
mem_key
Returns a key suitable for lookup in a MemTable.
src/db/format.rs:241
↓ 1 callers
Method
memory_used
Return the size of memory that has been allocated.
src/mem/arena.rs:66
↓ 1 callers
Method
must_release_snapshot
(&self, s: Arc<Snapshot>)
src/db/mod.rs:1668
↓ 1 callers
Method
needs_compaction
Whether the version needs to be compacted
src/version/mod.rs:242
↓ 1 callers
Method
new_input_iterator
Create an iterator that reads over all the compaction input tables with merged order. We produce different iter for tables in level0 and level >0 : le
src/compaction.rs:171
↓ 1 callers
Method
new_multi_thd_test
(&self)
src/db/mod.rs:3064
↓ 1 callers
Method
new_snapshot
(&mut self)
src/version/version_set.rs:305
↓ 1 callers
Function
new_test_file_diff
(delete: Vec<Vec<u64>>, add: Vec<Vec<u64>>)
src/version/version_set.rs:1453
↓ 1 callers
Function
new_test_lru_shards
(n: usize)
src/cache/mod.rs:127
↓ 1 callers
Function
new_test_merging_iter
Divide given ordered `src` into `n` lists and then construct a `MergingIterator` with them
src/iterator.rs:512
↓ 1 callers
Function
new_test_skl
()
src/mem/inlineskiplist.rs:431
↓ 1 callers
Function
new_test_version
(files: Vec<Vec<u64>>)
src/version/version_set.rs:1437
↓ 1 callers
Method
newest
(&self)
src/snapshot.rs:84
↓ 1 callers
Method
next
(&mut self)
src/mem/inlineskiplist.rs:376
↓ 1 callers
Function
next_n
(n: u32)
src/filter/bloom.rs:164
↓ 1 callers
Method
oldest
(&self)
src/snapshot.rs:75
↓ 1 callers
Method
open
(&self, name: P)
src/storage/file.rs:46
↓ 1 callers
Method
pick_compaction
Pick level and inputs for a new compaction. Returns `None` if no compaction needs to be done. Otherwise returns a `Compaction` that describes the comp
src/version/version_set.rs:492
↓ 1 callers
Method
pick_level_for_memtable_output
Return the level at which we should place a new memtable compaction result that covers the range `[smallest_user_key,largest_user_key]`.
src/version/mod.rs:260
↓ 1 callers
Method
prev
(&mut self)
src/mem/mod.rs:215
↓ 1 callers
Method
prev
find previous node
src/mem/inlineskiplist.rs:384
↓ 1 callers
Method
prev
seek to prev restart offset and scan backwards to a restart point before current
src/sstable/block.rs:302
↓ 1 callers
Method
print_sst_files
Print all sst files at current version
src/db/mod.rs:1799
↓ 1 callers
Method
process_batch
The thread take batches from the queue and apples them into memtable and WAL. Steps: 1. Grouping the batches in the queue into a big enough batch 2.
src/db/mod.rs:255
↓ 1 callers
Method
process_compaction
Process a compaction work when receiving the signal. The compaction might run recursively since we produce new table files.
src/db/mod.rs:364
↓ 1 callers
Function
random_height
()
src/mem/inlineskiplist.rs:414
↓ 1 callers
Function
random_key
(length: usize)
src/sstable/mod.rs:1115
↓ 1 callers
Function
random_seek_key
(keys: &[Vec<u8>], reverse_cmp: bool)
src/sstable/mod.rs:1053
↓ 1 callers
Function
random_skewed_string
Return a skewed potentially long string
src/record/mod.rs:91
↓ 1 callers
Function
random_value
(length: usize)
src/sstable/mod.rs:1131
↓ 1 callers
Method
read_all
(&mut self, _buf: &mut Vec<u8>)
src/record/mod.rs:164
↓ 1 callers
Method
read_physical_record
(&mut self)
src/record/reader.rs:237
↓ 1 callers
Method
record_bg_error
Replace the `bg_error` with new `Error` if it's `None`
src/db/mod.rs:1306
↓ 1 callers
Method
record_read_sample
Record a sample of bytes read at the specified internal key Might schedule a background compaction.
src/db/mod.rs:547
↓ 1 callers
Method
recover
Recover DB from `db_path`. Returns the newest VersionEdit and whether we need to persistent VersionEdit to Manifest
src/db/mod.rs:556
↓ 1 callers
Method
release
(&mut self, s: Arc<Snapshot>)
src/snapshot.rs:122
↓ 1 callers
Method
remove_dir
Same as `remove_dir` or `remove_dir_all`
src/storage/mem.rs:225
↓ 1 callers
Method
reopen_for_append
Replace the current writer with a new one created from the current StringFile
src/record/mod.rs:252
↓ 1 callers
Method
replay_log_file
Replays the edits in the named log file and returns the last sequence of insertions
src/db/mod.rs:667
↓ 1 callers
Method
reset
(&mut self)
src/filter/bloom.rs:158
↓ 1 callers
Function
run_concurrent
Test concurrency read&write
src/mem/skiplist.rs:848
↓ 1 callers
Method
schedule_close_batch
Schedule a WriteBatch to close batch processing thread for gracefully shutting down db
src/db/mod.rs:820
↓ 1 callers
Method
seek
(&mut self, pos: SeekFrom)
src/record/mod.rs:131
↓ 1 callers
Method
seek
target should be an encoded `LookupKey`
src/mem/mod.rs:205
↓ 1 callers
Method
seek_to_last
(&mut self)
src/mem/skiplist.rs:294
↓ 1 callers
Method
seek_to_last
(&mut self)
src/mem/mod.rs:200
↓ 1 callers
Method
seek_to_last
(&mut self)
src/sstable/block.rs:243
↓ 1 callers
Method
separator
(&self, a: &[u8], b: &[u8])
src/sstable/mod.rs:420
↓ 1 callers
Method
set_contents
(&mut self, src: &mut Vec<u8>)
src/batch.rs:168
↓ 1 callers
Method
set_next
height, 0-based index
src/mem/inlineskiplist.rs:50
↓ 1 callers
Method
set_next_file_number
(&mut self, new: u64)
src/version/version_set.rs:267
↓ 1 callers
Method
set_offset
(&mut self, offset: u64)
src/sstable/mod.rs:241
↓ 1 callers
Method
set_size
(&mut self, size: u64)
src/sstable/mod.rs:246
↓ 1 callers
Method
should_reuse_manifest
See if we can reuse the existing MANIFEST file
src/version/version_set.rs:979
↓ 1 callers
Method
should_stop_before
Returns true iff we should stop building the current output before processing `ikey` for too much overlapping with grand parents
src/compaction.rs:231
↓ 1 callers
Method
skip_to_initial_block
Skips all blocks that are completely before `initial_offset` Returns true on success. Handles reporting.
src/record/reader.rs:348
↓ 1 callers
Method
start
(&mut self, id: usize)
src/db/mod.rs:3094
↓ 1 callers
Method
start_reading_at
(&mut self, initial_offset: u64)
src/record/mod.rs:329
↓ 1 callers
Method
successor
(&self, key: &[u8])
src/sstable/mod.rs:425
↓ 1 callers
Method
table_cache_size
Reserve `non_table_cache_files` files or so for other uses and give the rest to TableCache
src/options.rs:201
↓ 1 callers
Method
take_err
(&mut self)
src/iterator.rs:501
↓ 1 callers
Method
test_backward_scan
(&self, expected: &[(Vec<u8>, Vec<u8>)])
src/sstable/mod.rs:946
↓ 1 callers
Method
test_forward_scan
(&self, expected: &[(Vec<u8>, Vec<u8>)])
src/sstable/mod.rs:929
↓ 1 callers
Method
test_random_access
(&mut self, keys: &[Vec<u8>], expected: Vec<(Vec<u8>, Vec<u8>)>)
src/sstable/mod.rs:963
↓ 1 callers
Method
total_size
(&self)
src/mem/skiplist.rs:172
↓ 1 callers
Method
unlock
(&self)
src/record/mod.rs:176
↓ 1 callers
Method
unlock
(&self)
src/storage/mem.rs:481
↓ 1 callers
Method
valid
(&self)
src/version/mod.rs:675
↓ 1 callers
Method
valid
(&self)
src/sstable/block.rs:234
↓ 1 callers
Method
value
(&self)
src/iterator.rs:249
← previous
next →
401–500 of 886, ranked by callers