Make code look more like Java 8

Author: gousiosg

src/main/java/gr/gousiosg/javacg/dyn/Instrumenter.java

@@ -46,8 +46,8 @@
 
 public class Instrumenter implements ClassFileTransformer {
 
-    static List<Pattern> pkgIncl = new ArrayList<Pattern>();
-    static List<Pattern> pkgExcl = new ArrayList<Pattern>();
+    static List<Pattern> pkgIncl = new ArrayList<>();
+    static List<Pattern> pkgExcl = new ArrayList<>();
 
     public static void premain(String argument, Instrumentation instrumentation) {
 
@@ -63,14 +63,14 @@ public static void premain(String argument, Instrumentation instrumentation) {
         String[] tokens = argument.split(";");
 
         if (tokens.length < 1) {
-            err("Missing delimeter ;");
+            err("Missing delimiter ;");
             return;
         }
 
         for (String token : tokens) {
             String[] args = token.split("=");
             if (args.length < 2) {
-                err("Missing argument delimeter =:" + token);
+                err("Missing argument delimiter =:" + token);
                 return;
             }
 
@@ -118,7 +118,7 @@ public byte[] transform(ClassLoader loader, String className, Class clazz,
         for (Pattern p : pkgExcl) {
             Matcher m = p.matcher(name);
             if (m.matches()) {
-                err("Not enhansing class: " + name);
+                err("Skipping class: " + name);
                 enhanceClass = false;
                 break;
             }

src/main/java/gr/gousiosg/javacg/dyn/MethodStack.java

@@ -33,40 +33,36 @@
 import java.io.IOException;
 import java.util.ArrayList;
 import java.util.Collections;
-import java.util.Comparator;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
 import java.util.Stack;
 
 public class MethodStack {
 
-    private static Stack<String> stack = new Stack<String>();
-    private static Map<Pair<String, String>, Integer> callgraph = new HashMap<Pair<String,String>, Integer>();
+    private static Stack<String> stack = new Stack<>();
+    private static Map<Pair<String, String>, Integer> callgraph = new HashMap<>();
     static FileWriter fw; 
     static StringBuffer sb;
     static long threadid = -1L;
-    
+
     static {
         Runtime.getRuntime().addShutdownHook(new Thread() {
             public void run() {
                 try {
                     fw.close();
                 } catch (IOException e) {
-                    // TODO Auto-generated catch block
                     e.printStackTrace();
                 }
                 //Sort by number of calls
-                List<Pair<String, String>> keys = new ArrayList<Pair<String, String>>();
+                List<Pair<String, String>> keys = new ArrayList<>();
                 keys.addAll(callgraph.keySet());
-                Collections.sort(keys, new Comparator<Object>() {
-                    public int compare(Object o1, Object o2) {
-                        Integer v1 = callgraph.get(o1);
-                        Integer v2 = callgraph.get(o2);
-                        return v1.compareTo(v2);
-                    }
+                Collections.sort(keys, (o1, o2) -> {
+                    Integer v1 = callgraph.get(o1);
+                    Integer v2 = callgraph.get(o2);
+                    return v1.compareTo(v2);
                 });
-                
+
                 for (Pair<String, String> key : keys) {
                     System.out.println(key + " " + callgraph.get(key));
                 }
@@ -89,7 +85,7 @@ public static void push(String callname) throws IOException {
             return;
 
         if (!stack.isEmpty()) {
-            Pair<String, String> p = new Pair<String, String>(stack.peek(), callname); 
+            Pair<String, String> p = new Pair<>(stack.peek(), callname);
             if (callgraph.containsKey(p))
                 callgraph.put(p, callgraph.get(p) + 1);
             else