/** * @return the step value */ @Pure public int getStep() { return step; }
/** * Returns the key. * * @return the key. */ @Pure public K getKey() { return k; }
@Pure public Set<QualifiedName> getDeclaratorNames() { return this.declaratorNames; } }
/** * Document links have a resolve provider as well. */ @Pure public Boolean getResolveProvider() { return this.resolveProvider; }
/** * A language id, like `typescript`. */ @Pure public String getLanguage() { return this.language; }
/** * A human-readable string describing the source of this diagnostic, e.g. 'typescript' or 'super lint'. */ @Pure public String getSource() { return this.source; }
/** * Creates an empty mutable {@link HashMap} instance. * * @return a new {@link HashMap} * * @since 2.13 */ @Pure public static <K, V> HashMap<K, V> newHashMap() { return new HashMap<K, V>(); }
@Override @Pure public int hashCode() { return 31 * 1 + ((this.text== null) ? 0 : this.text.hashCode()); }
@Override @Pure public int hashCode() { return 31 * 1 + ((this.resolveProvider== null) ? 0 : this.resolveProvider.hashCode()); } }
/** * Legacy property to support protocol version 1.0 requests. */ @Pure @Deprecated public String getText() { return this.text; }
@Override @Pure public int hashCode() { return 31 * 1 + ((this.watchers== null) ? 0 : this.watchers.hashCode()); } }
@Override @Pure public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((this.compilationUnit== null) ? 0 : this.compilationUnit.hashCode()); return prime * result + ((this.qualifiedName== null) ? 0 : this.qualifiedName.hashCode()); }
@Override @Pure public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((this.targetLevel== null) ? 0 : this.targetLevel.hashCode()); return prime * result + ((this.parser== null) ? 0 : this.parser.hashCode()); }
/** * @param array * the array * @param index * the index * @return the value at the given index */ @Pure @Inline("$1[$2]") public static <T> T get(T[] array, int index) { return array[index]; }
/** * @param array * the array * @param index * the index * @return the value at the given index */ @Pure @Inline("$1[$2]") public static boolean get(boolean[] array, int index) { return array[index]; }
/** * @param array * the array * @return the length of the given array */ @Pure @Inline("$1.length") public static int length(double[] array) { return array.length; }
/** * @param array * the array * @param index * the index * @return the value at the given index */ @Pure @Inline("$1[$2]") public static short get(short[] array, int index) { return array[index]; }
/** * @param array * the array * @param index * the index * @return the value at the given index */ @Pure @Inline("$1[$2]") public static byte get(byte[] array, int index) { return array[index]; }
/** * The logical <code>not</code> (negation). This is the equivalent to the java <code>!</code> operator. * * @param b * a boolean value. * @return <code>!b</code> */ @Pure @Inline(value="(!$1)", constantExpression=true) public static boolean operator_not(boolean b) { return !b; }
/** * The unary <code>minus</code> operator. This is the equivalent to the Java's <code>-</code> function. * * @param c a character. * @return <code>-c</code> * @since 2.3 */ @Pure @Inline(value="(-$1)", constantExpression=true) public static int operator_minus(char c) { return -c; }