if (lowerBoundInclusive != restriction.lowerBoundInclusive) {
            return false;
        }

        if (upperBound != null) {
            if (!upperBound.equals(restriction.upperBound)) {
                return false;
            }
        } else if (restriction.upperBound != null) {
            return false;
        }

        return upperBoundInclusive == restriction.upperBoundInclusive;
    }

				classes[j].target = x + 2*rands.Float64()
				classes[j].upperBound = x + 3*rands.Float64()
				lowSum += classes[j].lowerBound
				highSum += classes[j].upperBound
			})
		case 1:
			style = "bound from above"
			requiredSum = rands.Intn(probLen*3) + 1
			requiredSumF = float64(requiredSum)
			partition64(rands, probLen, requiredSumF, func(j int, x float64) {
				classes[j].upperBound = x

        for (upperBound in upperBounds) {
            val declaration = upperBound.constructor.declarationDescriptor as? ClassDescriptor ?: continue
            if (declaration.kind != ClassKind.INTERFACE && declaration.kind != ClassKind.ANNOTATION_CLASS) {
                return upperBound
            }
        }

        return upperBounds.firstOrNull() ?: builtIns.nullableAnyType
    }

  }

  @Override
  public SortedMultiset<E> headMultiset(E upperBound, BoundType boundType) {
    return delegate().headMultiset(upperBound, boundType);
  }

  @Override
  public SortedMultiset<E> subMultiset(
      E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) {
    return delegate().subMultiset(lowerBound, lowerBoundType, upperBound, upperBoundType);
  }

  /**

			sizeFilter: BatchJobSizeFilter{
				UpperBound: 1 << 20,
				LowerBound: 10 << 20,
			},
			err: errInvalidBatchJobSizeFilter,
		},
		{
			// LowerBound == UpperBound -> empty range
			sizeFilter: BatchJobSizeFilter{
				UpperBound: 1 << 20,
				LowerBound: 1 << 20,
			},
			err: errInvalidBatchJobSizeFilter,
		},
	}
	for i, test := range tests {

    private final String lowerBound;
    private final String upperBound;
    private final boolean upperInclusive;

    public VersionDependency(URI url, String version) {
        super(url);
        this.lowerBound = version;
        this.upperBound = null;
        upperInclusive = false;
    }

    public VersionDependency(URI url, String lowerBound, @Nullable String upperBound, boolean upperInclusive) {
        super(url);

   * in the other.
   */
  SortedMultiset<E> descendingMultiset();

  /**
   * Returns a view of this multiset restricted to the elements less than {@code upperBound},
   * optionally including {@code upperBound} itself. The returned multiset is a view of this
   * multiset, so changes to one will be reflected in the other. The returned multiset supports all
   * operations that this multiset supports.
   *

   * in the other.
   */
  SortedMultiset<E> descendingMultiset();

  /**
   * Returns a view of this multiset restricted to the elements less than {@code upperBound},
   * optionally including {@code upperBound} itself. The returned multiset is a view of this
   * multiset, so changes to one will be reflected in the other. The returned multiset supports all
   * operations that this multiset supports.
   *

//  1. `classes[J].lowerBound <= allocs[J] <= classes[J].upperBound` and
//  2. exactly one of the following is true:
//     2a. `allocs[J] == fairProp * classes[J].target`,
//     2b. `allocs[J] == classes[J].lowerBound && classes[J].lowerBound > fairProp * classes[J].target`, or
//     2c. `allocs[J] == classes[J].upperBound && classes[J].upperBound < fairProp * classes[J].target`.
//

  }

  @Override
  public SortedMultiset<E> headMultiset(E upperBound, BoundType boundType) {
    return Multisets.unmodifiableSortedMultiset(delegate().headMultiset(upperBound, boundType));
  }

  @Override
  public SortedMultiset<E> subMultiset(
      E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) {
    return Multisets.unmodifiableSortedMultiset(