Mega Code Archive
Search
.Net
ASP .Net
ASP .Net Tutorial
C#
C# Book
C# by API
C# Tutorial
VB.Net
VB.Net by API
VB.Net Tutorial
Visual C++ .Net
VisualBasic Script
Java
Java
Java Book
Java by API
Java Tutorial
Script
Flash ActionScript
Flex
JavaScript DHTML
JavaScript Reference
JavaScript Tutorial
Database
MSSQL
MSSQL Tutorial
MySQL
MySQL Tutorial
Oracle PLSQL
Oracle PLSQL Tutorial
PostgreSQL
Languages
Android
C
C Tutorial
C++
C++ Tutorial
Delphi
Perl
PHP
Python
Python Tutorial
Ruby
Silverlight
Office
MSOfficeExcel 2007 Tutorial
MSOfficePowerPoint 2007 Tutorial
MSOfficeWord 2007 Tutorial
Data
XML
XML Tutorial
Java Book
Collection 87 codes
Home
Java Book
Collection
1 0269 The Interfaces from Collection framework
2 0270 The Collection Classes
3 0271 Collection interface
4 0272 List interface
5 0273 ArrayList Class
6 0274 Constructors shown here
7 0275 Add to ArrayList
8 0276 LinkedList class
9 0277 Remove all elements from LinkedList
10 0278 Shallow copy of a LinkedList
11 0279 If contain a certain element
12 0280 Get iterator from LinkedList
13 0281 Peek the element
14 0282 Get the element from LinkedList
15 0283 Get the index of an element
16 0284 Poll, pop and push element to a LinkedList
17 0285 Remove element from a LinkedList
18 0286 Replace the element at the position
19 0287 Get the size of a LinkedList
20 0288 Convert LinkedList to Array
21 0289 Vector class
22 0290 Add elements to this vector
23 0291 Size and capacity
24 0292 Remove all elements from a vector
25 0293 Clone a vector
26 0294 Does it contain a certain element
27 0295 Copy elements in vector to an array
28 0296 Get Enumeration from this vector
29 0297 Compare two vectors
30 0298 Get element from vector
31 0299 Is vector empty
32 0300 Get element index
33 0301 Remove element from a vector
34 0302 Retain elements collection c has
35 0303 Replace element in a vector
36 0304 Get a sub list from a list
37 0305 Convert Vector to Array
38 0306 Iterator
39 0307 ListIterator
40 0308 Map
41 0309 java.util.Map.Entry
42 0310 The EnumMap Class
43 0311 HashMap Class
44 0312 The IdentityHashMap Class
45 0313 The LinkedHashMap Class
46 0314 NavigableMap
47 0315 SortedMap
48 0316 TreeMap Class
49 0317 WeakHashMap
50 0318 HashSet class
51 0319 EnumSet
52 0320 HashSet class
53 0321 LinkedHashSet class
54 0322 NavigableSet
55 0323 SortedSet
56 0324 TreeSet class
57 0325 Collections
58 0326 Do binary search
59 0327 Add to a collection
60 0328 Check collections
61 0329 Copy value to a List
62 0330 Check for common elements
63 0331 Get Enumeration from collection, create list from Enumeration
64 0332 Fill a list
65 0333 Check for frequency
66 0334 Get the index of sub list
67 0335 Get the max and min value from a Collection
68 0336 Fill n Copy object to a list
69 0337 Create set from a map
70 0338 Replace value in a list
71 0339 Reverse a list
72 0340 Get comparator in reverse order
73 0341 Rotate and shuffle a list
74 0342 Create singleton
75 0343 Sort a list
76 0344 Swap element in a list
77 0345 Get a synchronized collection
78 0346 Return an unmodifiable view of collections
79 0347 Arrays
80 0348 Deque
81 0349 ArrayDeque Class
82 0350 Queue
83 0351 PriorityQueue Class
84 0352 Working with variable-length bitsets
85 0353 Comparable
86 0354 Comparator
87 0355 Stack