File Search engine without threads

cs-hackathon-2022 · cs-hackathon-2022 · commit 932b5816a4dc · 2019-05-25T10:52:02.000+05:30
diff --git a/multithreading/src/com/itp/threads/ThreadPoolTest.java b/multithreading/src/com/itp/threads/ThreadPoolTest.java
@@ -0,0 +1,16 @@
+package com.itp.threads;
+
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+
+public class ThreadPoolTest {
+
+	public static void main(String[] args) {
+		
+		ExecutorService service = Executors.newFixedThreadPool(4);
+		
+		//Callable
+		//service.submit(new Deposit())
+		
+	}
+}
diff --git a/search-engine/.gitignore b/search-engine/.gitignore
@@ -0,0 +1 @@
+/bin/
diff --git a/search-engine/src/com/itp/searcheng/Application.java b/search-engine/src/com/itp/searcheng/Application.java
@@ -0,0 +1,49 @@
+package com.itp.searcheng;
+
+import java.io.BufferedReader;
+import java.io.File;
+import java.io.FilenameFilter;
+import java.nio.file.Files;
+import java.nio.file.Paths;
+
+public class Application {
+
+	public static void main(String[] args) {
+
+		if (args.length != 2) {
+			System.out.println("Usage: java Application <searchDir> <searchString>");
+			System.exit(1);
+		} else {
+			// System.out.println(args[0]);
+			// System.out.println(args[1]);
+
+			// 1. Retrieve all java files from given directory.
+
+			File dir = new File(args[0]);
+			File[] files = dir.listFiles(new FilenameFilter() {
+				@Override
+				public boolean accept(File arg0, String fname) {
+					return fname.endsWith(".java");
+				}
+			});
+
+			// 2. Search given content in each and every file.
+			for (File file : files) {
+				System.out.println("Searching into " + file.getAbsolutePath());
+				try (BufferedReader br = Files.newBufferedReader(Paths.get(file.getAbsolutePath()))) {
+					String line = "";
+					int count = 1;
+					while ((line = br.readLine()) != null) {
+						if (line.indexOf(args[1]) >= 0) {
+							System.out.println(count+":"+line);
+						}
+						count++;
+					}
+				} catch (Exception e) {
+					e.printStackTrace();
+				}
+			}
+		}
+
+	}
+}
