kampersanda/poplar-trie kampersanda/poplar-trie

  • Stars
    star
    56
  • Rank 530,104 (Top 11 %)
  • Language
    C++
  • License
    MIT License
  • Created almost 7 years ago
  • Updated almost 3 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
kampersanda/poplar-trie
github

kampersanda

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

C++17 implementation of memory-efficient dynamic tries

More Repositories

1

goodname

Tool to assist you with cool naming of your methods and software
Rust
124
star
2

sucds

Collection of succinct data structures in Rust
Rust
80
star
3

xcdat

Fast compressed trie dictionary library
C++
65
star
4

tongrams-rs

Rust library providing fast language model queries in compressed space
Rust
23
star
5

fast_succinct_trie

String map implementation through Fast Succinct Trie
C++
19
star
6

sif-embedding

Rust implementation of SIF and uSIF: Simple and fast sentence embedding
Rust
19
star
7

fcsd

Rust library of fast and compact string dictionary using Front-Coding
Rust
11
star
8

cda-tries

Compressed double-array tries for static string dictionaries
C++
10
star
9

dyft

C++17 Implementation of Dynamic Filter Trie
C++
9
star
10

constexpr_doublearray

C++17 implementation of constexpr double-array trie
C++
9
star
11

rcomp

C++17 implementation of online RLBWT construction in optimal-time and BWT-runs bounded space
C++
8
star
12

wordfreq-rs

Yet another Rust port of wordfreq
Rust
7
star
13

mih-rs

Fast neighbor search on binary codes
Rust
7
star
14

consistent_weighted_sampling

Software of 0-bit Consistent Weighted Sampling
C++
7
star
15

frechet_simsearch

Experimental library of approximate trajectory similarity search under FrΓ©chet distance
C++
6
star
16

succinctrits

Succinct Rank/Select Data Structures on Trits
C++
5
star
17

lzd-rs

LZ double-factor factorization in Rust
Rust
4
star
18

dynpdt

Space-efficient dynamic keyword dictionary through incremental path decomposition
C++
4
star
19

ddd

Experimental implementation of dynamic double-array dictionaries
C++
3
star
20

doublearray-go

Go implementation of double-array minimal-prefix trie
Go
3
star
21

dictionary_bench

Benchmark for dynamic keyword dictionaries
C++
3
star
22

bST

Similarity search on integer sketches using bST (b-bit sketch trie)
C++
3
star
23

small-bwt

Rust implementation of BWT construction in small space
Rust
3
star
24

simplearrayhash

Just a fast hash table for string keys
Rust
2
star
25

hmsearch

Straightforward Implementation of HmSearch
C++
1
star
26

kdtw

C++11 implementation of KDTW and its Python binding
C++
1
star