Note: This website is archived. For up-to-date information about D projects and development, please visit wiki.dlang.org.

Welcome to Nova

Nova is a library for (un)common data structures and algorithms in D.

Project Status

Development seems to have stalled with changeset [11] on 2007-10-09.

License

Nova uses zlib/libpng license.

Mission

Nova should provide an implementation for most known data structures and algorithms.

Motivation

  • I'm interested in data structures in general and especially in those which are not "mainstream" and therefore are more interesting.
  • I like D and this project is a good way to dig into it.

Roadmap/Progress

10/10/2007

Added bitio classes and huffman encoder/decoder templates

09/28/2007

Nova is now tangoified

06/16/2006

First version is up and contains

  • template classes for intrusive datastructures in the spirit of boost::intrusive
  • a matrix/vector template
  • a weighted graph template class
  • a solver for the partitioned boolean quadric problem (PBQP)

Further data structures, like hashed array tree (HAT), ternary search trie (TST) and hashed array mapped trie (HAMT) are planned for the future. The order of implementation will reflect my interests/needs.

Project Information

Name Nova
Category Libraries-System
Status 3 - Alpha
Short Description A library for (un)common data structures and algorithms in D
Long Description
Home Page
Forum /forums/viewforum.php?f=87

Starting Points

For a complete list of local wiki pages, see TitleIndex.