8000 GitHub - jakubpawlewicz/FST: Modern C++ Fast Succinct Trie. (Adapted from SuRF: https://github.com/efficient/SuRF).
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

jakubpawlewicz/FST

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Fast Succinct Tries (Succinct Range Filter)

FST is a fast and compact data structure. This is the source code for our SIGMOD best paper.

Install Dependencies

sudo apt-get install build-essential cmake libgtest.dev
cd /usr/src/gtest
sudo cmake CMakeLists.txt
sudo make
sudo cp *.a /usr/lib

Build

git submodule init
git submodule update
mkdir build
cd build
cmake ..
make -j

Simple Example

A simple example can be found here. To run the example:

g++ -mpopcnt -std=c++11 simple_example.cpp
./a.out

Note that the key list passed to the FST constructor must be SORTED.

Run Unit Tests

make test

License

Copyright 2018, Carnegie Mellon University

Licensed under the Apache License.

About

Modern C++ Fast Succinct Trie. (Adapted from SuRF: https://github.com/efficient/SuRF).

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 90.9%
  • C 3.2%
  • Python 3.2%
  • CMake 1.9%
  • Shell 0.8%
0