Package gnu.trove

Examples of gnu.trove.THashMap

27
28
29
30
31
32
33
  private THashMap backing;

  public THashMultiMap ()
  {
    backing = new THashMap ();
  }
View Full Code Here
32
33
34
35
36
37
38
    backing = new THashMap ();
  }

  public THashMultiMap (int initialCapacity)
  {
    backing = new THashMap (initialCapacity);
  }
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
    public EdgesIterator (ACRF.UnrolledGraph acrf, Assignment observed)
    {
      this.graph = acrf;
      this.observed = observed;

      cliquesByEdge = new THashMap();

      for (Iterator it = acrf.unrolledVarSetIterator (); it.hasNext();) {
        ACRF.UnrolledVarSet clique = (ACRF.UnrolledVarSet) it.next ();
        for (int v1idx = 0; v1idx < clique.size(); v1idx++) {
          Variable v1 = clique.get(v1idx);
View Full Code Here
34
35
36
37
38
39
40
  }

  public static void resetUniverse()
  {
      DEFAULT = new Universe();
      allProjectionCaches = new THashMap();
  }
View Full Code Here
306
307
308
309
310
311
312
  private void readObject (ObjectInputStream in) throws IOException, ClassNotFoundException
  {
    in.defaultReadObject ();
    int version = in.readInt ();
    instanceCache = new THashMap ();
  }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
  private THashMap fieldMap;
  private String name;

  public Record (String name, LabeledSpans spans) {
    this.name = name;
    fieldMap = new THashMap ();
    for (int i = 0; i < spans.size(); i++) {
      LabeledSpan span = spans.getLabeledSpan (i);
      if (!span.isBackground()) {
        Label tag = span.getLabel ();
        Field field = (Field) fieldMap.get (tag);
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
  }

  private void setupLabel2Var ()
  {
    idx2var = new Variable [lblseq.size ()][];
    var2label = new THashMap ();
    for (int t = 0; t < lblseq.size (); t++) {
      Labels lbls = lblseq.getLabels (t);
      idx2var[t] = new Variable [lbls.size ()];
      for (int j = 0; j < lbls.size (); j++) {
        Label lbl = lbls.get (j);
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
         return Double.compare (start1, start2);
       }
     } );

     ArrayList roots = new ArrayList (orderedByStart);
     THashMap children = new THashMap ();
     for (int i = 0; i < orderedByStart.size(); i++) {
       LabeledSpan child = (LabeledSpan) orderedByStart.get (i);
       for (int j = i-1; j >= 0; j--) {
         LabeledSpan parent = (LabeledSpan) orderedByStart.get (j);
         if (parent.isSubspan (child)) {
           List childList = (List) children.get (parent);
           if (childList == null) {
             childList = new ArrayList ();
             children.put (parent, childList);
           }
           roots.remove (child);
           childList.add (child);
           break;
         }
View Full Code Here
114
115
116
117
118
119
120
      myMap.remove(wk);
    }
  }

  public WeakHashMap(int initialCapacity, float loadFactor) {
    myMap = new THashMap(initialCapacity, loadFactor);
  }
View Full Code Here
118
119
120
121
122
123
124
  public WeakHashMap(int initialCapacity, float loadFactor) {
    myMap = new THashMap(initialCapacity, loadFactor);
  }

  public WeakHashMap(int initialCapacity) {
    myMap = new THashMap(initialCapacity);
  }
View Full Code Here
TOP

Related Classes of gnu.trove.THashMap

  • cc.mallet.extract.DocumentExtraction
  • cc.mallet.extract.Record
  • cc.mallet.grmm.learning.PseudolikelihoodACRFTrainer$EdgesIterator
  • cc.mallet.grmm.learning.templates.SimilarTokensTemplate
  • cc.mallet.grmm.types.Universe
  • cc.mallet.grmm.util.LabelsAssignment
  • cc.mallet.grmm.util.THashMultiMap
  • com.intellij.openapi.actionSystem.Presentation
  • com.intellij.util.containers.WeakHashMap
  • com.intellij.util.SharedProcessingContext
    • 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.