}
  }

  public void testGap_invalidRangesWithInfinity() {
    try {
      Range.atLeast(1).gap(Range.atLeast(2));
      fail();
    } catch (IllegalArgumentException expected) {
    }

    try {
      Range.atLeast(2).gap(Range.atLeast(1));
      fail();
    } catch (IllegalArgumentException expected) {
    }

    try {

    // These are the methods specified by StandardEntrySet
    verify(map, atLeast(0)).clear();
    verify(map, atLeast(0)).containsKey(any());
    verify(map, atLeast(0)).get(any());
    verify(map, atLeast(0)).isEmpty();
    verify(map, atLeast(0)).remove(any());
    verify(map, atLeast(0)).size();
    verifyNoMoreInteractions(map);
  }

    // These are the methods specified by StandardEntrySet
    verify(map, atLeast(0)).clear();
    verify(map, atLeast(0)).containsKey(any());
    verify(map, atLeast(0)).get(any());
    verify(map, atLeast(0)).isEmpty();
    verify(map, atLeast(0)).remove(any());
    verify(map, atLeast(0)).size();
    verifyNoMoreInteractions(map);
  }

    }
  }

  public void testGap_invalidRangesWithInfinity() {
    try {
      Range.atLeast(1).gap(Range.atLeast(2));
      fail();
    } catch (IllegalArgumentException expected) {
    }

    try {
      Range.atLeast(2).gap(Range.atLeast(1));
      fail();
    } catch (IllegalArgumentException expected) {
    }

    try {

        }
        return this.dialect;
    }


    /**
     * 
     * @param v
     * @return whether this version is a least the given one
     */
    public boolean atLeast ( DialectVersion v ) {
        return ordinal() >= v.ordinal();
    }


    /**
     * 
     * @param v
     * @return whether this version is a most the given one
     */

            i++;
        }

        if ( config.getMaximumVersion().atLeast(DialectVersion.SMB210) ) {
            System.arraycopy(config.getMachineId(), 0, this.clientGuid, 0, this.clientGuid.length);
        }

        List<NegotiateContextRequest> negoContexts = new LinkedList<>();
        if ( config.getMaximumVersion() != null && config.getMaximumVersion().atLeast(DialectVersion.SMB311) ) {
            byte[] salt = new byte[32];

    testInvariants(rangeSet);
    assertThat(rangeSet.asRanges()).contains(Range.closedOpen(1, 6));
    assertThat(rangeSet.complement().asRanges())
        .containsExactly(Range.lessThan(1), Range.atLeast(6))
        .inOrder();
  }

  public void testMergesConnectedDisjoint() {
    TreeRangeSet<Integer> rangeSet = TreeRangeSet.create();
    rangeSet.add(Range.closed(1, 4));
    rangeSet.add(Range.open(4, 6));

    assertFalse(rangeSet.contains(0));

    RangeSet<Integer> expectedComplement = TreeRangeSet.create();
    expectedComplement.add(Range.lessThan(1));
    expectedComplement.add(Range.atLeast(5));

    assertEquals(expectedComplement, rangeSet.complement());
  }

  public void testSingleBoundedBelowRange() {
    ImmutableRangeSet<Integer> rangeSet = ImmutableRangeSet.of(Range.greaterThan(2));

 * <tr><td>{@code (a..+∞)} <td>{@code {x | x > a}}      <td>{@link Range#greaterThan greaterThan}
 * <tr><td>{@code [a..+∞)} <td>{@code {x | x >= a}}     <td>{@link Range#atLeast atLeast}
 * <tr><td>{@code (-∞..b)} <td>{@code {x | x < b}}      <td>{@link Range#lessThan lessThan}
 * <tr><td>{@code (-∞..b]} <td>{@code {x | x <= b}}     <td>{@link Range#atMost atMost}

        ContiguousSet.create(Range.<Integer>all(), integers()));
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.atLeast(Integer.MIN_VALUE), integers()));
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.atMost(Integer.MAX_VALUE), integers()));
  }