if (state == NodeVisitState.COMPLETE) {
          stack.removeLast();
          continue;
        }
        if (state == NodeVisitState.PENDING) {
          return true;
        }

        visitedNodes.put(node, NodeVisitState.PENDING);
        top.remainingSuccessors = new ArrayDeque<>(graph.successors(node));
      }

      if (!top.remainingSuccessors.isEmpty()) {

        if (state == NodeVisitState.COMPLETE) {
          stack.removeLast();
          continue;
        }
        if (state == NodeVisitState.PENDING) {
          return true;
        }

        visitedNodes.put(node, NodeVisitState.PENDING);
        top.remainingSuccessors = new ArrayDeque<>(graph.successors(node));
      }

      if (!top.remainingSuccessors.isEmpty()) {

/**
 * This class simplifies communication for protocols that support
 * multiplexing requests. It encapsulates a stream and some protocol
 * knowledge (provided by a concrete subclass) so that connecting,
 * disconnecting, sending, and receiving can be syncronized
 * properly. Apparatus is provided to send and receive requests
 * concurrently.
 */

public abstract class Transport implements Runnable {

    /**

    }

    /**
     * Get number of pending operations
     *
     * @return number of pending operations
     */
    public long getRequestsPending() {
        return pendingOperations.size();
    }

    /**
     * Get pending operations list
     *
     * @return list of pending operations
     */
    public List<CommonServerMessageBlock> getPendingOperations() {

/**
 * This class simplifies communication for protocols that support
 * multiplexing requests. It encapsulates a stream and some protocol
 * knowledge (provided by a concrete subclass) so that connecting,
 * disconnecting, sending, and receiving can be syncronized
 * properly. Apparatus is provided to send and receive requests
 * concurrently.
 */

/**
 * Abstract base class for network transport implementations in JCIFS.

import org.opensearch.index.query.QueryBuilder;
import org.opensearch.index.query.QueryBuilders;

/**
 * Helper class for indexing operations in the Fess search engine.
 * This class provides functionality for sending documents to the search engine,
 * managing document lifecycle operations (create, update, delete), and handling
 * thumbnail processing during indexing.
 *

	// in Queue stats for bucket - from qCache
	QStat InQueueMetric `json:"queued"`
	// Deprecated fields
	// Pending size in bytes
	PendingSize int64 `json:"pendingReplicationSize"`
	// Failed size in bytes
	FailedSize int64 `json:"failedReplicationSize"`
	// Total number of pending operations including metadata updates
	PendingCount int64 `json:"pendingReplicationCount"`

     * Last fragment flag - indicates last fragment of a multi-fragment message
     */
    int DCERPC_LAST_FRAG = 0x02; /* Last fragment */
    /**
     * Pending cancel flag - indicates cancel was pending at sender
     */
    int DCERPC_PENDING_CANCEL = 0x04; /* Cancel was pending at sender */
    /**
     * Reserved flag for future use
     */
    int DCERPC_RESERVED_1 = 0x08;
    /**
     * Supports concurrent multiplexing flag

     * Last fragment flag - indicates last fragment of a multi-fragment message
     */
    int DCERPC_LAST_FRAG = 0x02; /* Last fragment */
    /**
     * Pending cancel flag - indicates cancel was pending at sender
     */
    int DCERPC_PENDING_CANCEL = 0x04; /* Cancel was pending at sender */
    /**
     * Reserved flag for future use
     */
    int DCERPC_RESERVED_1 = 0x08;
    /**
     * Supports concurrent multiplexing flag.

}

// PendingStatus returns a stringified representation of internal replication status with all targets marked as `PENDING`
func (d ReplicateDecision) PendingStatus() string {
	b := new(bytes.Buffer)
	for _, k := range d.targetsMap {
		if k.Replicate {
			fmt.Fprintf(b, "%s=%s;", k.Arn, replication.Pending.String())
		}
	}
	return b.String()
}