GitHub - tomilov/freq: Fastest possible (?) counting of words frequencies in a text. 450MB/s on Ivy bridge · GitHub

Name		Name	Last commit message	Last commit date
.clang-format		.clang-format
.gitignore		.gitignore
CMakeLists.txt		CMakeLists.txt
Makefile		Makefile
README.md		README.md
absl.cpp		absl.cpp
array_hash.cpp		array_hash.cpp
boost.cpp		boost.cpp
common.hpp		common.hpp
dense_hash_map.cpp		dense_hash_map.cpp
emilib.cpp		emilib.cpp
folly.cpp		folly.cpp
freq.sh		freq.sh
helpers.hpp		helpers.hpp
hopscotch_map.cpp		hopscotch_map.cpp
io.hpp		io.hpp
oaph.cpp		oaph.cpp
ordered_map.cpp		ordered_map.cpp
pb_ds.cpp		pb_ds.cpp
robin_map.cpp		robin_map.cpp
run.bash		run.bash
ska.cpp		ska.cpp
sparse_hash_map.cpp		sparse_hash_map.cpp
sparse_map.cpp		sparse_map.cpp
sparsest.cpp		sparsest.cpp
spp.cpp		spp.cpp
timer.hpp		timer.hpp
trie.cpp		trie.cpp
unordered_map.cpp		unordered_map.cpp

Repository files navigation

trie.cpp - trie
oaph.cpp - open addressing perfect hash (fastest here)

About

Fastest possible (?) counting of words frequencies in a text. 450MB/s on Ivy bridge

habr.com/ru/post/575108/

hash-table trie words-counter

4 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages