"video/3gpp-tt",
				"video/3gpp2",
				"video/bmpeg",
				"video/bt656",
				"video/celb",
				"video/dv",
				"video/example",
				"video/h261",
				"video/h263",
				"video/h263-1998",
				"video/h263-2000",
				"video/h264",
				"video/jpeg",
				"video/jpeg2000",
				"video/mj2",
				"video/mp1s",
				"video/mp2p",
				"video/mp2t",
				"video/mp4",

  <mime-type type="video/example"/>
  <mime-type type="video/h261">
    <glob pattern="*.h261"/>
  </mime-type>
  <mime-type type="video/h263">
    <glob pattern="*.h263"/>
  </mime-type>
  <mime-type type="video/h263-1998"/>
  <mime-type type="video/h263-2000"/>
  <mime-type type="video/h264">
    <glob pattern="*.h264"/>
  </mime-type>
  <mime-type type="video/iso.segment">

      <version>2.5.1</version>
      <version>2.5.2</version>
      <version>2.5.3</version>
      <version>2.6.0</version>
      <version>2.6.1</version>
      <version>2.6.2</version>
      <version>2.6.3</version>
      <version>2.7.0</version>
      <version>2.7.1</version>
      <version>3.0.0</version>
      <version>3.0.1</version>
      <version>3.0.2</version>
      <version>3.1.0</version>

         * results can exceed 2^63.
         */
        long result = times2ToThe32Mod(aHi * bHi /* < 2^62 */, m); // < m < 2^63
        result += aHi * bLo; // aHi * bLo < 2^63, result < 2^64
        if (result < 0) {
          result = UnsignedLongs.remainder(result, m);
        }
        // result < 2^63 again
        result += aLo * bHi; // aLo * bHi < 2^63, result < 2^64

         * results can exceed 2^63.
         */
        long result = times2ToThe32Mod(aHi * bHi /* < 2^62 */, m); // < m < 2^63
        result += aHi * bLo; // aHi * bLo < 2^63, result < 2^64
        if (result < 0) {
          result = UnsignedLongs.remainder(result, m);
        }
        // result < 2^63 again
        result += aLo * bHi; // aLo * bHi < 2^63, result < 2^64

   */
  public static long divide(long dividend, long divisor) {
    if (divisor < 0) { // i.e., divisor >= 2^63:
      if (compare(dividend, divisor) < 0) {
        return 0; // dividend < divisor
      } else {
        return 1; // dividend >= divisor
      }
    }

    // Optimization - use signed division if dividend < 2^63
    if (dividend >= 0) {
      return dividend / divisor;
    }

    /*

      <version>2.5.1</version>
      <version>2.5.2</version>
      <version>2.5.3</version>
      <version>2.6.0</version>
      <version>2.6.1</version>
      <version>2.6.2</version>
      <version>2.6.3</version>
      <version>2.7.0</version>
      <version>2.7.1</version>
      <version>3.0.0</version>
      <version>3.0.1</version>
      <version>3.0.2</version>
      <version>3.1.0</version>

   *
   * <p>If the argument is nonnegative, the returned result will be equal to {@code bits},
   * otherwise, the result will be equal to {@code 2^64 + bits}.
   *
   * <p>To represent decimal constants less than {@code 2^63}, consider {@link #valueOf(long)}
   * instead.
   *
   * @since 14.0
   */
  public static UnsignedLong fromLongBits(long bits) {
    // TODO(lowasser): consider caching small values, like Long.valueOf

   *
   * <p>If the argument is nonnegative, the returned result will be equal to {@code bits},
   * otherwise, the result will be equal to {@code 2^64 + bits}.
   *
   * <p>To represent decimal constants less than {@code 2^63}, consider {@link #valueOf(long)}
   * instead.
   *
   * @since 14.0
   */
  public static UnsignedLong fromLongBits(long bits) {
    // TODO(lowasser): consider caching small values, like Long.valueOf

      <version>2.5.0</version>
      <version>2.5.1</version>
      <version>2.5.2</version>
      <version>2.5.3</version>
      <version>2.6.0</version>
      <version>2.6.2</version>
      <version>2.6.3</version>
      <version>2.7.0</version>
      <version>2.7.1</version>
      <version>3.0.0</version>
      <version>3.0.1</version>
      <version>3.0.2</version>
      <version>3.1.0</version>