org.eclipse.jdt.core.compiler.CharOperation.indexOf java code examples

@Override
public ITypeAnnotationWalker toMethodReturn() {
  int close = CharOperation.indexOf(')', this.source);
  if (close != -1) {
    // optimization, see toMethodParameter.
    this.pos = close+1;
    return this;
  }
  return ITypeAnnotationWalker.EMPTY_ANNOTATION_WALKER;
}

@Override
public ITypeAnnotationWalker toMethodReturn() {
  int close = CharOperation.indexOf(')', this.source);
  if (close != -1) {
    // optimization, see toMethodParameter.
    this.pos = close+1;
    return this;
  }
  return ITypeAnnotationWalker.EMPTY_ANNOTATION_WALKER;
}

private static int trapDoorRegexMatchRule(char[] name2, int matchRule) {
  return CharOperation.indexOf(regexPrefix, name2, false) == 0 ?
      SearchPattern.R_REGEXP_MATCH : matchRule;
}
@Override

@Override
public ITypeAnnotationWalker toMethodReturn() {
  int close = CharOperation.indexOf(')', this.source);
  if (close != -1) {
    // optimization, see toMethodParameter.
    this.pos = close+1;
    return this;
  }
  return ITypeAnnotationWalker.EMPTY_ANNOTATION_WALKER;
}

@Override
public ITypeAnnotationWalker toMethodReturn() {
  int close = CharOperation.indexOf(')', this.source);
  if (close != -1) {
    // optimization, see toMethodParameter.
    this.pos = close+1;
    return this;
  }
  return ITypeAnnotationWalker.EMPTY_ANNOTATION_WALKER;
}

public char[] nextWord() {
  this.end = CharOperation.indexOf(';', this.signature, this.start);
  if (this.bracket <= this.start) // already know it if its > start
    this.bracket = CharOperation.indexOf('<', this.signature, this.start);
  int dot = CharOperation.indexOf('.', this.signature, this.start);
  if (this.bracket > this.start && this.bracket < this.end)
    this.end = this.bracket;
  if (dot > this.start && dot < this.end)
    this.end = dot;
  return CharOperation.subarray(this.signature, this.start, this.start = this.end); // skip word
}
/**  similar to nextWord() but don't stop at '.' */

public char[] nextWord() {
  this.end = CharOperation.indexOf(';', this.signature, this.start);
  if (this.bracket <= this.start) // already know it if its > start
    this.bracket = CharOperation.indexOf('<', this.signature, this.start);
  int dot = CharOperation.indexOf('.', this.signature, this.start);
  if (this.bracket > this.start && this.bracket < this.end)
    this.end = this.bracket;
  if (dot > this.start && dot < this.end)
    this.end = dot;
  return CharOperation.subarray(this.signature, this.start, this.start = this.end); // skip word
}
/**  similar to nextWord() but don't stop at '.' */

public char[] nextWord() {
  this.end = CharOperation.indexOf(';', this.signature, this.start);
  if (this.bracket <= this.start) // already know it if its > start
    this.bracket = CharOperation.indexOf('<', this.signature, this.start);
  int dot = CharOperation.indexOf('.', this.signature, this.start);
  if (this.bracket > this.start && this.bracket < this.end)
    this.end = this.bracket;
  if (dot > this.start && dot < this.end)
    this.end = dot;
  return CharOperation.subarray(this.signature, this.start, this.start = this.end); // skip word
}
public String toString() {

public char[] nextWord() {
  this.end = CharOperation.indexOf(';', this.signature, this.start);
  if (this.bracket <= this.start) // already know it if its > start
    this.bracket = CharOperation.indexOf('<', this.signature, this.start);
  int dot = CharOperation.indexOf('.', this.signature, this.start);
  if (this.bracket > this.start && this.bracket < this.end)
    this.end = this.bracket;
  if (dot > this.start && dot < this.end)
    this.end = dot;
  return CharOperation.subarray(this.signature, this.start, this.start = this.end); // skip word
}
/**  similar to nextWord() but don't stop at '.' */

public char[] nextWord() {
  this.end = CharOperation.indexOf(';', this.signature, this.start);
  if (this.bracket <= this.start) // already know it if its > start
    this.bracket = CharOperation.indexOf('<', this.signature, this.start);
  int dot = CharOperation.indexOf('.', this.signature, this.start);
  if (this.bracket > this.start && this.bracket < this.end)
    this.end = this.bracket;
  if (dot > this.start && dot < this.end)
    this.end = dot;
  return CharOperation.subarray(this.signature, this.start, this.start = this.end); // skip word
}
/**  similar to nextWord() but don't stop at '.' */

/**  similar to nextWord() but don't stop at '.' */
public char[] nextName() {
  this.end = CharOperation.indexOf(';', this.signature, this.start);
  if (this.bracket <= this.start) // already know it if its > start
    this.bracket = CharOperation.indexOf('<', this.signature, this.start);
  if (this.bracket > this.start && this.bracket < this.end)
    this.end = this.bracket;
  return CharOperation.subarray(this.signature, this.start, this.start = this.end); // skip name
}

/**  similar to nextWord() but don't stop at '.' */
public char[] nextName() {
  this.end = CharOperation.indexOf(';', this.signature, this.start);
  if (this.bracket <= this.start) // already know it if its > start
    this.bracket = CharOperation.indexOf('<', this.signature, this.start);
  if (this.bracket > this.start && this.bracket < this.end)
    this.end = this.bracket;
  return CharOperation.subarray(this.signature, this.start, this.start = this.end); // skip name
}

public String getModuleDoc() throws JavaModelException {
  if (this.content == null) return null;
  int index = CharOperation.indexOf(JavadocConstants.MODULE_DESCRIPTION_START, this.content, false, 0);
  if (index == -1) return null;
  int end = CharOperation.indexOf(JavadocConstants.BOTTOM_NAVBAR, this.content, false, index);
  if (end == -1) end = this.content.length -1;
  return String.valueOf(CharOperation.subarray(this.content, index, end));
}

public String getModuleDoc() throws JavaModelException {
  if (this.content == null) return null;
  int index = CharOperation.indexOf(JavadocConstants.MODULE_DESCRIPTION_START, this.content, false, 0);
  if (index == -1) return null;
  int end = CharOperation.indexOf(JavadocConstants.BOTTOM_NAVBAR, this.content, false, index);
  if (end == -1) end = this.content.length -1;
  return String.valueOf(CharOperation.subarray(this.content, index, end));
}

  @Override
  public int getParameterCount() {
    int count = 0;
    int start = CharOperation.indexOf('(', this.source) + 1;
    while (start < this.source.length && this.source[start] != ')') {
      start = typeEnd(start) + 1;
      count++;
    }
    return count;
  }
}

private char[] erasure(char[] typeName) {
  int genericStart = CharOperation.indexOf(Signature.C_GENERIC_START, typeName);
  if (genericStart > -1)
    typeName = CharOperation.subarray(typeName, 0, genericStart);
  return typeName;
}
public void addConstructorDeclaration(

  @Override
  public int getParameterCount() {
    int count = 0;
    int start = CharOperation.indexOf('(', this.source) + 1;
    while (start < this.source.length && this.source[start] != ')') {
      start = typeEnd(start) + 1;
      count++;
    }
    return count;
  }
}

private static char[] trapDoorRegexExtractModuleName(char[] name2) {
  int index = CharOperation.indexOf(regexPrefix, name2, false);
  return index >= 0 ? CharOperation.subarray(name2, index + regexPrefix.length, name2.length) : name2;
}
/*

  @Override
  public int getParameterCount() {
    int count = 0;
    int start = CharOperation.indexOf('(', this.source) + 1;
    while (start < this.source.length && this.source[start] != ')') {
      start = typeEnd(start) + 1;
      count++;
    }
    return count;
  }
}

void updateSourceName(int newId) {
  int hashPos = CharOperation.indexOf('#', this.sourceName);
  this.varId = newId;
  this.sourceName = CharOperation.concat(
      CharOperation.subarray(this.sourceName, 0, hashPos),
      Integer.toString(this.varId).toCharArray(),
      '#');
}

Javadoc

Answers the first index in the array for which the corresponding character is equal to toBeFound. Answers -1 if no occurrence of this character is found.

For example:

 
toBeFound = 'c' 
array = { ' a', 'b', 'c', 'd' } 
result => 2

 
toBeFound = 'e' 
array = { ' a', 'b', 'c', 'd' } 
result => -1

Popular methods of CharOperation

equals
If isCaseSensite is true, answers true if the two arrays are identical character by character, other
lastIndexOf
Answers the last index in the array for which the corresponding character is equal to toBeFound star
splitOn
Return a new array which is the split of the given array using the given divider. The given end is e
subarray
Answers a new array which is a copy of the given array starting at the given start and ending at the
toString
Answers a string which is the concatenation of the given array using the '.' as a separator. For ex
arrayConcat
Answers the concatenation of the two arrays. It answers null if the two arrays are null. If the firs
camelCaseMatch
Answers true if the pattern matches the given name using CamelCase rules, or false otherwise. char[]
concatWith
Answers the concatenation of the given array parts using the given separator between each part and a
pathMatch
Answers true if the pattern matches the filepath using the pathSepatator, false otherwise. Path char
replace
Answers a new array of characters with substitutions. No side-effect is operated on the original arr
compareTo
Compares the two char arrays lexicographically between the given start and end positions. Returns a
concat
Answers the concatenation of the three arrays. It answers null if the three arrays are null. If firs

Popular in Java

Reactive rest calls using spring rest template
addToBackStack (FragmentTransaction)
requestLocationUpdates (LocationManager)
setScale (BigDecimal)
Returns a BigDecimal whose scale is the specified value, and whose value is numerically equal to thi
Font (java.awt)
The Font class represents fonts, which are used to render text in a visible way. A font provides the
SocketTimeoutException (java.net)
This exception is thrown when a timeout expired on a socket read or accept operation.
SortedSet (java.util)
SortedSet is a Set which iterates over its elements in a sorted order. The order is determined eithe
TreeMap (java.util)
Walk the nodes of the tree left-to-right or right-to-left. Note that in descending iterations, next
AtomicInteger (java.util.concurrent.atomic)
An int value that may be updated atomically. See the java.util.concurrent.atomic package specificati
Logger (org.apache.log4j)
This is the central class in the log4j package. Most logging operations, except configuration, are d

Best Java code snippets using org.eclipse.jdt.core.compiler.CharOperation.indexOf (Showing top 20 results out of 315)