plane_trie

Read only Trie (patricia like tree).

Build from sorted string list. Load via mmap. Nodes are stored in postorder i.e root is last.

build from splited sorted file. nodes are writen in file in postorder.

TODO: merge tries

half_trie: words are plited in two parts prefix_trie - plane trie build of prefixes second_tries - set of tries. each corresponds to it's own prefix.

first: search for prefix in prefix trie second: search for rest of the word in corresponding second trie

TODO: UT for half trie

TODO: fb-trie - two half_tries one with words in straight order - another with reversed words TODO: UT for fb-trie

BUILD: cmake -DCMAKE_INCLUDE_PATH=../gtest-svn/include/ -DCMAKE_LIBRARY_PATH=../gtest-build/ .

Name		Name	Last commit message	Last commit date
Latest commit History 22 Commits
.gitignore		.gitignore
CMakeLists.txt		CMakeLists.txt
README.md		README.md
ask_half_trie.cpp		ask_half_trie.cpp
ask_plane_trie.cpp		ask_plane_trie.cpp
build_half_trie.cpp		build_half_trie.cpp
build_index.cpp		build_index.cpp
build_trie.cpp		build_trie.cpp
file_adapter.h		file_adapter.h
file_adapter_test.cpp		file_adapter_test.cpp
file_writer.hpp		file_writer.hpp
fuzzy_intersection_plane_trie.cpp		fuzzy_intersection_plane_trie.cpp
fuzzy_search_plane_trie.cpp		fuzzy_search_plane_trie.cpp
half_trie.hpp		half_trie.hpp
half_trie_build.hpp		half_trie_build.hpp
istream_adapter.h		istream_adapter.h
istream_adapter_test.cpp		istream_adapter_test.cpp
mmap.hpp		mmap.hpp
plane_index.hpp		plane_index.hpp
plane_trie.hpp		plane_trie.hpp
plane_trie_build.hpp		plane_trie_build.hpp
plane_trie_test.cpp		plane_trie_test.cpp
queue.hpp		queue.hpp
queue_test.cpp		queue_test.cpp
round_up_test.cpp		round_up_test.cpp
string_less_test.cpp		string_less_test.cpp
temp_node.hpp		temp_node.hpp
types.hpp		types.hpp
utils.hpp		utils.hpp

Provide feedback