Collections

Collections-
it is nothing but the framework defined in java.
it provides architecture to store & manipulate the group of objects.
Clasess & interfaces-
1) arraylist-
ex-
package collectionsp;
import java.util.ArrayList;
public class ArrayListClass {
public static void main(String[] args) {
int [] i=new int[3];
ArrayList <Integer> al=new ArrayList<Integer>();
al.add(10);
al.add(20);
al.add(30);
System.out.println(al);
ArrayList <String> al1=new ArrayList<String>();
al1.add("Pune");
al1.add("Mumbai");
al1.add("Thane");
System.out.println(al1);
List of method-
add()- add data in the list
set();- set values at gievn index
remove()-
removeAll()-
addAll()-
ex-
ArrayList <Integer> al=new ArrayList<Integer>();
al.add(10);
al.add(20);
al.add(30);
al.add(40);
ArrayList <Integer> al1=new ArrayList<Integer>();

al1.add(70);
al1.add(80);
al1.add(90);
//al.addAll(al1);
if (!al.containsAll(al1)) {
System.out.println("True");
al.addAll(al1);
} else {
System.out.println("false");
}
import java.util.Arrays;
import java.util.List;
//From list to arrays
ArrayList <String> al=new ArrayList<String>();
al.add("pune");
al.add("Mumbai");
al.add("Thane");
al.add("Nashik");
String []arrays=new String[al.size()];

al.toArray(arrays);
for (String itr:arrays) {
System.out.println(itr);
//From arrays to List conversion

String []arrays= {"Nagpur", "Manmad", "Ahmednagr"};
ArrayList <String> al=new ArrayList<String>(Arrays.asList(arrays));
al.add("pune");
al.add("Mumbai");
al.add("Thane");
al.add("Nashik");
}
}
Arraylist are follwing insertion order.

Arraylist allows duplicate values.
ex-
import java.util.LinkedList;

al.add("pune");
al.add("pune");
al.add("Mumbai");
al.add("Mumbai");
al.add("Thane");
al.add("Nashik");
if (al.contains("Mumbai")) {
al.remove("Mumbai"); }
if (!al.contains("Aurangabad")) {
al.add("Aurangabad");
}
LinkedList<String> ll=new LinkedList<String>();
ll.add("Hi");
ll.add("Bye");
ll.addAll(al);
System.out.println(ll);
}
}
when we want to iterate on the values of cxollection
ex-
import java.util.Iterator;

al.add("pune");
al.add("pune");
al.add("Mumbai");
al.add("Mumbai");
al.add("Thane");
al.add("Nashik");
if (al.contains("Mumbai")) {
al.remove("Mumbai"); }
if (!al.contains("Aurangabad")) {
al.add("Aurangabad");
}
LinkedList<String> ll=new LinkedList<String>();
ll.add("Hi");
ll.add("Bye");
ll.addAll(al);
System.out.println(ll);
Iterator<String> itr=ll.iterator();
while(itr.hasNext()) {
String value=itr.next();
System.out.println(value);
}
List iterator for List implementing classes-
ex--
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.ListIterator;
import java.util.NavigableSet;
import java.util.TreeSet;

al.add("Pune");
al.add("Pune");
al.add("Mumbai");
al.add("Mumbai");
al.add("Thane");
al.add("Nashik");
ListIterator<String>lstr= al.listIterator();
while (lstr.hasNext() ) {
String s=lstr.next();
System.out.println(s);
}
System.out.println("============================");
while (lstr.hasPrevious()) {
String s=lstr.previous();
System.out.println(s);
--------------------------------
When we dont want to maintain insertion order and duplicate value

then we go for Hashset.
ex-

al.add("pune");
al.add("pune");
al.add("Mumbai");
al.add("Mumbai");
al.add("Thane");
al.add("Nashik");
HashSet<String> hs=new HashSet<String>();
hs.add("Dubai");
hs.add("Bankok");
hs.addAll(al);
System.out.println(hs);
}
Treeset-
No null values accpted

By default is scending order
Duplicate are not allowed
ex-
import java.util.LinkedHashSet;
import java.util.NavigableSet;
import java.util.TreeSet;

al.add("Pune");
al.add("Pune");
al.add("Mumbai");
al.add("Mumbai");
al.add("Thane");
al.add("Nashik");
HashSet<String> hs=new HashSet<String>();
hs.add("Dubai");
hs.add("Bankok");
hs.addAll(al);
hs.add(null);
hs.add(null);
System.out.println(hs);
LinkedHashSet<String>lhs=new LinkedHashSet<String>();
lhs.add("Dubai");
lhs.add("Bankok");
lhs.addAll(al);
lhs.add(null);
System.out.println(lhs);
TreeSet<String> tr=new TreeSet<String>();

tr.addAll(al);
System.out.println(tr);
NavigableSet<String> val=tr.descendingSet();
System.out.println(val);
}
o/p-
[Nagpur, Manmad, Ahmednagr, Pune, Pune, Mumbai, Mumbai, Thane, Nashik]
[null, Bankok, Thane, Nagpur, Manmad, Pune, Ahmednagr, Nashik, Dubai, Mumbai]
[Dubai, Bankok, Nagpur, Manmad, Ahmednagr, Pune, Mumbai, Thane, Nashik, null]
[Ahmednagr, Manmad, Mumbai, Nagpur, Nashik, Pune, Thane]
[Thane, Pune, Nashik, Nagpur, Mumbai, Manmad, Ahmednagr]
----------------------------------------------------------------------------------
Map -
When we ahve data in the form of keys and value then we go for Hashmap
Keys are aleays unique- no duplicate values are allowed
values can be duplicate
ex-
import java.util.HashMap;
public class MapParctice {
HashMap<Integer,String> hm=new HashMap<Integer, String>();
hm.put(1, "Ram");
hm.put(2, "Raj");
hm.put(3, "Aliya");
hm.put(4, "Rio");
hm.put(5, "Rio");
hm.put(5, "Rio");
System.out.println(hm);
}
}
o/p-
{1=Ram, 2=Raj, 3=Aliya, 4=Rio, 5=Rio}
ex-2
import java.util.Collection;
import java.util.Set;
HashMap<Integer,String> hm=new HashMap<Integer, String>();
hm.put(1, "Ram");
hm.put(2, "Raj");
hm.put(3, "Aliya");
hm.put(4, "Rio");
hm.put(5, "Rio");
hm.put(5, "Rio");
//Updating values base on key

Set<Integer>key=hm.keySet();
for (Integer keyVal:key) {
if (keyVal==5) {
hm.replace(5, "Bangkok");
}
}
Collection<String> val=hm.values();
for (String values:val) {
System.out.println(values);
if(values.equals("Aliya")) {
hm.replace(3, "Pune");
}
}
}
------------------------------------------
Count charcters count from given string-
ex-
String s="aabbcccddeeeeffrg";
char[] charArrays=s.toCharArray();
HashMap<Character, Integer> hm=new HashMap<Character, Integer>();
for (char ch:charArrays) {
if (hm.containsKey(ch)) {
hm.put(ch, hm.get(ch)+1);
}
else {
hm.put(ch, 1);
}
}
}
o/p-
{a=2, b=2, r=1, c=3, d=2, e=4, f=2, g=1}
if we want to preserve the insertion order the we go for LinkedHashMap
ex-
import java.util.LinkedHashMap;
LinkedHashMap<Character, Integer> hm=new LinkedHashMap<Character,

Integer>();
}
else {
hm.put(ch, 1);
}
}
}
o/p
{a=2, b=2, c=3, d=2, e=4, f=2, r=1, g=1}
When we want to asend base on the keys then we go for treemap
ex-
import java.util.LinkedHashMap;
import java.util.TreeMap;
TreeMap<Character, Integer> hm=new TreeMap<Character, Integer>();
}
else {
hm.put(ch, 1);
}
}
}
o/p-
{a=2, b=2, c=3, d=2, e=4, f=2, g=1, r=1}

Collections

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Collections

Uploaded by

Copyright:

Available Formats

Collections-

it is nothing but the framework defined in java.

it provides architecture to store & manipulate the group of objects.

Clasess & interfaces-

public class ArrayListClass {

public static void main(String[] args) {

int [] i=new int[3];

ArrayList <Integer> al=new ArrayList<Integer>();

ArrayList <String> al1=new ArrayList<String>();

add()- add data in the list

set();- set values at gievn index

public class ArrayListClass {

public static void main(String[] args) {

ArrayList <Integer> al=new ArrayList<Integer>();

ArrayList <Integer> al1=new ArrayList<Integer>();

public class ArrayListClass {

public static void main(String[] args) {

//From list to arrays

ArrayList <String> al=new ArrayList<String>();

String []arrays=new String[al.size()];

public class ArrayListClass {

public static void main(String[] args) {

//From arrays to List conversion

ArrayList <String> al=new ArrayList<String>(Arrays.asList(arrays));

Arraylist are follwing insertion order.

public class ArrayListClass {

public static void main(String[] args) {

//From arrays to List conversion

ArrayList <String> al=new ArrayList<String>(Arrays.asList(arrays));

LinkedList<String> ll=new LinkedList<String>();

when we want to iterate on the values of cxollection

public class ArrayListClass {

public static void main(String[] args) {

//From arrays to List conversion

ArrayList <String> al=new ArrayList<String>(Arrays.asList(arrays));

LinkedList<String> ll=new LinkedList<String>();

List iterator for List implementing classes-

public class ArrayListClass {

public static void main(String[] args) {

//From arrays to List conversion

ArrayList <String> al=new ArrayList<String>(Arrays.asList(arrays));

When we dont want to maintain insertion order and duplicate value

public class ArrayListClass {

public static void main(String[] args) {

//From arrays to List conversion

ArrayList <String> al=new ArrayList<String>(Arrays.asList(arrays));

HashSet<String> hs=new HashSet<String>();

No null values accpted

public class ArrayListClass {

public static void main(String[] args) {

//From arrays to List conversion

ArrayList <String> al=new ArrayList<String>(Arrays.asList(arrays));

HashSet<String> hs=new HashSet<String>();

TreeSet<String> tr=new TreeSet<String>();

Keys are aleays unique- no duplicate values are allowed

values can be duplicate

public class MapParctice {

public static void main(String[] args) {

HashMap<Integer,String> hm=new HashMap<Integer, String>();

public class MapParctice {

public static void main(String[] args) {

HashMap<Integer,String> hm=new HashMap<Integer, String>();