MouseList

Odnośniki

Smutek to uczucie, jak gdyby się tonęło, jak gdyby grzebano cię w ziemi.
obecnym i przyszłym trwaniu...
szczęśliwy i bezpieczny – stwierdza, że jest zadowolony, a nawet bardzo zadowolony ( Jak dobrze)...
food that has a higher nutritional content, has been grown with more love and care, will not fill your system with toxins and has (most likely) not added as much to...
– Ale powiedziałeś, że trochę się dowiedziałeś – ponagliła podekscytowana Catti-brie...
- Prace przygotowawcze zajmą kilkadziesiąt lat - odezwał się Człowiek, Który Czuwał Nad Bezpieczeństwem Mieszkańców Ziemi...
Dodawanie animacji DHTML...
In his systematic efforts to ruin girls and women he strives to break down the last barriers of discrimination between him and other peoples...
czy się dzisiaj...
Eliza Orzeszkowa-Gloria Victis Geneza âźGloria victisâ została wydana po raz pierwszy w zbiorze nowel Orzeszkowej w Wilnie w 1910 roku...
i postępowania swoich wspólnot...

Smutek to uczucie, jak gdyby się tonęło, jak gdyby grzebano cię w ziemi.

Feedback
7. Modify MouseList.java so that it inherits from ArrayList
instead of using composition. Demonstrate the problem with this
approach. Feedback
8. Repair CatsAndDogs.java by creating a Cats container
(utilizing ArrayList) that will only accept and retrieve Cat
objects. Feedback
9. Fill a HashMap with key-value pairs. Print the results to show
ordering by hash code. Extract the pairs, sort by key, and place the
result into a LinkedHashMap. Show that the insertion order is
maintained.
10. Repeat the previous example with a HashSet and
LinkedHashSet.
11. Create a new type of container that uses a private ArrayList to
hold the objects. Using a Class reference, capture the type of the
first object you put in it, and then allow the user to insert objects
of only that type from then on. Feedback
12. Create a container that encapsulates an array of String, and that
only adds Strings and gets Strings, so that there are no casting
issues during use. If the internal array isn’t big enough for the next
add, your container should automatically resize it. In main( ),
Chapter 11: Collections of Objects
609

compare the performance of your container with an ArrayList
holding Strings. Feedback
13. Repeat Exercise 12 for a container of int, and compare the
performance to an ArrayList holding Integer objects. In your
performance comparison, include the process of incrementing
each object in the container. Feedback
14. Using the utilities in com.bruceeckel.util, create an array of
each primitive type and of String, then fill each array using an
appropriate generator, and print each array using the appropriate
print( ) method. Feedback
15. Create a generator that produces character names from your
favorite movies (you can use Snow White or Star Wars as a
fallback), and loops around to the beginning when it runs out of
names. Use the utilities in com.bruceeckel.util to fill an array,
an ArrayList, a LinkedList and both types of Set, then print
each container. Feedback
16. Create a class containing two String objects, and make it
Comparable so that the comparison only cares about the first
String. Fill an array and an ArrayList with objects of your class,
using the geography generator. Demonstrate that sorting works
properly. Now make a Comparator that only cares about the
second String and demonstrate that sorting works properly; also
perform a binary search using your Comparator. Feedback
17. Modify Exercise 16 so that an alphabetic sort is used. Feedback
18. Use Arrays2.RandStringGenerator to fill a TreeSet but using
alphabetic ordering. Print the TreeSet to verify the sort order.
Feedback
19. Create both an ArrayList and a LinkedList, and fill each using
the Collections2.capitals generator. Print each list using an
ordinary Iterator, then insert one list into the other using a
ListIterator, inserting at every other location. Now perform the
insertion starting at the end of the first list and moving backward.
Feedback
610
Thinking in Java
www.BruceEckel.com

20. Write a method that uses an Iterator to step through a
Collection and print the hashCode( ) of each object in the
container. Fill all the different types of Collections with objects
and apply your method to each container. Feedback
21. Repair the problem in InfiniteRecursion.java. Feedback
22. Create a class, then make an initialized array of objects of your
class. Fill a List from your array. Create a subset of your List
using subList( ), and then remove this subset from your List
using removeAll( ). Feedback
23. Change Exercise 6 in Chapter 7 to use an ArrayList to hold the
Rodents and an Iterator to move through the sequence of
Rodents. Remember that an ArrayList holds only Objects so
you must use a cast when accessing individual Rodents. Feedback
24. Following the Queue.java example, create a Deque class and
test it. Feedback
25. Use a TreeMap in Statistics.java. Now add code that tests the
performance difference between HashMap and TreeMap in that
program. Feedback
26. Produce a Map and a Set containing all the countries that begin
with ‘A.’ Feedback
27. Using Collections2.countries, fill a Set multiple times with the
same data and verify that the Set ends up with only one of each
instance. Try this with both kinds of Set. Feedback
28. Starting with Statistics.java, create a program that runs the test
repeatedly and looks to see if any one number tends to appear
more than the others in the results. Feedback
29. Rewrite Statistics.java using a HashSet of Counter objects
(you’ll have to modify Counter so that it will work in the
HashSet). Which approach seems better? Feedback
Chapter 11: Collections of Objects
611

30. Fill a LinkedHashMap with String keys and objects of your
choice. Now extract the pairs, sort them based on the keys, and re-
insert them into the Map.
31. Modify the class in Exercise 16 so that the class will work with
HashSets and as a key in HashMaps. Feedback
32. Using SlowMap.java for inspiration, create a SlowSet. Feedback