Multiset<E> self, Multiset<? extends E> elements) {
    // It'd be nice if we could specialize for ImmutableMultiset here without also retaining
    // its code when it's not in scope...
    if (elements instanceof AbstractMapBasedMultiset) {
      return addAllImpl(self, (AbstractMapBasedMultiset<? extends E>) elements);
    } else if (elements.isEmpty()) {
      return false;
    } else {

		result, err := storage.ListDir(t.Context(), "", testCase.volumeName, testCase.prefix, -1)
		expectErr := (err != nil)

		if expectErr != testCase.expectErr {
			t.Fatalf("case %v: error: expected: %v, got: %v", i+1, testCase.expectErr, expectErr)
		}

		if !testCase.expectErr {
			if !reflect.DeepEqual(result, testCase.expectedResult) {
				t.Fatalf("case %v: result: expected: %v, got: %v", i+1, testCase.expectedResult, result)

                if (!urlValue.startsWith("#")) {
                    final String u;
                    if (!protocolHelper.isValidFileProtocol(urlValue)) {
                        if (urlValue.startsWith("/")) {
                            u = "file:" + urlValue;
                        } else {

		return selected, true
	}

	// If we would never be able to reach read quorum.
	if objsValid < r.objQuorum {
		return nil, false
	}

	// If all objects agree.
	if selected != nil && objsAgree == objsValid {
		return selected, true
	}

	// If cached is nil we shall skip the entry.
	if selected.cached == nil {
		return nil, false
	}

	// Merge if we have disagreement.

		expectedFlag      bool
		expectedCode      int
	}{
		// If-None-Match(false) and If-Modified-Since(true)
		{
			name:            "If-None-Match1",
			ifNoneMatch:     "aa",
			ifModifiedSince: "Sun, 26 Aug 2024 02:01:00 GMT",
			objInfo:         objInfo,
			expectedFlag:    true,
			expectedCode:    304,
		},
		// If-Modified-Since(false)
		{
			name:            "If-None-Match2",
			ifNoneMatch:     "aaa",

        bucketNode = bucketNode.nextInVToKBucket) {
      if (bucketNode == node) {
        if (prevBucketNode == null) {
          hashTableVToK[valueBucket] = node.nextInVToKBucket;
        } else {
          prevBucketNode.nextInVToKBucket = node.nextInVToKBucket;
        }
        break;
      }
      prevBucketNode = bucketNode;
    }

    if (node.prevInKeyInsertionOrder == null) {

                function saveBuffer() {
                    if (buffer.length) {
                        let isBlankSpace = true;
                        buffer.forEach(line => {
                            if (line) {
                                isBlankSpace = false;
                            }
                        });
                        dataValue = {};
                        if (isBlankSpace) {

	hamster2.OtherToy = Toy{}

	if DB.Model(&hamster2).Association("PreferredToy").Count() != 1 {
		t.Errorf("Hamster's preferred toy count should be 1")
	}

	if DB.Model(&hamster2).Association("OtherToy").Count() != 1 {
		t.Errorf("Hamster's other toy count should be 1")
	}

	// Query
	hamsterToy := Toy{}
	DB.Model(&hamster).Association("PreferredToy").Find(&hamsterToy)
	if hamsterToy.Name != hamster.PreferredToy.Name {

            if (pos != -1) {
                buf.replace(pos, pos + 1, "MM");
            }
        }
        if (buf.indexOf("dd") == -1) {
            final int pos = buf.indexOf("d");
            if (pos != -1) {
                buf.replace(pos, pos + 1, "dd");
            }
        }
        if (buf.indexOf("HH") == -1) {
            final int pos = buf.indexOf("H");
            if (pos != -1) {

  public override fun close() {
    if (closed) return
    closed = true

    if (!started) return // Nothing to shut down.
    val serverSocket = this.serverSocket ?: return // If this is null, start() must have failed.

    // Cause acceptConnections() to break out.
    serverSocket.closeQuietly()

    // Await shutdown.
    for (queue in taskRunner.activeQueues()) {
      if (!queue.idleLatch().await(5, TimeUnit.SECONDS)) {