}

  private Multiset<N> adjacentNodesMultiset() {
    Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
    if (adjacentNodes == null) {
      adjacentNodes = HashMultiset.create(incidentEdgeMap.values());
      adjacentNodesReference = new SoftReference<>(adjacentNodes);
    }
    return adjacentNodes;
  }

  @Override
  public Set<E> edgesConnecting(N node) {

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import java.io.Serializable;
import java.util.Iterator;

/** An ordering that uses the reverse of the natural order of the values. */
@GwtCompatible
final class ReverseNaturalOrdering extends Ordering<Comparable<?>> implements Serializable {
  static final ReverseNaturalOrdering INSTANCE = new ReverseNaturalOrdering();

  @Override

    return Multimaps.index((Iterable<@NonNull E>) getDelegate(), keyFunction);
  }

  /**
   * Returns a map with the contents of this {@code FluentIterable} as its {@code values}, indexed
   * by keys derived from those values. In other words, each input value produces an entry in the
   * map whose key is the result of applying {@code keyFunction} to that value. These entries appear

        @DisplayName("Should handle various offset values")
        @ValueSource(longs = { 0L, 1L, 512L, 1024L, 4096L, 1048576L, Long.MAX_VALUE })
        void testVariousOffsets(long offset) {
            assertDoesNotThrow(() -> request.setOffset(offset));
        }

        @ParameterizedTest
        @DisplayName("Should handle various remaining bytes values")

	tx.Statement.Unscoped = true
	return
}

func (db *DB) Raw(sql string, values ...interface{}) (tx *DB) {
	tx = db.getInstance()
	tx.Statement.SQL = strings.Builder{}

	if strings.Contains(sql, "@") {
		clause.NamedExpr{SQL: sql, Vars: values}.Build(tx.Statement)
	} else {
		clause.Expr{SQL: sql, Vars: values}.Build(tx.Statement)
	}
	return

		b.uint32(1)           // total number of disks

		if _, err := w.cw.Write(buf[:]); err != nil {
			return err
		}

		// store max values in the regular end record to signal
		// that the zip64 values should be used instead
		records = uint16max
		size = uint32max
		offset = uint32max
	}

	// write end record
	var buf [directoryEndLen]byte
	b := writeBuf(buf[:])

public void clear(); } org/codehaus/plexus/util/FastMap$Values$1.class package org.codehaus.plexus.util; synchronized class FastMap$Values$1 implements java.util.Iterator { FastMap$EntryImpl after; FastMap$EntryImpl before; void FastMap$Values$1(FastMap$Values); public void remove(); public boolean hasNext(); public Object next(); } org/codehaus/plexus/util/FastMap$Values.class package org.codehaus.plexus.util; synchronized class FastMap$Values extends java.util.AbstractCollection { private void F...

    /** The offset for fragment positioning. */
    private int fragmentOffset;

    /**
     * Default constructor that initializes highlighting settings from Fess configuration.
     * Loads default values for type, fragment size, number of fragments, and fragment offset.
     */
    public HighlightInfo() {
        final FessConfig fessConfig = ComponentUtil.getFessConfig();
        type = fessConfig.getQueryHighlightType();

    private int maxReadWriteSize;
    private int maxFragmentedSize;

    /**
     * Create new RDMA negotiation response
     */
    public RdmaNegotiateResponse() {
        // Initialize with default values
        this.status = 0; // Success
        this.selectedVersion = 0x0100; // SMB Direct 1.0
        this.creditsGranted = 0;
        this.maxReceiveSize = RdmaCapabilities.DEFAULT_MAX_RECEIVE_SIZE;

  public void testIsEmpty() {
    assertFalse(testTable.isEmpty());
  }

  public void testSize() {
    assertEquals(1, testTable.size());
  }

  public void testValues() {
    assertThat(testTable.values()).contains("blah");
  }

  @Override
  Iterable<ImmutableTable<Character, Integer, String>> getTestInstances() {
    return ImmutableSet.of(testTable);
  }