http://www.jexp.ru/index.php?action=history&feed=atom&title=Java_by_API%2Fjava.util%2FSortedSet
Java by API/java.util/SortedSet - История изменений
2026-04-06T02:26:52Z
История изменений этой страницы в вики
MediaWiki 1.30.0
http://www.jexp.ru/index.php?title=Java_by_API/java.util/SortedSet&diff=104&oldid=prev
в 17:43, 31 мая 2010
2010-05-31T17:43:48Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style="vertical-align: top;" lang="ru">
<td colspan="1" style="background-color: white; color:black; text-align: center;">← Предыдущая</td>
<td colspan="1" style="background-color: white; color:black; text-align: center;">Версия 17:43, 31 мая 2010</td>
</tr><tr><td colspan="2" style="text-align: center;" lang="ru"><div class="mw-diff-empty">(нет различий)</div>
</td></tr></table>
http://www.jexp.ru/index.php?title=Java_by_API/java.util/SortedSet&diff=105&oldid=prev
Admin: 1 версия
2010-05-31T14:10:52Z
<p>1 версия</p>
<p><b>Новая страница</b></p><div>== SortedSet: add(String e) ==<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<!-- start source code --><br />
<br />
<source lang="java"><br />
<br />
import java.util.Iterator;<br />
import java.util.SortedSet;<br />
import java.util.TreeSet;<br />
public class Main {<br />
public static void main(String[] argv) throws Exception {<br />
SortedSet<String> set = new TreeSet<String>();<br />
set.add("b");<br />
set.add("c");<br />
set.add("a");<br />
Iterator it = set.iterator();<br />
while (it.hasNext()) {<br />
Object element = it.next();<br />
}<br />
String[] array = (String[]) set.toArray(new String[set.size()]);<br />
}<br />
}<br />
<br />
<br />
</source><br />
<br />
<br />
<!-- end source code --><br />
<br />
<br />
<br />
<br />
<br />
== SortedSet: headSet(E toElement) ==<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<!-- start source code --><br />
<br />
<source lang="java"><br />
<br />
/*<br />
Output:<br />
[I, P]<br />
[E, G]<br />
[E, G, I]<br />
[P]<br />
[I, P]<br />
[I]<br />
[]<br />
* */<br />
import java.util.Arrays;<br />
import java.util.SortedSet;<br />
import java.util.TreeSet;<br />
public class MainClass {<br />
public static void main(String args[]) throws Exception {<br />
String elements[] = { "I", "P", "E", "G", "P" };<br />
SortedSet set = new TreeSet(Arrays.asList(elements));<br />
System.out.println(set.tailSet("I"));<br />
System.out.println(set.headSet("I"));<br />
System.out.println(set.headSet("I\0"));<br />
System.out.println(set.tailSet("I\0"));<br />
System.out.println(set.subSet("I", "P\0"));<br />
System.out.println(set.subSet("I", "I\0"));<br />
System.out.println(set.subSet("I", "I"));<br />
}<br />
}<br />
<br />
<br />
</source><br />
<br />
<br />
<!-- end source code --><br />
<br />
<br />
<br />
<br />
<br />
== SortedSet: iterator() ==<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<!-- start source code --><br />
<br />
<source lang="java"><br />
<br />
import java.util.Iterator;<br />
import java.util.SortedSet;<br />
import java.util.TreeSet;<br />
public class Main {<br />
public static void main(String[] argv) throws Exception {<br />
SortedSet<String> set = new TreeSet<String>();<br />
set.add("b");<br />
set.add("c");<br />
set.add("a");<br />
Iterator it = set.iterator();<br />
while (it.hasNext()) {<br />
Object element = it.next();<br />
}<br />
String[] array = (String[]) set.toArray(new String[set.size()]);<br />
}<br />
}<br />
<br />
<br />
</source><br />
<br />
<br />
<!-- end source code --><br />
<br />
<br />
<br />
<br />
<br />
== SortedSet: subSet(E fromElement, E toElement) ==<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<!-- start source code --><br />
<br />
<source lang="java"><br />
<br />
/*<br />
Output:<br />
[I, P]<br />
[E, G]<br />
[E, G, I]<br />
[P]<br />
[I, P]<br />
[I]<br />
[]<br />
* */<br />
import java.util.Arrays;<br />
import java.util.SortedSet;<br />
import java.util.TreeSet;<br />
public class MainClass {<br />
public static void main(String args[]) throws Exception {<br />
String elements[] = { "I", "P", "E", "G", "P" };<br />
SortedSet set = new TreeSet(Arrays.asList(elements));<br />
System.out.println(set.tailSet("I"));<br />
System.out.println(set.headSet("I"));<br />
System.out.println(set.headSet("I\0"));<br />
System.out.println(set.tailSet("I\0"));<br />
System.out.println(set.subSet("I", "P\0"));<br />
System.out.println(set.subSet("I", "I\0"));<br />
System.out.println(set.subSet("I", "I"));<br />
}<br />
}<br />
<br />
<br />
</source><br />
<br />
<br />
<!-- end source code --><br />
<br />
<br />
<br />
<br />
<br />
== SortedSet: tailSet(E fromElement) ==<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<!-- start source code --><br />
<br />
<source lang="java"><br />
<br />
/*<br />
Output:<br />
[I, P]<br />
[E, G]<br />
[E, G, I]<br />
[P]<br />
[I, P]<br />
[I]<br />
[]<br />
* */<br />
import java.util.Arrays;<br />
import java.util.SortedSet;<br />
import java.util.TreeSet;<br />
public class MainClass {<br />
public static void main(String args[]) throws Exception {<br />
String elements[] = { "I", "P", "E", "G", "P" };<br />
SortedSet set = new TreeSet(Arrays.asList(elements));<br />
System.out.println(set.tailSet("I"));<br />
System.out.println(set.headSet("I"));<br />
System.out.println(set.headSet("I\0"));<br />
System.out.println(set.tailSet("I\0"));<br />
System.out.println(set.subSet("I", "P\0"));<br />
System.out.println(set.subSet("I", "I\0"));<br />
System.out.println(set.subSet("I", "I"));<br />
}<br />
}<br />
<br />
<br />
</source><br />
<br />
<br />
<!-- end source code --></div>
Admin