Ohloh by Black Duck

 Follow @ Meta   Join Now

 Settings |  Report Duplicate
Inactive
0

Project Summary

  Analyzed 3 days ago based on code collected 3 days ago.

Tx is a library for a compact trie data structure. Tx requires 1/4 - 1/10 of the memory usage compared to the previous implementations, and can therefore handle quite a large number of keys (e.g. 1 billion) efficiently. A trie data structure supports exact matching and common prefix matching, which are used for natural language processing etc. Tx uses Level-Order Unary Degree Sequence (LOUDS) for trie representation.

English

Japanese

Share

Quick Reference

Project Links:

Code Locations:
http://tx-trie.googlecode.com/sv...
Licenses:
BSD-4-Clause-UC
Similar Projects:
Managers:
Become the first manager for tx-trie
Browse Code

In a Nutshell, tx-trie...

Languages

C++ 		95%
3 Other 		5%
 
 

Lines of Code

 

Activity

30 Day Summary Apr 22 2013 — May 22 2013

12 Month Summary May 22 2012 — May 22 2013

Commits per Month

Community

Ratings

Be the first to rate this project
 
Click to add your rating
 
Review this Project!

Most Recent Contributors

Anon32 Daisuke.Okanohara Anon32 kazuki.ohta
Anon32 [anonymous]    

Contributors per Month

 
 
 

Project Summary

Code Data

SCM Data

Community Data

 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.