Home
last modified time | relevance | path

Searched refs:nextMatch (Results 1 – 4 of 4) sorted by relevance

/external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/
DBsDiffPatchWriter.java114 Matcher.NextMatch nextMatch = matcher.next(); in generatePatchWithMatcher() local
115 if (nextMatch.didFindMatch) { in generatePatchWithMatcher()
116 newPosition = nextMatch.newPosition; in generatePatchWithMatcher()
117 oldPosition = nextMatch.oldPosition; in generatePatchWithMatcher()
/external/icu/android_icu4j/src/main/java/android/icu/impl/
DTextTrieMap.java117 Node nextMatch = node.findMatch(chitr, output); in find() local
118 if (nextMatch != null) { in find()
119 find(nextMatch, chitr, handler, output); in find()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DTextTrieMap.java112 Node nextMatch = node.findMatch(chitr, output); in find() local
113 if (nextMatch != null) { in find()
114 find(nextMatch, chitr, handler, output); in find()
/external/v8/src/inspector/
Dv8-debugger-agent-impl.cc189 size_t nextMatch = searchArea.find(hint, offset); in adjustBreakpointLocation() local
191 if (nextMatch == String16::kNotFound && prevMatch == String16::kNotFound) { in adjustBreakpointLocation()
195 if (nextMatch == String16::kNotFound) { in adjustBreakpointLocation()
198 bestMatch = nextMatch; in adjustBreakpointLocation()
200 bestMatch = nextMatch - offset < offset - prevMatch ? nextMatch : prevMatch; in adjustBreakpointLocation()