Searched refs:firstMatch (Results 1 – 11 of 11) sorted by relevance
123 CharSequence firstMatch = null; in next() local133 firstMatch = filterToStartsWith(probe); in next()137 if (firstMatch != null && firstMatch.length() == probe.length()) { in next()138 possibleMatchesAfter.remove(firstMatch); in next()140 matchValue = data.get(firstMatch); in next()165 if (firstMatch == null) { // just in case we skipped the above loop in next()166 firstMatch = possibleMatchesBefore.iterator().next(); in next()168 matchValue = data.get(firstMatch); in next()
473 TimeZone firstMatch = null; in lookupByOffsetWithBiasInternal() local483 if (firstMatch == null) { in lookupByOffsetWithBiasInternal()484 firstMatch = match; in lookupByOffsetWithBiasInternal()491 if (firstMatch != null && !oneMatch && (bias == null || biasMatched)) { in lookupByOffsetWithBiasInternal()495 if (firstMatch == null) { in lookupByOffsetWithBiasInternal()499 TimeZone toReturn = biasMatched ? bias : firstMatch; in lookupByOffsetWithBiasInternal()
71 int firstMatch = uniformTemplate.find("${var}"); in determine_inline_from_template() local73 if (firstMatch < 0) { in determine_inline_from_template()79 int secondMatch = uniformTemplate.find("${var}", firstMatch + strlen("${var}")); in determine_inline_from_template()
52 int firstMatch = uniformTemplate.find("${var}"); in determine_inline_from_template() local54 if (firstMatch < 0) { in determine_inline_from_template()60 int secondMatch = uniformTemplate.find("${var}", firstMatch + strlen("${var}")); in determine_inline_from_template()
1315 …LZ4HC_match_t const firstMatch = LZ4HC_FindLongerMatch(ctx, ip, matchlimit, MINMATCH-1, nbSearches… in LZ4HC_compress_optimal() local1316 if (firstMatch.len==0) { ip++; continue; } in LZ4HC_compress_optimal()1318 if ((size_t)firstMatch.len > sufficient_len) { in LZ4HC_compress_optimal()1320 int const firstML = firstMatch.len; in LZ4HC_compress_optimal()1321 const BYTE* const matchPos = ip - firstMatch.off; in LZ4HC_compress_optimal()1341 int const matchML = firstMatch.len; /* necessarily < sufficient_len < LZ4_OPT_NUM */ in LZ4HC_compress_optimal()1342 int const offset = firstMatch.off; in LZ4HC_compress_optimal()1353 last_match_pos = firstMatch.len; in LZ4HC_compress_optimal()
403 assertThat(iterable.firstMatch(Predicates.equalTo("cool"))).hasValue("cool"); in testFirstMatch()404 assertThat(iterable.firstMatch(Predicates.equalTo("pants"))).hasValue("pants"); in testFirstMatch()405 assertThat(iterable.firstMatch(Predicates.alwaysFalse())).isAbsent(); in testFirstMatch()406 assertThat(iterable.firstMatch(Predicates.alwaysTrue())).hasValue("cool"); in testFirstMatch()
399 assertThat(iterable.firstMatch(Predicates.equalTo("cool"))).hasValue("cool"); in testFirstMatch()400 assertThat(iterable.firstMatch(Predicates.equalTo("pants"))).hasValue("pants"); in testFirstMatch()401 assertThat(iterable.firstMatch(Predicates.alwaysFalse())).isAbsent(); in testFirstMatch()402 assertThat(iterable.firstMatch(Predicates.alwaysTrue())).hasValue("cool"); in testFirstMatch()
433 int firstMatch = getNextIndexed(identity, _firstch(identity), in first() local436 return makeNodeHandle(firstMatch); in first()
468 public final Optional<E> firstMatch(Predicate<? super E> predicate) {
465 public final Optional<E> firstMatch(Predicate<? super E> predicate) {
1557 int firstMatch = 0; in writeClassLists() local1562 if (firstMatch != i - 1) { in writeClassLists()1564 for (int j = firstMatch; j < i; j++) { in writeClassLists()1571 firstMatch = i; in writeClassLists()