- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,341 for longerst (0.29 sec)
-
src/strings/replace_test.go
"aaa", "3[aaa]", "aa", "2[aa]", "a", "1[a]", "i", "i", "longerst", "most long", "longer", "medium", "long", "short", "xx", "xx", "x", "X", "X", "Y", "Y", "Z", ) testCases = append(testCases, testCase{gen1, "fooaaabar", "foo3[aaa]b1[a]r"}, testCase{gen1, "long, longerst, longer", "short, most long, medium"}, testCase{gen1, "xxxxx", "xxxxX"},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 22:53:05 UTC 2017 - 14.1K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/img/performance/tests-longest.png
tests-longest.png...
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 112.4K bytes - Viewed (0) -
subprojects/diagnostics/src/test/groovy/org/gradle/api/tasks/diagnostics/internal/text/StyledTableTest.groovy
new StyledTable.Row(["tiny", "even longer"], StyledTextOutput.Style.Normal) ] ) expect: StyledTableUtil.toString(table) == """ | a | b | |-----------|-------------| | foo | bar | | very long | short | | tiny | even longer | """.stripIndent(true).trim() }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Feb 25 00:22:38 UTC 2022 - 3.5K bytes - Viewed (0) -
src/regexp/backtrack.go
} if old := b.matchcap[1]; old == -1 || (longest && pos > 0 && pos > old) { copy(b.matchcap, b.cap) } // If going for first match, we're done. if !longest { return true } // If we used the entire text, no longer match is possible. if pos == b.end { return true } // Otherwise, continue on in hope of a longer match. continue } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 17:25:39 UTC 2023 - 8.8K bytes - Viewed (0) -
src/cmd/go/testdata/script/mod_get_ambiguous_pkg.txt
# 'go mod tidy' would arbitrarily choose the one with the longer path, # but 'go mod tidy' also arbitrarily chooses the latest version. cp go.mod go.mod.orig # From a clean slate, 'go get' currently does the same thing as 'go mod tidy': # it resolves the package from the module with the longest matching prefix. go get example.net/ambiguous/nested/pkg@v0.1.0 go list -m all
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 28 17:19:14 UTC 2021 - 2.6K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
// We've chosen a connection to evict. Confirm it's still okay to be evicted, then close it. toEvict.withLock { if (toEvict.calls.isNotEmpty()) return 0L // No longer idle. if (toEvict.idleAtNs != toEvictIdleAtNs) return 0L // No longer oldest. toEvict.noNewExchanges = true connections.remove(toEvict) } addressStates[toEvict.route.address]?.scheduleOpener()
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Sat Apr 20 17:03:43 UTC 2024 - 16.2K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/-HostnamesCommon.kt
} /** Encodes an IPv6 address in canonical form according to RFC 5952. */ internal fun inet6AddressToAscii(address: ByteArray): String { // Go through the address looking for the longest run of 0s. Each group is 2-bytes. // A run must be longer than one group (section 4.2.2). // If there are multiple equal runs, the first one must be used (section 4.2.3). var longestRunOffset = -1 var longestRunLength = 0 run {
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 11.2K bytes - Viewed (0) -
src/regexp/regexp.go
// This field can be modified by the Longest method, // but it is otherwise read-only. longest bool // whether regexp prefers leftmost-longest match } // String returns the source text used to compile the regular expression. func (re *Regexp) String() string { return re.expr } // Copy returns a new [Regexp] object copied from re. // Calling [Regexp.Longest] on one copy does not affect another. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 38.5K bytes - Viewed (0) -
src/internal/diff/diff.go
l[len(l)-1] += "\n\\ No newline at end of file\n" } return l } // tgs returns the pairs of indexes of the longest common subsequence // of unique lines in x and y, where a unique line is one that appears // once in x and once in y. // // The longest common subsequence algorithm is as described in // Thomas G. Szymanski, “A Special Case of the Maximal Common
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 14:13:04 UTC 2023 - 7.5K bytes - Viewed (0) -
src/regexp/exec_test.go
re.longest = false return re.MatchString(text), "" } func matchFullLongest(re, refull *Regexp, text string) (bool, string) { refull.longest = true return refull.MatchString(text), "[full,longest]" } func matchPartialLongest(re, refull *Regexp, text string) (bool, string) { re.longest = true return re.MatchString(text), "[longest]" }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:36:03 UTC 2024 - 20.7K bytes - Viewed (0)