-
TreeSet, internal implementation
Does anyone know how the compareTo() in TreeSet is implemented?
I needed a sorted list of String elements and was going to use a binary chop method to find if a search key was in the list. Is this how the TreeSet does it already? Reason I'm asking is because speed is very important in this case.
Similar Threads
-
Replies: 1
Last Post: 11-30-2005, 06:27 PM
-
By tomorrowland in forum Java
Replies: 1
Last Post: 10-07-2002, 11:14 PM
-
By Sridhar Mahadevan in forum .NET
Replies: 6
Last Post: 10-02-2002, 05:59 PM
-
By Lakshmanan in forum oracle.general
Replies: 4
Last Post: 04-06-2002, 02:19 AM
-
By Ash in forum Enterprise
Replies: 0
Last Post: 10-22-2001, 04:12 PM
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
Forum Rules
|
Top DevX Stories
Easy Web Services with SQL Server 2005 HTTP Endpoints
JavaOne 2005: Java Platform Roadmap Focuses on Ease of Development, Sun Focuses on the "Free" in F.O.S.S.
Wed Yourself to UML with the Power of Associations
Microsoft to Add AJAX Capabilities to ASP.NET
IBM's Cloudscape Versus MySQL
|
Reply With Quote
Bookmarks