sort a list using lambda in java 8

basahota · web-flow · commit a1d233786be2 · 2019-03-27T21:13:40.000+05:30
diff --git a/sort/SortListDemo.java b/sort/SortListDemo.java
@@ -0,0 +1,52 @@
+package com.javatechie.stream.sort;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.List;
+
+import com.javatechie.stream.api.example.DataBase;
+import com.javatechie.stream.api.example.Employee;
+
+public class SortListDemo {
+
+	public static void main(String[] args) {
+
+		List<Integer> list = new ArrayList<>();
+		list.add(8);
+		list.add(3);
+		list.add(12);
+		list.add(4);
+
+		List<Employee> employees = DataBase.getEmployees();
+
+		/*Collections.sort(employees, new Comparator<Employee>() {
+
+			@Override
+			public int compare(Employee o1, Employee o2) {
+				return (int) (o1.getSalary() - o2.getSalary());// ascending
+			}
+		});*/
+		
+		
+		Collections.sort(employees, ( o1,  o2) ->(int) (o1.getSalary() - o2.getSalary()));
+
+		//System.out.println(employees);
+		
+		
+		//employees.stream().sorted(( o1,  o2) ->(int) (o2.getSalary() - o1.getSalary())).forEach(System.out::println);
+		
+		//employees.stream().sorted(Comparator.comparing(emp->emp.getSalary())).forEach(System.out::println);
+		
+		employees.stream().sorted(Comparator.comparing(Employee::getDept)).forEach(System.out::println);
+
+		/*
+		 * Collections.sort(list);//ASSENDING Collections.reverse(list);
+		 * System.out.println(list);
+		 * 
+		 * list.stream().sorted(Comparator.reverseOrder()).forEach(s->System.out.println
+		 * (s));//descending
+		 */
+
+	}
+}
