Thursday 22 November 2012

Introductio with Collection Framework

Introductio with Collection Framework:

Collection is an Interface ... which provide us a well defined set of interfaces and classes to handle  and manipulate a group or collection of objects.

List and Set  are Interfaces and  both of them extends the Collection Interface.

List : --List is an ordered collection of objects which has the indexing property  and allows  duplicates...
The methods includedin it are given in the table bellow....
        
void
add(int index, Object element)
Inserts the specified element at the specified position in this list (optional operation).
 boolean
add(Object o)
Appends the specified element to the end of this list (optional operation).
 boolean
addAll(Collection c)
Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator (optional operation).
 boolean
addAll(int index, Collection c)
Inserts all of the elements in the specified collection into this list at the specified position (optional operation).
 void
clear()
Removes all of the elements from this list (optional operation).
 boolean
contains(Object o)
          Returns true if this list contains the specified element.
 boolean
containsAll(Collection c)
Returns true if this list contains all of the elements of the specified collection.
 boolean
equals(Object o)
Compares the specified object with this list for equality.
 Object
get(int index)
Returns the element at the specified position in this list.
 int
hashCode()
Returns the hash code value for this list.
 int
indexOf(Object o)
Returns the index in this list of the first occurrence of the specified element, or -1 if this list does not contain this element.
 boolean
isEmpty()
Returns true if this list contains no elements.
 Iterator
iterator()
Returns an iterator over the elements in this list in proper sequence.
 int
lastIndexOf(Object o)
Returns the index in this list of the last occurrence of the specified element, or -1 if this list does not contain this element.
 ListIterator
listIterator()
Returns a list iterator of the elements in this list (in proper sequence).
 ListIterator
listIterator(int index)
Returns a list iterator of the elements in this list (in proper sequence), starting at the specified position in this list.
 Object
remove(int index)
Removes the element at the specified position in this list (optional operation).
 boolean
remove(Object o)
Removes the first occurrence in this list of the specified element (optional operation).
 boolean
removeAll(Collection c)
Removes from this list all the elements that are contained in the specified collection (optional operation).
 boolean
retainAll(Collection c)
Retains only the elements in this list that are contained in the specified collection (optional operation).
 Object
set(int index, Object element)
Replaces the element at the specified position in this list with the specified element (optional operation).
 int
size()
Returns the number of elements in this list.
 List
subList(int fromIndex, int toIndex)
Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive.
 Object[]
toArray()
Returns an array containing all of the elements in this list in proper sequence.
 Object[]
toArray(Object[] a)
Returns an array containing all of the elements in this list in proper sequence; the runtime type of the returned array is that of the specified array.

Class which impelements List...are ArrayList and LinkedList

Set :-- Set is  a collection of unique objects which forbids  duplicate objects..

the methods included in Set are given in the table below...


boolean
add (Object o)
Ensures that this collection contains the specified element (optional operation).
 boolean
addAll(Collection c)
Adds all of the elements in the specified collection to this collection (optional operation).
 void
clear()
Removes all of the elements from this collection (optional operation).
 boolean
contains(Object o)
Returns true if this collection contains the specified element.
 boolean
containsAll(Collection c)
Returns true if this collection contains all of the elements in the specified collection.
 boolean
equals(Object o)
Compares the specified object with this collection for equality.
 int
hashCode()
Returns the hash code value for this collection.
 boolean
isEmpty()
Returns true if this collection contains no elements.
 Iterator
iterator()
Returns an iterator over the elements in this collection.
 boolean
remove(Object o)
Removes a single instance of the specified element from this collection, if it is present (optional operation).
 boolean
removeAll(Collection c)
Removes all this collection's elements that are also contained in the specified collection (optional operation).
 boolean
retainAll(Collection c)
Retains only the elements in this collection that are contained in the specified collection (optional operation).
 int
size()
Returns the number of elements in this collection.
 Object[]
toArray()
Returns an array containing all of the elements in this collection.
 Object[]
toArray(Object[] a)
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array.


Class which impelements set...Hashset and TreeSet.
Vector :--  A Vector is an historical collection class that acts like a growable array, but can store heterogeneous data elements.It is synchronized and thread safe.

Map :--  Map is  also an interface but not extends the Collection Interface.It is a key-value association of objects with unique key .

Class Which Implements Map ... Hashmap and TreeMap.... 


No comments:

Post a Comment