advertisement
javaboutique
Search Tips
Articles  |   Tutorials  |   Reviews  |   Tools  |   by Category  |   by Date  |   by Name  |   Submit  |   Source  |   Forums  |  
javaboutique
Browse DevX


Partners & Affiliates











advertisement

Tutorials : SortedSet and SortedMap Made Easier with Two New Mustang Interfaces :

A Brief Introduction To NavigableSet And NavigableMap

The NavigableSet/NavigableMap interfaces are just add-ons for the SortedSet/SortedMap interfaces. They provide new methods that help you easily list, extract, and modify a SortedSet/SortedMap. This allows you to use a dedicated large number of NavigableSet/NavigableMap methods just for navigation without supplying any "helper" methods. Figure 3 shows the position of the NavigableSet/NavigableMap interfaces in the java.util package.


NavigableSet

The NavigableSet interface provides methods for accessing elements of a SortedSet. Table 1 below splits these methods by their nature:

Iteration methods

Polls methods

LHCF methods

Subset methods

iterator

pollFirst

lower

headSet

descendingIterator

pollLast

higher

subSet

 

 

ceiling

tailSet

 

 

floor

 


Table 1. The NavigableSet interface provides methods for accessing elements of a SortedSet.

Let's go over the items covered in the table:

  • Iteration methods are used to obtain virtual cursors (Iterators) over a SortedSet.
    • Iterator<E> iterator(): Obtains an Iterator over an SortedSet in ascending order.
    • Iterator<E> descendingIterator(): Obtain a Iterator over a SortedSet in descending order.
    • Note: To obtain a reverse order view of current set, call the descendingSet method:
      NavigableSet<E> descendingSet()
      
      Listing 3 shows an application that creates a NavigableSet and how to use the iterator and descendingIterator methods.

  • Polls methods are used to extract elements from a SortedSet.
    • E pollFirst() removes and returns the first element from the current SortedSet.
    • E pollLast() removes and returns the last element from the current SortedSet.
    Notice that unlike the first and last methods from the SortedSet interface, the pollFirst and pollLast methods removes and returns the first, respectively last element from the SortedSet and not just returns them.

    Listing 4 is an example of using the pollFirst and pollLast methods. Figure 4 shows a graphical view of the application in Listing 4.


  • LHCF methods consist of the lower (L), higher (H), ceiling (C) and floor (F) methods:
    • E lower(E e) returns the greater element "<" than the given element (null if there is no such element).
    • E higher(E e) returns the lesser element ">" than the given element (null if there is no such element)
    • E ceiling(E e) returns the least element ">=" to the given element (null if there is no such element)
    • E floor(E e) returns the greatest element "<=" to the given element (null if there is no such element).

    Listing 5 is an example of using the above methods (the tested element was "Hydro").

  • Figure 5 shows a graphical view of the application in Listing 5.


  • Subset methods are used to extract a subset from a SortedSet.
    • NavigableSet<E> headSet(E toElement,boolean inclusive) returns a subset-view of the current set whose elements are less than (or equal to, if inclusive is true) toElement. Another headSet method is SortedSet<E> headSet(E toElement). This is equivalent to headSet(toElement, false).
    • NavigableSet<E> subSet(E fromElement,boolean fromInclusive,E toElement, boolean toInclusive) returns a subset-view of the current set whose elements range is [fromElement, toElement). By modifying the fromInclusive, toInclusive arguments you can obtain the following ranges: [fromElement, toElement], (fromElement, toElement), (fromElement, toElement]. Another subSet method is: SortedSet<E> subSet(E fromElement,E toElement). This is equivalent to subSet(fromElement, true, toElement, false).
    • NavigableSet<E> tailSet(E fromElement,boolean inclusive) returns a subset-view of this set whose elements are greater than (or equal to, if inclusive is true) fromElement. Another tailSet method is SortedSet<E> tailSet(E fromElement). This is equivalent to tailSet(fromElement, true).

    Note: In all cases, the returned subset is backed by the current set, so changes in the returned subset are reflected in this set, and vice-versa.

    Listing 6 shows what using these methods looks like. Figure 6 shows a graphical view of the application in Listing 6.


  • Home / Articles / SortedSet and SortedMap Made Easier with Two New Mustang Interfaces / 1 / 2 / Next Page

    How to Add Java Applets to Your Site

    New on the Java Boutique:

    New Review:

    Time Management Made Easy with the Quartz Enterprise Job Scheduler
    Why not just use the Java timer API? This open source scheduling API boasts simplicity, ease-of-integration, a well-rounded feature set, and it's free!

    New Applet:

    Reverse Complement
    Reverse Complement is a simple applet that converts DNA or RNA sequences into three useful formats.

    Elsewhere on internet.com:

    WebDeveloper Java
    Lots of Java information on webdeveloper.com

    WDVL Java
    Thorough Java resource at the Web Developer's Virtual Library.

    ScriptSearch Java
    Hundreds of free Java code files to download.

    jGuru: Your View of the Java Universe
    Customizable portal with online training, FAQs, regular news updates, and tutorials.

 Microsoft Visual Studio 2010 Showcase
 Avaya Developer Showcase
 MSDN Spotlight
 PHP for Windows Showcase
XML error: undefined entity at line 39
advertisement
Receive Articles via our XML/RSS feed
Receive Articles via our XML/RSS feed

JavaBytes
Internet Cyclone
This powerful, easy-to-use, internet optimizer is for Windows 95, 98, ME, NT, 2000 and XP. It's designed to automatically optimize your Windows settings, boosting your Internet connection up to 200%.

Windows 7: From Beta to Final Code in One Year
Google Shows Off Chrome OS, Releases Source
Microsoft Shows Off Silverlight 4, IE9 Plans
Metasploit Expands Vulnerability Test Framework
HyperCard Reborn?
Fedora 12 Takes Aim at Linux Networking
Top Supercomputer Nearly Doubles in Speed
Fedora 12 Linux Tackles Virtualization
Apple Gives iPhone Developers App Status Tracker
Novell Sets OpenSUSE 11.2 Free

Creating Custom Export Filters for StarOffice with XSLT
WPF Wonders: Using DataTemplates
Crystal Reports Family Offers Options for Developers
Avaya Aura Session Manager video
Avaya Aura Overview video
Exploring HTML 5's Audio/Video Multimedia Support
Overriding Virtual Functions? Use C++0x Attributes to Avoid Bugs.
Understanding the Cloud Computing Security Vulnerabilities
Cisco and IBM Target a Greener World
Upgrade to Visual Studio 2010 with the Ultimate Offer

Advertising Info  |   Member Services  |   Contact Us  |   Help  |   Feedback  |   Site Map  |   Network Map  |   About

internet.commediabistro.comJusttechjobs.comGraphics.com

Search:

WebMediaBrands Corporate Info

Legal Notices, Licensing, Permissions, Privacy Policy.
Advertise | Newsletters | Shopping | E-mail Offers | Freelance Jobs