Java Technologies: Collections in java

Click here to download eclipse supported ZIP file

This is ArrayListTest.java file having the source code to execute business logic.

 
    
/**

 * 

 */

package com.cv.java.collection;



import java.util.ArrayList;



/**

 * @author Chandra Vardhan

 *

 */

public class ArrayListTest {



  /**

   * 

   */

  public ArrayListTest() {

  }



  /**

   * @param args

   */

  public static void main(String[] args) {



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

    list.add("cv");

    list.add("cv");

    list.add("cv");

    System.out.println(list);



  }



}

This is ConcurrentHashMapVsSynchronizedMap.java file having the source code to execute business logic.

 
    
package com.cv.java.collection;



import java.util.Collections;

import java.util.HashMap;

import java.util.Hashtable;

import java.util.Map;

import java.util.concurrent.ConcurrentHashMap;

import java.util.concurrent.ExecutorService;

import java.util.concurrent.Executors;

import java.util.concurrent.TimeUnit;



/**

 * @author Chandra Vardhan

 *

 */



public class ConcurrentHashMapVsSynchronizedMap {



  public final static int THREAD_POOL_SIZE = 5;



  public static Map<String, Integer> hashTableObject = null;

  public static Map<String, Integer> synchronizedMapObject = null;

  public static Map<String, Integer> concurrentHashMapObject = null;

  public static Map<String, Integer> hashMapObject = null;



  public static void main(String[] args) throws InterruptedException {

    putTest();

    getTest();

  }



  public static void putTest() throws InterruptedException {

    hashTableObject = new Hashtable<String, Integer>();

    performPutTest(hashTableObject);



    synchronizedMapObject = Collections

        .synchronizedMap(new HashMap<String, Integer>());

    performPutTest(synchronizedMapObject);



    concurrentHashMapObject = new ConcurrentHashMap<String, Integer>();

    performPutTest(concurrentHashMapObject);



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

    performPutTest(hashMapObject);

  }



  public static void getTest() throws InterruptedException {

    hashTableObject = new Hashtable<String, Integer>();

    hashTableObject.put("cv", 1);

    hashTableObject.put("sv", 2);

    hashTableObject.put("nk", 3);

    hashTableObject.put("cv1", 1);

    hashTableObject.put("sv1", 2);

    hashTableObject.put("nk1", 3);

    hashTableObject.put("cv2", 1);

    hashTableObject.put("sv3", 2);

    hashTableObject.put("nk2", 3);

    performGetTest(hashTableObject);



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

    hashMap.put("cv", 1);

    hashMap.put("sv", 2);

    hashMap.put("nk", 3);

    hashMap.put("cv1", 1);

    hashMap.put("sv1", 2);

    hashMap.put("nk1", 3);

    hashMap.put("cv2", 1);

    hashMap.put("sv3", 2);

    hashMap.put("nk2", 3);

    synchronizedMapObject = Collections.synchronizedMap(hashMap);

    performGetTest(synchronizedMapObject);



    concurrentHashMapObject = new ConcurrentHashMap<String, Integer>();

    concurrentHashMapObject.put("cv", 1);

    concurrentHashMapObject.put("sv", 2);

    concurrentHashMapObject.put("nk", 3);

    concurrentHashMapObject.put("cv1", 1);

    concurrentHashMapObject.put("sv1", 2);

    concurrentHashMapObject.put("nk1", 3);

    concurrentHashMapObject.put("cv2", 1);

    concurrentHashMapObject.put("sv3", 2);

    concurrentHashMapObject.put("nk2", 3);

    

    performGetTest(concurrentHashMapObject);

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

    hashMap2.put("cv", 1);

    hashMap2.put("sv", 2);

    hashMap2.put("nk", 3);

    hashMap2.put("cv1", 1);

    hashMap2.put("sv1", 2);

    hashMap2.put("nk1", 3);

    hashMap2.put("cv2", 1);

    hashMap2.put("sv3", 2);

    hashMap2.put("nk2", 3);

    performGetTest(hashMap2);

  }



  public static void performPutTest(final Map<String, Integer> map)

      throws InterruptedException {



    System.out.println("Test started for: " + map.getClass());

    long averageTime = 0;

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



      long startTime = System.nanoTime();

      ExecutorService thread = Executors

          .newFixedThreadPool(THREAD_POOL_SIZE);

      for (int j = 0; j < THREAD_POOL_SIZE; j++) {

        thread.execute(new Runnable() {

          public void run() {



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

              Integer randomNumber = (int) Math.ceil(Math

                  .random() * 550000);



              // Put value

              map.put(String.valueOf(randomNumber), randomNumber);

            }

          }

        });

      }



      // Make sure executor stops

      thread.shutdown();



      // Blocks until all tasks have completed execution after a shutdown

      // request

      thread.awaitTermination(Long.MAX_VALUE, TimeUnit.DAYS);



      long entTime = System.nanoTime();

      long totalTime = (entTime - startTime) / 1000000L;

      averageTime += totalTime;

      System.out.println("2500K entried added/retrieved in " + totalTime

          + " ms");

    }

    System.out.println("For " + map.getClass() + " the average time is "

        + averageTime / 5 + " ms\n");

  }



  public static void performGetTest(final Map<String, Integer> map)

      throws InterruptedException {



    System.out.println("Test started for: " + map.getClass());

    long averageTime = 0;

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



      long startTime = System.nanoTime();

      ExecutorService thread = Executors

          .newFixedThreadPool(THREAD_POOL_SIZE);

      for (int j = 0; j < THREAD_POOL_SIZE; j++) {

        thread.execute(new Runnable() {

          @Override

          public void run() {



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

              for (Map.Entry<String, Integer> entry : map

                  .entrySet()) {

                entry.getKey();

                entry.getValue();

              }

            }

          }

        });

      }



      // Make sure executor stops

      thread.shutdown();



      // Blocks until all tasks have completed execution after a shutdown

      // request

      thread.awaitTermination(Long.MAX_VALUE, TimeUnit.DAYS);



      long entTime = System.nanoTime();

      long totalTime = (entTime - startTime) / 1000000L;

      averageTime += totalTime;

      System.out.println("Entried get in " + totalTime

          + " ms");

    }

    System.out.println("For " + map.getClass() + " the average time is "

        + averageTime / 5 + " ms\n");

  }

}

This is FailFastArrayListExample.java file having the source code to execute business logic.

 
    
package com.cv.java.collection;



import java.util.ArrayList;

import java.util.Iterator;



public class FailFastArrayListExample {



  public static void main(String[] args) {

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

    list.add("Apple");

    list.add("HTC");

    list.add("Samsung");



    Iterator iterator = list.iterator();



    while (iterator.hasNext()) {

      System.out.println(iterator.next());

//      iterator.remove();

      list.add("Sony");

      System.out.println(list.get(1));

//      map.remove(iterator.next());

    }



  }

}

This is FailFastExample2.java file having the source code to execute business logic.

 
    
package com.cv.java.collection;



import java.util.Enumeration;

import java.util.Hashtable;

import java.util.Iterator;

import java.util.Set;



public class FailFastExample2 {



  public static void main(String[] args) {

    Hashtable<String, String> ht = new Hashtable<String, String>();

    ht.put("Apple", "iPhone");

    ht.put("HTC", "HTC one");

    ht.put("Samsung", "S5");



    /*Iterator iterator = ht.keySet().iterator();

    while (iterator.hasNext()) {

      System.out.println(ht.get(iterator.next()));

      ht.put("Sony", "Xperia Z");

    }*/



    Enumeration<String> enumKey = ht.keys();

    while (enumKey.hasMoreElements()) {

      String key = enumKey.nextElement();

      String val = ht.get(key);

      if (key != null && val.equals("iPhone")) {

        ht.remove(key);

      }

      System.out.println(key +"---"+val);

    }

    

    

    String str;

     

      // Creating a Hashtable instance

      Hashtable<String, String> hashtable = new Hashtable<String, String>();

   

      /* Adding key-value pairs to Hashtable

       * public V put(K key, V value): Maps the specified key to the 

       * specified value in this hashtable. Neither the key nor the 

       * value can be null. The value can be retrieved by calling the 

       * get method with a key that is equal to the original key.

       */

      hashtable.put("A", "Apple");

      hashtable.put("B", "Orange");

      hashtable.put("C", "Mango");

      hashtable.put("D", "Banana");

      hashtable.put("E", "Grapes");

   

      System.out.println("Hashtable contains:");

   

      /* public Set<K> keySet(): Returns a Set view of the keys 

       * contained in this map. The set is backed by the map, 

       * so changes to the map are reflected in the set, and 

       * vice-versa.

       */

      Set<String> keys = hashtable.keySet();

   

      //Obtaining iterator over set entries

      Iterator<String> itr = keys.iterator();

   

      //Displaying Key and value pairs

      while (itr.hasNext()) { 

         // Getting Key

         str = itr.next();



         /* public V get(Object key): Returns the value to which 

          * the specified key is mapped, or null if this map 

          * contains no mapping for the key.

          */

         System.out.println("Key: "+str+" & Value: "+hashtable.get(str));

         

         if(str.equals("A")) {

           hashtable.remove(str);

         }

      } 

  }



}

This is FailFastMapExample.java file having the source code to execute business logic.

 
    
package com.cv.java.collection;



import java.util.HashMap;

import java.util.Iterator;

import java.util.Map;

import java.util.Map.Entry;



public class FailFastMapExample {



  public static void main(String[] args) {

    Map<String, String> map = new HashMap<String, String>();

    map.put("Apple", "iPhone");

    map.put("HTC", "HTC one");

    map.put("Samsung", "S5");



    Iterator iterator = map.keySet().iterator();



    while (iterator.hasNext()) {

      System.out.println(map.get(iterator.next()));

//      iterator.remove();

//      map.put("Sony", "Xperia Z");

//      map.remove(iterator.next());

    }

    

    for (Entry<String, String> entry : map.entrySet()) {      

      String key = entry.getKey();

      if(key.equals("HTC")) {

//        map.put("HTC1", "S6");//Problematic statement

      }      

    }

    

    for (String key : map.keySet()) {      

      if(key.equals("HTC")) {

//        map.put("HTC1", "S6");//Problematic statement

      }

      

    }



    map.put("Sony", "Xperia Z");

    

    System.out.println(map);

  }

}

This is FailSafeExample.java file having the source code to execute business logic.

 
    
package com.cv.java.collection;



import java.util.concurrent.ConcurrentHashMap;

import java.util.Iterator;



public class FailSafeExample {



  public static void main(String[] args) {

    ConcurrentHashMap<String, String> concurrentMap = new ConcurrentHashMap<String, String>();

    concurrentMap.put("Apple", "iPhone");

    concurrentMap.put("HTC", "HTC one");

    concurrentMap.put("Samsung", "S5");

    Iterator iterator = concurrentMap.keySet().iterator();

    while (iterator.hasNext()) {

      System.out.println(concurrentMap.get(iterator.next()));

      concurrentMap.put("Sony", "Xperia Z");

    }

  }



}

This is MyLinkedList.java file having the source code to execute business logic.

 
    
package com.cv.java.collection;



/**

 * @author Chandra Vardhan

 * 

 */

public class MyLinkedList {



  private Node head;

  private int size;



  public MyLinkedList() {

    head = new Node(null);

    size = 0;

  }



  public void addFirst(Object data) {

    Node newNode = new Node(data);

    head = newNode;

    while (head.next != null) {

      head = head.next;

    }

    head.next = newNode;

    size++;

  }



  public void addLast(Object data) {

    Node newNode = new Node(data);

    Node current = head;

    while (current.next != null) {

      current = current.next;

    }

    current.next = newNode;

    size++;

  }



  public void add(Object data, int index) {

    Node newNode = new Node(data);

    Node current = head;

    for (int i = 1; i < index && current.next != null; i++) {

      current = current.next;

    }

    newNode.next = current.next;

    current.next = newNode;

    size++;

  }



  public Object get(int index) {



    if (index <= 0)

      return null;



    Node current = head.next;

    for (int i = 1; i < index; i++) {

      if (current.next == null)

        return null;



      current = current.next;

    }

    return current.data;

  }



  public boolean remove(int index) {



    if (index < 0 || index > size)

      return false;



    Node current = head;

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

      if (current.next == null)

        return false;



      current = current.next;

    }

    current.next = current.next.next;

    size--;

    return true;

  }



  public int size() {

    return size;

  }



  StringBuffer output = null;



  public String toString() {

    Node current = head.next;

    output = new StringBuffer();

    while (current != null) {

      output.append(",");

      output.append(current.data.toString());

      current = current.next;

    }

    output.deleteCharAt(0);

    return "[" + output + "]";

  }



  private static class Node {

    Node next;

    Object data;



    public Node(Object data) {

      next = null;

      this.data = data;

    }



    public Node(Object data, Node next) {

      this.next = next;

      this.data = data;

    }

  }



  public static void main(String[] args) {

    MyLinkedList myLinkedList = new MyLinkedList();

    // /myLinkedList.add(1);

    /*

     * myLinkedList.addFirst(11); myLinkedList.addFirst(12);

     */

    myLinkedList.addLast(134);

    myLinkedList.addLast(14);

    myLinkedList.add(17, 2);

    System.out.println(myLinkedList);

  }



}

This is Fruit.java file having the source code to execute business logic.

 
    
package com.cv.java.util;



/**

 * @author Chandra Vardhan

 * 

 */

public class Fruit {



  private String fruitName;

  private String fruitDesc;

  private int quantity;



  public Fruit(String fruitName, String fruitDesc, int quantity) {

    super();

    this.fruitName = fruitName;

    this.fruitDesc = fruitDesc;

    this.quantity = quantity;

  }



  public String getFruitName() {

    return fruitName;

  }



  public void setFruitName(String fruitName) {

    this.fruitName = fruitName;

  }



  public String getFruitDesc() {

    return fruitDesc;

  }



  public void setFruitDesc(String fruitDesc) {

    this.fruitDesc = fruitDesc;

  }



  public int getQuantity() {

    return quantity;

  }



  public void setQuantity(int quantity) {

    this.quantity = quantity;

  }

}

This is Fruit2.java file having the source code to execute business logic.

 
    
package com.cv.java.util;



/**

 * @author Chandra Vardhan

 * 

 */

public class Fruit2 implements Comparable<Fruit2> {



  private String fruitName;

  private String fruitDesc;

  private int quantity;



  public Fruit2(String fruitName, String fruitDesc, int quantity) {

    super();

    this.fruitName = fruitName;

    this.fruitDesc = fruitDesc;

    this.quantity = quantity;

  }



  public String getFruitName() {

    return fruitName;

  }



  public void setFruitName(String fruitName) {

    this.fruitName = fruitName;

  }



  public String getFruitDesc() {

    return fruitDesc;

  }



  public void setFruitDesc(String fruitDesc) {

    this.fruitDesc = fruitDesc;

  }



  public int getQuantity() {

    return quantity;

  }



  public void setQuantity(int quantity) {

    this.quantity = quantity;

  }





  @Override

  public int compareTo(Fruit2 o) {

    int compareQuantity = ((Fruit2) o).getQuantity();



    // ascending order

    return this.quantity - compareQuantity;



    // descending order

    // return compareQuantity - this.quantity;



  }

}

This is Fruit3.java file having the source code to execute business logic.

 
    
package com.cv.java.util;



import java.util.Comparator;



/**

 * @author Chandra Vardhan

 * 

 */

public class Fruit3 implements Comparable<Fruit3> {



  private String fruitName;

  private String fruitDesc;

  private int quantity;

  public  static String s = new String("cv");

  public static Comparator<Fruit3> FruitNameComparator = new Comparator<Fruit3>() {



    public int compare(Fruit3 fruit1, Fruit3 fruit2) {



      String fruitName1 = fruit1.getFruitName().toUpperCase();

      String fruitName2 = fruit2.getFruitName().toUpperCase();



      // ascending order

      return fruitName2.compareTo(fruitName1);



      // descending order

      // return fruitName2.compareTo(fruitName1);

    }



  };



  public Fruit3(String fruitName, String fruitDesc, int quantity) {

    super();

    this.fruitName = fruitName;

    this.fruitDesc = fruitDesc;

    this.quantity = quantity;

  }



  public String getFruitName() {

    return fruitName;

  }



  public void setFruitName(String fruitName) {

    this.fruitName = fruitName;

  }



  public String getFruitDesc() {

    return fruitDesc;

  }



  public void setFruitDesc(String fruitDesc) {

    this.fruitDesc = fruitDesc;

  }



  public int getQuantity() {

    return quantity;

  }



  public void setQuantity(int quantity) {

    this.quantity = quantity;

  }



  @Override

  public int compareTo(Fruit3 compareFruit) {



    int compareQuantity = ((Fruit3) compareFruit).getQuantity();



    // ascending order

    return this.quantity - compareQuantity;



    // descending order

    // return compareQuantity - this.quantity;



  }



  



}

This is Fruits.java file having the source code to execute business logic.

 
    
package com.cv.java.util;



import java.util.ArrayList;

import java.util.Arrays;

import java.util.Collections;

import java.util.List;



/**

 * @author Chandra Vardhan

 * 

 */

public class Fruits {



  public static void main(String[] args) {



    String[] fruits = new String[] { "Pineapple", "Apple", "Orange", "Banana" };

    int i = 0;

    for (String temp : fruits) {

      System.out.println("fruits " + ++i + " : " + temp);

    }

    Arrays.sort(fruits);

    System.out.println("==================================================");

    int j = 0;

    for (String temp : fruits) {

      System.out.println("fruits " + ++j + " : " + temp);

    }

    System.out.println("==================================================");

    List<String> listFruits = new ArrayList<String>();



    listFruits.add("Pineapple");

    listFruits.add("Apple");

    listFruits.add("Orange");

    listFruits.add("Banana");

    int m = 0;

    for (String temp : listFruits) {

      System.out.println("fruits " + ++m + " : " + temp);

    }

    Collections.sort(listFruits);

    System.out.println("==================================================");



    int k = 0;

    for (String temp : listFruits) {

      System.out.println("fruits " + ++k + " : " + temp);

    }

    System.out.println("==================================================");

  }



}

This is SortFruitObject.java file having the source code to execute business logic.

 
    
package com.cv.java.util;



import java.util.Arrays;



/**

 * @author Chandra Vardhan

 * 

 */

public class SortFruitObject {



  public static void main(String args[]) {



    Fruit[] fruits = new Fruit[4];



    Fruit pineappale = new Fruit("Pineapple", "Pineapple description", 70);

    Fruit apple = new Fruit("Apple", "Apple description", 100);

    Fruit orange = new Fruit("Orange", "Orange description", 80);

    Fruit banana = new Fruit("Banana", "Banana description", 90);



    fruits[0] = pineappale;

    fruits[1] = apple;

    fruits[2] = orange;

    fruits[3] = banana;



    Arrays.sort(fruits);



    int i = 0;

    for (Fruit temp : fruits) {

      System.out.println("fruits " + ++i + " : " + temp.getFruitName() + ", Quantity : " + temp.getQuantity());

    }



  }

}

This is SortFruitObject2.java file having the source code to execute business logic.

 
    
package com.cv.java.util;



import java.util.Arrays;



/**

 * @author Chandra Vardhan

 * 

 */

public class SortFruitObject2 {



  public static void main(String args[]) {



    Fruit2[] fruits = new Fruit2[4];



    Fruit2 pineappale = new Fruit2("Pineapple", "Pineapple description", 70);

    Fruit2 apple = new Fruit2("Apple", "Apple description", 100);

    Fruit2 orange = new Fruit2("Orange", "Orange description", 80);

    Fruit2 banana = new Fruit2("Banana", "Banana description", 90);



    fruits[0] = pineappale;

    fruits[1] = apple;

    fruits[2] = orange;

    fruits[3] = banana;

    int i = 0;

    for (Fruit2 temp : fruits) {

      System.out.println("fruits " + ++i + " : " + temp.getFruitName() + ", Quantity : " + temp.getQuantity());

    }

    System.out.println("==========================================");

    Arrays.sort(fruits);



    int j = 0;

    for (Fruit2 temp : fruits) {

      System.out.println("fruits " + ++j + " : " + temp.getFruitName() + ", Quantity : " + temp.getQuantity());

    }



  }

}

This is SortFruitObject3.java file having the source code to execute business logic.

 
    
package com.cv.java.util;



import java.util.ArrayList;

import java.util.Arrays;

import java.util.Collections;

import java.util.List;



/**

 * @author Chandra Vardhan

 * 

 */

public class SortFruitObject3 {



  public static void main(String args[]) {



    Fruit3[] fruits = new Fruit3[4];

    

    System.out.println(Fruit3.s);



    Fruit3 pineappale = new Fruit3("Pineapple", "Pineapple description", 70);

    Fruit3 apple = new Fruit3("Apple", "Apple description", 80);

    Fruit3 orange = new Fruit3("Orange", "Orange description", 90);

    Fruit3 banana = new Fruit3("Banana", "Banana description", 100);



    fruits[0] = pineappale;

    fruits[1] = apple;

    fruits[2] = orange;

    fruits[3] = banana;

    int i = 0;

    for (Fruit3 temp : fruits) {

      System.out.println("fruits " + ++i + " : " + temp.getFruitName() + ", Quantity : " + temp.getQuantity());

    }

    System.out.println("==========================================");

//    Arrays.sort(fruits);

    Arrays.sort(fruits, Fruit3.FruitNameComparator);

    int j = 0;

    for (Fruit3 temp : fruits) {

      System.out.println("fruits " + ++j + " : " + temp.getFruitName() + ", Quantity : " + temp.getQuantity());

    }

    

    System.out.println("========================================== list ==========");

//    Arrays.sort(fruits);



    Fruit3 pineappale1 = new Fruit3("Pineapple", "Pineapple description", 70);

    Fruit3 apple1 = new Fruit3("Apple", "Apple description", 100);

    Fruit3 orange1 = new Fruit3("Orange", "Orange description", 80);

    Fruit3 banana1 = new Fruit3("Banana", "Banana description", 90);



    List<Fruit3> list = new ArrayList<Fruit3>();

    list.add(pineappale1);

    list.add(apple1);

    list.add(orange1);

    list.add(banana1);

    int k = 0;

    for (Fruit3 temp : list) {

      System.out.println("fruits " + ++k + " : " + temp.getFruitName() + ", Quantity : " + temp.getQuantity());

    }

    System.out.println("==========================================  list ==========");

//    Arrays.sort(fruits);

    Collections.sort(list, Fruit3.FruitNameComparator);

    int n = 0;

    for (Fruit3 temp : fruits) {

      System.out.println("fruits " + ++n + " : " + temp.getFruitName() + ", Quantity : " + temp.getQuantity());

    }

    

    



  }

}

This is ConcurrentModificationExceptionExample.java file having the source code to execute business logic.

 
    
package com.cv.util.exceptions;



import java.util.ArrayList;

import java.util.HashMap;

import java.util.Iterator;

import java.util.List;

import java.util.Map;



public class ConcurrentModificationExceptionExample {



  public static void main(String args[]) {

    List<String> myList = new ArrayList<String>();



    myList.add("1");

    myList.add("2");

    myList.add("3");

    myList.add("4");

    myList.add("5");



    Iterator<String> it = myList.iterator();

    while (it.hasNext()) {

      String value = it.next();

      System.out.println("List Value:" + value);

      if (value.equals("3"))

        myList.remove(value);

    }



    Map<String, String> myMap = new HashMap<String, String>();

    myMap.put("1", "1");

    myMap.put("2", "2");

    myMap.put("3", "3");



    Iterator<String> it1 = myMap.keySet().iterator();

    while (it1.hasNext()) {

      String key = it1.next();

      System.out.println("Map Value:" + myMap.get(key));

      if (key.equals("2")) {

        myMap.remove("2");

      }

    }



  }

}

This is OperationNotSupportedExceptionExample.java file having the source code to execute business logic.

 
    
package com.cv.util.exceptions;



import java.util.ArrayList;

import java.util.Collections;

import java.util.List;



public class OperationNotSupportedExceptionExample {



  public static void main(String args[]) {

    List<String> myList = new ArrayList<String>();



    myList.add("1");

    myList.add("2");

    myList.add("3");

    myList.add("4");

    myList.add("5");

    List<String> unmodifiableList = Collections.unmodifiableList(myList);

    

    unmodifiableList.add("6");

    

    System.out.println(unmodifiableList);



  }

}

This is pom.xml file having the entries of dependency jars and information to build the application .

<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
  <modelVersion>4.0.0</modelVersion>
  <groupId>com.cv.java.collection</groupId>
  <artifactId>CollectionsJava</artifactId>
  <version>1.0</version>
  
  <build>
		<pluginManagement>
			<plugins>
				<plugin>
					<groupId>org.apache.maven.plugins</groupId>
					<artifactId>maven-compiler-plugin</artifactId>
					<version>3.1</version>
					<configuration>
						<source>1.6</source>
						<target>1.6</target>
					</configuration>
				</plugin>

			</plugins>
		</pluginManagement>
		<finalName>CollectionsJava</finalName>
	</build>
</project>

This is log4j.properties file having the entries for logging the information into the console/file.

#By default enabling Console appender
# Root logger option
log4j.rootLogger=INFO, stdout

# Redirect log messages to console
log4j.appender.stdout=org.apache.log4j.ConsoleAppender
log4j.appender.stdout.Target=System.out
log4j.appender.stdout.layout=org.apache.log4j.PatternLayout
log4j.appender.stdout.layout.ConversionPattern=%-5p [%c]:%L -->> %m%n

# Redirect log messages to a log file
#log4j.appender.file=org.apache.log4j.RollingFileAppender
#log4j.appender.file.File=C:\servlet-application.log
#log4j.appender.file.MaxFileSize=5MB
#log4j.appender.file.MaxBackupIndex=10
#log4j.appender.file.layout=org.apache.log4j.PatternLayout
#log4j.appender.file.layout.ConversionPattern=%d{yyyy-MM-dd HH:mm:ss} %-5p %c{1}:%L - %m%n

Java Technologies

Collections in java

Click here to download eclipse supported ZIP file

This is ArrayListTest.java file having the source code to execute business logic.

This is ConcurrentHashMapVsSynchronizedMap.java file having the source code to execute business logic.

This is FailFastArrayListExample.java file having the source code to execute business logic.

This is FailFastExample2.java file having the source code to execute business logic.

This is FailFastMapExample.java file having the source code to execute business logic.

This is FailSafeExample.java file having the source code to execute business logic.

This is MyLinkedList.java file having the source code to execute business logic.

This is Fruit.java file having the source code to execute business logic.

This is Fruit2.java file having the source code to execute business logic.

This is Fruit3.java file having the source code to execute business logic.

This is Fruits.java file having the source code to execute business logic.

This is SortFruitObject.java file having the source code to execute business logic.

This is SortFruitObject2.java file having the source code to execute business logic.

This is SortFruitObject3.java file having the source code to execute business logic.

This is ConcurrentModificationExceptionExample.java file having the source code to execute business logic.

This is OperationNotSupportedExceptionExample.java file having the source code to execute business logic.

This is pom.xml file having the entries of dependency jars and information to build the application .

This is log4j.properties file having the entries for logging the information into the console/file.

No comments:

Post a Comment