Package com.carrotsearch.hppc

Examples of com.carrotsearch.hppc.IntOpenHashSet

94
95
96
97
98
99
100
101
102
103
   
    l_branches = Lists.newArrayList();
     l_states   = Lists.newArrayList();
    l_2ndHeads = Lists.newArrayList();
     n_2ndPos   = new double[t_size];
     s_reduce   = new IntOpenHashSet();
    
     int i; for (i=0; i<t_size; i++)
       l_2ndHeads.add(new ArrayList<DEPHead>());
  }
View Full Code Here
991
992
993
994
995
996
997
998
999
1000
      getSubNodeCollectionAux(col, arc.getNode());
  }
 
  public IntOpenHashSet getSubIdSet()
  {
    IntOpenHashSet set = new IntOpenHashSet();
   
    getSubIdSetAux(set, this);
    return set;
  }
View Full Code Here
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
   * The array is sorted in ascending order.
   * @return an array of IDs from the subtree of this node, including the ID of this node.
   */
  public int[] getSubIdArray()
  {
    IntOpenHashSet set = getSubIdSet();
    int[] list = set.toArray();
    Arrays.sort(list);
   
    return list;
  }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
   
    l_branches = Lists.newArrayList();
     l_states   = Lists.newArrayList();
    l_2ndHeads = Lists.newArrayList();
     n_2ndPos   = new double[t_size];
     s_reduce   = new IntOpenHashSet();
    
     int i; for (i=0; i<t_size; i++)
       l_2ndHeads.add(new ArrayList<DEPHead>());
  }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
  {
    super(tree);
   
    d_tree  = tree;
    i_pred  = 0;
    s_skip  = new IntOpenHashSet();
    l_argns = Lists.newArrayList();
    m_argns = Maps.newHashMap();
    m_refs  = Maps.newHashMap();
   
    initArcs(tree);
View Full Code Here
996
997
998
999
1000
1001
1002
1003
1004
1005
      getSubNodeCollectionAux(col, arc.getNode());
  }
 
  public IntOpenHashSet getSubIdSet()
  {
    IntOpenHashSet set = new IntOpenHashSet();
   
    getSubIdSetAux(set, this);
    return set;
  }
View Full Code Here
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
   * The array is sorted in ascending order.
   * @return an array of IDs from the subtree of this node, including the ID of this node.
   */
  public int[] getSubIdArray()
  {
    IntOpenHashSet set = getSubIdSet();
    int[] list = set.toArray();
    Arrays.sort(list);
   
    return list;
  }
View Full Code Here
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
  {
    int i, size = size();
     
    StringIntPair[]   H = new StringIntPair[size];
    List<DEPCountArc> F = new ArrayList<DEPCountArc>();
    IntOpenHashSet    T = new IntOpenHashSet();
    DEPCountArc a;
   
    StringIntPair[] t = lHeads.get(0);
     
    for (i=1; i<size; i++)
      H[i] = new StringIntPair(t[i].s, t[i].i);
     
    T.add(DEPLib.ROOT_ID);
    F.addAll(getArcs(lHeads, T));
     
    while (!F.isEmpty())
    {
      UTCollection.sortReverseOrder(F);
      a = F.get(0);
     
      H[a.depId].i = a.headId;
      H[a.depId].s = a.deprel;
   
      T.add(a.depId);
      removeArcs(F, a.depId);
     
      F.addAll(getArcs(lHeads, T));     
    }
     
View Full Code Here
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
  }
 
  /** Called by {@link DEPTree#projectivize()}. */
  private DEPNode getSmallestNonProjectiveArc(IntArrayList ids)
  {
    IntOpenHashSet remove = new IntOpenHashSet();
    DEPNode wk, nonProj = null;
    int np, max = 0;
   
    for (IntCursor cur : ids)
    {
      wk = get(cur.value);
      np = isNonProjective(wk);
     
      if (np == 0)
      {
        remove.add(cur.value);
      }
      else if (np > max)
      {
        nonProj = wk;
        max = np;
View Full Code Here
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
  }
 
  @Deprecated
  private void addNonProjectiveMap(IntObjectOpenHashMap<IntOpenHashSet> map, int cIdx, int nIdx)
  {
    IntOpenHashSet set;
   
    if (map.containsKey(cIdx))
      set = map.get(cIdx);
    else
    {
      set = new IntOpenHashSet();
      map.put(cIdx, set);
    }
   
    set.add(nIdx);
  }
View Full Code Here
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
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.