Permalink
Browse files

Misc

  • Loading branch information...
1 parent c8b8c13 commit 1abf7c834c22fed3b1142efab213c7d1727f0e8c Andy Seaborne committed Mar 14, 2012
@@ -38,9 +38,6 @@
// Scala?
public class CSVParser
{
- // Toy.
- // TODO Tokenizer.
-
public static void main(String ... argv)
{
Sink<List<String>> sink = new Sink<List<String>>(){
@@ -43,7 +43,6 @@ which is (32 bit)
public static byte[] encode(long value)
{
- // TODO
//return null ;
throw new NotImplemented("ZigZagInteger.encode") ;
}
@@ -63,7 +62,7 @@ public static long decode(ByteBuffer bytes)
public static long decode(ByteBuffer bytes, int idx)
{ return -1 ; }
-/** Make a VarInteger from the bytes found start from idx */
+ /** Make a VarInteger from the bytes found start from idx */
public static ZigZagInteger make(byte[] bytes)
{
return new ZigZagInteger(bytes) ;
@@ -40,8 +40,8 @@
{
private static Logger log = LoggerFactory.getLogger(AVL.class) ;
- /* ==== AVL TODO
- * Reenable all of test "del_10"
+ /* ==== AVL to do
+ * Re-enable all of test "del_10"
* + Boolean returns on delete
* + Size by tracking ins/del
*/
@@ -32,10 +32,9 @@
public final class RadixNode //extends PrintableBase implements Printable
{
-
//TODO Clean and refactor to allow for different implementations
- // Nibble mode: array of first nibble.
- // Flag to say if to look in first or second nibble.
+ // Nibble mode: array by nibble.
+ // Flag to say if to look in first or second nibble.
// Interface for lenStart, lenFinish
// In-memory
// Old style list of subnodes.
@@ -34,12 +34,12 @@
/* http://en.wikipedia.org/wiki/Radix_tree */
public final class RadixTree
{
- // TODO
- // More checking, all if'ed out
- // Iteration
- // Value?
- // Architecture : action visitor pattern - find&do (overhead?)
- // Add value
+ // TODO Sepaarte RadixNode and RadixTree
+ // nibble nodes.
+
+ // TODO contains tests
+ // TODO Min tests, max tests, iterator tests.
+ // TODO isEmpty
static public boolean logging = true ;
static public /*final*/ boolean checking = true ;
@@ -662,7 +662,7 @@ public boolean isEmpty()
log.debug("iterator: empty tree") ;
return Iter.nullIterator() ;
}
- // TODO -- Empty root : shoudl not occur but copy with it.
+ // TODO -- Empty root : should not occur but cope with it.
return new RadixIterator(root, start, finish) ;
}
@@ -38,7 +38,6 @@
public abstract class AVLRun
{
- // TODO Combine with TTreeRun
static boolean showProgress = true ;
static public void main(String...a)
@@ -38,7 +38,6 @@
public abstract class TTreeRun
{
- // TODO Combine with AVLRun
static boolean showProgress = true ;
static public void main(String...a)

0 comments on commit 1abf7c8

Please sign in to comment.