@Override public void finished() { checkState(sizeT1 == data.values().stream().filter(node -> node.type == QueueType.T1).count()); checkState(sizeT2 == data.values().stream().filter(node -> node.type == QueueType.T2).count()); checkState(sizeB1 == data.values().stream().filter(node -> node.type == QueueType.B1).count()); checkState(sizeB2 == data.values().stream().filter(node -> node.type == QueueType.B2).count()); checkState((sizeT1 + sizeT2) <= maximumSize); checkState((sizeB1 + sizeB2) <= maximumSize); }
@Override public void finished() { for (int i = 0; i < levels; i++) { int level = i; long count = data.values().stream().filter(node -> node.level == level).count(); checkState(count == sizeQ[i]); } }
@Override public void finished() { long filterSize = data.values().stream() .filter(node -> node.status == Status.FILTER) .count(); long mainSize = data.values().stream() .filter(node -> node.status == Status.MAIN) .count(); checkState(filterSize <= maximumFilterSize); checkState(mainSize <= maximumMainResidentSize); checkState((filterSize + mainSize) <= maximumSize); checkState((filterSize + mainSize) == residentSize); }
@Override public void finished() { long filterSize = data.values().stream().filter(node -> node.status == Status.FILTER).count(); long mainSize = data.values().stream().filter(node -> node.status == Status.MAIN).count(); checkState((filterSize + mainSize) <= maximumSize); checkState(residentFilter == filterSize); checkState(residentMain == mainSize); }
@Override public void finished() { checkState(sizeT1 == data.values().stream().filter(node -> node.type == QueueType.T1).count()); checkState(sizeT2 == data.values().stream().filter(node -> node.type == QueueType.T2).count()); checkState(sizeB1 == data.values().stream().filter(node -> node.type == QueueType.B1).count()); checkState(sizeB2 == data.values().stream().filter(node -> node.type == QueueType.B2).count()); checkState((sizeT1 + sizeT2) <= maximumSize); checkState((sizeB1 + sizeB2) <= maximumSize); }
@Override public void finished() { checkState(sizeT1 == data.values().stream().filter(node -> node.type == QueueType.T1).count()); checkState(sizeT2 == data.values().stream().filter(node -> node.type == QueueType.T2).count()); checkState(sizeB1 == data.values().stream().filter(node -> node.type == QueueType.B1).count()); checkState(sizeB2 == data.values().stream().filter(node -> node.type == QueueType.B2).count()); checkState((sizeT1 + sizeT2) <= maximumSize); checkState((sizeB1 + sizeB2) <= maximumSize); }
@Override public void finished() { long filterSize = data.values().stream().filter(node -> node.status == Status.FILTER).count(); long mainSize = data.values().stream().filter(node -> node.status == Status.MAIN).count(); checkState((filterSize + mainSize) <= maximumSize); checkState(residentFilter == filterSize); checkState(residentMain == mainSize); }
@Override public void finished() { long edenProbationSize = data.values().stream() .filter(n -> n.status == Status.EDEN_PROBATION).count(); long edenProtectedSize = data.values().stream() .filter(n -> n.status == Status.EDEN_PROTECTED).count(); long mainProtectedSize = data.values().stream() .filter(n -> n.status == Status.MAIN_PROTECTED).count(); checkState(sizeEden <= maxEden); checkState(edenProtectedSize == sizeEdenProtected); checkState(sizeEden == edenProbationSize + sizeEdenProtected); checkState(mainProtectedSize == sizeMainProtected); checkState(data.size() <= maximumSize); }
@Override public void finished() { long edenSize = data.values().stream().filter(n -> n.status == Status.EDEN).count(); long probationSize = data.values().stream().filter(n -> n.status == Status.PROBATION).count(); long protectedSize = data.values().stream().filter(n -> n.status == Status.PROTECTED).count(); checkState(edenSize == sizeEden); checkState(protectedSize == sizeProtected); checkState(probationSize == data.size() - edenSize - protectedSize); checkState(data.size() <= maximumSize); }
@Override public void finished() { for (int i = 0; i < levels; i++) { int level = i; int count = (int) data.values().stream() .filter(node -> node.status == Status.MAIN) .filter(node -> node.level == level) .count(); checkState(count == sizeMainQ[i]); } checkState(data.values().stream().filter(n -> n.status == Status.EDEN).count() == sizeEden); checkState(data.size() <= maxEden + maxMain); }
@Override public void finished() { long resident = data.values().stream() .filter(node -> node.status != Status.HIR_NON_RESIDENT) .count(); checkState(resident == residentSize); checkState(sizeHot <= maximumHotSize); checkState(residentSize <= maximumSize); checkState(sizeNR <= maximumNonResidentSize); checkState(data.size() <= (maximumSize + maximumNonResidentSize)); checkState(sizeS == data.values().stream().filter(node -> node.isInS).count()); checkState(sizeQ == data.values().stream().filter(node -> node.isInQ).count()); if (debug) { printLirs(); } }
@Override public void finished() { printSegmentSizes(); long edenSize = data.values().stream().filter(n -> n.status == Status.EDEN).count(); long probationSize = data.values().stream().filter(n -> n.status == Status.PROBATION).count(); long protectedSize = data.values().stream().filter(n -> n.status == Status.PROTECTED).count(); checkState(edenSize == sizeEden, "%s != %s", edenSize, sizeEden); checkState(protectedSize == sizeProtected); checkState(probationSize == data.size() - edenSize - protectedSize); checkState(data.size() <= maximumSize, data.size()); }
@Override public void finished() { checkState(data.values().stream().filter(n -> n.status == Status.EDEN).count() == sizeEden); checkState(sizeEden + sizeMain == data.size()); checkState(data.size() <= maxEden + maxMain); }
public List<DruidServerMetadata> getAllServers() { List<DruidServerMetadata> servers = new ArrayList<>(); historicalServers.values() .stream() .flatMap(Collection::stream) .map(server -> server.getServer().getMetadata()) .forEach(servers::add); realtimeServers.values() .stream() .flatMap(Collection::stream) .map(server -> server.getServer().getMetadata()) .forEach(servers::add); return servers; }
@Override public void finished() { policyStats.setName(getPolicyName()); printSegmentSizes(); long actualWindowSize = data.values().stream().filter(n -> n.queue == WINDOW).count(); long actualProbationSize = data.values().stream().filter(n -> n.queue == PROBATION).count(); long actualProtectedSize = data.values().stream().filter(n -> n.queue == PROTECTED).count(); long calculatedProbationSize = data.size() - actualWindowSize - actualProtectedSize; checkState((long) windowSize == actualWindowSize, "Window: %s != %s", (long) windowSize, actualWindowSize); checkState((long) protectedSize == actualProtectedSize, "Protected: %s != %s", (long) protectedSize, actualProtectedSize); checkState(actualProbationSize == calculatedProbationSize, "Probation: %s != %s", actualProbationSize, calculatedProbationSize); checkState(data.size() <= maximumSize, "Maximum: %s > %s", data.size(), maximumSize); }
@Override public Map<Long,List<Entity>> grouped(TypedName<Long> attr) { Preconditions.checkArgument(attr != CommonAttributes.ENTITY_ID, "cannot group by entity ID"); EntityIndex idx = indexes.get(attr.getName()); if (idx == null) { return store.values() .stream() .filter(e -> e.hasAttribute(attr)) .collect(Collectors.groupingBy(e -> e.getLong(attr))); } else { return idx.getValues() .stream() .collect(Collectors.toMap(l -> (Long) l, idx::getEntities)); } }
@Override public void finished() { checkState(sizeT1 == data.values().stream().filter(node -> node.type == QueueType.T1).count()); checkState(sizeT2 == data.values().stream().filter(node -> node.type == QueueType.T2).count()); checkState(sizeB1 == data.values().stream().filter(node -> node.type == QueueType.B1).count()); checkState(sizeB2 == data.values().stream().filter(node -> node.type == QueueType.B2).count()); checkState((sizeT1 + sizeT2) <= maximumSize); checkState((sizeB1 + sizeB2) <= maximumSize); }
@Override public void finished() { long edenSize = data.values().stream().filter(n -> n.status == Status.EDEN).count(); long probationSize = data.values().stream().filter(n -> n.status == Status.PROBATION).count(); long protectedSize = data.values().stream().filter(n -> n.status == Status.PROTECTED).count(); checkState(edenSize == sizeEden); checkState(protectedSize == sizeProtected); checkState(probationSize == data.size() - edenSize - protectedSize); checkState(data.size() <= maximumSize); }
@Override public void finished() { printSegmentSizes(); long windowSize = data.values().stream().filter(n -> n.queue == WINDOW).count(); long probationSize = data.values().stream().filter(n -> n.queue == PROBATION).count(); long protectedSize = data.values().stream().filter(n -> n.queue == PROTECTED).count(); checkState(windowSize == sizeWindow); checkState(protectedSize == sizeProtected); checkState(probationSize == data.size() - windowSize - protectedSize); checkState(data.size() <= maximumSize); }
@Override public void finished() { checkState(data.values().stream().filter(n -> n.status == Status.EDEN).count() == sizeEden); checkState(sizeEden + sizeMain == data.size()); checkState(data.size() <= maxEden + maxMain); }