- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 948 for pairOf (0.18 sec)
-
platforms/core-configuration/configuration-cache/src/test/kotlin/org/gradle/internal/cc/impl/serialization/codecs/JavaObjectSerializationCodecTest.kt
val writeObjectBean = SerializableWriteObjectBean(Pair(writeReplaceBean, writeReplaceBean)) pairOf(writeObjectBean) }) { (first, second) -> assertThat( first, sameInstance(second) ) val decodedPair = first.value as Pair<*, *> assertThat( decodedPair.first,
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jun 08 11:29:25 UTC 2024 - 16.1K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/main/java/org/gradle/internal/Pair.java
return right; } public static <L, R> Pair<L, R> of(@Nullable L left, @Nullable R right) { return new Pair<L, R>(left, right); } public <T> Pair<T, Pair<L, R>> pushLeft(T t) { return of(t, this); } public <T> Pair<Pair<L, R>, T> pushRight(T t) { return of(this, t); } public <T> Pair<Pair<T, L>, R> nestLeft(T t) { return of(of(t, left), right);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:48:02 UTC 2023 - 3.3K bytes - Viewed (0) -
src/main/java/org/codelibs/core/misc/Pair.java
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 3.6K bytes - Viewed (0) -
src/net/http/mapping.go
package http // A mapping is a collection of key-value pairs where the keys are unique. // A zero mapping is empty and ready to use. // A mapping tries to pick a representation that makes [mapping.find] most efficient. type mapping[K comparable, V any] struct { s []entry[K, V] // for few pairs m map[K]V // for many pairs } type entry[K comparable, V any] struct { key K value V }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 12 17:47:07 UTC 2023 - 1.7K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/filter/EncodingFilter.java
final Map<String, List<String>> paramListMap = new HashMap<>(); final String[] pairs = queryString.split("&"); try { for (final String pair : pairs) { final int pos = pair.indexOf('='); if (pos >= 0) { final String key = urlCodec.decode(pair.substring(0, pos), enc); List<String> list = paramListMap.get(key);
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 6.9K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/HeadersKotlinTest.kt
assertThat(headers["e"]).isNull() } @Test fun iteratorOperator() { val headers = headersOf("a", "b", "c", "d") val pairs = mutableListOf<Pair<String, String>>() for ((name, value) in headers) { pairs += name to value } assertThat(pairs).containsExactly("a" to "b", "c" to "d") } @Test fun builderGetOperator() { val builder = Headers.Builder() builder.add("a", "b")
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Thu Dec 21 01:54:49 UTC 2023 - 2K bytes - Viewed (0) -
src/encoding/base32/base32_test.go
encodings := []*Encoding{ StdEncoding, StdEncoding.WithPadding('-'), StdEncoding.WithPadding(NoPadding), } for i, enc := range encodings { for _, pair := range pairs { input := pair.decoded encoded := enc.EncodeToString([]byte(input)) decoded, err := enc.DecodeString(encoded) if err != nil { t.Errorf("DecodeString Error for encoding %d (%q): %v", i, input, err)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 16:25:54 UTC 2024 - 26K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/StringsTest.java
// Identical valid surrogate pairs. assertEquals( "abc\uD8AB\uDCAB", Strings.commonPrefix("abc\uD8AB\uDCABdef", "abc\uD8AB\uDCABxyz")); // Differing valid surrogate pairs. assertEquals("abc", Strings.commonPrefix("abc\uD8AB\uDCABdef", "abc\uD8AB\uDCACxyz")); // One invalid pair. assertEquals("abc", Strings.commonPrefix("abc\uD8AB\uDCABdef", "abc\uD8AB\uD8ABxyz"));
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 10.3K bytes - Viewed (0) -
src/internal/diff/diff.go
// license that can be found in the LICENSE file. package diff import ( "bytes" "fmt" "sort" "strings" ) // A pair is a pair of values tracked for both the x and y side of a diff. // It is typically a pair of line indexes. type pair struct{ x, y int } // Diff returns an anchored diff of the two texts old and new // in the “unified diff” format. If old and new are identical,
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/iter/iter.go
// next and stop. // // Next returns the next pair in the sequence // and a boolean indicating whether the pair is valid. // When the sequence is over, next returns a pair of zero values and false. // It is valid to call next after reaching the end of the sequence // or after calling stop. These calls will continue // to return a pair of zero values and false. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:09:28 UTC 2024 - 6.6K bytes - Viewed (0)