Package gnu.trove

Examples of gnu.trove.TIntIntHashMap

165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
  {
    Set survivors = new THashSet (variablesSet ());
    survivors.remove (victim);

    int vi = 0;
    TIntIntHashMap dict = new TIntIntHashMap (survivors.size ());
    // dict.setDefaultValue (-1);  No longer supported, but this.getIndex() written to avoid need for this.
    my2global = new int[survivors.size ()];

    for (Iterator it = survivors.iterator (); it.hasNext();) {
      Variable var = (Variable) it.next ();
      int gvi = var.getIndex ();
      dict.put (gvi, vi);
      my2global [vi] = gvi;
    }

    projectionMap = dict;
    numNodes--;  // do this at end b/c it affects getVertexSet()
View Full Code Here
260
261
262
263
264
265
266
267
268
269
270
271
272
/* 281 */     return new Operation() {
/*     */       public void theirs() {
/*     */       }
/*     */
/*     */       public void ours() {
/* 286 */         TIntIntHashMap ours = new TIntIntHashMap(100000);
/* 287 */         for (int i = Main.dataset.size(); i-- > 0; )
/* 288 */           ours.put(i, i);
/*     */       }
/*     */
/*     */       public String toString()
/*     */       {
/* 293 */         return Main.dataset.size() + " entry primitive int map.put timing run; no basis for comparison";
View Full Code Here
28
29
30
31
32
33
34
35
  private TIntIntHashMap mySingle;
  private TIntObjectHashMap<TIntHashSet> myMulti;


  public IntToIntSetMap(int initialCapacity, float loadfactor) {
    mySingle = new TIntIntHashMap(initialCapacity, loadfactor);
    myMulti = new TIntObjectHashMap<TIntHashSet>(initialCapacity, loadfactor);
  }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
        Boolean match = new Boolean(expression.match(context));

        // update the context mapping from this last visit
        // did we visit some args(<name>) nodes ?
        if (!context.m_exprIndexToTargetIndex.isEmpty()) {
            TIntIntHashMap sourceToTargetArgIndexes = new TIntIntHashMap();
            int index = 0;
            for (Iterator it = m_expressionInfo.getArgumentNames().iterator(); it.hasNext(); index++) {
                String adviceParamName = (String) it.next();
                //look for adviceParamName in the expression name and get its index
                int exprArgIndex = ArgsIndexVisitor.getExprArgIndex(m_expression, adviceParamName);
                if (exprArgIndex < 0) {
                    //param of advice not found in pc signature - f.e. "joinPoint"
                    continue;
                }
                int adviceArgIndex = m_expressionInfo.getArgumentIndex(adviceParamName);
                int targetArgIndex = context.m_exprIndexToTargetIndex.get(exprArgIndex);
                //                System.out.println(" transitive arg" + adviceArgIndex + " " + adviceParamName + " -> " + exprArgIndex
                // + " -> " + targetArgIndex);
                sourceToTargetArgIndexes.put(adviceArgIndex, targetArgIndex);
            }
            context.m_exprIndexToTargetIndex = sourceToTargetArgIndexes;

            //debug:
            //            if (m_expressionInfo.m_isAdviceBindingWithArgs) {
View Full Code Here
TOP

Related Classes of gnu.trove.TIntIntHashMap

  • cc.mallet.classify.constraints.pr.MaxEntL2FLPRConstraints
  • cc.mallet.fst.semi_supervised.constraints.TwoLabelGEConstraints
  • cc.mallet.fst.semi_supervised.pr.constraints.OneLabelL2PRConstraints
  • cc.mallet.grmm.types.FactorGraph
  • cc.mallet.topics.LDAHyper
  • cc.mallet.topics.LDAStream
  • cc.mallet.topics.RTopicModel
  • cc.mallet.types.HashedSparseVector
  • com.intellij.util.containers.IntToIntSetMap
  • com.intellij.util.io.IntToIntBtree
    • 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.