Return-Path: Delivered-To: apmail-jakarta-commons-dev-archive@apache.org Received: (qmail 7250 invoked from network); 15 Nov 2002 00:06:09 -0000 Received: from unknown (HELO nagoya.betaversion.org) (192.18.49.131) by daedalus.apache.org with SMTP; 15 Nov 2002 00:06:08 -0000 Received: (qmail 20392 invoked by uid 97); 15 Nov 2002 00:07:09 -0000 Delivered-To: qmlist-jakarta-archive-commons-dev@jakarta.apache.org Received: (qmail 20376 invoked by uid 97); 15 Nov 2002 00:07:08 -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 20364 invoked by uid 98); 15 Nov 2002 00:07:08 -0000 X-Antivirus: nagoya (v4218 created Aug 14 2002) Message-ID: <023001c28c3b$00160f40$675d22d9@oemcomputer> From: "Stephen Colebourne" To: "Jakarta Commons Developers List" References: <20021114191731.93662.qmail@web10408.mail.yahoo.com> Subject: [collections] Pleasedtameetcha, and a couple of questions Date: Fri, 15 Nov 2002 00:07:34 -0000 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.50.4133.2400 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N From: "Jeff Varszegi" > I'm a newbie to the Apache mailing lists; I ask forgiveness in advance for asking stupid > questions. Quick hint - watch what others do before posting yourself...such as the [collections] tag in the Subject line ;-) > The first is a LinkedList implementation that reduces object creation/garbage collection that > works twice as fast as LinkedList. Sounds promising > The second is a double-ended queue that offers good speed and deterministic delivery to waiting > threads. In other words, if thread A requests something from the queue before thread B, thread A > is guaranteed to get a result before thread B, even if both of them are initially forced to wait. > This was an absolute requirement for some code I'm writing, and if it can be useful to someone I > don't want to waste the chance. I would also like someone to look over the queue code, to check > for correctness and maybe suggest improvements. May be too specialised. Don't know without looking. Does it implement our Buffer interface? > Is there any interest in these two items? I have other general-purpose utility stuff too, but I'm > not sure of the proper way to submit it all. Do I just send the code to this list, or what? I suggest starting a new thread (with a clear Subject line) for each submission, eg. [collections][SUBMIT] Faster LinkedList and attach the code > P.S. Anyone contribute a SkipList implementation yet? How about array-based Red-Black tree or > something similar? I've found that most of the slowness in TreeSet and TreeMap is due to > unnecessary object creation. SkipList??? Tree was discussed about 8 months ago but never got in. It should do though. Stephen -- To unsubscribe, e-mail: For additional commands, e-mail: