if (names != null && !names.isEmpty()) { b.append(" Names ["); int[] keys = names.keys();
if (depends.tagValueGlobalRules[i] == null || depends.tagValueGlobalRules[i].isEmpty()) { continue;
/** * {@inheritDoc} */ public boolean isEmpty() { return edges.isEmpty(); }
/** See {@link gnu.trove.map.hash.TIntObjectHashMap#isEmpty()} */ public boolean isEmpty() { return delegate.isEmpty(); }
@Override public boolean isEmpty() { return map.isEmpty(); }
/** See {@link gnu.trove.map.hash.TIntObjectHashMap#isEmpty()} */ public boolean isEmpty() { return delegate.isEmpty(); }
public boolean isEmpty() { return powers.isEmpty(); }
@SuppressWarnings("unchecked") private void tuple(TIntObjectHashMap<TIntObjectHashMap> current, int[] tt, int p, Tuples tuples) { if (current.isEmpty()) { tuples.add(tt); } else { for (int k : current.keys()) { tt[p] = k; tuple(current.get(k), tt, p + 1, tuples); } } }
/** * String representation in specified output format. * * @param format output format * @return string representation in specified output format */ public String toString(OutputFormat format) { StringBuilder sb = new StringBuilder(); sb.append(sign ? '-' : '+').append('{'); if (map.isEmpty()) return sb.append('}').toString(); String from, to; TIntObjectIterator<IndexMappingBufferRecord> iterator = map.iterator(); while (iterator.hasNext()) { iterator.advance(); if (iterator.value().isContracted()) { from = toStringIndex(iterator.key(), format).substring(1); to = toStringIndex(iterator.value().getIndexName(), format).substring(1); sb.append(','); } else { from = toStringIndex(setRawState(iterator.value().getFromRawState(), iterator.key()), format); to = toStringIndex(setRawState(iterator.value().getToRawState(), iterator.value().getIndexName()), format); } sb.append(from).append(" -> ").append(to).append(", "); } sb.deleteCharAt(sb.length() - 1).deleteCharAt(sb.length() - 1).append('}'); return sb.toString(); } // public String toStringWithStates() {
protected void relocateBySpanningTree() { final TIntObjectHashMap<ArrayList<Loss>> availableLosses = new TIntObjectHashMap<>(); final BitSet usedFragments = new BitSet(graph.numberOfVertices()); for (int l=0; l < numberOfSelectedEdges; ++l) { final Loss loss = usedEdges[l]; final Fragment f = loss.getTarget(); usedFragments.set(f.getVertexId()); } usedFragments.set(graph.getRoot().getVertexId()); for (int l=0; l < numberOfSelectedEdges; ++l) { final Loss loss = usedEdges[l]; final Fragment f = loss.getTarget(); final ArrayList<Loss> ls = new ArrayList<>(); for (int i=0; i < f.getInDegree(); ++i) { if (usedFragments.get(f.getParent(i).getVertexId())) { ls.add(f.getIncomingEdge(i)); } } availableLosses.put(f.getVertexId(), ls); } numberOfSelectedEdges = 0; while (!availableLosses.isEmpty()) { Loss maximum = findMax(availableLosses); usedEdges[numberOfSelectedEdges++] = maximum; availableLosses.remove(maximum.getTarget().getVertexId()); } }
Component component; int index; if (!indexToComponent.isEmpty())
if (node.exponent == null || node.exponent.summands.isEmpty()) {