| LOW | cliff.toml | 61 | | COMMENT |
| LOW | columnar/src/dynamic_column.rs | 321 | #[doc(hidden)] | COMMENT |
| LOW | columnar/src/lib.rs | 1 | //! # Tantivy-Columnar | COMMENT |
| LOW | columnar/src/value.rs | 101 | 1 => Ok(NumericalType::U64), | COMMENT |
| LOW | columnar/src/dictionary.rs | 21 | | COMMENT |
| LOW | columnar/src/columnar/merge/mod.rs | 61 | /// If several columns with the same name are conflicting with the numerical types in the | COMMENT |
| LOW | columnar/src/columnar/merge/tests.rs | 41 | let columnar2 = make_columnar("numbers", &[2u64]); | COMMENT |
| LOW | columnar/src/columnar/writer/mod.rs | 41 | /// | COMMENT |
| LOW | columnar/src/columnar/writer/mod.rs | 81 | /// Returns the list of doc ids from 0..num_docs sorted by the `sort_field` | COMMENT |
| LOW | columnar/src/column_index/multivalued_index.rs | 101 | } | COMMENT |
| LOW | columnar/src/column_index/multivalued_index.rs | 301 | /// Converts a list of ranks (row ids of values) in a 1:n index to the corresponding list of | COMMENT |
| LOW | columnar/src/column_index/mod.rs | 161 | // * doc_id_range.start and doc_id_range.end may not exist, but docids in | COMMENT |
| LOW | columnar/src/column_index/optional_index/mod.rs | 41 | pub fn num_bytes_in_block(&self) -> u32 { | COMMENT |
| LOW | columnar/src/column_index/optional_index/mod.rs | 61 | /// block] | COMMENT |
| LOW | …ar/src/column_index/optional_index/set_block/sparse.rs | 201 | } | COMMENT |
| LOW | columnar/src/column/plain/mod.rs | 1 | //! Plain-encoded `Str` and `Bytes` columns. | COMMENT |
| LOW | columnar/src/column/plain/block/onpair16_block.rs | 1 | //! Blocks compressed with OnPair16. | COMMENT |
| LOW | columnar/src/column/plain/block/onpair16_block.rs | 41 | /// Maximum dictionary budget, in bits: a dictionary has at most `2^MAX_CODE_BITS` tokens. | COMMENT |
| LOW | columnar/src/column/plain/block/raw_block.rs | 1 | //! Blocks storing their values as is. | COMMENT |
| LOW | columnar/src/column_values/monotonic_mapping.rs | 21 | /// | COMMENT |
| LOW | columnar/src/column_values/mod.rs | 41 | | COMMENT |
| LOW | columnar/src/column_values/mod.rs | 141 | if value_range.contains(&val) { | COMMENT |
| LOW | …values/u128_based/compact_space/build_compact_space.rs | 101 | let saved_bits = (amplitude_bits - amplitude_new_bits) as usize * total_num_values as usize; | COMMENT |
| LOW | …mnar/src/column_values/u128_based/compact_space/mod.rs | 1 | /// This codec takes a large number space (u128) and reduces it to a compact number space. | COMMENT |
| LOW | columnar/src/column_values/u64_based/line.rs | 41 | // This is outside of realm we handle. | COMMENT |
| LOW | columnar/src/column_values/u64_based/line.rs | 81 | return Line::default(); | COMMENT |
| LOW | columnar/src/column_values/u64_based/line.rs | 101 | // Without sorting our values, this is a difficult problem. | COMMENT |
| LOW | columnar/src/column_values/u64_based/mod.rs | 21 | use crate::iterable::Iterable; | COMMENT |
| LOW | sstable/src/block_match_automaton.rs | 41 | for kb in &start_key[0..common_prefix_len] { | COMMENT |
| LOW | sstable/src/block_match_automaton.rs | 61 | // e.* | | COMMENT |
| LOW | sstable/src/block_match_automaton.rs | 81 | // p | COMMENT |
| LOW | sstable/src/lib.rs | 1 | //! `tantivy_sstable` is a crate that provides a sorted string table data structure. | COMMENT |
| LOW | sstable/src/lib.rs | 21 | //! builder.insert(b"banana", &2).unwrap(); | COMMENT |
| LOW | sstable/src/lib.rs | 261 | /// Returns the last inserted key. | COMMENT |
| LOW | sstable/src/dictionary.rs | 21 | /// An SSTable is a sorted map that associates sorted `&[u8]` keys | COMMENT |
| LOW | sstable/src/dictionary.rs | 181 | | COMMENT |
| LOW | sstable/src/dictionary.rs | 401 | | COMMENT |
| LOW | sstable/src/index/v3.rs | 561 | max_slope_idx = index; | COMMENT |
| LOW | stacker/src/fastcmp.rs | 1 | /// fastcmp employs a trick to speed up the comparison of two slices of bytes. | COMMENT |
| LOW | stacker/src/arena_hashmap.rs | 1 | use super::{Addr, MemoryArena}; | COMMENT |
| LOW | stacker/src/arena_hashmap.rs | 61 | } | COMMENT |
| LOW | stacker/src/expull.rs | 1 | use std::mem; | COMMENT |
| LOW | stacker/src/expull.rs | 21 | /// It combines the idea of the unrolled linked list and tries to address the | COMMENT |
| LOW | stacker/src/shared_arena_hashmap.rs | 41 | fn is_empty(&self) -> bool { | COMMENT |
| LOW | stacker/src/shared_arena_hashmap.rs | 281 | let v = memory_arena.read(val_addr); | COMMENT |
| LOW | stacker/src/memory_arena.rs | 1 | //! 32-bits Memory arena for types implementing `Copy`. | COMMENT |
| LOW | stacker/src/memory_arena.rs | 21 | //! access them as references. | COMMENT |
| LOW | tokenizer-api/src/lib.rs | 1 | //! Tokenizer are in charge of chopping text into a stream of tokens | COMMENT |
| LOW | common/src/group_by.rs | 1 | use std::cell::RefCell; | COMMENT |
| LOW | common/src/key_tracking.rs | 1 | /// Initial capacity of the `Vec<u8>` key buffer, large enough for most keys. | COMMENT |
| LOW | common/src/lib.rs | 61 | /// in that order. | COMMENT |
| LOW | common/src/lib.rs | 81 | } | COMMENT |
| LOW | common/src/file_slice.rs | 281 | | COMMENT |
| LOW | common/src/datetime.rs | 21 | Milliseconds, | COMMENT |
| LOW | common/src/datetime.rs | 81 | } | COMMENT |
| LOW | common/src/bitset.rs | 161 | // `trailing_zeros` and the bit-clear in parallel instead of | COMMENT |
| LOW | examples/index_from_multiple_threads.rs | 1 | // # Indexing from different threads. | COMMENT |
| LOW | examples/iterating_docs_and_positions.rs | 1 | // # Iterating docs and positions. | COMMENT |
| LOW | examples/iterating_docs_and_positions.rs | 41 | // (Because we indexed a very small number of documents over one thread | COMMENT |
| LOW | examples/iterating_docs_and_positions.rs | 101 | // and the [`Postings`](https://docs.rs/tantivy/~0/tantivy/trait.Postings.html) trait | COMMENT |
| 450 more matches not shown… |
Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).