The behavior behind the internal property can change at any time and without notice.
Internal properties MUST NOT be documented in public documentation.

As a *secondary aspect*, property names can carry **feature-stability** information of the features they represent.

   * returned by {@link #row}. Those maps may support {@code setValue()}, {@code put()}, and {@code
   * putAll()}.
   *
   * @return a map view from each row key to a secondary map from column keys to values
   */
  Map<R, Map<C, V>> rowMap();

  /**
   * Returns a view that associates each column key with the corresponding map from row keys to

th{border-color:#7abaff}.table-hover .table-primary:hover{background-color:#9fcdff}.table-hover .table-primary:hover>td,.table-hover .table-primary:hover>th{background-color:#9fcdff}.table-secondary,.table-secondary>td,.table-secondary>th{background-color:#d6d8db}.table-secondary tbody+tbody,.table-secondary td,.table-secondary th,.table-secondary thead th{border-color:#b3b7bb}.table-hover .table-secondary:hover{background-color:#c8cbcf}.table-hover .table-secondary:hover>td,.table-hover .table-secondary:hover>th{...

        return Comparator.comparingLong((ToLongFunction<MavenProject>) this::getProjectWeight)
                .reversed() // Higher weights first
                .thenComparing(this::getProjectId); // Secondary sort for deterministic ordering
    }

    private long calculateWeight(MavenProject project) {
        // Calculate maximum weight of downstream dependencies

 * whereToDiffer} produces no observable change in performance. We want to make sure that the array
 * equals implementation is *not* short-circuiting to prevent timing-based attacks. Being fast is
 * only a secondary goal.
 *
 * @author Kurt Alfred Kluever
 */
@NullUnmarked
public class HashCodeBenchmark {

  // Use a statically configured random instance for all of the benchmarks

					<i class="fa fa-search" aria-hidden="true"></i>
					<la:message key="labels.search" />
				</button>
				<la:link href="/search/advance?q=${f:u(q)}${fe:pagingQuery(null)}" styleClass="btn btn-outline-secondary">
					<i class="fa fa-cog" aria-hidden="true"></i>
					<la:message key="labels.advance" />
				</la:link>
			</div>
		</div>
	</div>
	</c:if>

					<i class="fa fa-search" aria-hidden="true"></i>
					<la:message key="labels.search" />
				</button>
				<la:link href="/search/advance?q=${f:u(q)}${fe:pagingQuery(null)}" styleClass="btn btn-outline-secondary">
					<i class="fa fa-cog" aria-hidden="true"></i>
					<la:message key="labels.advance" />
				</la:link>
			</div>
		</div>
	</div>
	</c:if>

    ListenableFuture<Foo> immediate = immediateFuture(new Foo());
    SettableFuture<Bar> secondary = SettableFuture.create();
    AsyncFunction<Foo, Bar> function = unused -> secondary;
    assertTrue(transformAsync(immediate, function, directExecutor()).cancel(false));
    assertTrue(secondary.isCancelled());
    assertFalse(secondary.wasInterrupted());
  }

    ListenableFuture<Foo> immediate = immediateFuture(new Foo());
    SettableFuture<Bar> secondary = SettableFuture.create();
    AsyncFunction<Foo, Bar> function = unused -> secondary;
    assertTrue(transformAsync(immediate, function, directExecutor()).cancel(false));
    assertTrue(secondary.isCancelled());
    assertFalse(secondary.wasInterrupted());
  }

            verify(mockBuffer, times(5)).dec_ndr_short(); // max xmit, max recv, addr len, result, final short
            verify(mockBuffer).dec_ndr_long(); // assoc group
            verify(mockBuffer).advance(10); // secondary addr (length 10)
            verify(mockBuffer, times(2)).align(4); // alignment calls
            verify(mockBuffer).dec_ndr_small(); // num results
            verify(mockBuffer).advance(20); // transfer syntax / version