assertThat(stopwatch.toString()).isEqualTo("5.000 s");
    stopwatch.reset();
    stopwatch.start();
    ticker.advance((long) (1.5 * 60 * 1000000000L));
    assertThat(stopwatch.toString()).isEqualTo("1.500 min");
    stopwatch.reset();
    stopwatch.start();
    ticker.advance((long) (2.5 * 60 * 60 * 1000000000L));
    assertThat(stopwatch.toString()).isEqualTo("2.500 h");
    stopwatch.reset();
    stopwatch.start();

  }

  @GwtIncompatible
  public void testMin_noArgs() {
    assertThrows(IllegalArgumentException.class, () -> min());
  }

  public void testMin() {
    assertThat(min(LEAST)).isEqualTo(LEAST);
    assertThat(min(GREATEST)).isEqualTo(GREATEST);
    assertThat(min((short) 8, (short) 6, (short) 7, (short) 5, (short) 3, (short) 0, (short) 9))
        .isEqualTo((short) 0);
  }

    if (other.isEmpty()) {
      return other;
    } else {
      C lowerEndpoint = Ordering.<C>natural().max(this.first(), other.first());
      C upperEndpoint = Ordering.<C>natural().min(this.last(), other.last());
      return (lowerEndpoint.compareTo(upperEndpoint) <= 0)
          ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
          : new EmptyContiguousSet<C>(domain);
    }

        // When/Then
        assertDoesNotThrow(() -> {
            PropertyConfiguration testConfig = new PropertyConfiguration(props);
            // Configuration should handle inconsistent min/max versions
            assertNotNull(testConfig.getMinimumVersion());
            assertNotNull(testConfig.getMaximumVersion());
        });
    }

    @Test

                        dc_list_expiration = now + 1000 * 60 * 15; /* 15 min */
                        if (LogStream.level >= 2) {
                            SmbTransport.log.println("Failed to retrieve DC list from WINS");
                        }
                    }
                }

                final int max = Math.min(dc_list.length, LOOKUP_RESP_LIMIT);
                for (int j = 0; j < max; j++) {

                Arguments.of((LongGetter) FileEntry::lastAccess, 0L, "zero lastAccess"),
                Arguments.of((LongGetter) FileEntry::lastAccess, Long.MIN_VALUE, "min lastAccess"),

                Arguments.of((LongGetter) FileEntry::length, -100L, "negative length"),
                Arguments.of((LongGetter) FileEntry::length, 0L, "zero length"),

        } else if (hours > 0) {
            return String.format("%02d:%02d h", hours, minutes);
        } else if (minutes > 0) {
            return String.format("%02d:%02d min", minutes, seconds);
        } else {
            return String.format("%d.%03d s", seconds, millis);
        }
    }

	switch {
	case resourceSize < 0:
		return 0, errors.New("Resource size cannot be negative")

	case h == nil:
		rangeLength = resourceSize

	case h.IsSuffixLength:
		specifiedLen := -h.Start
		rangeLength = min(specifiedLen, resourceSize)

	case h.Start >= resourceSize:
		return 0, InvalidRange{
			OffsetBegin:  h.Start,
			OffsetEnd:    h.End,
			ResourceSize: resourceSize,
		}

	case h.End > -1:
		end := h.End

 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 */

package com.google.common.hash;

import static java.lang.Math.min;

import com.google.common.annotations.VisibleForTesting;
import com.google.common.primitives.Longs;
import java.lang.reflect.Field;
import java.nio.ByteOrder;
import java.security.AccessController;

}

func (r *RingBuffer) read(p []byte) (n int, err error) {
	if r.w == r.r && !r.isFull {
		return 0, ErrIsEmpty
	}

	if r.w > r.r {
		n = min(r.w-r.r, len(p))
		copy(p, r.buf[r.r:r.r+n])
		r.r = (r.r + n) % r.size
		return n, err
	}

	n = min(r.size-r.r+r.w, len(p))

	if r.r+n <= r.size {
		copy(p, r.buf[r.r:r.r+n])
	} else {
		c1 := r.size - r.r
		copy(p, r.buf[r.r:r.size])