[ephemerata.git] / KezvhLib / lib / org.apache.commons.collections / apidocs / org / apache / commons / collections / FastTreeMap.html
| blob | 0199aee19dc461198a694f0f5d158437fefcae8a |
1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
2 <!--NewPage-->
3 <HTML>
4 <HEAD>
5 <!-- Generated by javadoc (build 1.5.0_07) on Fri Apr 11 15:39:17 BST 2008 -->
7 <TITLE>
8 FastTreeMap (Commons Collections 3.2.1 API)
9 </TITLE>
16 function windowTitle()
17 {
19 }
20 </SCRIPT>
21 <NOSCRIPT>
22 </NOSCRIPT>
24 </HEAD>
29 <!-- ========= START OF TOP NAVBAR ======= -->
33 <TR>
38 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
39 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
40 <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD>
41 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="class-use/FastTreeMap.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A> </TD>
42 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
43 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
44 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
45 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
46 </TR>
47 </TABLE>
48 </TD>
50 </EM>
51 </TD>
52 </TR>
54 <TR>
56 <A HREF="../../../../org/apache/commons/collections/FastHashMap.html" title="class in org.apache.commons.collections"><B>PREV CLASS</B></A>
57 <A HREF="../../../../org/apache/commons/collections/FunctorException.html" title="class in org.apache.commons.collections"><B>NEXT CLASS</B></A></FONT></TD>
59 <A HREF="../../../../index.html?org/apache/commons/collections/FastTreeMap.html" target="_top"><B>FRAMES</B></A>
62 <!--
63 if(window==top) {
64 document.writeln('<A HREF="../../../../allclasses-noframe.html"><B>All Classes</B></A>');
65 }
66 //-->
67 </SCRIPT>
68 <NOSCRIPT>
70 </NOSCRIPT>
73 </FONT></TD>
74 </TR>
75 <TR>
77 SUMMARY: NESTED | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD>
79 DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD>
80 </TR>
81 </TABLE>
83 <!-- ========= END OF TOP NAVBAR ========= -->
85 <HR>
86 <!-- ======== START OF CLASS DATA ======== -->
87 <H2>
89 org.apache.commons.collections</FONT>
90 <BR>
91 Class FastTreeMap</H2>
92 <PRE>
93 java.lang.Object
96 <IMG SRC="../../../../resources/inherit.gif" ALT="extended by "><B>org.apache.commons.collections.FastTreeMap</B>
97 </PRE>
98 <DL>
99 <DT><B>All Implemented Interfaces:</B> <DD>java.io.Serializable, java.lang.Cloneable, java.util.Map, java.util.SortedMap</DD>
100 </DL>
101 <HR>
102 <DL>
104 </PRE>
106 <P>
108 to operate in a multithreaded environment where the large majority of
109 method calls are read-only, instead of structural changes. When operating
110 in "fast" mode, read calls are non-synchronized and write calls perform the
111 following steps:</p>
112 <ul>
113 <li>Clone the existing collection
114 <li>Perform the modification on the clone
115 <li>Replace the existing collection with the (modified) clone
116 </ul>
118 all accesses of any type are synchronized but no cloning takes place. This
119 is appropriate for initially populating the collection, followed by a switch
121 is complete.</p>
126 maximum performance.</p>
129 Using it may cause unexpected failures on some architectures.</i>
130 It suffers from the same problems as the double-checked locking idiom.
131 In particular, the instruction that clones the internal collection and the
132 instruction that sets the internal reference to the clone can be executed
133 or perceived out-of-order. This means that any read operation might fail
134 unexpectedly, as it may be reading the state of the internal collection
135 before the internal collection is fully formed.
136 For more information on the double-checked locking idiom, see the
139 <P>
141 <P>
142 <DL>
149 <DT><B>See Also:</B><DD><A HREF="../../../../serialized-form.html#org.apache.commons.collections.FastTreeMap">Serialized Form</A></DL>
150 <HR>
152 <P>
153 <!-- =========== FIELD SUMMARY =========== -->
160 </TR>
164 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#fast">fast</A></B></CODE>
166 <BR>
167 Are we operating in "fast" mode?</TD>
168 </TR>
172 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#map">map</A></B></CODE>
174 <BR>
175 The underlying map we are managing.</TD>
176 </TR>
177 </TABLE>
178
179 <!-- ======== CONSTRUCTOR SUMMARY ======== -->
186 </TR>
188 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#FastTreeMap()">FastTreeMap</A></B>()</CODE>
190 <BR>
192 </TR>
194 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#FastTreeMap(java.util.Comparator)">FastTreeMap</A></B>(java.util.Comparator comparator)</CODE>
196 <BR>
197 Construct an empty map with the specified comparator.</TD>
198 </TR>
200 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#FastTreeMap(java.util.Map)">FastTreeMap</A></B>(java.util.Map map)</CODE>
202 <BR>
203 Construct a new map with the same mappings as the specified map,
204 sorted according to the keys's natural order</TD>
205 </TR>
207 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#FastTreeMap(java.util.SortedMap)">FastTreeMap</A></B>(java.util.SortedMap map)</CODE>
209 <BR>
210 Construct a new map with the same mappings as the specified map,
211 sorted according to the same ordering</TD>
212 </TR>
213 </TABLE>
214
215 <!-- ========== METHOD SUMMARY =========== -->
222 </TR>
226 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#clear()">clear</A></B>()</CODE>
228 <BR>
229 Remove all mappings from this map.</TD>
230 </TR>
234 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#clone()">clone</A></B>()</CODE>
236 <BR>
237 Return a shallow copy of this <code>FastTreeMap</code> instance.</TD>
238 </TR>
242 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#comparator()">comparator</A></B>()</CODE>
244 <BR>
245 Return the comparator used to order this map, or <code>null</code>
246 if this map uses its keys' natural order.</TD>
247 </TR>
251 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#containsKey(java.lang.Object)">containsKey</A></B>(java.lang.Object key)</CODE>
253 <BR>
254 Return <code>true</code> if this map contains a mapping for the
255 specified key.</TD>
256 </TR>
260 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#containsValue(java.lang.Object)">containsValue</A></B>(java.lang.Object value)</CODE>
262 <BR>
263 Return <code>true</code> if this map contains one or more keys mapping
264 to the specified value.</TD>
265 </TR>
269 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#entrySet()">entrySet</A></B>()</CODE>
271 <BR>
272 Return a collection view of the mappings contained in this map.</TD>
273 </TR>
277 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#equals(java.lang.Object)">equals</A></B>(java.lang.Object o)</CODE>
279 <BR>
280 Compare the specified object with this list for equality.</TD>
281 </TR>
285 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#firstKey()">firstKey</A></B>()</CODE>
287 <BR>
288 Return the first (lowest) key currently in this sorted map.</TD>
289 </TR>
293 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#get(java.lang.Object)">get</A></B>(java.lang.Object key)</CODE>
295 <BR>
296 Return the value to which this map maps the specified key.</TD>
297 </TR>
301 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#getFast()">getFast</A></B>()</CODE>
303 <BR>
304 Returns true if this map is operating in fast mode.</TD>
305 </TR>
309 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#hashCode()">hashCode</A></B>()</CODE>
311 <BR>
312 Return the hash code value for this map.</TD>
313 </TR>
317 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#headMap(java.lang.Object)">headMap</A></B>(java.lang.Object key)</CODE>
319 <BR>
320 Return a view of the portion of this map whose keys are strictly
321 less than the specified key.</TD>
322 </TR>
326 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#isEmpty()">isEmpty</A></B>()</CODE>
328 <BR>
329 Return <code>true</code> if this map contains no mappings.</TD>
330 </TR>
334 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#keySet()">keySet</A></B>()</CODE>
336 <BR>
337 Return a set view of the keys contained in this map.</TD>
338 </TR>
342 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#lastKey()">lastKey</A></B>()</CODE>
344 <BR>
345 Return the last (highest) key currently in this sorted map.</TD>
346 </TR>
350 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#put(java.lang.Object, java.lang.Object)">put</A></B>(java.lang.Object key,
353 <BR>
354 Associate the specified value with the specified key in this map.</TD>
355 </TR>
359 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#putAll(java.util.Map)">putAll</A></B>(java.util.Map in)</CODE>
361 <BR>
362 Copy all of the mappings from the specified map to this one, replacing
363 any mappings with the same keys.</TD>
364 </TR>
368 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#remove(java.lang.Object)">remove</A></B>(java.lang.Object key)</CODE>
370 <BR>
371 Remove any mapping for this key, and return any previously
372 mapped value.</TD>
373 </TR>
377 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#setFast(boolean)">setFast</A></B>(boolean fast)</CODE>
379 <BR>
380 Sets whether this map is operating in fast mode.</TD>
381 </TR>
385 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#size()">size</A></B>()</CODE>
387 <BR>
388 Return the number of key-value mappings in this map.</TD>
389 </TR>
393 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#subMap(java.lang.Object, java.lang.Object)">subMap</A></B>(java.lang.Object fromKey,
396 <BR>
397 Return a view of the portion of this map whose keys are in the
398 range fromKey (inclusive) to toKey (exclusive).</TD>
399 </TR>
403 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#tailMap(java.lang.Object)">tailMap</A></B>(java.lang.Object key)</CODE>
405 <BR>
406 Return a view of the portion of this map whose keys are greater than
407 or equal to the specified key.</TD>
408 </TR>
412 <TD><CODE><B><A HREF="../../../../org/apache/commons/collections/FastTreeMap.html#values()">values</A></B>()</CODE>
414 <BR>
415 Return a collection view of the values contained in this map.</TD>
416 </TR>
417 </TABLE>
422 </TR>
425 </TR>
426 </TABLE>
431 </TR>
434 </TR>
435 </TABLE>
436
437 <P>
439 <!-- ============ FIELD DETAIL =========== -->
446 </TR>
447 </TABLE>
450 map</H3>
451 <PRE>
453 <DL>
454 <DD>The underlying map we are managing.
455 <P>
456 <DL>
457 </DL>
458 </DL>
459 <HR>
462 fast</H3>
463 <PRE>
465 <DL>
467 <P>
468 <DL>
469 </DL>
470 </DL>
472 <!-- ========= CONSTRUCTOR DETAIL ======== -->
479 </TR>
480 </TABLE>
483 FastTreeMap</H3>
484 <PRE>
486 <DL>
487 <DD>Construct a an empty map.
488 <P>
489 </DL>
490 <HR>
493 FastTreeMap</H3>
494 <PRE>
496 <DL>
497 <DD>Construct an empty map with the specified comparator.
498 <P>
499 <DL>
500 <DT><B>Parameters:</B><DD><CODE>comparator</CODE> - the comparator to use for ordering tree elements</DL>
501 </DL>
502 <HR>
505 FastTreeMap</H3>
506 <PRE>
508 <DL>
509 <DD>Construct a new map with the same mappings as the specified map,
510 sorted according to the keys's natural order
511 <P>
512 <DL>
514 </DL>
515 <HR>
518 FastTreeMap</H3>
519 <PRE>
521 <DL>
522 <DD>Construct a new map with the same mappings as the specified map,
523 sorted according to the same ordering
524 <P>
525 <DL>
527 </DL>
529 <!-- ============ METHOD DETAIL ========== -->
536 </TR>
537 </TABLE>
540 getFast</H3>
541 <PRE>
543 <DL>
544 <DD>Returns true if this map is operating in fast mode.
545 <P>
546 <DD><DL>
549 </DD>
550 </DL>
551 <HR>
554 setFast</H3>
555 <PRE>
557 <DL>
558 <DD>Sets whether this map is operating in fast mode.
559 <P>
560 <DD><DL>
562 </DD>
563 </DL>
564 <HR>
567 get</H3>
568 <PRE>
570 <DL>
571 <DD>Return the value to which this map maps the specified key. Returns
575 <P>
576 <DD><DL>
577 <DT><B>Specified by:</B><DD><CODE>get</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>get</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
578 </DD>
579 <DD><DL>
582 </DD>
583 </DL>
584 <HR>
587 size</H3>
588 <PRE>
590 <DL>
591 <DD>Return the number of key-value mappings in this map.
592 <P>
593 <DD><DL>
594 <DT><B>Specified by:</B><DD><CODE>size</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>size</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
595 </DD>
596 <DD><DL>
599 </DD>
600 </DL>
601 <HR>
604 isEmpty</H3>
605 <PRE>
607 <DL>
609 <P>
610 <DD><DL>
611 <DT><B>Specified by:</B><DD><CODE>isEmpty</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>isEmpty</CODE> in class <CODE>java.util.AbstractMap</CODE></DL>
612 </DD>
613 <DD><DL>
616 </DD>
617 </DL>
618 <HR>
621 containsKey</H3>
622 <PRE>
624 <DL>
626 specified key.
627 <P>
628 <DD><DL>
629 <DT><B>Specified by:</B><DD><CODE>containsKey</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>containsKey</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
630 </DD>
631 <DD><DL>
634 </DD>
635 </DL>
636 <HR>
639 containsValue</H3>
640 <PRE>
642 <DL>
644 to the specified value.
645 <P>
646 <DD><DL>
647 <DT><B>Specified by:</B><DD><CODE>containsValue</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>containsValue</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
648 </DD>
649 <DD><DL>
652 </DD>
653 </DL>
654 <HR>
657 comparator</H3>
658 <PRE>
660 <DL>
662 if this map uses its keys' natural order.
663 <P>
664 <DD><DL>
665 <DT><B>Specified by:</B><DD><CODE>comparator</CODE> in interface <CODE>java.util.SortedMap</CODE><DT><B>Overrides:</B><DD><CODE>comparator</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
666 </DD>
667 <DD><DL>
670 </DD>
671 </DL>
672 <HR>
675 firstKey</H3>
676 <PRE>
678 <DL>
679 <DD>Return the first (lowest) key currently in this sorted map.
680 <P>
681 <DD><DL>
682 <DT><B>Specified by:</B><DD><CODE>firstKey</CODE> in interface <CODE>java.util.SortedMap</CODE><DT><B>Overrides:</B><DD><CODE>firstKey</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
683 </DD>
684 <DD><DL>
687 </DD>
688 </DL>
689 <HR>
692 lastKey</H3>
693 <PRE>
695 <DL>
696 <DD>Return the last (highest) key currently in this sorted map.
697 <P>
698 <DD><DL>
699 <DT><B>Specified by:</B><DD><CODE>lastKey</CODE> in interface <CODE>java.util.SortedMap</CODE><DT><B>Overrides:</B><DD><CODE>lastKey</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
700 </DD>
701 <DD><DL>
704 </DD>
705 </DL>
706 <HR>
709 put</H3>
710 <PRE>
713 <DL>
714 <DD>Associate the specified value with the specified key in this map.
715 If the map previously contained a mapping for this key, the old
716 value is replaced and returned.
717 <P>
718 <DD><DL>
719 <DT><B>Specified by:</B><DD><CODE>put</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>put</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
720 </DD>
721 <DD><DL>
722 <DT><B>Parameters:</B><DD><CODE>key</CODE> - the key with which the value is to be associated<DD><CODE>value</CODE> - the value to be associated with this key
724 </DD>
725 </DL>
726 <HR>
729 putAll</H3>
730 <PRE>
732 <DL>
733 <DD>Copy all of the mappings from the specified map to this one, replacing
734 any mappings with the same keys.
735 <P>
736 <DD><DL>
737 <DT><B>Specified by:</B><DD><CODE>putAll</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>putAll</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
738 </DD>
739 <DD><DL>
741 </DD>
742 </DL>
743 <HR>
746 remove</H3>
747 <PRE>
749 <DL>
750 <DD>Remove any mapping for this key, and return any previously
751 mapped value.
752 <P>
753 <DD><DL>
754 <DT><B>Specified by:</B><DD><CODE>remove</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>remove</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
755 </DD>
756 <DD><DL>
759 </DD>
760 </DL>
761 <HR>
764 clear</H3>
765 <PRE>
767 <DL>
768 <DD>Remove all mappings from this map.
769 <P>
770 <DD><DL>
771 <DT><B>Specified by:</B><DD><CODE>clear</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>clear</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
772 </DD>
773 <DD><DL>
774 </DL>
775 </DD>
776 </DL>
777 <HR>
780 equals</H3>
781 <PRE>
783 <DL>
784 <DD>Compare the specified object with this list for equality. This
785 implementation uses exactly the code that is used to define the
786 list equals function in the documentation for the
788 <P>
789 <DD><DL>
790 <DT><B>Specified by:</B><DD><CODE>equals</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>equals</CODE> in class <CODE>java.util.AbstractMap</CODE></DL>
791 </DD>
792 <DD><DL>
795 </DD>
796 </DL>
797 <HR>
800 hashCode</H3>
801 <PRE>
803 <DL>
804 <DD>Return the hash code value for this map. This implementation uses
805 exactly the code that is used to define the list hash function in the
807 <P>
808 <DD><DL>
809 <DT><B>Specified by:</B><DD><CODE>hashCode</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>hashCode</CODE> in class <CODE>java.util.AbstractMap</CODE></DL>
810 </DD>
811 <DD><DL>
814 </DD>
815 </DL>
816 <HR>
819 clone</H3>
820 <PRE>
822 <DL>
824 The keys and values themselves are not copied.
825 <P>
826 <DD><DL>
828 </DD>
829 <DD><DL>
832 </DD>
833 </DL>
834 <HR>
837 headMap</H3>
838 <PRE>
840 <DL>
841 <DD>Return a view of the portion of this map whose keys are strictly
842 less than the specified key.
843 <P>
844 <DD><DL>
845 <DT><B>Specified by:</B><DD><CODE>headMap</CODE> in interface <CODE>java.util.SortedMap</CODE><DT><B>Overrides:</B><DD><CODE>headMap</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
846 </DD>
847 <DD><DL>
850 </DD>
851 </DL>
852 <HR>
855 subMap</H3>
856 <PRE>
859 <DL>
860 <DD>Return a view of the portion of this map whose keys are in the
861 range fromKey (inclusive) to toKey (exclusive).
862 <P>
863 <DD><DL>
864 <DT><B>Specified by:</B><DD><CODE>subMap</CODE> in interface <CODE>java.util.SortedMap</CODE><DT><B>Overrides:</B><DD><CODE>subMap</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
865 </DD>
866 <DD><DL>
867 <DT><B>Parameters:</B><DD><CODE>fromKey</CODE> - Lower limit of keys for the returned map<DD><CODE>toKey</CODE> - Upper limit of keys for the returned map
869 </DD>
870 </DL>
871 <HR>
874 tailMap</H3>
875 <PRE>
877 <DL>
878 <DD>Return a view of the portion of this map whose keys are greater than
879 or equal to the specified key.
880 <P>
881 <DD><DL>
882 <DT><B>Specified by:</B><DD><CODE>tailMap</CODE> in interface <CODE>java.util.SortedMap</CODE><DT><B>Overrides:</B><DD><CODE>tailMap</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
883 </DD>
884 <DD><DL>
887 </DD>
888 </DL>
889 <HR>
892 entrySet</H3>
893 <PRE>
895 <DL>
896 <DD>Return a collection view of the mappings contained in this map. Each
898 <P>
899 <DD><DL>
900 <DT><B>Specified by:</B><DD><CODE>entrySet</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>entrySet</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
901 </DD>
902 <DD><DL>
903 </DL>
904 </DD>
905 </DL>
906 <HR>
909 keySet</H3>
910 <PRE>
912 <DL>
913 <DD>Return a set view of the keys contained in this map.
914 <P>
915 <DD><DL>
916 <DT><B>Specified by:</B><DD><CODE>keySet</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>keySet</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
917 </DD>
918 <DD><DL>
919 </DL>
920 </DD>
921 </DL>
922 <HR>
925 values</H3>
926 <PRE>
928 <DL>
929 <DD>Return a collection view of the values contained in this map.
930 <P>
931 <DD><DL>
932 <DT><B>Specified by:</B><DD><CODE>values</CODE> in interface <CODE>java.util.Map</CODE><DT><B>Overrides:</B><DD><CODE>values</CODE> in class <CODE>java.util.TreeMap</CODE></DL>
933 </DD>
934 <DD><DL>
935 </DL>
936 </DD>
937 </DL>
938 <!-- ========= END OF CLASS DATA ========= -->
939 <HR>
942 <!-- ======= START OF BOTTOM NAVBAR ====== -->
946 <TR>
951 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
952 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
953 <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD>
954 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="class-use/FastTreeMap.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A> </TD>
955 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
956 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
957 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
958 <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
959 </TR>
960 </TABLE>
961 </TD>
963 </EM>
964 </TD>
965 </TR>
967 <TR>
969 <A HREF="../../../../org/apache/commons/collections/FastHashMap.html" title="class in org.apache.commons.collections"><B>PREV CLASS</B></A>
970 <A HREF="../../../../org/apache/commons/collections/FunctorException.html" title="class in org.apache.commons.collections"><B>NEXT CLASS</B></A></FONT></TD>
972 <A HREF="../../../../index.html?org/apache/commons/collections/FastTreeMap.html" target="_top"><B>FRAMES</B></A>
975 <!--
976 if(window==top) {
977 document.writeln('<A HREF="../../../../allclasses-noframe.html"><B>All Classes</B></A>');
978 }
979 //-->
980 </SCRIPT>
981 <NOSCRIPT>
983 </NOSCRIPT>
986 </FONT></TD>
987 </TR>
988 <TR>
990 SUMMARY: NESTED | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD>
992 DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD>
993 </TR>
994 </TABLE>
996 <!-- ======== END OF BOTTOM NAVBAR ======= -->
998 <HR>
999 Copyright © 2001-2008 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All Rights Reserved.
1000 </BODY>
1001 </HTML>