byte[] decompressed = searchHelper.gzipDecompress(compressed);

        assertEquals(testData, new String(decompressed));
        // For small strings, gzip overhead might make compressed data larger
        // So we just verify that compression/decompression works correctly
        assertNotNull(compressed);
        assertTrue(compressed.length > 0);
    }

    // Helper methods for creating mock objects

            if (ssn != null) {
                ssn.removeAttribute("npa-" + server);
            }
            if (sae.getNtStatus() == NtStatus.NT_STATUS_ACCESS_VIOLATION) {
                /* Server challenge no longer valid for
                 * externally supplied password hashes.
                 */
                resp.sendRedirect(req.getRequestURL().toString());
                return;
            }

      } catch (_: FileNotFoundException) {
        // A file must have been deleted manually!
        for (source in sources) {
          source.closeQuietly()
        }
        // Since the entry is no longer valid, remove it so the metadata is accurate (i.e. the cache
        // size.)
        try {
          removeEntry(this)
        } catch (_: IOException) {
        }
        return null
      }

		// ReadSlice, and it's that function that handles
		// the last byte.
	}

	// Try all readers with UnreadByte.
	for rno, read := range readers {
		// Some input data that is longer than the minimum reader buffer size.
		const n = 10
		var buf bytes.Buffer
		for i := 0; i < n; i++ {
			buf.WriteString("abcdefg")
		}

		r := NewReaderSize(&buf, minReadBufferSize)

        byte[] remaining = new byte[2];
        assertEquals(2, sis.read(remaining, 0, 2));
        assertArrayEquals(new byte[] { 40, 50 }, remaining);
    }

    @Test
    @DisplayName("Skip handles amount larger than available")
    void skipHandlesLargerThanAvailable() throws IOException {
        // Create message with 3 bytes of data
        byte[] data = new byte[] { 1, 2, 3 };

labels.facet_is_not_found=Not found
labels.doc_score=Score:
labels.development_mode_warning=Fess is running in development mode. Please install OpenSearch separately in a production environment.
labels.eol_error=The system you are using is no longer supported. Please refer to the product support lifecycle page and upgrade.
labels.tooltip_search_view=Search Screen
labels.tooltip_run_crawler=Run Crawler
labels.tooltip_forum=Forum
labels.tooltip_onlinehelp=Help

    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two
    // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about

in the lock, and to her great delight it fitted!

  Alice opened the door and found that it led into a small
passage, not much larger than a rat-hole:  she knelt down and
looked along the passage into the loveliest garden you ever saw.
How she longed to get out of that dark hall, and wander about
among those beds of bright flowers and those cool fountains, but

        .addEqualityGroup(Range.all(), Range.all())
        .addEqualityGroup("Phil")
        .testEquals();
  }

  @GwtIncompatible // TODO(b/148207871): Restore once Eclipse compiler no longer flakes for this.
  @J2ktIncompatible // TODO(b/148207871): Likewise, or once J2KT uses javac instead of Eclipse.
  public void testLegacyComparable() {

Here's what to keep in mind and how to review a pull request:

### Understand the problem { #understand-the-problem }

* First, make sure you **understand the problem** that the pull request is trying to solve. It might have a longer discussion in a GitHub Discussion or issue.

* There's also a good chance that the pull request is not actually needed because the problem can be solved in a **different way**. Then you can suggest or ask about that.