1
== Small Sized Tasks ==
3
* Implement support for progress callback functions in bless_buffer_save().
5
* Create programs to check performance scaling and memory leaks in the library.
7
== Medium Sized Tasks ==
9
* Implement bless_buffer_find(). Use Boyer-Moore algorithm for searching.
11
== Large Sized Tasks ==
13
* Use a more efficient data structure to implement the Segment Collection.
14
See doc/devel/segcol_data_structure.txt for some ideas.