*/

package com.google.common.collect.testing;

import com.google.common.annotations.GwtCompatible;
import java.util.Map.Entry;
import java.util.SortedMap;
import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * Creates sorted maps, containing sample elements, to be tested.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
@NullMarked

   *         .buildOrThrow();
   * }
   *
   * <p>For <i>small</i> immutable sorted maps, the {@code ImmutableSortedMap.of()} methods are even
   * more convenient.
   *
   * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to
   * build multiple maps in series. Each map is a superset of the maps created before it.
   *
   * @since 2.0
   */

import com.google.common.annotations.GwtCompatible;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import org.jspecify.annotations.NullMarked;

/**
 * Implementation helper for {@link TestMapGenerator} for use with enum maps.
 *
 * @author Kevin Bourrillion
 */
@GwtCompatible
@NullMarked

    }

    @Override
    public Map<R, Map<C, V2>> rowMap() {
      return Maps.transformValues(fromTable.rowMap(), row -> Maps.transformValues(row, function));
    }

    @Override
    public Map<C, Map<R, V2>> columnMap() {
      return Maps.transformValues(
          fromTable.columnMap(), column -> Maps.transformValues(column, function));
    }
  }

  /**

// along with this program.  If not, see <http://www.gnu.org/licenses/>.

package event

import "maps"

// TargetIDSet - Set representation of TargetIDs.
type TargetIDSet map[TargetID]struct{}

// Clone - returns copy of this set.
func (set TargetIDSet) Clone() TargetIDSet {
	setCopy := NewTargetIDSet()
	maps.Copy(setCopy, set)
	return setCopy
}

// add - adds TargetID to the set.

      ImmutableList<Cell<R, C, V>> cellList,
      ImmutableSet<R> rowSpace,
      ImmutableSet<C> columnSpace) {
    Map<R, Integer> rowIndex = Maps.indexMap(rowSpace);
    Map<R, Map<C, V>> rows = new LinkedHashMap<>();
    for (R row : rowSpace) {
      rows.put(row, new LinkedHashMap<C, V>());
    }
    Map<C, Map<R, V>> columns = new LinkedHashMap<>();
    for (C col : columnSpace) {
      columns.put(col, new LinkedHashMap<R, V>());

    return value;
  }

  /**
   * Specifies the delegate maps going in each direction. Called by subclasses during
   * deserialization.
   */
  void setDelegates(Map<K, V> forward, Map<V, K> backward) {
    inverse = checkMapsAndMakeInverse(forward, backward);
    delegate = forward;
  }

  private AbstractBiMap<V, K> checkMapsAndMakeInverse(Map<K, V> forward, Map<V, K> backward) {
    checkArgument(forward.isEmpty());

 * limitations under the License.
 */

package com.google.common.collect.testing;

import com.google.common.annotations.GwtCompatible;
import java.util.Map;
import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * Creates maps, containing sample elements, to be tested.
 *
 * @author George van den Driessche
 */
@GwtCompatible
@NullMarked

	sync.RWMutex
	// resyncStatus maps resync ID to resync status for peer
	resyncStatus map[string]SiteResyncStatus
	// map peer deployment ID to resync ID
	peerResyncMap map[string]resyncState
}

func newSiteResyncMetrics(ctx context.Context) *siteResyncMetrics {
	s := siteResyncMetrics{
		resyncStatus:  make(map[string]SiteResyncStatus),
		peerResyncMap: make(map[string]resyncState),
	}
	go s.save(ctx)

 * limitations under the License.
 */

/**
 * An API for representing graph (node and edge) data. It is analogous to the Java Collections
 * Framework APIs for lists, maps, sets, etc.
 *
 * <p>This package is a part of the open-source <a href="https://github.com/google/guava">Guava</a>
 * library.
 */
@CheckReturnValue
@NullMarked
package com.google.common.graph;