| LOW | cliff.toml | 61 | |
| LOW | columnar/src/dynamic_column.rs | 241 | pub fn open(&self) -> io::Result<DynamicColumn> { |
| LOW | columnar/src/lib.rs | 1 | //! # Tantivy-Columnar |
| LOW | columnar/src/value.rs | 101 | 1 => Ok(NumericalType::U64), |
| LOW | columnar/src/dictionary.rs | 21 | |
| LOW | columnar/src/columnar/merge/mod.rs | 61 | /// input columnars, the first type compatible out of i64, u64, f64 in that order will be used. |
| LOW | columnar/src/columnar/merge/tests.rs | 41 | let columnar2 = make_columnar("numbers", &[2u64]); |
| LOW | columnar/src/column_index/multivalued_index.rs | 101 | } |
| LOW | columnar/src/column_index/multivalued_index.rs | 241 | } |
| LOW | columnar/src/column_index/multivalued_index.rs | 281 | pub fn num_docs(&self) -> u32 { |
| LOW | columnar/src/column_index/mod.rs | 141 | row_start..row_end |
| LOW | columnar/src/column_index/optional_index/mod.rs | 41 | pub fn num_bytes_in_block(&self) -> u32 { |
| LOW | columnar/src/column_index/optional_index/mod.rs | 61 | /// block] |
| LOW | columnar/src/column_values/monotonic_mapping.rs | 21 | fn from_u64(val: u64) -> Self; |
| LOW | columnar/src/column_values/mod.rs | 41 | |
| LOW | columnar/src/column_values/mod.rs | 141 | } |
| 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; |
| 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. |
| LOW | columnar/src/column_values/u64_based/line.rs | 41 | // This is outside of realm we handle. |
| LOW | columnar/src/column_values/u64_based/line.rs | 81 | return Line::default(); |
| LOW | columnar/src/column_values/u64_based/line.rs | 101 | // Without sorting our values, this is a difficult problem. |
| LOW | columnar/src/column_values/u64_based/mod.rs | 21 | use crate::iterable::Iterable; |
| LOW | sstable/src/block_match_automaton.rs | 41 | for kb in &start_key[0..common_prefix_len] { |
| LOW | sstable/src/block_match_automaton.rs | 61 | // e.* | |
| LOW | sstable/src/block_match_automaton.rs | 81 | // p |
| LOW | sstable/src/lib.rs | 1 | //! `tantivy_sstable` is a crate that provides a sorted string table data structure. |
| LOW | sstable/src/lib.rs | 21 | //! builder.insert(b"banana", &2).unwrap(); |
| LOW | sstable/src/streamer.rs | 261 | /// If the end of the stream as been reached, and `.next()` |
| LOW | sstable/src/dictionary.rs | 21 | /// to any kind of typed values. |
| LOW | sstable/src/dictionary.rs | 161 | block_addr: BlockAddr, |
| LOW | sstable/src/dictionary.rs | 421 | /// lower_bound: Bound::Included(aaa) => Included(0) // "Next" term id |
| LOW | sstable/src/index/v3.rs | 561 | max_slope_idx = index; |
| LOW | stacker/src/fastcmp.rs | 1 | /// fastcmp employs a trick to speed up the comparison of two slices of bytes. |
| LOW | stacker/src/arena_hashmap.rs | 1 | use super::{Addr, MemoryArena}; |
| LOW | stacker/src/arena_hashmap.rs | 61 | } |
| LOW | stacker/src/expull.rs | 1 | use std::mem; |
| LOW | stacker/src/expull.rs | 21 | /// It combines the idea of the unrolled linked list and tries to address the |
| LOW | stacker/src/shared_arena_hashmap.rs | 41 | fn is_empty(&self) -> bool { |
| LOW | stacker/src/shared_arena_hashmap.rs | 281 | let v = memory_arena.read(val_addr); |
| LOW | stacker/src/memory_arena.rs | 1 | //! 32-bits Memory arena for types implementing `Copy`. |
| LOW | stacker/src/memory_arena.rs | 21 | //! access them as references. |
| LOW | tokenizer-api/src/lib.rs | 1 | //! Tokenizer are in charge of chopping text into a stream of tokens |
| LOW | common/src/group_by.rs | 1 | use std::cell::RefCell; |
| LOW | common/src/lib.rs | 41 | fn len(&self) -> usize { |
| LOW | common/src/lib.rs | 61 | /// |
| LOW | common/src/lib.rs | 81 | /// For simplicity, tantivy internally handles `f64` as `u64`. |
| LOW | common/src/file_slice.rs | 281 | |
| LOW | common/src/datetime.rs | 21 | Milliseconds, |
| LOW | common/src/bitset.rs | 161 | // `trailing_zeros` and the bit-clear in parallel instead of |
| LOW | examples/index_from_multiple_threads.rs | 1 | // # Indexing from different threads. |
| LOW | examples/iterating_docs_and_positions.rs | 1 | // # Iterating docs and positions. |
| LOW | examples/iterating_docs_and_positions.rs | 41 | // (Because we indexed a very small number of documents over one thread |
| LOW | examples/iterating_docs_and_positions.rs | 101 | // and the [`Postings`](https://docs.rs/tantivy/~0/tantivy/trait.Postings.html) trait |
| LOW | examples/deleting_updating_documents.rs | 1 | // # Deleting and Updating (?) documents |
| LOW | examples/deleting_updating_documents.rs | 41 | |
| LOW | examples/deleting_updating_documents.rs | 101 | // # Update = Delete + Insert |
| LOW | examples/faceted_search.rs | 1 | // # Faceted Search |
| LOW | examples/aggregation.rs | 21 | // category, stock and price will be fast fields as that's the requirement |
| LOW | examples/aggregation.rs | 181 | // In this Aggregation we want to get the average price for different groups, depending on how |
| LOW | examples/basic_search.rs | 1 | // # Basic Example |
| 367 more matches not shown… |