Admin: 1 версия

2010-06-01T05:05:49Z

1 версия

в 17:44, 31 мая 2010

2010-05-31T17:44:27Z

Новая страница

== Create TreeSet from String array ==



<source lang="java">
import java.util.NavigableSet;
import java.util.TreeSet;
public class CityNavigator {
static NavigableSet<String> citiesSet;
public static void main(String[] args) {
String[] cities = { "A", "B", "C", "D", "E", "F" };
citiesSet = new TreeSet<String>();
for (String city : cities)
citiesSet.add(city);
}
}</source>



== For each loop with generic NavigableSet, created from TreeSet ==



<source lang="java">
import java.util.NavigableSet;
import java.util.TreeSet;
public class CityNavigator {
static NavigableSet<String> citiesSet;
public static void main(String[] args) {
String[] cities = { "A", "B", "C", "D", "E", "F" };
citiesSet = new TreeSet<String>();
for (String city : cities)
citiesSet.add(city);

for (String city : citiesSet)
System.out.println(" " + city);
}
}</source>



== NavigableSet by TreeSet ==



<source lang="java">
import java.util.NavigableSet;
import java.util.TreeSet;
public class CityNavigator {
static NavigableSet<String> citiesSet;
public static void main(String[] args) {
String[] cities = { "A", "B", "C", "D", "E", "F" };
citiesSet = new TreeSet<String>();
for (String city : cities)
citiesSet.add(city);

for (String city : citiesSet)
System.out.println(" " + city);
}
}</source>



== NavigableSet.ceiling ==



<source lang="java">
import java.util.NavigableSet;
import java.util.TreeSet;
public class CityNavigator {
static NavigableSet<String> citiesSet;
public static void main(String[] args) {
String[] cities = { "A", "B", "C", "D", "E", "F" };
citiesSet = new TreeSet<String>();
for (String city : cities)
citiesSet.add(city);

System.out.println(citiesSet.ceiling("A"));
}

}</source>



== NavigableSet.floor ==



<source lang="java">
import java.util.NavigableSet;
import java.util.TreeSet;
public class CityNavigator {
static NavigableSet<String> citiesSet;
public static void main(String[] args) {
String[] cities = { "A", "B", "C", "D", "E", "F" };
citiesSet = new TreeSet<String>();
for (String city : cities)
citiesSet.add(city);

System.out.println(citiesSet.floor("A"));
}

}</source>



== NavigableSet.higher ==



<source lang="java">
import java.util.NavigableSet;
import java.util.TreeSet;
public class CityNavigator {
static NavigableSet<String> citiesSet;
public static void main(String[] args) {
String[] cities = { "A", "B", "C", "D", "E", "F" };
citiesSet = new TreeSet<String>();
for (String city : cities)
citiesSet.add(city);

System.out.println(citiesSet.higher("A"));
}

}</source>



== NavigableSet.lower ==



<source lang="java">
import java.util.NavigableSet;
import java.util.TreeSet;
public class CityNavigator {
static NavigableSet<String> citiesSet;
public static void main(String[] args) {
String[] cities = { "A", "B", "C", "D", "E", "F" };
citiesSet = new TreeSet<String>();
for (String city : cities)
citiesSet.add(city);

System.out.println(citiesSet.lower("A"));
}

}</source>



== The NavigableSet Interface ==

<p>The NavigableSet interface is a subinterface of SortedSet that provides methods for searching for elements.</p>
<p>java.util.TreeSet is an implementation of NavigableSet.</p>



<source lang="java">
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;
import java.util.NavigableSet;
import java.util.TreeSet;
public class NavigableSetDemo {
public static void main(String[] args) {
List<Integer> list = Arrays.asList(3, 2, 4, 1, 5);
NavigableSet<Integer> ns = new TreeSet<Integer>(list);
System.out.println("Ascending order (default): " + ns);
Iterator<Integer> descendingIterator = ns.descendingIterator();
StringBuilder sb = new StringBuilder("Descending order: ");
while (descendingIterator.hasNext()) {
int m = descendingIterator.next();
sb.append(m + " ");
}
System.out.println(sb);
int greatest = ns.lower(3);
System.out.println("Lower of 3 = " + greatest);
int smallest = ns.higher(3);
System.out.println("Higher of 3 = " + smallest);
}
}</source>



<pre class=codeResult>Ascending order (default): [1, 2, 3, 4, 5]
Descending order: 5 4 3 2 1
Lower of 3 = 2
Higher of 3 = 4</pre>

← Предыдущая	Версия 05:05, 1 июня 2010
(нет различий)

Java Tutorial/Collections/NavigableSet - История изменений

Admin: 1 версия

в 17:44, 31 мая 2010