1 |
|
/* |
2 |
< |
* Copyright 1998-2006 Sun Microsystems, Inc. All Rights Reserved. |
2 |
> |
* Copyright (c) 1998, 2008, Oracle and/or its affiliates. All rights reserved. |
3 |
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
|
* |
5 |
|
* This code is free software; you can redistribute it and/or modify it |
18 |
|
* 2 along with this work; if not, write to the Free Software Foundation, |
19 |
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
20 |
|
* |
21 |
< |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
22 |
< |
* CA 95054 USA or visit www.sun.com if you need additional information or |
23 |
< |
* have any questions. |
21 |
> |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
22 |
> |
* or visit www.oracle.com if you need additional information or have any |
23 |
> |
* questions. |
24 |
|
*/ |
25 |
|
|
26 |
|
package java.util; |
195 |
|
* @since 1.6 |
196 |
|
*/ |
197 |
|
public NavigableSet<E> descendingSet() { |
198 |
< |
return new TreeSet(m.descendingMap()); |
198 |
> |
return new TreeSet<E>(m.descendingMap()); |
199 |
|
} |
200 |
|
|
201 |
|
/** |
452 |
|
*/ |
453 |
|
public E pollFirst() { |
454 |
|
Map.Entry<E,?> e = m.pollFirstEntry(); |
455 |
< |
return (e == null)? null : e.getKey(); |
455 |
> |
return (e == null) ? null : e.getKey(); |
456 |
|
} |
457 |
|
|
458 |
|
/** |
460 |
|
*/ |
461 |
|
public E pollLast() { |
462 |
|
Map.Entry<E,?> e = m.pollLastEntry(); |
463 |
< |
return (e == null)? null : e.getKey(); |
463 |
> |
return (e == null) ? null : e.getKey(); |
464 |
|
} |
465 |
|
|
466 |
|
/** |
505 |
|
s.writeInt(m.size()); |
506 |
|
|
507 |
|
// Write out all elements in the proper order. |
508 |
< |
for (Iterator i=m.keySet().iterator(); i.hasNext(); ) |
509 |
< |
s.writeObject(i.next()); |
508 |
> |
for (E e : m.keySet()) |
509 |
> |
s.writeObject(e); |
510 |
|
} |
511 |
|
|
512 |
|
/** |