"The process cannot access the file because another process has locked a portion of the file.", "The disk is full.",
            "A duplicate name exists on the network.", "The network name cannot be found.", "ERRnomoreconn.", "The file exists.",
            "The parameter is incorrect.", "Too many Uids active on this session.",

            "The process cannot access the file because another process has locked a portion of the file.", "The disk is full.",
            "A duplicate name exists on the network.", "The network name cannot be found.", "ERRnomoreconn.", "The file exists.",
            "The parameter is incorrect.", "Too many Uids active on this session.",

	expectedOpType                    replication.Type
	expectedAction                    replicationAction
}{
	{ // 1. empty tgtInfos slice
		name:                              "no replicated targets",
		tgtInfos:                          []replicatedTargetInfo{},
		expectedCompletedSize:             0,
		expectedReplicationStatusInternal: "",
		expectedReplicationStatus:         replication.StatusType(""),

    int NT_STATUS_PIPE_LISTENING = 0xC00000b3;
    /** The file that was specified is a directory */
    int NT_STATUS_FILE_IS_A_DIRECTORY = 0xC00000ba;
    /** A duplicate name exists on the network */
    int NT_STATUS_DUPLICATE_NAME = 0xC00000bd;
    /** The specified network name is no longer available */
    int NT_STATUS_NETWORK_NAME_DELETED = 0xC00000c9;

import java.util.Map.Entry;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * Implementation of {@code Multimap} that does not allow duplicate key-value entries and that
 * returns collections whose iterators follow the ordering in which the data was added to the
 * multimap.
 *

		{[]string{"d1", "d2", "d3", "d1"}, fmt.Errorf("duplicate endpoints found")},
		{[]string{"d1", "d2", "d3", "./d1"}, fmt.Errorf("duplicate endpoints found")},
		{[]string{"http://localhost/d1", "http://localhost/d2", "http://localhost/d1", "http://localhost/d4"}, fmt.Errorf("duplicate endpoints found")},

    for (Field field : httpHeadersFields()) {
      assertEquals(
          upperToHttpHeaderName(field.getName(), specialCases, uppercaseAcronyms), field.get(null));
    }
  }

  // Tests that there are no duplicate HTTP header names
  public void testNoDuplicateFields() throws Exception {
    ImmutableList.Builder<String> httpHeaders = ImmutableList.builder();
    for (Field field : httpHeadersFields()) {

        return getSubjectGenerator().create(e0(), e1(), e1(), e2()).iterator();
      }
    }.test();
  }

  /**
   * Returns {@link Method} instances for the tests that assume multisets support duplicates so that
   * the test of {@code Multisets.forSet()} can suppress them.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection
  public static List<Method> getIteratorDuplicateInitializingMethods() {

        for (Field field : fields) {
            if (field.getType() == int.class) {
                int value = field.getInt(null);
                assertTrue(values.add(value), "Duplicate value found for field: " + field.getName());
            }
        }
    }

    @Test
    @DisplayName("Test constant values follow bit flag pattern")
    void testConstantsBitFlagPattern() {

        }
      }
    }
  }

  /**
   * If the graph is undirected, each unordered [node, otherNode] pair (except self-loops) will be
   * visited twice if there is an edge connecting them. To avoid returning duplicate {@link
   * EndpointPair}s, we keep track of the nodes that we have visited. When processing endpoint
   * pairs, we skip if the "other node" is in the visited set, as shown below:
   *
   * <pre>