/** * Returns a set of terminal IDs belonging to this argument given the specific tree. * @param tree the constituent tree. * @return a set of terminal IDs belonging to this argument. */ public IntOpenHashSet getTerminalIdSet(CTTree tree) { IntOpenHashSet set = new IntOpenHashSet(); for (PBLoc loc : l_locs) set.addAll(tree.getNode(loc).getSubTerminalIdSet()); return set; }
/** Initializes random centroids. */ private void initCentroids() { IntOpenHashSet set = new IntOpenHashSet(); Random rand = new Random(RAND_SEED); d_centroid = new double[K*D]; d_scala = new double[K]; while (set.size() < K) set.add(rand.nextInt(N)); int[] unit; int k = 0; for (IntCursor cur : set) { unit = v_units.get(cur.value); for (int index : unit) d_centroid[getCentroidIndex(k, index)] = 1; d_scala[k++] = Math.sqrt(unit.length); } }
public boolean isSkip(DEPNode node) { return s_skip.contains(node.id); }
static public IntOpenHashSet intersection(IntContainer c1, IntContainer c2) { IntOpenHashSet s1 = new IntOpenHashSet(c1); IntOpenHashSet s2 = new IntOpenHashSet(c2); s1.retainAll(s2); return s1; }
if (set.size() > max.i2) max.set(key, set.size()); remove = new IntOpenHashSet(); if (set.contains(max.i1)) set.remove(max.i1); if (set.isEmpty()) remove.add(cur.value); return new IntOpenHashSet(map.keys());
if (pair == null) return null; Pair<PBArg,IntOpenHashSet> max = new Pair<PBArg,IntOpenHashSet>(null, new IntOpenHashSet()); IntOpenHashSet set; CTNode prn = pair.o1; if (set.contains(esm.getTerminalId())) if (arg.hasType(",") && max.o2.size() < set.size()) max.set(arg, set);
public IntOpenHashSet getSubTerminalIdSet() { IntOpenHashSet set = new IntOpenHashSet(); for (CTNode node : getSubTerminals()) set.add(node.getTerminalId()); return set; }
public IntOpenHashSet getSubIdSet() { IntOpenHashSet set = new IntOpenHashSet(); getSubIdSetAux(set, this); return set; }
public void addArgumentToSkipList() { s_skip.add(i_arg); }
private BitSet[] createBitSets(IntOpenHashSet hashSets[], IntOpenHashSet mergedHashSet) { BitSet bitSets[] = new BitSet[hashSets.length]; for (int i = 0; i < bitSets.length; ++i) { bitSets[i] = new BitSet(mergedHashSet.size()); } int pos = 0; for (int i = 0; i < mergedHashSet.keys.length; i++) { if (mergedHashSet.allocated[i]) { for (int j = 0; j < bitSets.length; ++j) { if (hashSets[j].contains(mergedHashSet.keys[i])) { bitSets[j].set(pos); } } ++pos; } } return bitSets; }
public void addAll(IntHashSet set) { super.addAll(set); } }
private void removeExistingPredicates(IntOpenHashSet[] sets, List<PBInstance> list) { for (PBInstance inst : list) { for (IntOpenHashSet set : sets) set.remove(inst.predId); } }
public DEPStateBranch(DEPLabel label) { this.lambda = i_lambda; this.beta = i_beta; this.trans = n_trans; this.score = d_score; this.reduce = s_reduce.clone(); this.heads = d_tree.getHeads(); this.label = label; }
public void reInit() { initPrimitives(); l_branches.clear(); l_states.clear(); for (List<DEPHead> list : l_2ndHeads) list.clear(); Arrays.fill(n_2ndPos, 0); s_reduce.clear(); d_tree.clearHeads(); }
if (set.size() > max.i2) max.set(key, set.size()); remove = new IntOpenHashSet(); if (set.contains(max.i1)) set.remove(max.i1); if (set.isEmpty()) remove.add(cur.value); return new IntOpenHashSet(map.keys());
if (pair == null) return null; Pair<PBArg,IntOpenHashSet> max = new Pair<PBArg,IntOpenHashSet>(null, new IntOpenHashSet()); IntOpenHashSet set; CTNode prn = pair.o1; if (set.contains(esm.getTerminalId())) if (arg.hasType(",") && max.o2.size() < set.size()) max.set(arg, set);