Functions — github.com/Fullstop000/wickdb

hub / github.com/Fullstop000/wickdb / functions

Functions886 in github.com/Fullstop000/wickdb

⨍ Functions 886◇ Types & classes 135

↓ 3 callersMethodcmp

(&self)

src/version/version_set.rs:1137

↓ 3 callersMethodcompact_range

Schedule a compaction for the key range `[begin, end]`.

src/db/mod.rs:226

↓ 3 callersMethodcompare

`a` and `b` should be a `LookupKey` each

src/mem/mod.rs:41

↓ 3 callersFunctioncompress_block

Compresses the give raw block by configured compression algorithm. Returns the compressed data and compression data.

src/sstable/table.rs:522

↓ 3 callersFunctionconstruct_skl_from_nodes

( nodes: Vec<(&str, usize)>, )

src/mem/skiplist.rs:392

↓ 3 callersMethodfile_size

(&self)

src/sstable/table.rs:481

↓ 3 callersMethodfind_less_than

Find the nearest node with a key < the given key. Return head if there is no such node.

src/mem/skiplist.rs:211

↓ 3 callersMethodfind_next_user_entry

Try to point the inner iter to yield a internal key whose user key is greater than previous user key with sequence limitation. We only need to find th

src/db/iterator.rs:216

↓ 3 callersMethodfind_shard

(&self, k: &K)

src/cache/mod.rs:85

↓ 3 callersMethodfind_smallest

(&mut self)

src/iterator.rs:451

↓ 3 callersMethodfind_splice_for_level

( &self, key: &[u8], mut before: *mut Node, height: usize, )

src/mem/inlineskiplist.rs:314

↓ 3 callersMethodfind_table

Try to find the sst file from cache. If not found, try to find the file from storage and insert it into the cache

src/table_cache.rs:50

↓ 3 callersMethodfinish

Appends the trailer of filter block and returns the filter block data in bytes

src/sstable/filter_block.rs:81

↓ 3 callersMethodfinish_output_file

Finish the current output file by calling `builder.finish` and insert it into the table cache

src/db/mod.rs:1353

↓ 3 callersMethodflush

Flushes any buffered key/value pairs to file. Can be used to ensure that two adjacent entries never live in the same data block. Most clients should n

src/sstable/table.rs:370

↓ 3 callersMethodfor_each_child

(&mut self, mut f: F)

src/iterator.rs:481

↓ 3 callersFunctiongen

Extract gen

src/mem/skiplist.rs:648

↓ 3 callersMethodget

Search the value by the given key in sstables level by level

src/version/mod.rs:130

↓ 3 callersMethodget_child

(&self, i: usize)

src/iterator.rs:473

↓ 3 callersMethodget_height

(&self)

src/mem/inlineskiplist.rs:338

↓ 3 callersFunctionget_internal_key

(mut src: &mut &[u8])

src/version/version_edit.rs:435

↓ 3 callersFunctionget_level

(max_levels: usize, src: &mut &[u8])

src/version/version_edit.rs:439

↓ 3 callersMethodinc_next_file_number

(&mut self)

src/version/version_set.rs:273

↓ 3 callersMethodincrement_byte

(&mut self, offset: usize, delta: u8)

src/record/mod.rs:279

↓ 3 callersMethodinsert_into

Insert all the records in the batch into the given `MemTable`

src/batch.rs:118

↓ 3 callersMethodis_dir

(&self)

src/storage/mem.rs:374

↓ 3 callersMethodis_empty

(&self)

src/storage/mod.rs:70

↓ 3 callersMethodkey

(&self)

src/sstable/mod.rs:621

↓ 3 callersMethodlevel_summary

Return a String includes number of files in every level

src/version/mod.rs:247

↓ 3 callersMethodmark_file_number_used

Forward to `num + 1` as the next file number

src/version/version_set.rs:800

↓ 3 callersFunctionmask

Return a masked representation of crc. Motivation: it is problematic to compute the CRC of a string that contains embedded CRCs. Therefore we recomm

src/util/crc32.rs:36

↓ 3 callersMethodmax_grandparent_overlap_bytes

Maximum bytes of overlaps in grandparent (i.e., level+2) before we stop building a single file in a level-> level+1 compaction.

src/options.rs:182

↓ 3 callersFunctionnew_test_builder

()

src/sstable/filter_block.rs:210

↓ 3 callersFunctionnew_test_reader

(block: Vec<u8>)

src/sstable/filter_block.rs:213

↓ 3 callersMethodnext

(&mut self)

src/mem/skiplist.rs:309

↓ 3 callersMethodoverlap_in_level

Returns true iff some file in the specified level overlaps some part of `[smallest_ukey,largest_ukey]`. `smallest_ukey` is `None` represents a key sma

src/version/mod.rs:438

↓ 3 callersMethodpanic_valid

(&self)

src/mem/skiplist.rs:354

↓ 3 callersMethodprev

(&mut self)

src/sstable/mod.rs:617

↓ 3 callersMethodread_record

Read the next complete record into given `buf`. Returns true if read successfully, false if we hit end of the input.

src/record/reader.rs:108

↓ 3 callersMethodrename

(&self, old: P, new: P)

src/storage/mem.rs:294

↓ 3 callersMethodresult

(&self)

src/util/reporter.rs:38

↓ 3 callersMethodseek

find first node, key <= node.key

src/mem/inlineskiplist.rs:371

↓ 3 callersMethodseek_to_first

(&mut self)

src/mem/skiplist.rs:283

↓ 3 callersMethodseek_to_first

(&mut self)

src/mem/inlineskiplist.rs:362

↓ 3 callersMethodseek_to_first

(&mut self)

src/sstable/block.rs:238

↓ 3 callersMethodseek_to_last

(&mut self)

src/sstable/mod.rs:604

↓ 3 callersMethodset_next

(&self, height: usize, node: *mut Node)

src/mem/skiplist.rs:72

↓ 3 callersMethodset_prev_log_number

(&mut self, num: u64)

src/version/version_edit.rs:213

↓ 3 callersMethodskip_forward

Skip invalid results util finding a valid derived iter by `next()` If found, set derived iter to the first

src/iterator.rs:147

↓ 3 callersMethodvalid_or_panic

(&self)

src/sstable/block.rs:221

↓ 3 callersMethodwrite_level0_files

Persistent given memtable into a single sst file to level0. If `into_base` is true, the file could be pushed into level1 or level2 if there's no too m

src/version/version_set.rs:581

↓ 2 callersMethodapproximate_memory_usage

(&self)

src/mem/mod.rs:86

↓ 2 callersMethodapproximate_offset_of

Return the approximate offset in the database of the data for given `ikey` in this version

src/version/mod.rs:455

↓ 2 callersMethodassert_dir_exists

(&self, target: P)

src/storage/mem.rs:611

↓ 2 callersFunctionassert_encode_decode

(edit: &VersionEdit)

src/version/version_edit.rs:454

↓ 2 callersFunctionassert_encoded_decoded

(key: &str, seq: u64, vt: ValueType)

src/db/format.rs:436

↓ 2 callersMethodassert_file_exists

(&self, target: P)

src/storage/mem.rs:607

↓ 2 callersMethodassert_get

(&self, key: u32, want: u32)

src/cache/lru.rs:297

↓ 2 callersMethodassert_num

(&self, key: u32, want: bool, silent: bool)

src/filter/bloom.rs:148

↓ 2 callersMethodblock_reader

Converts an BlockHandle into an iterator over the contents of the corresponding block.

src/sstable/table.rs:118

↓ 2 callersMethodchange

Change the ReaderState to given `s` and wake up all the threads waiting for this

src/mem/skiplist.rs:839

↓ 2 callersMethodcheck_offset_past_end_returns_no_records

ensure that a reader never read a record from a offset beyond the whole file

src/record/mod.rs:339

↓ 2 callersMethodclear

(&mut self)

src/batch.rs:111

↓ 2 callersMethodcompact_mem_table

Compact immutable memory table to level0 files

src/db/mod.rs:963

↓ 2 callersMethodcompare

(&self, a: &[u8], b: &[u8])

src/db/format.rs:277

↓ 2 callersMethodcorruption_err

(&mut self)

src/sstable/block.rs:213

↓ 2 callersMethoddecoded_from

(&mut self, src: &[u8])

src/version/version_edit.rs:273

↓ 2 callersMethoddestroy

(&mut self)

src/db/mod.rs:160

↓ 2 callersFunctionextend

(crc: u32, data: &[u8])

src/util/crc32.rs:25

↓ 2 callersFunctionextract_seq_number

(key: &[u8])

src/db/format.rs:386

↓ 2 callersMethodfill_levels

Prevent pushing of new sstables into deeper levels by adding tables that cover a specified range to all levels

src/db/mod.rs:1769

↓ 2 callersMethodfind_largest

(&mut self)

src/iterator.rs:462

↓ 2 callersMethodfind_last

Find the last node

src/mem/skiplist.rs:237

↓ 2 callersMethodfind_last

(&self)

src/mem/inlineskiplist.rs:292

↓ 2 callersMethodfind_prev_user_key

Try to point the inner iter to yield a internal key whose user key is less than previous user key with sequence limitation. Different with `find_next_

src/db/iterator.rs:265

↓ 2 callersFunctionfind_smallest_boundary_file

Iterate all the files in level until find the file whose smallest key has same user key and greater sequence number by `InternalComparator` ( actually

src/version/version_set.rs:1041

↓ 2 callersMethodfor_not_ith

(&mut self, n: usize, mut f: F)

src/iterator.rs:490

↓ 2 callersMethodgenerate_filter

Converts 'keys' to an encoded filter vec by 'policy'

src/sstable/filter_block.rs:98

src/mem/skiplist.rs:637

↓ 2 callersMethodget_child_mut

(&mut self, i: usize)

src/iterator.rs:477

↓ 2 callersMethodget_level_files

(&self, level: usize)

src/version/mod.rs:341

↓ 2 callersMethodget_sequence

(&self)

src/batch.rs:191

↓ 2 callersMethodhas_bg_error

(&self)

src/db/mod.rs:1318

↓ 2 callersFunctionhash_numbers

(k: u64, g: u64)

src/mem/skiplist.rs:657

↓ 2 callersMethodinit_allowed_seeks

(&self)

src/version/version_edit.rs:86

↓ 2 callersMethodinternal_get

Finds the first entry with the key equal or greater than target and returns the block iterator direclty The given `key` is an internal key so the `cm

src/sstable/table.rs:154

↓ 2 callersMethodinternal_iter

(&self, read_opt: ReadOptions)

src/db/mod.rs:397

↓ 2 callersMethodis_empty

(&self)

src/snapshot.rs:69

↓ 2 callersMethodis_empty

(&self)

src/util/slice.rs:51

↓ 2 callersMethodis_manifest

(&self)

src/storage/mem.rs:407

↓ 2 callersMethodis_trivial_move

Is this a trivial compaction that can be implemented by just moving a single input file to the next level (no merging or splitting) TODO: improve this

src/compaction.rs:156

↓ 2 callersMethoditers_len

(&self)

src/version/version_set.rs:1141

↓ 2 callersMethoditers_len

(&self)

src/db/iterator.rs:342

↓ 2 callersFunctionkey_is_before_file

used for biggest user key

src/version/mod.rs:623

↓ 2 callersMethodlock

(&self)

src/storage/mem.rs:477

↓ 2 callersMethodmanual_compact_range

Schedules a manual compaction for the key range `[begin, end]` and waits util the compaction completes

src/db/mod.rs:1034

↓ 2 callersMethodmaybe_append_index_block

Add a key into the index block if neccessary

src/sstable/table.rs:494

↓ 2 callersMethodname

(&self)

src/mem/mod.rs:52

↓ 2 callersMethodname

(&self)

src/sstable/mod.rs:416

← previous next →201–300 of 886, ranked by callers