FilesExpand file tree

 master

/

SortedMapDemo.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

37 lines (36 loc) · 1003 Bytes

 master

/

SortedMapDemo.java

Copy path

Top

File metadata and controls

• Code
• Blame

37 lines (36 loc) · 1003 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

//: containers/SortedMapDemo.java

// What you can do with a TreeMap.

import java.util.*;

import net.mindview.util.*;

import static net.mindview.util.Print.*;

public class SortedMapDemo {

public static void main(String[] args) {

TreeMap<Integer,String> sortedMap =

new TreeMap<Integer,String>(new CountingMapData(10));

print(sortedMap);

Integer low = sortedMap.firstKey();

Integer high = sortedMap.lastKey();

print(low);

print(high);

Iterator<Integer> it = sortedMap.keySet().iterator();

for(int i = 0; i <= 6; i++) {

if(i == 3) low = it.next();

if(i == 6) high = it.next();

else it.next();

}

print(low);

print(high);

print(sortedMap.subMap(low, high));

print(sortedMap.headMap(high));

print(sortedMap.tailMap(low));

}

} /* Output:

{0=A0, 1=B0, 2=C0, 3=D0, 4=E0, 5=F0, 6=G0, 7=H0, 8=I0, 9=J0}

0

9

3

7

{3=D0, 4=E0, 5=F0, 6=G0}

{0=A0, 1=B0, 2=C0, 3=D0, 4=E0, 5=F0, 6=G0}

{3=D0, 4=E0, 5=F0, 6=G0, 7=H0, 8=I0, 9=J0}

*///:~