Toret lt

Word + " We consider that it is misspelled."); } }- toret = new HeuristicCheckerResult(!isCheckingOnInternetNeaded, false, codeToBeChecked, this.getClass());- return toret;+ toRet = new HeuristicCheckerResult(!isCheckingOnInternetNeaded, false, codeToBeChecked, this.getClass());+ return toRet; } /**@@ -87,24 +87,24 @@ * @return list of words in codeToBeChecked */ List filterWordsFromCode(String codeToBeChecked) {- List toret = new ArrayList();+ List toRet = new ArrayList(); Pattern p = Pattern.compile("[a-zA-Z_]+", Pattern.MULTILINE); Matcher m = p.matcher(codeToBeChecked); while (m.find()) {- toret.add(m.group());- }- return toret;+ toRet.add(m.group());+ }+ return toRet; } boolean isWordCorrect(List combinedWords) throws IOException {- boolean toret = true;+ boolean toRet = true; for (String word : combinedWords) { // it is assumed that words with capital case are equal to word with // all small case in dictionary- toret = toret && spellChecker.exist(word.toLowerCase());- out.println(word + " " + toret);- }- return toret;+ toRet = toRet && spellChecker.exist(word.toLowerCase());+ out.println(word + " " + toRet);+ }+ return toRet; } /**@@ -118,11 +118,11 @@ */ List decomposeCombinedWord(String combinedWord) throws IllegalArgumentException { Validate.isTrue(combinedWord.matches("[a-zA-Z_]+"));- List toret = new ArrayList();- toret.add(combinedWord);- toret = decomposeUnderscoreCombinedWords(toret);- toret = decomposeCamelCombinedWords(toret);- return toret;+ List toRet = new ArrayList();+ toRet.add(combinedWord);+ toRet = decomposeUnderscoreCombinedWords(toRet);+ toRet = decomposeCamelCombinedWords(toRet);+ return toRet; } /**@@ -133,15 +133,15 @@ * @return list of decomposed words */ List decomposeUnderscoreCombinedWords(List combinedWord) {- List toret = new ArrayList();+ List toRet = new ArrayList(); for (String word : combinedWord) {- toret.addAll(new ArrayList(Arrays.asList(word.split("_+"))));+ toRet.addAll(new ArrayList(Arrays.asList(word.split("_+")))); // sometimes empty string is entered in list // this remove such entries- toret.remove("");+ toRet.remove(""); }- return toret;+ return toRet; } /**@@ -152,14 +152,14 @@ * @return list of decomposed words */ List decomposeCamelCombinedWords(List combinedWord) {- List toret = new ArrayList();+ List toRet = new ArrayList(); for (String word : combinedWord) { // extract only first part with small caps of string if it exists // example: thisIsMyName -> this Pattern p = Pattern.compile("\\b[a-z]+"); Matcher m = p.matcher(word); if (m.find()) {- toret.add(m.group());+ toRet.add(m.group()); } // extract all parts of string which starts with capital case to@@ -168,10 +168,10 @@ p = Pattern.compile("[A-Z][a-z]*"); m = p.matcher(word); while (m.find()) {- toret.add(m.group());+ toRet.add(m.group()); } }- return toret;+ return toRet; } @Override=======================================--- /trunk/src/main/java/org/apache/rat/pd/util/FileManipulator.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/util/FileManipulator.java Fri Aug 21 17:04:14 2009@@ -46,17 +46,17 @@ static public String readFile(String path) throws IOException { File aFile = new File(path);- String toret = "";+ String toRet = ""; BufferedReader input = new BufferedReader(new FileReader(aFile)); try { String line = null; while ((line = input.readLine()) != null) {- toret += line + "\n";+ toRet += line + "\n"; } } finally { input.close(); }- return toret;+ return toRet; } public static String convertStreamToString(InputStream is) {=======================================--- /trunk/src/test/java/org/apache/rat/pd/core/SlidingWindowAlgorithmTest.java Fri Aug 21 06:53:09 2009+++ /trunk/src/test/java/org/apache/rat/pd/core/SlidingWindowAlgorithmTest.java Fri Aug 21 17:04:14 2009@@ -201,8 +201,8 @@ } @Override- public boolean isCodeFound(String posibleCutAndPastedCode) {- String temp = posibleCutAndPastedCode.replaceAll("(F )*(T )*TEND", "");+ public boolean isCodeFound(String possibleCopyAndPastedCode) {+ String temp = possibleCopyAndPastedCode.replaceAll("(F )*(T )*TEND", ""); if (temp.trim().length() > 0) { return false; } else=======================================--- /trunk/src/test/java/org/apache/rat/pd/engines/google/RegexGeneratorTest.java Fri Aug 21 06:53:09 2009+++ /trunk/src/test/java/org/apache/rat/pd/engines/google/RegexGeneratorTest.java Fri Aug 21 17:04:14 2009@@ -29,11 +29,7 @@ private RegexGenerator regexGenerator = new RegexGenerator(); private String TEST_CASE_1 = "public static void

This information. If an exception happened, it * will wait before next retry. *- * @param posibleCutAndPastedCode+ * @param possibleCopyAndPastedCode code currently being checked * @return information is code plagiarised */- public boolean isCodeFound(String posibleCutAndPastedCode) {- boolean toret = false;+ public boolean isCodeFound(String possibleCopyAndPastedCode) {+ boolean toRet = false; for (int i = 0; i try {- toret = searchengine.gueryEngine(posibleCutAndPastedCode);+ toRet = searchengine.gueryEngine(possibleCopyAndPastedCode); break; } catch (Exception e) { // just print number of retry@@ -73,7 +73,7 @@ } } }- return toret;+ return toRet; } }=======================================--- /trunk/src/main/java/org/apache/rat/pd/engines/google/GoogleCodeSearchParser.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/engines/google/GoogleCodeSearchParser.java Fri Aug 21 17:04:14 2009@@ -46,7 +46,7 @@ /** * This class is for communication between search engine and this program. *- * @author maka:+ * @author maka */ public class GoogleCodeSearchParser implements ISearchEngine, Managable {@@ -92,12 +92,12 @@ * results will be true. * * @param searchResults list of results for our query- * @param posibleCutAndPastedCode code currently being checked- * @return information is there any match is found+ * @param possibleCopyAndPastedCode code currently being checked+ * @return information is there any match found */- public boolean isMatchFound(List searchResults, String posibleCutAndPastedCode) {- boolean toret = false;- String[] lines = posibleCutAndPastedCode.split("\n *");+ public boolean isMatchFound(List searchResults, String possibleCopyAndPastedCode) {+ boolean toRet = false;+ String[] lines = possibleCopyAndPastedCode.split("\n *"); // iterate ower results for (SearchResult searchResult : searchResults) {@@ -106,13 +106,13 @@ for (String line : lines) { if (isMatchingByDistance(match, line) || this.isMatchingByRegex(match, line)) {- toret = true;+ toRet = true; break; } } } }- return toret;+ return toRet; } /**@@ -127,10 +127,10 @@ int maxLength = toMatch.length() > source.length() ? toMatch.length() : source.length(); int distance = StringUtils.getLevenshteinDistance(toMatch, source);- boolean toret = (maxLength > 0) && (similarityFactor (distance * 100) / maxLength);+ boolean toRet = (maxLength > 0) && (similarityFactor (distance * 100) / maxLength); // TODO think about lines with only one character. } // for example!!!- return toret;+ return toRet; } /**@@ -166,11 +166,11 @@ } private String getLanguageQuery() {- String toret = "";+ String toRet = ""; if (!language.equals(IHeuristicChecker.ALL_LANGUAGES)) {- toret = "as_lang=" + this.language + "&";- }- return toret;+ toRet = "as_lang=" + this.language + "&";+ }+ return toRet; } /*@@ -184,19 +184,18 @@ } /**- * @param posibleCutAndPastedCode code for checking+ * @param possibleCopyAndPastedCode code currently being checked * @return proper URL for gdata-codesearch API * @throws MalformedURLException */ @SuppressWarnings("deprecation") // FIXME URLEncoding is system dependent now- private URL createUrl(String posibleCutAndPastedCode) throws MalformedURLException {- URL toret = new URL(CODESEARCH_FEEDS_URL + getLanguageQuery() + "q="- + URLEncoder.encode(regexGenerator.stringToRegex(posibleCutAndPastedCode)) + "&max-results="+ private URL createUrl(String possibleCopyAndPastedCode) throws MalformedURLException {+ URL toRet = new URL(CODESEARCH_FEEDS_URL + getLanguageQuery() + "q="+ + URLEncoder.encode(regexGenerator.stringToRegex(possibleCopyAndPastedCode)) + "&max-results=" + RESULT_NUMBER);- out.println(posibleCutAndPastedCode + " -> " + regexGenerator.stringToRegex(posibleCutAndPastedCode));- return toret;+ return toRet; } /*@@ -206,9 +205,9 @@ * org.apache.rat.pd.engines.ISearchEngine#isCodeFound(java.lang.String) */ @Override- public boolean isCodeFound(String posibleCutAndPastedCode) {+ public boolean isCodeFound(String possibleCopyAndPastedCode) { searchResults.clear();- return retryManager.isCodeFound(posibleCutAndPastedCode);+ return retryManager.isCodeFound(possibleCopyAndPastedCode); } /*@@ -217,46 +216,39 @@ * @see org.apache.rat.pd.engines.Managable#gueryEngine(java.lang.String) */ @Override- public boolean gueryEngine(String posibleCutAndPastedCode) throws IOException, ServiceException {- boolean toreturn = false;-- List listOfFeedUrl = splitLongUrl(posibleCutAndPastedCode, CODESEARCH_QUERY_MAX_LENGTH);-

*"); lines = excludeBlankLines(lines); for (int i = 0; i - toret += LINE_BEGINNING_REGEX + ZERO_OR_MORE_BLANK_SPACE + super.stringToRegex(lines[i]);+ toRet += LINE_BEGINNING_REGEX + ZERO_OR_MORE_BLANK_SPACE + super.stringToRegex(lines[i]); // for current line, it is better not to add LINE_END_REGEX.- // we don't know is end of real line in code is reached+ // we don't know if end of real line in code is reached if (i != lines.length - 1) {- toret += ZERO_OR_MORE_BLANK_SPACE + LINE_END_REGEX + BLANK_MARK_FOR_URL;+ toRet += ZERO_OR_MORE_BLANK_SPACE + LINE_END_REGEX + BLANK_MARK_FOR_URL; } }- return toret;+ return toRet; } /**@@ -72,14 +72,14 @@ } } // copy non-blank lines- String[] toret = new String[lentgh];+ String[] toRet = new String[lentgh]; int index = 0; for (String line : lines) { if (!line.trim().isEmpty()) {- toret[index] = line;+ toRet[index] = line; index++; } }- return toret;+ return toRet; } }=======================================--- /trunk/src/main/java/org/apache/rat/pd/heuristic/functions/CPPFunctionHeuristicChecker.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/heuristic/functions/CPPFunctionHeuristicChecker.java Fri Aug 21 17:04:14 2009@@ -47,8 +47,6 @@ * rhs.GetItsVal()); } */ private static final String CPP_FUNCTION_REGEX_2 = "^[\t ]*[\\w+ \\*&]+\\s*\\:\\:\\s*[*&~]?\\s*\\w+ *\\([^()]*?\\)( *const *)?(\\s)*\\{[\\s\\S]*\\}[\n\r]*";- // TODO add regular expression which will match functions with a reference- // to a string as a returning type for example. private static final String CPP_FUNCTION_REGEX = "(" + CPP_FUNCTION_REGEX_1 + ")|(" + CPP_FUNCTION_REGEX_2 + ")"; /**=======================================--- /trunk/src/main/java/org/apache/rat/pd/heuristic/functions/FortranFunctionHeuristicChecker.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/heuristic/functions/FortranFunctionHeuristicChecker.java Fri Aug 21 17:04:14 2009@@ -114,9 +114,11 @@ * or after subprogram. Depends on limit property, function can return false * if matched subprogram length is smaller then limit value. *- * @param codeToBeChecked- * @param functionHeader- * @param functionEndRegex+ * @param codeToBeChecked code currently being checked+ * @param functionHeader regular expression which match header of a+ * subprogram in Fortran+ * @param functionEndRegex regular expression which match end of a+ * subprogram in Fortran * @return true if this is Fortran subprogram. */ boolean isFortranFunction(String codeToBeChecked, String functionHeader, String functionEndRegex) {@@ -141,9 +143,11 @@ /** * Method will return functions name from a functions header *- * @param functionHeader- * @param keywordRegex- * @param functionNameRegex+ * @param functionHeader regular expression which match header of a+ * subprogram in Fortran+ * @param keywordRegex keyword for function and subroutine+ * @param functionNameRegex regular expression which match keyword and name+ * of a subprogram in Fortran * @return functions name */ String getFunctionName(String functionHeader, String keywordRegex, String functionNameRegex) {@@ -165,8 +169,8 @@ * Method will return functions header from a string. Functions header is * matched by a regular expression regex. *- * @param codeToBeChecked- * @param regex+ * @param codeToBeChecked code currently being checked+ * @param regex regular expression which match subprogram's header * @return functions header if it functions */ String getFunctionHeader(String codeToBeChecked, String regex) {=======================================--- /trunk/src/main/java/org/apache/rat/pd/heuristic/misspellings/MisspellingsHeuristicChecker.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/heuristic/misspellings/MisspellingsHeuristicChecker.java Fri Aug 21 17:04:14 2009@@ -64,7 +64,7 @@ */ @Override public HeuristicCheckerResult checkByHeuristic(String codeToBeChecked) {- HeuristicCheckerResult toret = new HeuristicCheckerResult(false, true, codeToBeChecked, this.getClass());+ HeuristicCheckerResult toRet = new HeuristicCheckerResult(false, true, codeToBeChecked, this.getClass()); boolean isCheckingOnInternetNeaded = true; List words = filterWordsFromCode(codeToBeChecked); for (String word : words) {@@ -75,8 +75,8 @@ out.println("Error in decomposing word:" +

File name- * @return an report entry+ * @return a report entry */ private ReportEntry searchOnInternet(List searchEngines, String code, String fileName) {- ReportEntry toret = null;+ ReportEntry toRet = null; List found = new ArrayList(); for (ISearchEngine searchEngine : searchEngines) { if (searchEngine.isCodeFound(code.toString())) {@@ -226,36 +226,36 @@ } } if (!found.isEmpty()) {- toret = new ReportEntry(found, code, fileName);- }- return toret;+ toRet = new ReportEntry(found, code, fileName);+ }+ return toRet; } /**- * @param heuristicCheckers lit of chosen heuristic checkers+ * @param heuristicCheckers list of chosen heuristic checkers * @param toCheck code to be checked * @return heuristicCheckerResult with proper information for sliding window * algorithm */ private HeuristicCheckerResult isCheckOnInternetNeaded(List heuristicCheckers, String toCheck) {- HeuristicCheckerResult toret = new HeuristicCheckerResult(false, true, toCheck, null);+ HeuristicCheckerResult toRet = new HeuristicCheckerResult(false, true, toCheck, null); for (IHeuristicChecker checker : heuristicCheckers) {- toret = checker.checkByHeuristic(toCheck);- if (toret.isShouldStretch()) {+ toRet = checker.checkByHeuristic(toCheck);+ if (toRet.isShouldStretch()) { break; } }- return toret;+ return toRet; } /** * Append tokens from start position until end. * * @param tokens list of tokens to combine- * @param start position- * @param end position+ * @param start index of start position+ * @param end index of end position * @return appended tokens */ private StringBuffer combineTokens(String[] tokens, int start, int end) {@@ -290,9 +290,9 @@ * * Example:Analyzing file : c:\HelloWorld.java Progress: 2/200 (1%) *- * @param whole is number of all tokens we iterate- * @param current is current position of iteration- * @param fileName is file name of source file+ * @param whole number of all tokens we iterate+ * @param current current position of iteration+ * @param fileName file name of source file */ private void printProgress(int whole, int current, String fileName) { // clear previous state=======================================--- /trunk/src/main/java/org/apache/rat/pd/engines/ISearchEngine.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/engines/ISearchEngine.java Fri Aug 21 17:04:14 2009@@ -33,10 +33,10 @@ /** * Checks if code part exist on this code search engine *- * @param posibleCutAndPastedCode+ * @param possibleCopyAndPastedCode code currently being checked * @return boolean - true if this code is found on search engine */- boolean isCodeFound(String posibleCutAndPastedCode);+ boolean isCodeFound(String possibleCopyAndPastedCode); /** * This method can return search results with link where we can see exactly=======================================--- /trunk/src/main/java/org/apache/rat/pd/engines/KodersCodeSearchParser.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/engines/KodersCodeSearchParser.java Fri Aug 21 17:04:14 2009@@ -31,7 +31,7 @@ private static final String serch = " @Override- public boolean isCodeFound(String posibleCutAndPastedCode) {+ public boolean isCodeFound(String possibleCopyAndPastedCode) { // TODO Auto-generated method stub return false; }=======================================--- /trunk/src/main/java/org/apache/rat/pd/engines/Managable.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/engines/Managable.java Fri Aug 21 17:04:14 2009@@ -35,10 +35,10 @@ * This function can retrieve information about potentially plagiarised code * from search engine. NOTE: for now there are only this types of exceptions *- * @param posibleCutAndPastedCode- * @return+ * @param possibleCopyAndPastedCode code currently being checked+ * @return information about if code is found * @throws IOException * @throws ServiceException */- boolean gueryEngine(String posibleCutAndPastedCode) throws IOException, ServiceException;-}+ boolean gueryEngine(String possibleCopyAndPastedCode) throws IOException, ServiceException;+}=======================================--- /trunk/src/main/java/org/apache/rat/pd/engines/RetryManager.java Fri Aug 21 06:53:09 2009+++ /trunk/src/main/java/org/apache/rat/pd/engines/RetryManager.java Fri Aug 21 17:04:14 2009@@ -51,14 +51,14 @@ * query SearchEngine for