/* JLanguageTool, a natural language style checker 
 * Copyright (C) 2005 Daniel Naber (http://www.danielnaber.de)
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
 * USA
 */
package de.danielnaber.languagetool.rules.de;

import java.util.ArrayList;
import java.util.List;

import de.danielnaber.languagetool.AnalyzedSentence;
import de.danielnaber.languagetool.AnalyzedToken;
import de.danielnaber.languagetool.rules.RuleMatch;

/**
 * Prüft, dass in Bindestrich-Komposita kein Leerzeichen eingefügt wird (wie z.B. in 'Diäten- Erhöhung').
 *   
 * @author Daniel Naber
 */
public class DashRule extends GermanRule {

  public DashRule() {
  }
  
  public String getId() {
    return "DE_DASH";
  }

  public String getDescription() {
    return "Prüft, dass in Bindestrich-Komposita kein Leerzeichen eingefügt wird (wie z.B. in 'Diäten- Erhöhung')";
  }

  public RuleMatch[] match(AnalyzedSentence text) {
    List ruleMatches = new ArrayList();
    AnalyzedToken[] tokens = text.getTokensWithoutWhitespace();
    int pos = 0;
    String prevToken = null;
    for (int i = 0; i < tokens.length; i++) {
      String token = tokens[i].getToken();
      if (token.trim().equals("")) {
        // ignore
        continue;
      } else {
        if (prevToken != null && !prevToken.equals("-") && !prevToken.equals("--") && prevToken.endsWith("-")) {
          char firstChar = token.charAt(0);
          if (Character.isUpperCase(firstChar)) {
            String msg = "Möglicherweise fehlt ein 'und' oder es wurde nach dem Wort " +
                    "ein überflüssiges Leerzeichen eingefügt.";
            RuleMatch ruleMatch = new RuleMatch(this, tokens[i-1].getStartPos(),
                tokens[i-1].getStartPos()+prevToken.length(), msg);
            ruleMatches.add(ruleMatch);
          }
        }
      }
      prevToken = token;
      pos += token.length();
    }
    return toRuleMatchArray(ruleMatches);
  }

  public void reset() {
    // nothing
  }

}

@@ -1970,25 +1970,24 @@
 als(%22-%22) && 
-!
 prevToken.eq
@@ -1988,20 +1988,27 @@
 ken.
-equals(%22--%22)
+indexOf(%22--%22) == -1
  && 

fix wrong warning for "---"