return network.isDirected() ? ordered(nodeU, nodeV) : unordered(nodeU, nodeV);
  }

  /**
   * If this {@link EndpointPair} {@link #isOrdered()}, returns the node which is the source.
   *
   * @throws UnsupportedOperationException if this {@link EndpointPair} is not ordered
   */
  public abstract N source();

  /**
   * If this {@link EndpointPair} {@link #isOrdered()}, returns the node which is the target.
   *

            this.activeConnections = activeConnections;
            this.nonPooledConnections = nonPooledConnections;
            this.trackedConnections = trackedConnections;
            this.maxPoolSize = maxPoolSize;
            this.totalHealthChecks = totalHealthChecks;
            this.failedHealthChecks = failedHealthChecks;
            this.connectionsRemoved = connectionsRemoved;

                long lm = f.lastModified();

                if (lm > this.lastModified) {
                    if (log.isDebugEnabled()) {
                        log.debug("Reading " + tc.getConfig().getLmHostsFileName());
                    }
                    this.lastModified = lm;
                    this.table.clear();
                    try (FileReader r = new FileReader(f)) {

            LifecycleStarter lifecycleStarter) {
        this.lifeCyclePluginAnalyzer = lifeCyclePluginAnalyzer;
        this.defaultLifeCycles = defaultLifeCycles;
        this.lifecycleTaskSegmentCalculator = lifecycleTaskSegmentCalculator;
        this.lifecycleExecutionPlanCalculator = lifecycleExecutionPlanCalculator;
        this.mojoExecutor = mojoExecutor;
        this.lifecycleStarter = lifecycleStarter;
    }

    @Override

            this.path = path;
            this.createGuid = guid;
            this.fileId = Arrays.copyOf(fileId, 16);
            this.type = type;
            this.timeout = timeout;
            this.createTime = System.currentTimeMillis();
            this.lastAccessTime = createTime;
            this.leaseKey = leaseKey;
            this.reconnecting = false;
        }
        

      Map<N, GraphConnections<N, V>> nodeConnections,
      long edgeCount) {
    this.isDirected = builder.directed;
    this.allowsSelfLoops = builder.allowsSelfLoops;
    this.nodeOrder = builder.nodeOrder.cast();
    // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive.
    this.nodeConnections =
        (nodeConnections instanceof TreeMap)
            ? new MapRetrievalCache<>(nodeConnections)

    /**
     * Returns the flags currently in use for this message.
     *
     * @return An <code>int</code> containing the flags in use for this
     *         message.
     */
    public int getFlags() {
        return this.flags;
    }

    /**
     * Sets the flags for this message.
     *
     * @param flags
     *            The flags for this message.
     */
    public void setFlags(final int flags) {

    fun signedBy(signedBy: HeldCertificate?) =
      apply {
        this.signedBy = signedBy
      }

    /**
     * Set this certificate to be a signing certificate, with up to `maxIntermediateCas`
     * intermediate signing certificates beneath it.
     *
     * By default this certificate cannot not sign other certificates. Set this to 0 so this

        this.directoryPath = path;
        this.leaseKey = key;
        this.scope = scope;
        this.createTime = System.currentTimeMillis();
        this.lastUpdateTime = createTime;
        this.lastAccessTime = createTime;
        this.maxAge = 30000;  // 30 seconds default
        
        this.children = new ConcurrentHashMap<>();
        this.lock = new ReentrantReadWriteLock();

 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0