<la:errors/>
                                </div>
                                    <%-- Form Fields --%>
                                <table class="table table-bordered" aria-label="<la:message key="labels.key_match_details" />">
                                    <tbody>
                                    <tr>
                                        <th style="width: 25%"><la:message

        return Spliterators.spliterator(new Object[0], Spliterator.DISTINCT | Spliterator.ORDERED);
      }
      Map<K, V> delegate = delegateOrNull();
      return (delegate != null)
          ? delegate.keySet().spliterator()
          : Spliterators.spliterator(
              requireKeys(), 0, size, Spliterator.DISTINCT | Spliterator.ORDERED);
    }

    @Override
    public void forEach(Consumer<? super K> action) {

/**
 * Implementation of {@code Table} whose iteration ordering across row keys is sorted by their
 * natural ordering or by a supplied comparator. Note that iterations across the columns keys for a
 * single row key may or may not be ordered, depending on the implementation. When rows and columns
 * are both sorted, it's easier to use the {@link TreeBasedTable} subclass.
 *
 * <p>The {@link #rowKeySet} method returns a {@link SortedSet} and the {@link #rowMap} method

                                <div class="row top10">
                                    <div class="col-sm-12">
                                        <table class="table table-bordered table-striped" aria-label="<la:message key="labels.pathmap_list" />">
                                            <thead>
                                            <tr>

	metacacheSharePrefix = false
)

//go:generate msgp -file $GOFILE -unexported

// metacache contains a tracked cache entry.
type metacache struct {
	// do not re-arrange the struct this struct has been ordered to use less
	// space - if you do so please run https://github.com/orijtech/structslop
	// and verify if your changes are optimal.
	ended        time.Time  `msg:"end"`
	started      time.Time  `msg:"st"`

                                <div class="row top10">
                                    <div class="col-sm-12">
                                        <table class="table table-bordered table-striped" aria-label="<la:message key="labels.labeltype_list" />">
                                            <thead>
                                            <tr>

   * collection. If the specified collection is a {@link SortedSet} or a {@link PriorityQueue}, this
   * priority queue will be ordered according to the same ordering. Otherwise, this priority queue
   * will be ordered according to the {@linkplain Comparable natural ordering} of its elements.
   *
   * @param c the collection whose elements are to be placed into this priority queue

    setDistinctValues(NetworkBuilder.class, networkBuilderA, networkBuilderB);
    setDistinctValues(Network.class, IMMUTABLE_NETWORK_A, IMMUTABLE_NETWORK_B);
    setDefault(EndpointPair.class, EndpointPair.ordered("A", "B"));
  }

  @Override
  public void testNulls() throws Exception {
    try {
      super.testNulls();
    } catch (AssertionError e) {

        }

        @Test
        @DisplayName("Should verify method invocation order")
        void testMethodInvocationOrder() {
            // Setup ordered verification
            Map<String, DfsReferralDataInternal> cache = new HashMap<>();
            String key = "ordered-key";

            // Execute in specific order
            mockReferralData.setKey(key);
            mockReferralData.setCacheMap(cache);

apply to operands of <i>ordered</i> types.
These terms and the result of the comparisons are defined as follows:
</p>

<ul>
	<li>
	Boolean types are comparable.
	Two boolean values are equal if they are either both
	<code>true</code> or both <code>false</code>.
	</li>

	<li>
	Integer types are comparable and ordered.
	Two integer values are compared in the usual way.