I guess you forgot the attachment? ;-) BTW, do you know the hashtrie component? http://www.softcomplete.com/hashtrie.asp
Best regards, Flávio On Tue, May 24, 2011 at 1:48 PM, leledumbo <leledumbo_c...@yahoo.co.id> wrote: > I've written a unit containing suffix trie implementation. It could be used > for: fast string existence search (could be extended with other information > if required), though takes quite a lot of spaces (O(n^2) for a string where > n is the string length, but grow slower as more strings get added), the > existence search have O(m) complexity where m is the string to search for. > This string to search for could be exact or a substring of previously added > strings. > > Please have a look and try it (a test program is included), open for > suggestions or whatever you want to say. > > > -- _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
