* More expressive node affinity syntax, and support for “soft” node affinity.
Node selectors (to constrain pods to schedule on a subset of nodes) now support
the operators {<code>In, NotIn, Exists, DoesNotExist, Gt, Lt</code>}  instead of just conjunction of exact match on node label values. In
addition, we’ve introduced a new “soft” kind of node selector that is just a

  ':x-pack:plugin:ilm:qa:multi-node',
  ':x-pack:plugin:ilm:qa:rest',
  ':x-pack:plugin:ilm:qa:with-security',
  ':x-pack:plugin:mapper-constant-keyword',
  ':x-pack:plugin:mapper-flattened',
  ':x-pack:plugin:ml',
  ':x-pack:plugin:ml:qa:basic-multi-node',
  ':x-pack:plugin:ml:qa:disabled',
  ':x-pack:plugin:ml:qa:ml-with-security',
  ':x-pack:plugin:ml:qa:native-multi-node-tests',

    AbstractGraphTest.validateGraph(transpose);

    for (Integer node : directedGraph.nodes()) {
      assertThat(directedGraph.inDegree(node)).isSameInstanceAs(transpose.outDegree(node));
      assertThat(directedGraph.outDegree(node)).isSameInstanceAs(transpose.inDegree(node));
    }

    assertThat(transpose.successors(N1)).doesNotContain(N2);
    directedGraph.putEdge(N2, N1);

     * @return the rpath
     */
    public final String getRpath() {
        return this.rpath;
    }

    /**
     * Gets the node name for this referral.
     *
     * @return the node
     */
    public final String getNode() {
        return this.node;
    }

    /**
     * Gets the special name for this referral.
     *
     * @return the specialName
     */

      assertThat(graph.edges()).isEmpty(); // no edges can remain if there's no nodes
      AbstractGraphTest.validateGraph(graph);

      Collections.shuffle(nodeList, gen);
      for (Integer node : nodeList) {
        assertThat(graph.addNode(node)).isTrue();
      }
      Collections.shuffle(edgeList, gen);
      for (EndpointPair<Integer> edge : edgeList) {
        assertThat(graph.putEdge(edge.nodeU(), edge.nodeV())).isTrue();
      }

[ "${MODE}" == "pools" ] && docker-compose -f minio-${MODE}.yaml stop minio2
[ "${MODE}" == "pools" ] && docker-compose -f minio-${MODE}.yaml stop minio6

# Pause one node, to check that all S3 calls work while one node goes wrong
[ "${MODE}" == "resiliency" ] && docker-compose -f minio-${MODE}.yaml pause minio4

docker run --rm --net=mint_default \
	--name="mint-${MODE}-${JOB_NAME}" \

        return flags;
    }

    /**
     * Gets the new node address.
     *
     * @return the new node address
     */
    public String getNewNodeAddress() {
        return newNodeAddress;
    }

    /**
     * Sets the new node address.
     *
     * @param newNodeAddress the new node address
     */
    public void setNewNodeAddress(String newNodeAddress) {

 * implement it:
 *
 * {@snippet :
 * // won't work
 * TreeTraverser<NodeType> traverser = node -> node.getChildNodes();
 * }
 *
 * Instead, you can pass a lambda expression to the {@code using} factory method:
 *
 * {@snippet :
 * TreeTraverser<NodeType> traverser = TreeTraverser.using(node -> node.getChildNodes());
 * }
 *
 * @author Louis Wasserman
 * @since 15.0

      AbstractNetworkTest.validateNetwork(network);

      Collections.shuffle(nodeList, gen);
      for (Integer node : nodeList) {
        assertThat(network.addNode(node)).isTrue();
      }
      Collections.shuffle(edgeList, gen);
      for (Object edge : edgeList) {
        assertThat(
                network.addEdge(

        bb.position(54);
        String altPath = "\\\\alt\\path";
        bb.put(altPath.getBytes(StandardCharsets.UTF_16LE));
        bb.putShort((short) 0);

        // Node string at offset 76
        bb.position(76);
        String node = "NODE01";
        bb.put(node.getBytes(StandardCharsets.UTF_16LE));
        bb.putShort((short) 0);

        // Decode
        int decodedSize = referral.decode(testBuffer, 0, testBuffer.length);