HomeSort by relevance Sort by last modified time
    Searched refs:numberOfMatchingCharacters (Results 1 - 2 of 2) sorted by null

  /external/smali/util/src/main/java/ds/tree/
RadixTreeNode.java 89 int numberOfMatchingCharacters = 0;
90 while (numberOfMatchingCharacters < key.length() && numberOfMatchingCharacters < this.getKey().length()) {
91 if (key.charAt(numberOfMatchingCharacters) != this.getKey().charAt(numberOfMatchingCharacters)) {
94 numberOfMatchingCharacters++;
96 return numberOfMatchingCharacters;
RadixTreeImpl.java 178 int numberOfMatchingCharacters = node.getNumberOfMatchingCharacters(key);
182 if (node.getKey().equals("") == true || numberOfMatchingCharacters == 0 || (numberOfMatchingCharacters < key.length() && numberOfMatchingCharacters >= node.getKey().length())) {
184 String newText = key.substring(numberOfMatchingCharacters, key.length());
204 else if (numberOfMatchingCharacters == key.length() && numberOfMatchingCharacters == node.getKey().length()) {
214 else if (numberOfMatchingCharacters > 0 && numberOfMatchingCharacters < node.getKey().length()) {
216 n1.setKey(node.getKey().substring(numberOfMatchingCharacters, node.getKey().length()))
    [all...]

Completed in 44 milliseconds