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(
        body = "ABCDEFGHIJKLMNOPQR",
      )

	DB.Migrator().DropTable(&LevelC3{}, &LevelC2{}, &LevelC1{})
	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,

    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);

Ö]ªo^ŠœPÜxNK¦1·SA¿iJtih{CÜqLY®}Va Jfs ck£iyzac­‚B^ž ñP¢pïx~Wc÷GbVÕ¨VX{B’axItã^R}p®ÜP ª—!` CþÕ)HFIH¸lãòaJ˪|Oªpkxd4ŽUQõ¤/F}m }hcqtˆßTH}rIj 8|vNH} £­_eòèimã2ñ _•[qVçñÑjinwȳÖA`kÖkV{A—}_ò_[«kw«mìigò™go7srQSò­]V|q@e2PB÷Ì«öö@ÔþËÚzÙù ÿÌëÙÆ ÿðÌßÜm¼Œ÷cluñ² ôUq}¤ G¢c2 ¾ic÷}VqyˆÂHrbÆø+ xo| jmLô[m}ïZL_ _BVWUx GVÜirxa\ªûvvi@xGz8ãOEwKW¨8q }¸¦K]ÎéaLXïh„q\|qÖYb}ïtBI“¾¼DWÙlxñK|ªÜ"}¼4%òE\oŒ`rí£töfvÜVW’1³tR¬÷}l®g{„ˆãXJ²JaÐv WïÆúâi¾uhy}N jc ?el ‰ @QtsÖI†ôGL£ÕúG þê7N²eTK÷Pni à·oJF³zsj£kqòSo~¬<ã6Z~ËÖ BIMßvEtha }J%%Õ ccxIˆàebqq...

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 = &lt;-c1:
	print("received ", i1, " from c1\n")
case c2 &lt;- i2:
	print("sent ", i2, " to c2\n")
case i3, ok := (&lt;-c3):  // same as: i3, ok := &lt;-c3
	if ok {
		print("received ", i3, " from c3\n")
	} else {

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], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs,...

- Fixes an issue where you can't attach more than 15 GCE Persistent Disks to c2, n2, m1, m2 machine types. ([#88602](https://github.com/kubernetes/kubernetes/pull/88602), [@yuga711](https://github.com/yuga711)) [SIG Storage]

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], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs,...

œ+>ÈÿÀ~ýÌ*¯Ü 䮿Ǣ+Ú” Q/ue+~ƒ¹ˆ>7 ž6 '2Aaß_¢?‘Gô ¼pÓ !²× IJ ˯‚ÓùèªÛ£\Ib¬«¬B2l ¦© (¿ “kc@ žIµŒöñ`« ‰(»óºòF' •¬Oå±S ×È:25Z;%’É@g P§² ¾Y; 'a’ õMŽ >P!Éx r CSlpÇ3·dá~òìKTÆmQBë5£;ôß2ýôö¯ì8/p£·‚ñIÉ™O» ' T ¨`^ ³ ƒceQ±*2ÎçÎ¡Ñ G–LÍTNk#Ô H±,-~Øa8 ŒKIÍó—VÆ Îeõµ#ž€Ç2¿E5]zݲC¢"ˆÁ ’N¯Œ _Þ´¾Aá"¥x:¤hþ¤‰ Ï„Ñ¥ ‡ ¤¹{ÙTöë¼zµßɲ¨.­ûhcƒ"¹x÷ªno7¾O} ”í`‚ÒP%è¸ÖéXì uøoûv{ú\ÌÃÐ,7 Á3 è’6‰”…‹1o-L ÞâãÒº¢ jó ðý†Jçö ÿ` øåI=˜ê:W ï°‡ºT³ ¦€O8Kù ïÇÛ<Ð} 4ýÚøÚûÏ: J* ‹÷™í€€èƒ”Ávà #ã〠¢eìB\Ä t²û£¡Ð x® ?ß•sS=dHrèæ4p íŒ6” gþŒ°Ëí÷/8Êò ýÎzŽçÙ-...

- Fixes issue where you can't attach more than 15 GCE Persistent Disks to c2, n2, m1, m2 machine types. ([#88602](https://github.com/kubernetes/kubernetes/pull/88602), [@yuga711](https://github.com/yuga711)) [SIG Storage]