Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/azrafe7/hxtstree

A Ternary Search Tree in Haxe 3.1+.
https://github.com/azrafe7/hxtstree

Last synced: 11 days ago
JSON representation

A Ternary Search Tree in Haxe 3.1+.

Host: GitHub
URL: https://github.com/azrafe7/hxtstree
Owner: azrafe7
License: mit
Created: 2014-10-12T17:08:15.000Z (about 10 years ago)
Default Branch: master
Last Pushed: 2014-11-06T00:35:26.000Z (about 10 years ago)
Last Synced: 2024-11-05T13:22:35.528Z (about 2 months ago)
Language: Haxe
Homepage:
Size: 5.04 MB
Stars: 4
Watchers: 3
Forks: 1
Open Issues: 1
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        hxTSTree

========

A [Ternary Search Tree](http://en.wikipedia.org/wiki/Ternary_search_tree) in Haxe 3.1+.

[![demo](screenshots/screenshot.png)](https://dl.dropboxusercontent.com/u/32864004/dev/FPDemo/hxTSTreeDemo.swf)

[online swf demo](https://dl.dropboxusercontent.com/u/32864004/dev/FPDemo/hxTSTreeDemo.swf)

Based on Dr. Dobbs article ([http://www.drdobbs.com/database/ternary-search-trees/184410528](http://www.drdobbs.com/database/ternary-search-trees/184410528)).

**Features:**

 - Multiple search types (exact, prefix, pattern, [Hamming distance](http://en.wikipedia.org/wiki/Hamming_distance), [Levenshtein distance](http://en.wikipedia.org/wiki/Levenshtein_distance), prev/next)

 - Multiple insert modes (sequential, random, balanced)

 - Serialization/Unserialization

 - Association of arbitrary data to keys (~like a `Map`)

 - Returned keys (/data) are given in sorted order

 - DOT format file writer (for visualization with tools like [Graphviz](http://www.graphviz.org/)) 

## Internal representation (with [`fruit.txt`](assets/fruit.txt) word list)

**TSTree.bulkInsert() - sequential**

[![](screenshots/bulkInsert.png)](https://github.com/azrafe7/hxTSTree/raw/master/bulkInsert.png)

**TSTree.randomBulkInsert() - random**

[![](screenshots/randomBulkInsert.png)](https://github.com/azrafe7/hxTSTree/raw/master/randomBulkInsert.png)

**TSTree.balancedBulkInsert() - balanced**

[![](screenshots/balancedBulkInsert.png)](https://github.com/azrafe7/hxTSTree/raw/master/balancedBulkInsert.png)

## References

 - [http://en.wikipedia.org/wiki/Ternary_search_tree](http://en.wikipedia.org/wiki/Ternary_search_tree)

 - [http://www.drdobbs.com/database/ternary-search-trees/184410528](http://www.drdobbs.com/database/ternary-search-trees/184410528)

 - [http://en.wikipedia.org/wiki/Hamming_distance](http://en.wikipedia.org/wiki/Hamming_distance)

 - [http://en.wikipedia.org/wiki/Levenshtein_distance](http://en.wikipedia.org/wiki/Levenshtein_distance)

 - [http://stevehanov.ca/blog/index.php?id=114](http://stevehanov.ca/blog/index.php?id=114)

 - [http://www.let.rug.nl/kleiweg/lev/](http://www.let.rug.nl/kleiweg/lev/)

 - [http://www.graphviz.org/](http://www.graphviz.org/)

 - [http://www.graphviz.org/Documentation/dotguide.pdf](http://www.graphviz.org/Documentation/dotguide.pdf)

 - [https://github.com/jasononeil/compiletime/blob/master/src/CompileTime.hx](https://github.com/jasononeil/compiletime/blob/master/src/CompileTime.hx)

## License

**hxTSTree** is developed by Giuseppe Di Mauro (azrafe7) and released under the MIT license. See the [LICENSE](LICENSE) file for details.