}

  public void testEncloses_open() {
    Range<Integer> range = Range.open(2, 5);
    assertTrue(range.encloses(range));
    assertTrue(range.encloses(Range.open(2, 4)));
    assertTrue(range.encloses(Range.open(3, 5)));
    assertTrue(range.encloses(Range.closed(3, 4)));

    assertFalse(range.encloses(Range.openClosed(2, 5)));

    @DisplayName("unwrap, domain, anonymous/guest flags happy paths")
    void unwrap_and_flags_happy(boolean[] flags) {
        boolean anonymous = flags[0];
        boolean guest = flags[1];

        // Arrange
        Subject subject = new Subject();
        TestCredentials creds = new TestCredentials("DOMAIN", anonymous, guest, subject, false);

        // Act & Assert

    assertEquals(Range.closed(1, 3), ContiguousSet.closedOpen(1, 4).range());
    assertEquals(Range.closed(1, 3), ContiguousSet.create(Range.open(0, 4), integers()).range());
    assertEquals(
        Range.closed(1, 3), ContiguousSet.create(Range.openClosed(0, 3), integers()).range());

    assertEquals(
        Range.openClosed(0, 3),
        ContiguousSet.create(Range.closed(1, 3), integers()).range(OPEN, CLOSED));

      put(range, value);
      return;
    }

    Range<K> coalescedRange = coalescedRange(range, checkNotNull(value));
    put(coalescedRange, value);
  }

  /** Computes the coalesced range for the given range+value - does not mutate the map. */
  private Range<K> coalescedRange(Range<K> range, V value) {
    Range<K> coalescedRange = range;
    Entry<Cut<K>, RangeMapEntry<K, V>> lowerEntry =

   * the range map, or {@code null} otherwise.
   */
  @Nullable Entry<Range<K>, V> getEntry(K key);

  /**
   * Returns the minimal range {@linkplain Range#encloses(Range) enclosing} the ranges in this
   * {@code RangeMap}.
   *
   * @throws NoSuchElementException if this range map is empty
   */
  Range<K> span();

  /**

  public static <C extends Comparable> ImmutableRangeSet<C> of(Range<C> range) {
    checkNotNull(range);
    if (range.isEmpty()) {
      return of();
    } else if (range.equals(Range.all())) {
      return all();
    } else {
      return new ImmutableRangeSet<>(ImmutableList.of(range));
    }
  }

  /** Returns an immutable range set containing the single range {@link Range#all()}. */
  @SuppressWarnings("unchecked")

        // Assert
        assertEquals(-1, actual);
    }

    @Test
    @DisplayName("Structure: DOS_ERROR_CODES is non-null with [code,status] pairs")
    void dosErrorCodesStructureIsValid() {
        // Arrange & Act
        int[][] table = DosError.DOS_ERROR_CODES;

        // Assert
        assertNotNull(table, "DOS_ERROR_CODES must not be null");
        assertTrue(table.length > 0, "DOS_ERROR_CODES must not be empty");

			{8, "\x00G\x00o\x00G\x00o"},
			{4, "end\n"},
		},
	}}

	for _, v := range vectors {
		t.Run(path.Base(v.file), func(t *testing.T) {
			f, err := os.Open(v.file)
			if err != nil {
				t.Fatalf("Open() error: %v", err)
			}
			defer f.Close()

			tr := NewReader(f)
			for i, tc := range v.cases {
				hdr, err := tr.Next()
				if err != nil || hdr == nil {

    //@Maxbytelength(maxbytelength = 1000)
    public String url;

    /** Minimum error count filter for searching failure URLs. */
    //@IntRange(min = 0, max = 2147483647)
    public String errorCountMin;

    /** Maximum error count filter for searching failure URLs. */
    //@IntRange(min = 0, max = 2147483647)
    public String errorCountMax;

    /** Error name filter for searching failure URLs. */

world, because the Go garbage collector is unaware of the memory
allocated by C.  The most important consideration is not to
constrain future implementations, so the rule is that Go code can
hand a Go pointer to C code but must separately arrange for
Go to hang on to a reference to the pointer until C is done with it.
*/
package gmp

/*
#cgo LDFLAGS: -lgmp
#include <gmp.h>
#include <stdlib.h>