Ohloh by Black Duck

 Follow @ Meta   Join Now

 Settings |  Report Duplicate
Very Low Activity
0

Project Summary

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

The libdivsufsort project provides a fast, lightweight, and robust C API library to construct the suffix array and the Burrows-Wheeler transformed string for any input string of a constant-size alphabet.

News:2008/08/23: libdivsufsort-2.0.0 is now available. 2008/06/09: The project has been moved to Google Code. Current Features:Constructs the suffix array in O(n log n) time and O(1) extra working space. Constructs the Burrows-Wheeler transformed string directly. Inverse BW-transform. Fast suffix array checker. Simple string search. Planned Features:Lightweight BWT and Inverse BWT. (3n? bytes) Regular expression search...?

Share

Quick Reference

Project Links:

Code Locations:
http://libdivsufsort.googlecode....
Licenses:
MIT
Similar Projects:
Managers:
Become the first manager for libdivsufsort
Browse Code

In a Nutshell, libdivsufsort...

Languages

C 		79%
CMake 		21%
 
 

Lines of Code

 

Activity

30 Day Summary Apr 22 2013 — May 22 2013

12 Month Summary May 22 2012 — May 22 2013

  • 0 Commits Down -1 (100%) from previous 12 months
  • 0 Contributors Down -1 (100%) from previous 12 months

Commits per Month

Community

Ratings

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

Most Recent Contributors

Anon32 yuta.256 Anon32 ....256@gmail.com
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.