Examples of com.carrotsearch.hppc.IntOpenHashSet

com.carrotsearch.hppc.IntOpenHashSet
l.dsi.unimi.it/">fastutil project.

  
  @Deprecated
  private IntOpenHashSet getNonProjectiveMapAux(IntObjectOpenHashMap<IntOpenHashSet> map)
  {
    IntIntPair max = new IntIntPair(-1, -1);
    IntOpenHashSet set, remove;
    boolean removed;
    int[] keys;
    
    do
    {
      max.set(-1, -1);
      keys = map.keys().toArray();
      Arrays.sort(keys);
      
      for (int key : keys)
      {
        set = map.get(key);
        
        if (set.size() > max.i2)
          max.set(key, set.size());
      }
      
      removed = false;
      
      if (max.i2 > 0)
      {
        remove = new IntOpenHashSet();
        
        for (IntCursor cur : map.get(max.i1))
        {
          if (map.containsKey(cur.value))
          {
            set = map.get(cur.value);
            
            if (set.contains(max.i1))
            {
              removed = true;
              set.remove(max.i1);
              if (set.isEmpty())  remove.add(cur.value);
            }
          }
        }
        
        for (IntCursor cur : remove)
          map.remove(cur.value);
      }
    }
    while (removed);
            
    return new IntOpenHashSet(map.keys());
  }

View Full Code Here

    }
  }
  
  public DEPTree getDEPTreeWithoutEdited(CTTree cTree, DEPTree dTree)
  {
    IntOpenHashSet set = new IntOpenHashSet();
    addEditedTokensAux(cTree.getRoot(), set);
    int i, j, size = dTree.size();
    DEPTree tree = new DEPTree();
    DEPNode node;
    
    for (i=1,j=1; i<size; i++)
    {
      if (!set.contains(i))
      {
        node = dTree.get(i);
        node.id = j++;
        removeEditedHeads(node.getXHeads(), set);
        removeEditedHeads(node.getSHeads(), set);

View Full Code Here

  }
  
  /** 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)

View Full Code Here

   * @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;
  }

View Full Code Here

   * @param tree the constituent tree.
   * @return the sorted list of terminal IDs belonging to this argument give the specific tree.
   */
  public int[] getSortedTerminalIdList(CTTree tree)
  {
    IntOpenHashSet set = getTerminalIdSet(tree);
    int[] ids = set.toArray();
    
    Arrays.sort(ids);
    return ids;
  }

View Full Code Here

    return spans;
  }
  
  private int[] getSpan(DEPNode pred, DEPNode arg)
  {
    IntOpenHashSet sArg = arg .getSubIdSet();
    
    if (pred.isDescendentOf(arg))
      sArg.removeAll(pred.getSubIdSet());      
    
    int[] span = sArg.toArray();
    return span;
  }

View Full Code Here

    return true;
  }
  
  static public IntOpenHashSet intersection(IntContainer c1, IntContainer c2)
  {
    IntOpenHashSet s1 = new IntOpenHashSet(c1);
    IntOpenHashSet s2 = new IntOpenHashSet(c2);
    
    s1.retainAll(s2);
    return s1;
  }

View Full Code Here

    return list;
  }
  
  public IntOpenHashSet getSubTerminalIdSet()
  {
    IntOpenHashSet set = new IntOpenHashSet();
    
    for (CTNode node : getSubTerminals())
      set.add(node.getTerminalId());
    
    return set;
  }

View Full Code Here

  
  private boolean findOverlappingArguments(PBInstance instance)
  {
    CTTree  tree = instance.getTree();
    PBArg ai, aj;
    IntOpenHashSet si, sj;
    int i, j, size = instance.getArgSize(), ni, nj;
    List<PBArg> lDel = new ArrayList<PBArg>();
    
    for (i=0; i<size; i++)
    {
      ai = instance.getArg(i);
      si = getTerminalIdSet(ai, tree);
      ni = si.size();
      
      for (j=i+1; j<size; j++)
      {
        aj = instance.getArg(j);
        sj = getTerminalIdSet(aj, tree);

View Full Code Here

  }
  
  /** Returns the set of terminal IDs associated with this argument. */
  private IntOpenHashSet getTerminalIdSet(PBArg arg, CTTree tree)
  {
    IntOpenHashSet set = new IntOpenHashSet();
    
    for (PBLoc loc : arg.getLocs())
    {
      if (!loc.isType(";"))
        set.addAll(tree.getNode(loc).getSubTerminalIdSet());
    }
    
    return set;
  }

View Full Code Here

0 1 2 3 4

TOP

Related Classes of com.carrotsearch.hppc.IntOpenHashSet

com.carrotsearch.hppc.caliper.BenchmarkPerturbedVsHashedOnly

com.carrotsearch.hppc.examples.IteratingOverSets

com.carrotsearch.hppc.misc.HppcMaxHashMapSize

com.clearnlp.clustering.Kmeans

com.clearnlp.component.state.DEPState

com.clearnlp.component.state.ParseState

com.clearnlp.component.state.SRLState

com.clearnlp.constituent.CTNode

com.clearnlp.dependency.DEPNode

com.clearnlp.dependency.DEPTree

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.