radixtree - Project Hosting on Google Code

Last 30 days Dec 16, 2009 issue 7 (Make available on maven repository?) reported by pedro.sam - Please make available on maven repository? Please make available on maven repository? Older Oct 06, 2009 RadixTree-0.3.zip (Source archive) file uploaded by tahseen.ur.rehman - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Oct 06, 2009 RadixTree-0.3.jar (Binary for version 0.3) file uploaded by tahseen.ur.rehman - Labels: OpSys-All Featured Type-Archive Labels: OpSys-All Featured Type-Archive Oct 06, 2009 issue 5 (There are many typos in the documentation and code) changed by tahseen.ur.rehman - Status: Fixed Owner: tahseen.ur.rehman Status: Fixed Owner: tahseen.ur.rehman Oct 06, 2009 issue 4 (DuplicateKeyException is an unchecked exception) Status changed by tahseen.ur.rehman - Status: WontFix Status: WontFix Oct 06, 2009 issue 6 (Add a method that would complete a given string to the point...) changed by tahseen.ur.rehman - Status: Fixed Owner: tahseen.ur.rehman Status: Fixed Owner: tahseen.ur.rehman Oct 06, 2009 r22 ( Resolve: Issue 6: Add a method that would complete a given ...) committed by tahseen.ur.rehman - Resolve: Issue 6 : Add a method that would complete a given string to the point where the ambiguity starts Resolve: Issue 6 : Add a method that would complete a given string to the point where the ambiguity starts Jun 23, 2009 RadixTree-0.2.zip (Source archive) file uploaded by tahseen.ur.rehman - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Jun 23, 2009 RadixTree-0.2.jar (Binary for version 0.2) file uploaded by tahseen.ur.rehman - Labels: Featured Type-Executable OpSys-All Labels: Featured Type-Executable OpSys-All Jun 23, 2009 r21 (- Merged Dennis Heidsiek <HeidsiekB@aol.com> improvement of ...) committed by tahseen.ur.rehman - - Merged Dennis Heidsiek <HeidsiekB@aol.com> improvement of the Visitor - Merged Dennis Heidsiek <HeidsiekB@aol.com> implmentation of java.utl.Formatter interface - Added extra construtcor for VisitorImpl so that a initialization value can be provided - Merged Dennis Heidsiek <HeidsiekB@aol.com> improvement of the Visitor - Merged Dennis Heidsiek <HeidsiekB@aol.com> implmentation of java.utl.Formatter interface - Added extra construtcor for VisitorImpl so that a initialization value can be provided Jun 23, 2009 r20 (- Merged Dennis Heidsiek <HeidsiekB@aol.com> improvement of ...) committed by tahseen.ur.rehman - - Merged Dennis Heidsiek <HeidsiekB@aol.com> improvement of the Visitor - Merged Dennis Heidsiek <HeidsiekB@aol.com> implmentation of java.utl.Formatter interface - Added extra construtcor for VisitorImpl so that a initialization value can be provided - Merged Dennis Heidsiek <HeidsiekB@aol.com> improvement of the Visitor - Merged Dennis Heidsiek <HeidsiekB@aol.com> implmentation of java.utl.Formatter interface - Added extra construtcor for VisitorImpl so that a initialization value can be provided Nov 30, 2008 issue 2 (Add ability to search with wildcards) commented on by andrea86 - You can do a wildcard search simply by inserting all the rotation of the strings you want to index (followed by a mark character, like $) and then doing a prefix search of the rotation of the query that puts the * as the last character. Example: You want to insert "cat"; you have to insert those strings: cat$ $cat t$ca at$c Later, you want to search for "ct"; this is the same to search for a string that start with a prefix "t$c". You can do a wildcard search simply by inserting all the rotation of the strings you want to index (followed by a mark character, like $) and then doing a prefix search of the rotation of the query that puts the as the last character. Example: You want to insert "cat"; you have to insert those strings: cat$ $cat t$ca at$c Later, you want to search for "ct"; this is the same to search for a string that start with a prefix "t$c". Sep 17, 2008 issue 6 (Add a method that would complete a given string to the point...) Status changed by tahseen.ur.rehman - Thanks a lot for your contribution. I will write some unit test for this one and then i will include it :) Status: Started Thanks a lot for your contribution. I will write some unit test for this one and then i will include it :) Status: Started Sep 17, 2008 issue 5 (There are many typos in the documentation and code) Status changed by tahseen.ur.rehman - I will fix this. Thanks a lot for reporting this one. Status: Accepted I will fix this. Thanks a lot for reporting this one. Status: Accepted Sep 17, 2008 issue 4 (DuplicateKeyException is an unchecked exception) commented on by tahseen.ur.rehman - Unchecked vs Checked Exception, this a bit controversial topic. There are pros and cons for both. It might be i have tendency to go against the book :) Give me a good reason and i guess i will go back to checked exception Or you can just modify the code as you like it is open source. Unchecked vs Checked Exception, this a bit controversial topic. There are pros and cons for both. It might be i have tendency to go against the book :) Give me a good reason and i guess i will go back to checked exception Or you can just modify the code as you like it is open source. Sep 17, 2008 issue 6 (Add a method that would complete a given string to the point...) commented on by kaljurand - / One possible implementation / public String complete(String prefix) { return complete(prefix, root, ""); } private String complete(String key, RadixTreeNode<T> node, String base) { int i = 0; int keylen = key.length(); int nodelen = node.getKey().length(); while (i < keylen && i < nodelen) { if (key.charAt(i) != node.getKey().charAt(i)) { break; } i++; } if (i == keylen && i <= nodelen) { return base + node.getKey(); } else if (nodelen == 0 \|\| (i < keylen && i >= nodelen)) { String beginning = key.substring(0, i); String ending = key.substring(i, keylen); for (RadixTreeNode<T> child : node.getChildern()) { if (child.getKey().startsWith(ending.charAt(0) + "")) { return complete(ending, child, base + beginning); } } } return null; } / One possible implementation / public String complete(String prefix) { return complete(prefix, root, ""); } private String complete(String key, RadixTreeNode<T> node, String base) { int i = 0; int keylen = key.length(); int nodelen = node.getKey().length(); while (i < keylen && i < nodelen) { if (key.charAt(i) != node.getKey().charAt(i)) { break; } i++; } if (i == keylen && i <= nodelen) { return base + node.getKey(); } else if (nodelen == 0 \|\| (i < keylen && i >= nodelen)) { String beginning = key.substring(0, i); String ending = key.substring(i, keylen); for (RadixTreeNode<T> child : node.getChildern()) { if (child.getKey().startsWith(ending.charAt(0) + "")) { return complete(ending, child, base + beginning); } } } return null; } Sep 17, 2008 issue 6 (Add a method that would complete a given string to the point...) reported by kaljurand - It would be nice if the interface contained a method, like String complete(String prefix) that would "complete" the prefix to the point where the ambiguity starts. Say, the tree contains: "blah1" and "blah2"; then complete("bl") would return "blah". It would be nice if the interface contained a method, like String complete(String prefix) that would "complete" the prefix to the point where the ambiguity starts. Say, the tree contains: "blah1" and "blah2"; then complete("bl") would return "blah". Sep 17, 2008 issue 5 (There are many typos in the documentation and code) reported by kaljurand - null if iot can not find the key * searchPefix * If there no children of the node we need to * Opertaion only valid if it is and a few more ... * null if iot can not find the key * searchPefix * If there no children of the node we need to * Opertaion only valid if it is and a few more ... Sep 17, 2008 issue 4 (DuplicateKeyException is an unchecked exception) reported by kaljurand - DuplicateKeyException currently extends RuntimeException, wouldn't it better to make it a checked exception instead? DuplicateKeyException currently extends RuntimeException, wouldn't it better to make it a checked exception instead?

issue 6 (Add a method that would complete a given string to the point...) commented on by kaljurand - /* One possible implementation */ public String complete(String prefix) { return complete(prefix, root, ""); } private String complete(String key, RadixTreeNode<T> node, String base) { int i = 0; int keylen = key.length(); int nodelen = node.getKey().length(); while (i < keylen && i < nodelen) { if (key.charAt(i) != node.getKey().charAt(i)) { break; } i++; } if (i == keylen && i <= nodelen) { return base + node.getKey(); } else if (nodelen == 0 || (i < keylen && i >= nodelen)) { String beginning = key.substring(0, i); String ending = key.substring(i, keylen); for (RadixTreeNode<T> child : node.getChildern()) { if (child.getKey().startsWith(ending.charAt(0) + "")) { return complete(ending, child, base + beginning); } } } return null; }

/* One possible implementation */ public String complete(String prefix) { return complete(prefix, root, ""); } private String complete(String key, RadixTreeNode<T> node, String base) { int i = 0; int keylen = key.length(); int nodelen = node.getKey().length(); while (i < keylen && i < nodelen) { if (key.charAt(i) != node.getKey().charAt(i)) { break; } i++; } if (i == keylen && i <= nodelen) { return base + node.getKey(); } else if (nodelen == 0 || (i < keylen && i >= nodelen)) { String beginning = key.substring(0, i); String ending = key.substring(i, keylen); for (RadixTreeNode<T> child : node.getChildern()) { if (child.getKey().startsWith(ending.charAt(0) + "")) { return complete(ending, child, base + beginning); } } } return null; }

Last 30 days

Older