setScopedVertices(scopedVertices);

        this.versionedVertices = scopedVertices || versionedVertices;
        this.scopedVertices = scopedVertices;

        int count = countNodes(tree);

        init(count, count + (count / 2));

        processTreeNodes(null, tree, 0, 0);
    }
    // ------------------------------------------------------------------------

    getMultiset()
        .forEachEntry((element, count) -> actual.add(Multisets.immutableEntry(element, count)));
    assertEquals(expected, actual);
  }

  public void testForEachEntryDuplicates() {
    initThreeCopies();
    List<Entry<E>> expected = singletonList(Multisets.immutableEntry(e0(), 3));
    List<Entry<E>> actual = new ArrayList<>();
    getMultiset()

  @Override
  void setCountCheckReturnValue(E element, int count) {
    assertTrue(
        "setCount() with the correct expected present count should return true",
        setCount(element, count));
  }

  @Override
  void setCountNoCheckReturnValue(E element, int count) {
    setCount(element, count);
  }

  @CanIgnoreReturnValue
  private boolean setCount(E element, int count) {

from fastapi.testclient import TestClient


@pytest.fixture(name="call_counter")
def call_counter_fixture():
    return {"count": 0}


@pytest.fixture(name="app")
def app_fixture(call_counter: dict[str, int]):
    def get_db():
        call_counter["count"] += 1
        return f"db_{call_counter['count']}"

    def get_user(db: Annotated[str, Depends(get_db)]):
        return "user"

    app = FastAPI()

     *    This constructor is here to implement cloneability of this class.
     */
    private MD4(final MD4 md) {
        this();
        context = md.context.clone();
        buffer = md.buffer.clone();
        count = md.count;
    }

    // Cloneable method implementation
    //...........................................................................

    /**
     * Returns a copy of this MD object.
     */
    @Override

	if err != nil {
		t.Fatal(err)
	}
	isClosed := rlk.IsClosed()
	if isClosed {
		t.Fatal("File ref count shouldn't be zero")
	}

	// Increase reference count to 2.
	rlk.IncLockRef()

	isClosed = rlk.IsClosed()
	if isClosed {
		t.Fatal("File ref count shouldn't be zero")
	}

	// Decrease reference count by 1.
	if err = rlk.Close(); err != nil {
		t.Fatal(err)
	}

	isClosed = rlk.IsClosed()

    return Multisets.setCountImpl(this, element, count);
  }

  /**
   * A sensible definition of {@link #setCount(Object, int, int)} in terms of {@link #count(Object)}
   * and {@link #setCount(Object, int)}. If you override either of these methods, you may wish to
   * override {@link #setCount(Object, int, int)} to forward to this implementation.
   *
   * @since 7.0
   */

                return value;
              }
            });
      }
      assertThat(segment.count).isEqualTo(count);
      assertThat(count).isAtMost(segment.threshold);
      assertThat(count).isAtMost((segment.table.length() * 3 / 4));
      assertThat(count).isGreaterThan(segment.table.length() * 3 / 8);
    }
  }

  @SuppressWarnings("TruthGetOrDefault") // We are testing our implementation of getOrDefault.

                return value;
              }
            });
      }
      assertThat(segment.count).isEqualTo(count);
      assertThat(count).isAtMost(segment.threshold);
      assertThat(count).isAtMost((segment.table.length() * 3 / 4));
      assertThat(count).isGreaterThan(segment.table.length() * 3 / 8);
    }
  }

  @SuppressWarnings("TruthGetOrDefault") // We are testing our implementation of getOrDefault.

	latest := int64(0)

	// Find the common cardinality from previously collected
	// occurrences of elements.
	for nano, count := range timeOccurrenceMap {
		if count < maxima {
			continue
		}

		// We are at or above maxima
		if count > maxima || nano > latest {
			maxima = count
			latest = nano
		}
	}

	// Return the collected common max time, with maxima
	return time.Unix(0, latest).UTC(), maxima