в 17:43, 31 мая 2010

2010-05-31T17:43:48Z

Admin: 1 версия

2010-05-31T14:11:56Z

1 версия

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

== NavigableSet: ceiling(T e) ==



<source lang="java">

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

</source>



== NavigableSet: descendingSet() ==



<source lang="java">

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

</source>



== NavigableSet: floor(T e) ==



<source lang="java">

import java.util.NavigableSet;
import java.util.TreeSet;
public class Main {

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

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

}

</source>



== NavigableSet: higher(T e) ==



<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 Main {
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>



== NavigableSet: lower(T e) ==



<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 Main {
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>

← Предыдущая	Версия 17:43, 31 мая 2010
(нет различий)

Java by API/java.util/NavigableSet - История изменений

в 17:43, 31 мая 2010

Admin: 1 версия