/*
     * If greatestOf() promised to be implemented as reverse().leastOf(), this
     * test would be enough. It doesn't... but we'll cheat and act like it does
     * anyway. There's a comment there to remind us to fix this if we change it.
     */
    List<Integer> list = asList(3, 1, 3, 2, 4, 2, 4, 3);
    assertEquals(asList(4, 4, 3, 3), numberOrdering.greatestOf(list, 4));
  }

### Tests { #tests }

* Help me check that the PR has **tests**.

* Check that the tests **fail** before the PR. 🚨

* Then check that the tests **pass** after the PR. ✅

* Many PRs don't have tests, you can **remind** them to add tests, or you can even **suggest** some tests yourself. That's one of the things that consume most time and you can help a lot with that.

* Then also comment what you tried, that way I'll know that you checked it. 🤓

	// normally be visible to the outside. As such, this loop iterates through
	// one or more "header files" until it finds a "normal file".
	format := FormatUSTAR | FormatPAX | FormatGNU
	for {
		// Discard the remainder of the file and any padding.
		if err := discard(tr.r, tr.curr.physicalRemaining()); err != nil {
			return nil, err
		}
		if _, err := tryReadFull(tr.r, tr.blk[:tr.pad]); err != nil {
			return nil, err
		}

        try {
            /*
             * We cannot synchronize (run_thread) here or the caller's
             * thread.wait( timeout ) cannot reaquire the lock and
             * return which would render the timeout effectively useless.
             */
            if (this.state != 5 && this.state != 6) {
                doConnect();
            }
        } catch (final Exception ex) {

						}
					}
					if changed {
						// All empty, clear.
						if clearField {
							version.ObjectV2.PartIndices = nil
						}

						// Reindex since it was changed.
						meta, err := version.MarshalMsg(make([]byte, 0, len(ver.meta)+10))
						if err == nil {
							// Override both if fine.
							ver.header = version.header()
							ver.meta = meta

				<exclusion>
					<groupId>org.opensearch.plugin</groupId>
					<artifactId>percolator-client</artifactId>
				</exclusion>
				<exclusion>
					<groupId>org.opensearch.plugin</groupId>
					<artifactId>reindex-client</artifactId>
				</exclusion>
				<exclusion>
					<groupId>org.opensearch.plugin</groupId>
					<artifactId>mapper-extras-client</artifactId>
				</exclusion>
				<exclusion>

        final File file = new File(realPath);
        return file.isFile();
    }

    /**
     * Creates cached content with highlighting for a document.
     * Uses Handlebars templates to render the cached content.
     *
     * @param doc the document data map
     * @param queries the search queries for highlighting
     * @return the rendered cache content
     */

    if (evictsBySize()) {
      // Ensure sum of segment max weights = overall max weights
      long maxSegmentWeight = maxWeight / segmentCount + 1;
      long remainder = maxWeight % segmentCount;
      for (int i = 0; i < this.segments.length; ++i) {
        if (i == remainder) {
          maxSegmentWeight--;
        }
        this.segments[i] =

such as <code>name(SB)</code>, but not offsets from symbols,
such as <code>name+4(SB)</code>.
</p>

<p>
Instructions, registers, and assembler directives are always in UPPER CASE to remind you
that assembly programming is a fraught endeavor.
(Exception: the <code>g</code> register renaming on ARM.)
</p>

<p>
In Go object files and binaries, the full name of a symbol is the

@return 0;\n  }\n  @if $divisor == 0 {\n    @error \"Cannot divide by 0\";\n  }\n  $remainder: $dividend;\n  $result: 0;\n  $factor: 10;\n  @while ($remainder > 0 and $precision >= 0) {\n    $quotient: 0;\n    @while ($remainder >= $divisor) {\n      $remainder: $remainder - $divisor;\n      $quotient: $quotient + 1;\n    }\n    $result: $result * 10 + $quotient;\n    $factor: $factor * .1;\n    $remainder: $remainder * 10;\n    $precision: $precision - 1;\n    @if ($precision < 0 and $remainder >=...