long bitSize() {
      return (long) data.length() * Long.SIZE;
    }

    /**
     * Number of set bits (1s).
     *
     * <p>Note that because of concurrent set calls and uses of atomics, this bitCount is a (very)
     * close *estimate* of the actual number of bits set. It's not possible to do better than an
     * estimate without locking. Note that the number, if not exactly accurate, is *always*

	if globalExpiryState != nil {
		m.Set(expiryPendingTasks, float64(globalExpiryState.PendingTasks()))
	}
	if globalTransitionState != nil {
		m.Set(transitionActiveTasks, float64(globalTransitionState.ActiveTasks()))
		m.Set(transitionPendingTasks, float64(globalTransitionState.PendingTasks()))
		m.Set(transitionMissedImmediateTasks, float64(globalTransitionState.MissedImmediateTasks()))
	}

     * Processes allowed SIDs (Security Identifiers) and adds them to the SID set.
     * If the SID is a group, it recursively processes all group members.
     *
     * @param file the SMB file
     * @param sid the SID to process
     * @param sidSet the set of SIDs to add to
     */
    protected void processAllowedSIDs(final SmbFile file, final SID sid, final Set<SID> sidSet) {
        if (logger.isDebugEnabled()) {

    return nodeOrder;
  }

  @Override
  public Set<N> adjacentNodes(N node) {
    return nodeInvalidatableSet(checkedConnections(node).adjacentNodes(), node);
  }

  @Override
  public Set<N> predecessors(N node) {
    return nodeInvalidatableSet(checkedConnections(node).predecessors(), node);
  }

  @Override
  public Set<N> successors(N node) {

    /**
     * @return Required active profile identifiers, never {@code null}.
     */
    public Set<String> getRequiredActiveProfileIds() {
        return getProfileIds(pa -> !pa.optional() && pa.active());
    }

    /**
     * @return Optional active profile identifiers, never {@code null}.
     */
    public Set<String> getOptionalActiveProfileIds() {
        return getProfileIds(pa -> pa.optional() && pa.active());
    }

        // Then
        // Verify that the 'sam' field is set correctly
        assertEquals(mockSamArray, msrpc.sam, "The 'sam' field should be initialized with the provided SamrSamArray.");

        // Verify that the 'ptype' field is set to 0
        assertEquals(0, msrpc.getPtype(), "The 'ptype' field should be initialized to 0.");

        // Verify that the 'flags' field is set to DCERPC_FIRST_FRAG | DCERPC_LAST_FRAG

    }

    @LazyInit transient @Nullable Set<E> elementSet;

    Set<E> createElementSet() {
      return Collections.unmodifiableSet(delegate.elementSet());
    }

    @Override
    public Set<E> elementSet() {
      Set<E> es = elementSet;
      return (es == null) ? elementSet = createElementSet() : es;
    }

    @LazyInit transient @Nullable Set<Multiset.Entry<E>> entrySet;

    }

    @LazyInit transient @Nullable Set<E> elementSet;

    Set<E> createElementSet() {
      return Collections.unmodifiableSet(delegate.elementSet());
    }

    @Override
    public Set<E> elementSet() {
      Set<E> es = elementSet;
      return (es == null) ? elementSet = createElementSet() : es;
    }

    @LazyInit transient @Nullable Set<Multiset.Entry<E>> entrySet;

    putEdge(N1, N2);
    putEdge(N2, N1);
    Set<Integer> n1AdjacentNodes = graph.adjacentNodes(N1);
    Set<Integer> n2AdjacentNodes = graph.adjacentNodes(N2);
    Set<Integer> n1Predecessors = graph.predecessors(N1);
    Set<Integer> n2Predecessors = graph.predecessors(N2);
    Set<Integer> n1Successors = graph.successors(N1);
    Set<Integer> n2Successors = graph.successors(N2);

        void testToString() throws Exception {
            // Set up notification with known values
            byte oplockLevel = 0x02;
            byte[] fileId = new byte[16];
            Arrays.fill(fileId, 0, 8, (byte) 0xAB);
            Arrays.fill(fileId, 8, 16, (byte) 0xCD);

            // Use reflection to set private fields