MapReduce :: 정규표현식 패턴으로 단어 검색

fver1004 · May 21, 2017 · d470d3c · d470d3c
1 parent 2fb80de
commit d470d3c
Show file tree

Hide file tree

Showing 2 changed files with 17 additions and 2 deletions.
diff --git a/DaeguLibCounter/bin/DaeguLibCounter/WordProcess.class b/DaeguLibCounter/bin/DaeguLibCounter/WordProcess.class
diff --git a/DaeguLibCounter/src/DaeguLibCounter/WordProcess.java b/DaeguLibCounter/src/DaeguLibCounter/WordProcess.java
@@ -7,6 +7,8 @@
 import java.util.LinkedHashMap;
 import java.util.List;
 import java.util.Map;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
 
 import org.apache.hadoop.conf.Configuration;
 import org.apache.hadoop.fs.FileSystem;
@@ -23,6 +25,10 @@ public class WordProcess {
 	Path pt=new Path("hdfs:/dic.txt");//Location of file in HDFS
 	LinkedHashMap<String, String[]> listMap = new LinkedHashMap<String, String[]>();
 	BufferedReader br;
+	String patternL = "(^|[^A-Z]|\\s)";
+	String patternR = "(\\s|[^A-Z+]|$)";
+	Pattern p;
+	Matcher m;
 
 	WordProcess() throws IOException{
 
@@ -51,10 +57,19 @@ public List<String> Processing(String bookname) throws IOException{
     	    for(Map.Entry<String, String[]> entry : listMap.entrySet()){
     	    	String key = entry.getKey();
     	    	String[] value = entry.getValue();
-
+
+    	    	//HASH value 배열 값들 비교. 정규표현식으로 아닌거 걸러내기
         	        for(String token : value){
-        	        	if(bookname.toUpperCase().contains(token))
+
+        	        	String pattern = patternL + token + patternR;
+
+        	        	p = Pattern.compile(pattern);
+        	        	m = p.matcher(bookname);
+
+        	        	if(m.find()){
         	        		tokenList.add(key);
+        	        		break;}//중복토큰 없도록 break
+
         	        }
     	    	}