| /dports/lang/gcc10/gcc-10.3.0/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/devel/avr-gcc/gcc-10.2.0/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/lang/gcc9-devel/gcc-9-20211007/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/lang/gcc11/gcc-11.2.0/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/lang/gcc10-devel/gcc-10-20211008/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/lang/gcc9/gcc-9.4.0/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/lang/gcc9-aux/gcc-9.1.0/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1952 auto bestMatch = haystack[0 .. matchLen]; variable
1954 haystack = .find!pred(haystack, bestMatch);
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libphobos/src/std/algorithm/ |
| H A D | searching.d | 1968 auto bestMatch = haystack[0 .. matchLen]; variable
1970 haystack = .find!pred(haystack, bestMatch);
|
| /dports/graphics/pecl-imagick-im7/imagick-3.5.1/ |
| H A D | ChangeLog | 205 Imagick::subimagematch(Imagick $subimage[, array &$bestMatch[, float &similarity[,
|
| /dports/graphics/pecl-imagick/imagick-3.5.1/ |
| H A D | ChangeLog | 205 Imagick::subimagematch(Imagick $subimage[, array &$bestMatch[, float &similarity[,
|
| /dports/biology/py-crossmap/CrossMap-0.5.4/lib/cmmodule/ |
| H A D | BED.py | 2345 def bestMatch(self): member in CompareBED
|
| /dports/net-mgmt/netdisco-mibs/netdisco-mibs-4.010/cisco/ |
| H A D | CISCO-ITP-MLR-MIB.my | 2103 bestMatch(2)
2114 'bestMatch' : Rules will be processed using a combination
|
| /dports/net-mgmt/observium/observium/mibs/cisco/ |
| H A D | CISCO-ITP-MLR-MIB | 2103 bestMatch(2)
2114 'bestMatch' : Rules will be processed using a combination
|
| /dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/Wrap/ |
| H A D | rough_test.py | 6026 bestMatch = Chem.GetMostSubstitutedCoreMatch(mol, core, matches)
6027 self.assertEqual(numHsMatchingDummies(mol, core, bestMatch), res)
|
| /dports/editors/texstudio/texstudio-4.1.2/src/ |
| H A D | texstudio.cpp | 7946 int bestMatch = -1, bestScore = 0; in findOccurencesApproximate() local
7972 bestMatch = i; in findOccurencesApproximate()
7975 if (bestScore > guessedWord.size() * 5 / 3) columns.append(bestMatch); //accept if 0.33 similarity in findOccurencesApproximate()
|
| /dports/www/firefox/firefox-99.0/browser/components/urlbar/ |
| H A D | UrlbarView.jsm | 1288 if (UrlbarPrefs.get("bestMatch.blockingEnabled")) {
|
| /dports/www/py-notebook/notebook-6.4.5/notebook/static/edit/js/ |
| H A D | main.min.js.map | 65 …bestMatch;\n for (var i = 0; i < matches.full.length; i++) {\n var match = matches…
|
| /dports/lang/pharo/Pharo-1.4-14438/ |
| H A D | Pharo-1.4.changes | 234007 | bestMatch bestIndex d |
234008 bestMatch := 9999.
234016 (d > 0 and: [ d < bestMatch ]) ifTrue:
234018 bestMatch := d ] ].
234025 | bestMatch bestIndex d |
234026 bestMatch := 9999.
234034 (d > 0 and: [ d < bestMatch ]) ifTrue:
234036 bestMatch := d ] ].
|
| H A D | PharoV10.sources | 406580 | bestMatch bestIndex d |
406581 bestMatch := 9999.
406589 (d > 0 and: [ d < bestMatch ]) ifTrue:
406591 bestMatch := d ] ].
406598 | bestMatch bestIndex d |
406599 bestMatch := 9999.
406607 (d > 0 and: [ d < bestMatch ]) ifTrue:
406609 bestMatch := d ] ].
|
| /dports/deskutils/egroupware/egroupware/api/js/etemplate/ |
| H A D | etemplate2.min.js.map | 1 …apedValue","16","levenshtein","matrix","distanceFunction","level","bm","bestMatch","bestMatchDist"…
|