Files

arrayvec

array.rsarray_string.rschar.rserrors.rslib.rsmaybe_uninit_nodrop.rsrange.rs

cfg_if

lib.rs

crossbeam_deque

lib.rs

crossbeam_epoch

sync

list.rsmod.rsqueue.rs

atomic.rscollector.rsdefault.rsdeferred.rsepoch.rsgarbage.rsguard.rsinternal.rslib.rs

crossbeam_utils

atomic_option.rscache_padded.rslib.rsscoped.rs

either

lib.rs

fid_rs

fid

block.rsblocks.rschunk.rschunks.rsfid.rsfid_iter.rs

internal_data_structure

popcount_table.rsraw_bit_vector.rs

fid.rsinternal_data_structure.rslib.rs

fst_rs

lib.rs

lazy_static

inline_lazy.rslib.rs

libc

unix

notbsd

linux

other

b64

mod.rsnot_x32.rsx86_64.rs

align.rsmod.rs

align.rsmod.rs

mod.rs

align.rsmod.rs

lib.rsmacros.rs

memoffset

lib.rsoffset_of.rsspan_of.rs

nodrop

lib.rs

num_cpus

lib.rs

rayon

collections

binary_heap.rsbtree_map.rsbtree_set.rshash_map.rshash_set.rslinked_list.rsmod.rsvec_deque.rs

compile_fail

cannot_collect_filtermap_data.rscannot_zip_filtered_data.rscell_par_iter.rsmod.rsmust_use.rsno_send_par_iter.rsrc_par_iter.rs

iter

collect

consumer.rsmod.rs

find_first_last

mod.rs

plumbing

mod.rs

chain.rschunks.rscloned.rsempty.rsenumerate.rsextend.rsfilter.rsfilter_map.rsfind.rsflat_map.rsflatten.rsfold.rsfor_each.rsfrom_par_iter.rsinspect.rsinterleave.rsinterleave_shortest.rsintersperse.rslen.rsmap.rsmap_with.rsmod.rsnoop.rsonce.rspar_bridge.rsproduct.rsreduce.rsrepeat.rsrev.rsskip.rssplitter.rssum.rstake.rstry_fold.rstry_reduce.rstry_reduce_with.rsunzip.rsupdate.rswhile_some.rszip.rszip_eq.rs

slice

mergesort.rsmod.rsquicksort.rs

delegate.rslib.rsmath.rsoption.rspar_either.rsprelude.rsprivate.rsrange.rsresult.rssplit_producer.rsstr.rsvec.rs

rayon_core

compile_fail

mod.rsquicksort_race1.rsquicksort_race2.rsquicksort_race3.rsrc_return.rsrc_upvar.rsscope_join_bad.rs

join

mod.rs

scope

mod.rs

sleep

mod.rs

spawn

mod.rs

thread_pool

mod.rs

job.rslatch.rslib.rslog.rsregistry.rsunwind.rsutil.rs

scopeguard

lib.rs

>

//! FST (Fast Succinct Trie) implementation in Rust.
//!
//! [Master API Docs](https://laysakura.github.io/fst-rs/fst_rs/)
//! |
//! [Released API Docs](https://docs.rs/crate/fst-rs)
//! |
//! [Benchmark Results](https://laysakura.github.io/fst-rs/criterion/report/)
//! |
//! [Changelog](https://github.com/laysakura/fst-rs/blob/master/CHANGELOG.md)
//!
//! [![Build Status](https://travis-ci.com/laysakura/fst-rs.svg?branch=master)](https://travis-ci.com/laysakura/fst-rs)
//! [![Crates.io Version](https://img.shields.io/crates/v/fst-rs.svg)](https://crates.io/crates/fst-rs)
//! [![Crates.io Downloads](https://img.shields.io/crates/d/fst-rs.svg)](https://crates.io/crates/fst-rs)
//! [![Minimum rustc version](https://img.shields.io/badge/rustc-1.33+-lightgray.svg)](https://github.com/laysakura/fst-rs#rust-version-supports)
//! [![License: MIT](https://img.shields.io/badge/license-MIT-blue.svg)](https://github.com/laysakura/fst-rs/blob/master/LICENSE-MIT)
//! [![License: Apache 2.0](https://img.shields.io/badge/license-Apache_2.0-blue.svg)](https://github.com/laysakura/fst-rs/blob/master/LICENSE-APACHE)
//!
//! FST is a building block of SuRF (Succinct Range Filter).
//! SuRF and FST is first introduced in the [SIGMOD 2018 best paper](http://www.pdl.cmu.edu/PDL-FTP/Storage/surf_sigmod18.pdf).
//!
//! FST is a memory efficient and high performance trie.
//! FST is like LOUDS based trie (e.g. [trie-rs](https://github.com/laysakura/trie-rs)) but does not use pure LOUDS.
//! It instead uses LOUDS-DS (abbrev of LOUDS-Dense & LOUDS-Sparse), which uses bitmap-based encoding (fast but fat) for upper levels of a trie tree and LOUDS-based encoding (slow but memory-efficient) for lower levels.
//!
//! # Quickstart
//!
//! To use fst-rs, add the following to your `Cargo.toml` file:
//!
//! ```toml
//! [dependencies]
//! fst-rs = "0.1"  # NOTE: Replace to latest minor version.
//! ```
//!
//! ## Usage Overview
//! (TBD)
//!
//! # Features
//! (TBD)