Map<InetAddress, Integer> hostCounts = Maps.toMap( occurrencesByHost.elementSet(), new Function<InetAddress, Integer>() { @Override assertThat(occurrencesByHost.elementSet().size()) .as( "Not all hosts were used as contact points. There is a very small chance"
private void keepMostSpecificClasses(Multiset<OWLClass> classes){ HashMultiset<OWLClass> copy = HashMultiset.create(classes); for (OWLClass nc1 : copy.elementSet()) { for (OWLClass nc2 : copy.elementSet()) { if(!nc1.equals(nc2)){ //remove class nc1 if it is superclass of another class nc2 boolean isSubClassOf = false; if(sr.getClassHierarchy() != null){ isSubClassOf = sr.getClassHierarchy().isSubclassOf(nc2, nc1); } else { isSubClassOf = sr.isSuperClassOf(nc1, nc2); } if(isSubClassOf){ classes.remove(nc1, classes.count(nc1)); break; } } } } } }
log.info("|-Going to retransform {} loaded class(es) of {} class loader(s).", classLoaderMultiset.size(), classLoaderMultiset.elementSet().size());
err.append("1. ImportExceptions by code :\n"); for (String code : importExceptionCodes.elementSet()) { err.append (". "+ StringUtils.rightPad(code,45) + " : "+ importExceptionCodes.count(code) +"\n");
for (final Integer ti : sumCount[k].elementSet()) {
for (int k = 0; k < nTopics; k++) { for (final Integer ti : sums[k].elementSet()) { topSum[k] += Gamma.logGamma(sums[k].count(ti) + beta[k]); sumTotals[k] += sums[k].count(ti);
Map<InetAddress, Integer> hostCounts = Maps.toMap( occurrencesByHost.elementSet(), new Function<InetAddress, Integer>() { @Override assertThat(occurrencesByHost.elementSet().size()) .as( "Not all hosts were used as contact points. There is a very small chance"
for (final Integer ti : sums[k].elementSet()) { logLikelihood += Gamma.logGamma(sums[k].count(ti) + beta[k]); sumTotals[k] += sums[k].count(ti);