CloneSet2881

plugins/org.eclipse.jdt.ui/ui/org/eclipse/jdt/internal/ui/text/JavaHeuristicScanner.java

plugins/org.eclipse.jdt.ui/ui/org/eclipse/jdt/internal/ui/text/JavaHeuristicScanner.java

        /**
         * Finds the lowest position in <code>fDocument</code> such that the position is &gt;= <code>position</code>
         * and &lt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code>
         * and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &gt; <code>position</code>, or <code>UNBOUND</code>
         * @param ch the <code>char</code> to search for
         * @return the lowest position of <code>ch</code> in (<code>bound</code>, <code>position</code>] that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
        public int scanForward(int position, int bound, char ch) {
                return scanForward(position, bound, new CharacterMatch(ch));
        }

        /**
         * Finds the lowest position in <code>fDocument</code> such that the position is &gt;= <code>position</code>
         * and &lt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code> for at least one
         * ch in <code>chars</code> and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &gt; <code>position</code>, or <code>UNBOUND</code>
         * @param chars an array of <code>char</code> to search for
         * @return the lowest position of a non-whitespace character in [<code>position</code>, <code>bound</code>) that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
        public int scanForward(int position, int bound, char[] chars) {
                return scanForward(position, bound, new CharacterMatch(chars));
        }

        /**
         * Finds the highest position in <code>fDocument</code> such that the position is &lt;= <code>position</code>
         * and &gt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code> for at least one
         * ch in <code>chars</code> and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &lt; <code>position</code>, or <code>UNBOUND</code>
         * @param ch the <code>char</code> to search for
         * @return the highest position of one element in <code>chars</code> in (<code>bound</code>, <code>position</code>] that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
        public int scanBackward(int position, int bound, char ch) {
                return scanBackward(position, bound, new CharacterMatch(ch));
        }

        /**
         * Finds the highest position in <code>fDocument</code> such that the position is &lt;= <code>position</code>
         * and &gt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code> for at least one
         * ch in <code>chars</code> and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &lt; <code>position</code>, or <code>UNBOUND</code>
         * @param chars an array of <code>char</code> to search for
         * @return the highest position of one element in <code>chars</code> in (<code>bound</code>, <code>position</code>] that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
        public int scanBackward(int position, int bound, char[] chars) {
                return scanBackward(position, bound, new CharacterMatch(chars));
        }

/**
         * Finds the highest position in <code>fDocument</code> such that the position is &lt;= <code>position</code>
         * and &gt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code> for at least one
         * ch in <code>chars</code> and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &lt; <code>position</code>, or <code>UNBOUND</code>
         * @param ch the <code>char</code> to search for
         * @return the highest position of one element in <code>chars</code> in (<code>bound</code>, <code>position</code>] that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
/**
         * Finds the lowest position in <code>fDocument</code> such that the position is &gt;= <code>position</code>
         * and &lt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code>
         * and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &gt; <code>position</code>, or <code>UNBOUND</code>
         * @param ch the <code>char</code> to search for
         * @return the lowest position of <code>ch</code> in (<code>bound</code>, <code>position</code>] that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
public int  [[#variablea3c38060]](int position, int bound, char ch) {
  return [[#variablea3c38060]](position, bound, new CharacterMatch(ch));
}

/**
         * Finds the highest position in <code>fDocument</code> such that the position is &lt;= <code>position</code>
         * and &gt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code> for at least one
         * ch in <code>chars</code> and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &lt; <code>position</code>, or <code>UNBOUND</code>
         * @param chars an array of <code>char</code> to search for
         * @return the highest position of one element in <code>chars</code> in (<code>bound</code>, <code>position</code>] that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
/**
         * Finds the lowest position in <code>fDocument</code> such that the position is &gt;= <code>position</code>
         * and &lt; <code>bound</code> and <code>fDocument.getChar(position) == ch</code> evaluates to <code>true</code> for at least one
         * ch in <code>chars</code> and the position is in the default partition.
         *
         * @param position the first character position in <code>fDocument</code> to be considered
         * @param bound the first position in <code>fDocument</code> to not consider any more, with <code>bound</code> &gt; <code>position</code>, or <code>UNBOUND</code>
         * @param chars an array of <code>char</code> to search for
         * @return the lowest position of a non-whitespace character in [<code>position</code>, <code>bound</code>) that resides in a Java partition, or <code>NOT_FOUND</code> if none can be found
         */
public int  [[#variablea3c38060]](int position, int bound, char[] chars) {
  return [[#variablea3c38060]](position, bound, new CharacterMatch(chars));
}
 

scanBackward 

scanForward