- Sort Score
- Num 10 results
- Language All
Results 41 - 50 of 51 for c1 (0.05 seconds)
-
okhttp/src/jvmTest/kotlin/okhttp3/internal/cache/DiskLruCacheTest.kt
assertThat(it.edit()).isNull() } assertThat(cache.size()).isEqualTo(0L) } @Test fun iterator() { set("a", "a1", "a2") set("b", "b1", "b2") set("c", "c1", "c2") val iterator = cache.snapshots() assertThat(iterator.hasNext()).isTrue() iterator.next().use { assertThat(it.key()).isEqualTo("a") it.assertValue(0, "a1")
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Feb 03 22:17:59 GMT 2026 - 59.4K bytes - Click Count (0) -
internal/s3select/select_test.go
{ name: "select-is_not_string", input: []byte(`c1,c2,c3 1,2,3 1,,3`), query: `select * from S3object where _2 IS NOT ''`, wantResult: `{"c1":"1","c2":"2","c3":"3"}`, }, { name: "select-is_not_string", input: []byte(`c1,c2,c3 1,2,3 1,,3`), query: `select * from S3object where _2 != '' AND _2 > 1`, wantResult: `{"c1":"1","c2":"2","c3":"3"}`, }, }Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 76.1K bytes - Click Count (0) -
guava-tests/test/com/google/common/collect/IteratorsTest.java
Comparator<TestDatum> comparator = Comparator.comparing(d -> d.letter); // When elements compare as equal (both C's have same letter), our merge should always return C1 // before C2, since C1 is from the first iterator. Iterator<TestDatum> merged = Iterators.mergeSorted(ImmutableList.of(left.iterator(), right.iterator()), comparator);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 57.3K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/IteratorsTest.java
Comparator<TestDatum> comparator = Comparator.comparing(d -> d.letter); // When elements compare as equal (both C's have same letter), our merge should always return C1 // before C2, since C1 is from the first iterator. Iterator<TestDatum> merged = Iterators.mergeSorted(ImmutableList.of(left.iterator(), right.iterator()), comparator);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 57.3K bytes - Click Count (0) -
src/archive/zip/reader_test.go
0000280 d0 00 0d d0 00 0d d0 00 0d d0 00 0d d0 00 0d d0 0000290 00 0d d0 00 0d d0 00 0d d0 00 0d d0 00 0d d0 00 00002a0 0d d0 00 cd ff 9e 46 86 fa a7 7d 3a 43 d7 8e 10 00002b0 52 e9 be e6 6e cf eb 9e 85 4d 65 ce cc 30 c1 44 00002c0 c0 4e af bc 9c 6c 4b a0 d7 54 ff 1d d5 5c 89 fb 00002d0 b5 34 7e c4 c2 9e f5 a0 f6 5b 7e 6e ca 73 c7 ef 00002e0 5d be de f9 e8 81 eb a5 0a a5 63 54 2c d7 1c d1
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 15 18:35:56 GMT 2026 - 57.9K bytes - Click Count (0) -
okhttp/src/jvmTest/kotlin/okhttp3/URLConnectionTest.kt
.build() server.enqueue(response) server.enqueue(response) val request = newRequest("/") val c1 = getResponse(request) assertContent("ABCDE", c1, 5) val c2 = getResponse(request) assertContent("ABCDE", c2, 5) c1.close() c2.close() } @Test fun connectionsArePooled() { val response = MockResponse(
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 133.3K bytes - Click Count (0) -
tests/preload_suits_test.go
if err := DB.AutoMigrate(&LevelC1{}, &LevelC2{}, &LevelC3{}); err != nil { t.Error(err) } level2 := LevelC2{ Value: "c2", LevelC1: LevelC1{ Value: "c1", }, } DB.Create(&level2) want := []LevelC3{ { Value: "c3-1", LevelC2: level2, }, { Value: "c3-2", LevelC2: level2, }, }
Created: Sun Apr 05 09:35:12 GMT 2026 - Last Modified: Thu Jun 05 11:34:13 GMT 2025 - 30.4K bytes - Click Count (0) -
doc/go_spec.html
a select with only <code>nil</code> channels and no default case blocks forever. </p> <pre> var a []int var c, c1, c2, c3, c4 chan int var i1, i2 int select { case i1 = <-c1: print("received ", i1, " from c1\n") case c2 <- i2: print("sent ", i2, " to c2\n") case i3, ok := (<-c3): // same as: i3, ok := <-c3 if ok {
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Apr 01 23:39:18 GMT 2026 - 287.8K bytes - Click Count (1) -
lib/fips140/v1.26.0.zip
compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1024(&T[i], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1536(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1536(&T[i],...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1024(&T[i], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1536(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1536(&T[i],...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)