mtrevisan/HunLinter

Identical blocks of code found in 3 locations. Consider refactoring.

Open

            for(final Map.Entry<Character, List<LetterMatcherEntry>> entry : letterAndRulesCombinable.entrySet()){
                letterAndRulesCombinableKeys[offset ++] = entry.getKey();
                this.letterAndRulesCombinable.put(entry.getKey(), entry.getValue().toArray(new LetterMatcherEntry[0]));
            }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

            for(int j = 0; j < size; j ++){
                final DictionaryEntry entry = entries.get(j);
                if(compoundMinimumLength != null && entry.getWord().length() >= compoundMinimumLength
                        && !entry.hasContinuationFlag(forbiddenWordFlag))
                    value.add(entry);

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        for(final String inputCompound : inputCompounds){
            final DictionaryEntry dicEntry = dictionaryEntryFactory.createFromDictionaryLine(inputCompound);

            //filter input set by minimum length and forbidden flag
            if(compoundMinimumLength != null && dicEntry.getWord().length() >= compoundMinimumLength

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

            for(final Map.Entry<String, List<RuleMatcherEntry>> entry : ruleAndRulesNotCombinable.entrySet()){
                ruleAndRulesNotCombinableKeys[offset ++] = entry.getKey();
                this.ruleAndRulesNotCombinable.put(entry.getKey(), entry.getValue().toArray(new RuleMatcherEntry[0]));
            }

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

            for(final Map.Entry<Character, List<LetterMatcherEntry>> entry : letterAndRulesNotCombinable.entrySet()){
                letterAndRulesNotCombinableKeys[offset ++] = entry.getKey();
                this.letterAndRulesNotCombinable.put(entry.getKey(), entry.getValue().toArray(new LetterMatcherEntry[0]));
            }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    public final Set<String> getSynonymsSet(){
        final Set<String> set = new HashSet<>(synonyms.size());
        for(int i = 0; i < synonyms.size(); i ++)
            set.addAll(synonyms.get(i).getSynonyms());
        return set;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    private List<String> getStringData(final List<AffixOption> keys){
        final List<String> strings = new ArrayList<>(keys.size());
        for(int i = 0; i < keys.size(); i ++)
            strings.add(getData(keys.get(i)));
        return strings;

• Read up
  Read up

Consider simplifying this complex logical expression.

Open

        if(appliedRules.length > 0){
            //check that last suffix and last prefix don't have the needaffix flag
            boolean lastSuffix = false;
            boolean lastPrefix = false;
            boolean lastSuffixNeedAffix = false;

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    public final void createAutoCorrectLinterWorker(final Consumer<WorkerAbstract<?>> onStart, final Consumer<WorkerAbstract<?>> onEnd,
            final Consumer<Exception> onCancelled){
        final Supplier<WorkerAbstract<?>> creator = () -> new AutoCorrectLinterWorker(parserManager.getAcoParser(),
            parserManager.getLanguage(), parserManager.getDicParser(), parserManager.getWordGenerator(), onCancelled);
        createWorker(AutoCorrectLinterWorker.WORKER_NAME, creator, onStart, onEnd);

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

            if(!StringUtils.containsAny(word, letterAndRulesCombinableKeys[i])){
                final LetterMatcherEntry[] letterMatcherEntries = letterAndRulesCombinable.get(letterAndRulesCombinableKeys[i]);
                for(int j = 0; j < letterMatcherEntries.length; j ++)
                    letterMatcherEntries[j].match(inflection);
            }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    public final void createThesaurusLinterWorker(final Consumer<WorkerAbstract<?>> onStart, final Consumer<WorkerAbstract<?>> onEnd,
            final Consumer<Exception> onCancelled){
        final Supplier<WorkerAbstract<?>> creator = () -> new ThesaurusLinterWorker(parserManager.getTheParser(), parserManager.getLanguage(),
            parserManager.getDicParser(), parserManager.getWordGenerator(), onCancelled);
        createWorker(ThesaurusLinterWorker.WORKER_NAME, creator, onStart, onEnd);

• Read up
  Read up

Consider simplifying this complex logical expression.

Open

        if(hasLeadingZeros(tokens[0])
                || tokensWithPatch != null && (tokensWithPatch.length > 1 && hasLeadingZeros(tokens[1])
                || tokensWithPatch.length > 2 && hasLeadingZeros(tokensWithPatch[2])))
            throw new IllegalArgumentException("Numeric identifier MUST NOT contain leading zeros");

Identical blocks of code found in 3 locations. Consider refactoring.

Open

            if(inflection.hasContinuationFlag(ruleAndRulesNotCombinableKeys[i])){
                final RuleMatcherEntry[] ruleMatcherEntries = ruleAndRulesNotCombinable.get(ruleAndRulesNotCombinableKeys[i]);
                for(int j = 0; j < ruleMatcherEntries.length; j ++)
                    ruleMatcherEntries[j].match(inflection);
            }

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

            if(StringUtils.containsAny(word, letterAndRulesNotCombinableKeys[i])){
                final LetterMatcherEntry[] letterMatcherEntries = letterAndRulesNotCombinable.get(letterAndRulesNotCombinableKeys[i]);
                for(int j = 0; j < letterMatcherEntries.length; j ++)
                    letterMatcherEntries[j].match(inflection);
            }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    public final void createThesaurusLinterFSAWorker(final Consumer<WorkerAbstract<?>> onStart, final Consumer<WorkerAbstract<?>> onEnd,
            final Consumer<Exception> onCancelled, final DictionaryLookup dictionaryLookup){
        final Supplier<WorkerAbstract<?>> creator = () -> new ThesaurusLinterFSAWorker(parserManager.getTheParser(),
            parserManager.getDicParser(), parserManager.getWordGenerator(), onCancelled, dictionaryLookup);
        createWorker(ThesaurusLinterFSAWorker.WORKER_NAME, creator, onStart, onEnd);

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

    private static String expandAliases(final String part, final List<String> aliases){
        return (aliases != null && !aliases.isEmpty() && NumberUtils.isCreatable(part)
            ? aliases.get(Integer.parseInt(part) - 1)
            : part);
    }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    public final void createAutoCorrectLinterFSAWorker(final Consumer<WorkerAbstract<?>> onStart, final Consumer<WorkerAbstract<?>> onEnd,
            final Consumer<Exception> onCancelled, final DictionaryLookup dictionaryLookup){
        final Supplier<WorkerAbstract<?>> creator = () -> new AutoCorrectLinterFSAWorker(parserManager.getAcoParser(),
            parserManager.getDicParser(), parserManager.getWordGenerator(), onCancelled, dictionaryLookup);
        createWorker(AutoCorrectLinterWorker.WORKER_NAME, creator, onStart, onEnd);

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    private void checkValidity(final String[] parts, final ParsingContext context){
        if(parts.length != 3)
            throw new LinterException(WRONG_FORMAT, context);
        if(!affixOption.is(parts[0]))
            throw new LinterException(BAD_OPTION, context, affixOption.getCode());

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

    private static String expandAliases(final String part, final List<String> aliases){
        return (aliases != null && !aliases.isEmpty() && NumberUtils.isCreatable(part)? aliases.get(Integer.parseInt(part) - 1): part);
    }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    public LetterMatcherEntry(final String messagePattern, final Character masterLetter, final String[] wrongFlags,
            final String correctRule){
        this.messagePattern = messagePattern;
        this.masterLetter = masterLetter;
        this.wrongFlags = wrongFlags;

• Read up
  Read up