/dports/devel/fossology-nomos-standalone/fossology-3.11.0/src/monk/agent/ |
H A D | diff.c | 30 searchStart < searchLength && in matchNTokens() 38 size_t canMatch = MIN(textLength - textStart, searchLength - searchStart); in matchNTokens() 57 size_t searchLength = searchTokens->len; in lookForDiff() local 60 size_t searchStopAt = MIN(iSearch + maxAllowedDiff, searchLength); in lookForDiff() 71 searchTokens, searchPos, searchLength, in lookForDiff() 113 size_t searchLength, in applyTailDiff() argument 120 .length = searchLength - (*iSearch) in applyTailDiff() 155 size_t searchLength = searchTokens->len; in findMatchAsDiffs() local 202 while ((iText < textLength) && (iSearch < searchLength)) { in findMatchAsDiffs() 239 if ((iSearch < searchLength) && (searchLength < maxAllowedDiff + iSearch)) { in findMatchAsDiffs() [all …]
|
H A D | diff.h | 51 const GArray* searchTokens, size_t searchStart, size_t searchLength,
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/builtins/ |
H A D | string-endswith.tq | 8 searchLength: uintptr): Boolean labels Slow { 15 while (searchIndex < searchLength) { 57 // 9. Let searchLength be the length of searchStr. 58 const searchLength: uintptr = searchStr.length_uintptr; 60 // 10. Let start be end - searchLength. 61 const start: uintptr = end - searchLength; 67 // searchLength is the same as the full code unit sequence of searchStr, 73 string, searchStr, start, searchLength) otherwise Slow;
|
H A D | string-startswith.tq | 38 // 10. Let searchLength be the length of searchStr. 39 const searchLength: uintptr = searchStr.length_uintptr; 41 // 11. If searchLength + start is greater than len, return false. 44 if (searchLength > len - start) return False; 47 // searchLength is the same as the full code unit sequence of searchStr, 53 string, searchStr, start, searchLength) otherwise Slow;
|
H A D | string-replaceall.tq | 142 // 7. Let searchLength be the length of searchString. 143 const searchLength = searchString.length_smi; 145 // 8. Let advanceBy be max(1, searchLength). 146 const advanceBy = SmiMax(1, searchLength); 183 const matchEndPosition = position + searchLength; 201 // e. Let endOfLastMatch be position + searchLength. 202 endOfLastMatch = position + searchLength;
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/builtins/ |
H A D | string-endswith.tq | 8 searchLength: uintptr): Boolean labels Slow { 15 while (searchIndex < searchLength) { 57 // 9. Let searchLength be the length of searchStr. 58 const searchLength: uintptr = searchStr.length_uintptr; 60 // 10. Let start be end - searchLength. 61 const start: uintptr = end - searchLength; 67 // searchLength is the same as the full code unit sequence of searchStr, 72 return TryFastStringCompareSequence(string, searchStr, start, searchLength)
|
H A D | string-startswith.tq | 38 // 10. Let searchLength be the length of searchStr. 39 const searchLength: uintptr = searchStr.length_uintptr; 41 // 11. If searchLength + start is greater than len, return false. 44 if (searchLength > len - start) return False; 47 // searchLength is the same as the full code unit sequence of searchStr, 52 return TryFastStringCompareSequence(string, searchStr, start, searchLength)
|
H A D | string-replaceall.tq | 140 // 7. Let searchLength be the length of searchString. 141 const searchLength = searchString.length_smi; 143 // 8. Let advanceBy be max(1, searchLength). 144 const advanceBy = SmiMax(1, searchLength); 181 const matchEndPosition = position + searchLength; 199 // e. Let endOfLastMatch be position + searchLength. 200 endOfLastMatch = position + searchLength;
|
/dports/audio/py-music21/music21-7.1.0/music21/search/ |
H A D | serial.py | 554 self.searchLength = 1 596 self.searchLength = length 636 if len(chordList) == self.searchLength + 1: 639 if len(chordList) == self.searchLength: 666 if (lengthOfActive >= self.searchLength 671 elif (lengthOfActive >= self.searchLength): 739 if len(rowSuperset) >= self.searchLength: 767 if len(chordList) == self.searchLength: 776 if len(chordList) == self.searchLength: 795 if (lengthOfActive >= self.searchLength [all …]
|
H A D | base.py | 228 searchLength = len(self.searchList) 230 if searchLength == 0: 234 if searchLength > streamLength: 237 for startPosition, streamEls in enumerate(windowed(streamIteratorEls, searchLength)): 239 for j in range(searchLength): 302 searchLength = len(searchList) 303 if searchLength == 0: 307 if searchLength > streamLength: 310 for startPosition, streamEls in enumerate(windowed(streamIteratorEls, searchLength)): 311 for j in range(searchLength):
|
/dports/lang/v8/v8-9.6.180.12/src/builtins/ |
H A D | string-startswith.tq | 38 // 10. Let searchLength be the length of searchStr. 39 const searchLength: uintptr = searchStr.length_uintptr; 41 // 11. If searchLength + start is greater than len, return false. 44 if (searchLength > len - start) return False; 47 // searchLength is the same as the full code unit sequence of searchStr,
|
H A D | string-endswith.tq | 70 // 9. Let searchLength be the length of searchStr. 71 const searchLength: uintptr = searchStr.length_uintptr; 73 // 10. Let start be end - searchLength. 74 const start = Signed(end - searchLength); 80 // searchLength is the same as the full code unit sequence of searchStr,
|
H A D | string-replaceall.tq | 80 // 7. Let searchLength be the length of searchString. 81 const searchLength = searchString.length_smi; 83 // 8. Let advanceBy be max(1, searchLength). 84 const advanceBy = SmiMax(1, searchLength); 121 const matchEndPosition = position + searchLength; 139 // e. Let endOfLastMatch be position + searchLength. 140 endOfLastMatch = position + searchLength;
|
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/JavaScriptCore/wtf/text/ |
H A D | StringImpl.cpp | 548 unsigned searchLength = length() - index; in find() local 549 if (matchLength > searchLength) in find() 552 unsigned delta = searchLength - matchLength; in find() 593 unsigned searchLength = length() - index; in findIgnoringCase() local 594 if (matchLength > searchLength) in findIgnoringCase() 597 unsigned delta = searchLength - matchLength; in findIgnoringCase() 627 unsigned searchLength = length() - index; in find() local 628 if (matchLength > searchLength) in find() 631 unsigned delta = searchLength - matchLength; in find() 669 unsigned searchLength = length() - index; in findIgnoringCase() local [all …]
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/prometheus/alertmanager/ui/app/src/Utils/ |
H A D | Match.elm | 29 searchLength = function 30 -- A character must be within searchLength spaces of the 40 |> List.concatMap (charMatch searchLength z2)
|
/dports/net-mgmt/thanos/thanos-0.11.0/vendor/github.com/prometheus/alertmanager/ui/app/src/Utils/ |
H A D | Match.elm | 29 searchLength = function 30 -- A character must be within searchLength spaces of the 40 |> List.concatMap (charMatch searchLength z2)
|
/dports/net-mgmt/prometheus2/prometheus-2.30.3/vendor/github.com/prometheus/alertmanager/ui/app/src/Utils/ |
H A D | Match.elm | 29 searchLength = function 30 -- A character must be within searchLength spaces of the 40 |> List.concatMap (charMatch searchLength z2)
|
/dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/zstd/tests/ |
H A D | paramgrill.c | 169 U32 Slength = cParams.searchLength; in BMK_benchParam() 318 … params.windowLog, params.chainLog, params.hashLog, params.searchLog, params.searchLength, in BMK_printWinner() 486 p.searchLength++; break; in paramVariation() 488 p.searchLength--; break; in paramVariation() 554 …p.searchLength=FUZ_rand(&g_rand) % (ZSTD_SEARCHLENGTH_MAX+1 - ZSTD_SEARCHLENGTH_MIN) + ZSTD_SEARCH… in randomParams() 726 ….windowLog, params.chainLog, params.hashLog, params.searchLog, params.searchLength, params.targetL… in BMK_translateAdvancedParams() 978 g_params.searchLength = 0; in main() 981 … g_params.searchLength *= 10, g_params.searchLength += *argument++ - '0'; in main()
|
/dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/zstd/tests/fuzz/ |
H A D | zstd_helpers.c | 35 cParams.searchLength = FUZZ_rand32(state, ZSTD_SEARCHLENGTH_MIN, in FUZZ_randomCParams() 68 set(cctx, ZSTD_p_minMatch, cParams.searchLength); in FUZZ_setRandomParameters()
|
/dports/biology/mmseqs2/MMseqs2-13-45111/lib/zstd/tests/fuzz/ |
H A D | zstd_helpers.c | 35 cParams.searchLength = FUZZ_rand32(state, ZSTD_SEARCHLENGTH_MIN, in FUZZ_randomCParams() 67 set(cctx, ZSTD_p_minMatch, cParams.searchLength); in FUZZ_setRandomParameters()
|
/dports/devel/upp/upp/uppsrc/plugin/zstd_legacy/lib/ |
H A D | zstd_internal.h | 184 …STATIC void ZSTD_statsPrint(ZSTD_stats_t* stats, U32 searchLength) { (void)stats; (void)searchLeng… in ZSTD_statsPrint() argument
|
/dports/science/opensim-core/opensim-core-4.1/OpenSim/Common/ |
H A D | Path.cpp | 158 size_t searchLength = std::min(thisPathLength, otherPathLength); in formRelativePathVec() local 161 while (match && ind < searchLength) { in formRelativePathVec()
|
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/ |
H A D | qgsstringutils.cpp | 423 int searchLength = searchNormalized.length(); in fuzzyScore() local 427 if ( candidateLength == 0 || searchLength == 0 ) in fuzzyScore() 455 if ( searchIdx >= searchLength ) in fuzzyScore() 499 if ( searchIdx >= searchLength ) in fuzzyScore() 514 if ( searchIdx < searchLength ) in fuzzyScore()
|
/dports/biology/mmseqs2/MMseqs2-13-45111/lib/zstd/lib/compress/ |
H A D | zstd_fast.c | 21 U32 const mls = cParams->searchLength; in ZSTD_fillHashTable() 238 U32 const mls = cParams->searchLength; in ZSTD_compressBlock_fast() 259 U32 const mls = cParams->searchLength; in ZSTD_compressBlock_fast_dictMatchState() 378 U32 const mls = cParams->searchLength; in ZSTD_compressBlock_fast_extDict()
|
/dports/graphics/qgis/qgis-3.22.3/src/core/ |
H A D | qgsstringutils.cpp | 422 int searchLength = searchNormalized.length(); in fuzzyScore() local 426 if ( candidateLength == 0 || searchLength == 0 ) in fuzzyScore() 454 if ( searchIdx >= searchLength ) in fuzzyScore() 498 if ( searchIdx >= searchLength ) in fuzzyScore() 513 if ( searchIdx < searchLength ) in fuzzyScore()
|