• Home
Name Date Size #Lines LOC

..--

lib/03-May-2024-6,1885,274

tests/03-May-2024-2,7452,200

tools/03-May-2024-1,9971,710

v0_1_5/03-May-2024-13,83612,076

AUTHORSD03-May-202428 21

Android.mkD03-May-20242 KiB7142

COPYINGD03-May-20241.4 KiB117

ChangeLogD03-May-20240

INSTALLD03-May-20249.3 KiB238179

MODULE_LICENSE_BSD_LIKED03-May-20240

Makefile.amD03-May-202475 64

Makefile.inD03-May-202420.5 KiB666581

NEWSD03-May-20240

READMED03-May-20241.5 KiB5637

README.androidD03-May-2024662 2116

aclocal.m4D03-May-202433.8 KiB952857

android_diff.txtD03-May-202416.5 KiB520477

configureD03-May-2024188 KiB6,6315,475

configure.acD03-May-2024889 4234

depcompD03-May-202417.4 KiB590375

install-shD03-May-202413.3 KiB520344

missingD03-May-202410.9 KiB368275

README

1- Project name
2
3marisa-trie
4http://code.google.com/p/marisa-trie/
5
6- Project summary
7
8Matching Algorithms with Recursively Implemented StorAge
9
10- Version
11
120.1.4
13
14- Description
15
16This project *marisa-trie* provides a C++ library *libmarisa* and command line tools *`marisa-*`* for building and operating nesting patricia tries. The brand-new dictionary structure is designed to be static and space efficient. Also, *marisa-trie* enables not only simple lookups but also prefix searches and predictive searches.
17
18 * Prefix searches are to find keys from prefixes of a given query.
19 * Predictive searches are to find keys starting with a given query.
20
21The biggest advantage of *marisa-trie* is that it can build a considerably compact dictionary. See below for the size of dictionaries built with various trie implementations.
22
23 * Input
24  * Source: enwiki-20110115-all-titles-in-ns0.gz
25  * Contents: all page titles of English Wikipedia (Jan. 2011)
26  * Number of keys: 8,279,325
27  * Total size: 167,223,035 bytes (plain) / 46,344,646 bytes (gzipped)
28
29|| *Implementation* || *Size (bytes)* || *Remarks*                   ||
30||  darts-clone     ||   316,065,792  || Compacted double-array trie ||
31||  tx-trie         ||   107,119,864  || LOUDS-based trie            ||
32|| *marisa-trie*    ||   *42,688,271* || Nesting patricia trie       ||
33
34 * Documentation (in Japanese)
35  * HowTo
36  * ListOfTools
37  * LibraryInterface
38  * BenchmarkResults
39
40- Version control system
41
42Subversion
43
44- Source code license
45
46New BSD License
47
48- Project labels
49
50Nesting
51Patricia
52Trie
53Static
54Dictionary
55CPlusPlus
56

README.android

1URL: http://marisa-trie.googlecode.com/files/marisa-0.1.4.tar.gz
2Version: 0.1.4
3License: New BSD
4License File: LICENSE
5
6Description:
7C++ library providing implementation of Matching
8Algorithm with Recursively Implemented StorAge (MARISA) -- static and
9space-efficient trie data structure.
10
11
12Homepage: http://code.google.com/p/marisa-trie/
13
14Local Modifications:
15- Remove files under vs2008/ as we don't need to build under
16  visual studio.
17- Changes to string.h to avoid a header collision with the C
18  standard header with the same name.
19- Apply patch 30551945 from alexgru to fix a critical bug.
20- Remove all the exceptions: see <android_diff.txt> for details.
21