@@ -185,7 +185,7 @@ public CharSequence getPhonemeText() {
185185 */
186186 @ Deprecated
187187 public Phoneme join (final Phoneme right ) {
188- return new Phoneme (this . phonemeText .toString () + right .phonemeText .toString (), this . languages .restrictTo (right .languages ));
188+ return new Phoneme (phonemeText .toString () + right .phonemeText .toString (), languages .restrictTo (right .languages ));
189189 }
190190
191191 /**
@@ -195,7 +195,7 @@ public Phoneme join(final Phoneme right) {
195195 * @return a new Phoneme
196196 */
197197 public Phoneme mergeWithLanguage (final LanguageSet lang ) {
198- return new Phoneme (this . phonemeText .toString (), this . languages .merge (lang ));
198+ return new Phoneme (phonemeText .toString (), languages .merge (lang ));
199199 }
200200
201201 @ Override
@@ -647,7 +647,7 @@ public Rule(final String pattern, final String lContext, final String rContext,
647647 * @return the left context Pattern
648648 */
649649 public RPattern getLContext () {
650- return this . lContext ;
650+ return lContext ;
651651 }
652652
653653 /**
@@ -656,7 +656,7 @@ public RPattern getLContext() {
656656 * @return the pattern
657657 */
658658 public String getPattern () {
659- return this . pattern ;
659+ return pattern ;
660660 }
661661
662662 /**
@@ -665,7 +665,7 @@ public String getPattern() {
665665 * @return the phoneme
666666 */
667667 public PhonemeExpr getPhoneme () {
668- return this . phoneme ;
668+ return phoneme ;
669669 }
670670
671671 /**
@@ -674,7 +674,7 @@ public PhonemeExpr getPhoneme() {
674674 * @return the right context Pattern
675675 */
676676 public RPattern getRContext () {
677- return this . rContext ;
677+ return rContext ;
678678 }
679679
680680 /**
@@ -689,20 +689,20 @@ public boolean patternAndContextMatches(final CharSequence input, final int i) {
689689 if (i < 0 ) {
690690 throw new IndexOutOfBoundsException ("Can not match pattern at negative indexes" );
691691 }
692- final int patternLength = this . pattern .length ();
692+ final int patternLength = pattern .length ();
693693 final int ipl = i + patternLength ;
694694 if (ipl > input .length ()) {
695695 // not enough room for the pattern to match
696696 return false ;
697697 }
698698 // evaluate the pattern, left context and right context
699699 // fail early if any of the evaluations is not successful
700- if (!input .subSequence (i , ipl ).equals (this . pattern )) {
700+ if (!input .subSequence (i , ipl ).equals (pattern )) {
701701 return false ;
702702 }
703- if (!this . rContext .isMatch (input .subSequence (ipl , input .length ()))) {
703+ if (!rContext .isMatch (input .subSequence (ipl , input .length ()))) {
704704 return false ;
705705 }
706- return this . lContext .isMatch (input .subSequence (0 , i ));
706+ return lContext .isMatch (input .subSequence (0 , i ));
707707 }
708708}
0 commit comments