Generics and Collections

Author: turingfly

Java-8/src/genericsAndCollections/ArrayAndArrayList.java

@@ -20,7 +20,6 @@ public void test() {
 		// Changes are reflected in both, since they are backed by the same data.
 		array[0] = "c";
 		// convert a List to an Array
-		
 		String[] array2 = (String[]) list.toArray(); // [c, b]
 
 		// list.remove(1); throws UnsupportedOperationException

Java-8/src/genericsAndCollections/GenericBound.java

@@ -63,7 +63,6 @@ public static void printList1(List<?> list) {
 	 * used the keyword extends rather than implements .
 	 */
 	public static long total(List<? extends Number> list) {
-
 		// ArrayList<Number> list = new ArrayList<Integer>(); // DOES NOT
 		// COMPILE
 		long count = 0;

Java-8/src/genericsAndCollections/GenericClass.java

@@ -2,7 +2,8 @@
 
 /**
  * 
- * @author chengfeili Jun 7, 2017 5:44:24 PM
+ * @author chengfeili 
+ * Jun 7, 2017 5:44:24 PM
  * 
  *            When you instantiate the class, you tell the compiler what T
  *            should be for that particular instance.

Java-8/src/genericsAndCollections/SearchingAndSorting.java

@@ -21,14 +21,13 @@ public void test() {
 		int[] nums = {6, 9, 1, 8};
 		Arrays.sort(nums); // [1, 6, 8, 9]
 		System.out.println(Arrays.binarySearch(nums, 6)); // 1
-		System.out.println(Arrays.binarySearch(nums, 3)); // -2  ( -1 -1 )
+		System.out.println(Arrays.binarySearch(nums, 3)); // -2  ( -1 -1 = -2)
 	}
 	public void test2() {
 		List<A> list = new ArrayList<>();
 		list.add(new A());
 		// Collections.sort(list); Does not compile
 		Comparator<A> c = (a, b) -> a.id - b.id;
 		Collections.sort(list, c);
-		
 	}
 }

Java-8/src/genericsAndCollections/UsingQueue.java

@@ -5,9 +5,11 @@
 
 /**
  * 
- * @author chengfeili Jun 7, 2017 7:52:08 PM 
+ * @author chengfeili 
+ * Jun 7, 2017 7:52:08 PM 
+ * 
  * 		   LinkedList: In addition to being a
- *         list, it is a double- ended queue. A double-ended queue is different
+ *         list, it is a double-ended queue. A double-ended queue is different
  *         from a regular queue in that you can insert and remove elements from
  *         both the front and back of the queue. The main benefit of a
  *         LinkedList is that it implements both the List and Queue interfaces.