checkArgument(value > 0, "Not true that %s is positive.", value);
    return value;
  }

  /**
   * An enum representing the state of a node during DFS. {@code PENDING} means that the node is on
   * the stack of the DFS, while {@code COMPLETE} means that the node and all its successors have
   * been already explored. Any node that has not been explored will not have a state at all.
   */

    @Test
    public void logonUserNoDomain () throws IOException {
        Assume.assumeTrue(getTestDomain().equalsIgnoreCase(getTestUserDomain()));
        // without a domain name, at this point we do not resolve the domain DFS roots
        Assume.assumeTrue(getProperties().get("test.share.dfsroot.url") == null);
        CIFSContext ctx = getContext();
        try ( SmbResource f = new SmbFile(
            getTestShareURL(),

final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map); private static void dfsVisit(Vertex, java.util.Map, java.util.LinkedList); static void <clinit>(); } org/codehaus/plexus/util/dag/Vertex.class package org.codehaus.plexus.util.dag; public...

final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map); private static void dfsVisit(Vertex, java.util.Map, java.util.LinkedList); static void <clinit>(); } org/codehaus/plexus/util/PropertyUtils.class package org.codehaus.plexus.util; public...

final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map); private static void dfsVisit(Vertex, java.util.Map, java.util.LinkedList); static void <clinit>(); } org/codehaus/plexus/util/dag/Vertex.class package org.codehaus.plexus.util.dag; public...

final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map); private static void dfsVisit(Vertex, java.util.Map, java.util.LinkedList); static void <clinit>(); } org/codehaus/plexus/util/dag/Vertex.class package org.codehaus.plexus.util.dag; public...