From commons-dev-return-20647-qmlist-jakarta-archive-commons-dev=jakarta.apache.org@jakarta.apache.org Fri Dec 06 16:26:12 2002 Return-Path: Delivered-To: apmail-jakarta-commons-dev-archive@apache.org Received: (qmail 87597 invoked from network); 6 Dec 2002 16:26:11 -0000 Received: from unknown (HELO nagoya.betaversion.org) (192.18.49.131) by daedalus.apache.org with SMTP; 6 Dec 2002 16:26:11 -0000 Received: (qmail 20720 invoked by uid 97); 6 Dec 2002 16:27:17 -0000 Delivered-To: qmlist-jakarta-archive-commons-dev@jakarta.apache.org Received: (qmail 20668 invoked by uid 97); 6 Dec 2002 16:27:15 -0000 Mailing-List: contact commons-dev-help@jakarta.apache.org; run by ezmlm Precedence: bulk List-Unsubscribe: List-Subscribe: List-Help: List-Post: List-Id: "Jakarta Commons Developers List" Reply-To: "Jakarta Commons Developers List" Delivered-To: mailing list commons-dev@jakarta.apache.org Received: (qmail 20638 invoked by uid 98); 6 Dec 2002 16:27:14 -0000 X-Antivirus: nagoya (v4218 created Aug 14 2002) Message-ID: <20021206162551.62889.qmail@web12704.mail.yahoo.com> Date: Fri, 6 Dec 2002 08:25:51 -0800 (PST) From: Charles Burdick Subject: Re: [Collections] [SUBMIT] Trie To: Jakarta Commons Developers List In-Reply-To: <00a801c29bf3$2a7ba660$e72c29d9@oemcomputer> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N As a frequent user of Commons-Collections, I can support the usefulness of a Trie implementation in Collections. Most algorithms textbooks use Trie as an advanced data structure for fast string retrieval. It is discussed in Knuth's Art of Computer Programming. http://www.amazon.com/exec/obidos/tg/detail/-/0201485419/ref=lib_rd_ss_TI73/102-3297886-4987356?v=glance&s=books&vi=reader&img=86&coliid=I3GKWA6SDKHVJ5#reader-link I'm not convinced that Tries can be optimally stored as objects. Perhaps we will want a Trie interface that supports primitive char access as well as a TrieMap interface that is object-based and extends Collection. Thanks, Chuck --- Stephen Colebourne wrote: > Hi, > I've taken a quick look at the code here, and that all looks fine. > > Unfortunately, I don't really know what I'm looking at! What I mean > is that > I've never heard of a 'Trie' before, and am thus wondering as to why > I would > use it, and is it general enough to be in [collections]. > > In the past we have had discussions about Tree implementations (and I > have > coded some before). This may be related, as the Trie appears to be a > recursive structure. > > Perhaps, some use cases as to why a Trie is useful, especially in a > general/server environment would be useful. Thanks. > > Stephen > > ----- Original Message ----- > From: "Rich Dougherty" > To: > Sent: Monday, December 02, 2002 7:36 AM > Subject: [Collections] [SUBMIT] Trie > > > > Hi > > > > I've written an implementation for a trie which I'd like to > > contribute. I've attached a simple implementation and a test > > case. Here's the interface: > > __________________________________________________ Do you Yahoo!? Yahoo! Mail Plus - Powerful. Affordable. Sign up now. http://mailplus.yahoo.com -- To unsubscribe, e-mail: For additional commands, e-mail: