}

  @Test
  fun cancelingRunningJobTakesNoEffectUntilJobFinishes() {
    dispatcher.maxRequests = 1
    val c1 = client.newCall(newRequest("http://a/1", "tag1"))
    val c2 = client.newCall(newRequest("http://a/2"))
    c1.enqueue(callback)
    c2.enqueue(callback)
    c1.cancel()
    executor.assertJobs("http://a/1")
    executor.finishJob("http://a/1")
    executor.assertJobs("http://a/2")
  }

      return true;
    }
    if (length != s2.length()) {
      return false;
    }
    for (int i = 0; i < length; i++) {
      char c1 = s1.charAt(i);
      char c2 = s2.charAt(i);
      if (c1 == c2) {
        continue;
      }
      int alphaIndex = getAlphaIndex(c1);
      // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
      // however this showed no obvious improvement.

        project.setBuild(new Build());

        // Build up an artifactMap
        project.addArtifact(new Artifact("g0", "a0", "v0", "e0", "c0"));
        project.addArtifact(new Artifact("g1", "a1", "v1", "e1", "c1"));
        project.addArtifact(new Artifact("g2", "a2", "v2", "e2", "c2"));
    }

    /**
     * <p>testValueExtraction.</p>
     *
     * @throws Exception if any.
     */
    @Test

			}
		} else {
			// If bytealg.Index is not available a brute force search is
			// ~1.5-3x faster than Rabin-Karp since n is small.
			c0 := b[last]
			c1 := b[last-1] // There are at least 2 chars to match
		loop:
			for ; i < len(s); i++ {
				if s[i] == c0 && s[i-1] == c1 {
					for k := 2; k < n; k++ {
						if s[i-k] != b[last-k] {
							continue loop
						}
					}
					return i - last
				}
			}
		}

                return channels.get(index);

            case LEAST_CONNECTIONS:
                return channels.stream()
                        .min((c1, c2) -> Integer.compare(c1.getActiveConnections(), c2.getActiveConnections()))
                        .orElse(channels.get(0));

            case RANDOM:
                return channels.get((int) (Math.random() * channels.size()));

	ctx := context.Background()

	// Create companies
	c1 := Company{Name: "Electronics"}
	c2 := Company{Name: "Books"}
	if err := DB.Create(&c1).Error; err != nil {
		t.Fatalf("create c1: %v", err)
	}
	if err := DB.Create(&c2).Error; err != nil {
		t.Fatalf("create c2: %v", err)
	}

	// Create users with companies
	u1 := User{Name: "John", Age: 25, CompanyID: &c1.ID}
	u2 := User{Name: "Jane", Age: 30, CompanyID: &c2.ID}

                } else {
                    // X-1 is going to be treated as X1
                    if (!isDigit && i != version.length() - 1) {
                        char c1 = version.charAt(i + 1);
                        if (Character.isDigit(c1)) {
                            isCombination = true;
                            continue;
                        }
                    }

 *   <li>Ranges are <i>convex</i>: whenever two values are contained, all values in between them
 *       must also be contained. More formally, for any {@code c1 <= c2 <= c3} of type {@code C},
 *       {@code r.contains(c1) && r.contains(c3)} implies {@code r.contains(c2)}). This means that a
 *       {@code Range<Integer>} can never be used to represent, say, "all <i>prime</i> numbers from
 *       1 to 100."

		{
			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"}`,
		},
	}

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