/** * Tells whether this instance is empty. * * @return whether this instance is empty */ public boolean isEmpty() { return this.cardinality() == 0; }
private String toIndexString() { StringBuilder sb = new StringBuilder(2 + this.cardinality() * 8); sb.append("{"); String separator = ""; int nextIndex = this.nextSetBit(0); while (nextIndex != -1) { sb.append(separator).append(nextIndex); separator = ", "; nextIndex = this.nextSetBit(nextIndex + 1); } sb.append("}"); return sb.toString(); }
final Tree firstTree = iterator.next(); Bitmask combinationSettledIndices = new Bitmask(firstTree.settledDestinationIndices); int maxSettledIndices = combinationSettledIndices.cardinality(); final HashSet<ChannelDescriptor> employedChannelDescriptors = new HashSet<>(firstTree.employedChannelDescriptors); int maxVisitedChannelDescriptors = employedChannelDescriptors.size(); maxSettledIndices += ithTree.settledDestinationIndices.cardinality(); if (maxSettledIndices > combinationSettledIndices.cardinality()) { return null;
final Bitmask indices = entry.getValue(); if (indices.cardinality() < 2) continue;
if (channelDescriptor.isReusable() || newSettledIndices.cardinality() == 1) { if (newSettledIndices.cardinality() == this.destChannelDescriptorSets.size() - excludedExistingIndices.cardinality() && (!this.isRequestBreakpoint || isVisitedBreakpointChannel)) { return newSolutions; && this.kernelDestChannelDescriptorSetsToIndices.size() > 1 && childSolutionSets.size() > 1 && this.destInputs.size() > newSettledIndices.cardinality() + settledDestinationIndices.cardinality() + 1) {