* any other implementation of this interface.
 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getChildren()} that retrieves its successors in a graph:
 *
 * <pre>{@code
 * someGraphAlgorithm(startNode, MyNode::getChildren);
 * }</pre>
 *
 * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't

		arnErr, ok := err.(*event.ErrARNNotFound)
		if ok {
			for i, queue := range config.QueueList {
				// Remove ARN not found queues, because we previously allowed
				// adding unexpected entries into the config.
				//
				// With newer config disallowing changing / turning off
				// notification targets without removing ARN in notification
				// configuration we won't see this problem anymore.

     */
    int getCount();

    /**
     * {@inheritDoc}
     *
     * <p>Returns {@code true} if the given object is also a multiset entry and the two entries
     * represent the same element and count. That is, two entries {@code a} and {@code b} are equal
     * if:
     *
     * <pre>{@code
     * Objects.equal(a.getElement(), b.getElement())
     *     && a.getCount() == b.getCount()

    split(range.upperBound);

    // Due to the splitting of any entries spanning the range bounds, we know that any entry with a
    // lower bound in the merge range is entirely contained by the merge range.
    Set<Entry<Cut<K>, RangeMapEntry<K, V>>> entriesInMergeRange =
        entriesByLowerBound.subMap(range.lowerBound, range.upperBound).entrySet();

    // Create entries mapping any unmapped ranges in the merge range to the specified value.

	versionID  string `json:"-"`
	RetryCount int    `json:"retryCount" msg:"rc"`
	sz         int64  `json:"-"`
}

// MRFReplicateEntries has the map of MRF entries to save to disk
type MRFReplicateEntries struct {
	Entries map[string]MRFReplicateEntry `json:"entries" msg:"e"`
	Version int                          `json:"version" msg:"v"`
}

// ToMRFEntry returns the relevant info needed by MRF

for a minimum of two years (four Go releases).
Some, such as `http2client` and `http2server`,
will be maintained much longer, even indefinitely.

When possible, each GODEBUG setting has an associated
[runtime/metrics](/pkg/runtime/metrics/) counter
named `/godebug/non-default-behavior/<name>:events`
that counts the number of times a particular program's
behavior has changed based on a non-default value
for that setting.

                for (MetadataGraphEdge e : ins) {
                    sb.append("       from :  ").append(e.toString()).append('\n');
                }
            } else {
                sb.append("      no entries\n");
            }

            List<MetadataGraphEdge> outs = getExcidentEdges(v);
            if (outs != null) {
                for (MetadataGraphEdge e : outs) {

        readinessProbe:
          failureThreshold: 3
          httpGet:
            path: /metrics
            port: monitoring
          initialDelaySeconds: 0
          periodSeconds: 10
          successThreshold: 1
          timeoutSeconds: 1
        startupProbe:
          httpGet:
            path: /metrics
            port: monitoring
          initialDelaySeconds: 1
          periodSeconds: 1

    /**
     * Retrieve the last acces time of the file represented by this <code>SmbResource</code>
     * 
     * @return The number of milliseconds since the 00:00:00 GMT, January 1,
     *         1970 as a <code>long</code> value
     * @throws CIFSException
     */
    long lastAccess () throws CIFSException;


    /**
     * Retrieve the last time the file represented by this

    return CompactHashMap.create();
  }

  /**
   * Returns the platform preferred map implementation that preserves insertion order when used only
   * for insertions, with a hint for how many entries to expect.
   */
  static <K extends @Nullable Object, V extends @Nullable Object>
      Map<K, V> preservesInsertionOrderOnPutsMapWithExpectedSize(int expectedSize) {