Package | Description |
---|---|
com.google.gwt.dev.javac.testing.impl | |
com.google.gwt.dev.util.editdistance | |
com.google.gwt.text.client |
Classes for parsing and rendering numbers, dates, and times.
|
com.google.gwt.text.shared |
Classes for parsing and rendering text and safe HTML.
|
com.google.gwt.text.shared.testing |
Classes used for testing text parsing and rendering.
|
com.google.gwt.user.server.rpc.impl | |
java.lang |
Modifier and Type | Method and Description |
---|---|
CharSequence |
StaticJavaResource.getContent() |
abstract CharSequence |
MockResource.getContent() |
Constructor and Description |
---|
StaticJavaResource(String qualifiedTypeName,
CharSequence source) |
Modifier and Type | Method and Description |
---|---|
static int |
GeneralEditDistances.atMostOneError(CharSequence s1,
CharSequence s2)
Compares two strings for at most one insert/delete/substitute difference.
|
int |
ModifiedBerghelRoachEditDistance.getDistance(CharSequence targetSequence,
int limit) |
int |
GeneralEditDistance.getDistance(CharSequence target,
int limit)
Computes edit distance from the pattern string (used to
construct this GeneralEditDistance instance) to a given target
string, bounded by a limit of interest.
|
abstract int |
MyersBitParallelEditDistance.getDistance(CharSequence s,
int k)
Computes distance from the pattern to a given string, bounded by
a limiting distance @see(GeneralEditDistance.getDistance(CharSequence,int)).
|
static ModifiedBerghelRoachEditDistance |
ModifiedBerghelRoachEditDistance.getInstance(CharSequence pattern)
Creates an instance for computing edit distance from
pattern . |
static CharIndex |
CharIndex.getInstance(CharSequence s)
Generates an index for a given alphabet, defined by a character sequence.
|
static MyersBitParallelEditDistance |
MyersBitParallelEditDistance.getInstance(CharSequence s)
Chooses an appropriate implementation for a given pattern string.
|
static GeneralEditDistance |
GeneralEditDistances.getLevenshteinDistance(CharSequence pattern)
Generates an GeneralEditDistance engine for a particular pattern string
based on Levenshtein distance.
|
static int[] |
PatternBitmap.map(CharSequence s,
CharIndex idx,
int[] result)
Computes a pattern bitmap for a short character sequence.
|
static int[][] |
PatternBitmap.map(CharSequence s,
CharIndex idx,
int[][] result,
int width)
Computes a pattern bitmap for a character sequence of any length.
|
static long[] |
PatternBitmap.map(CharSequence s,
CharIndex idx,
long[] result)
Computes a pattern bitmap for a medium character sequence.
|
abstract int[] |
CharIndex.map(CharSequence s,
int[] mapped)
Performs lookups on an entire sequence of characters.
|
int[] |
CharIndex.FullHash.map(CharSequence s,
int[] mapped) |
int[] |
CharIndex.Masked.map(CharSequence s,
int[] mapped) |
int[] |
CharIndex.Straight.map(CharSequence s,
int[] mapped) |
Constructor and Description |
---|
MyersBitParallelEditDistance(CharSequence s)
Constructs a distance calculator for a given string.
|
Modifier and Type | Method and Description |
---|---|
Long |
LongParser.parse(CharSequence object) |
Double |
DoubleParser.parse(CharSequence object) |
Integer |
IntegerParser.parse(CharSequence object) |
Modifier and Type | Method and Description |
---|---|
T |
Parser.parse(CharSequence text) |
Modifier and Type | Method and Description |
---|---|
String |
PassthroughParser.parse(CharSequence object) |
Modifier and Type | Method and Description |
---|---|
void |
ServerSerializationStreamWriter.LengthConstrainedArray.addToken(CharSequence token) |
Modifier and Type | Class and Description |
---|---|
class |
String
Intrinsic string class.
|
class |
StringBuffer
A fast way to create strings using multiple appends.
|
class |
StringBuilder
A fast way to create strings using multiple appends.
|
Modifier and Type | Method and Description |
---|---|
CharSequence |
CharSequence.subSequence(int start,
int end) |
CharSequence |
String.subSequence(int beginIndex,
int endIndex) |
Modifier and Type | Method and Description |
---|---|
StringBuffer |
StringBuffer.append(CharSequence x) |
Appendable |
Appendable.append(CharSequence charSquence) |
StringBuilder |
StringBuilder.append(CharSequence x) |
StringBuffer |
StringBuffer.append(CharSequence x,
int start,
int end) |
Appendable |
Appendable.append(CharSequence charSquence,
int start,
int end) |
StringBuilder |
StringBuilder.append(CharSequence x,
int start,
int end) |
static int |
Character.codePointAt(CharSequence seq,
int index) |
static int |
Character.codePointBefore(CharSequence cs,
int index) |
static int |
Character.codePointCount(CharSequence seq,
int beginIndex,
int endIndex) |
boolean |
String.contains(CharSequence s) |
boolean |
String.contentEquals(CharSequence cs) |
StringBuffer |
StringBuffer.insert(int index,
CharSequence chars) |
StringBuilder |
StringBuilder.insert(int index,
CharSequence chars) |
StringBuffer |
StringBuffer.insert(int index,
CharSequence chars,
int start,
int end) |
StringBuilder |
StringBuilder.insert(int index,
CharSequence chars,
int start,
int end) |
static int |
Character.offsetByCodePoints(CharSequence seq,
int index,
int codePointOffset) |
String |
String.replace(CharSequence from,
CharSequence to) |
Constructor and Description |
---|
StringBuffer(CharSequence s) |
StringBuilder(CharSequence s) |
Copyright © 2018. All rights reserved.