Package gnu.trove

Examples of gnu.trove.TIntIntHashMap

102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
        // 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;
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
127
128
129
130
131
132
133
    analyzer = new WikipediaAnalyzer();
   
    ids = new int[maxConceptId];
    values = new double[maxConceptId];
   
    inlinkMap = new TIntIntHashMap(300);
  }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
    assert i > 0 && i % 2 == 0;
    maxLeafNodesInHash = (short) i;

    if (hasCachedMappings) {
      myCachedMappings = new TIntIntHashMap(myCachedMappingsSize = 4 * maxLeafNodes);
    } else {
      myCachedMappings = null;
      myCachedMappingsSize = -1;
    }
  }
View Full Code Here
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
        //}

        if (defaultSplit) {
          hashLeafData.clean();

          final TIntIntHashMap map = hashLeafData.values;

          final int avg = keys.length / 2;
          medianKey = keys[avg];
          --btree.hashedPagesCount;
          setChildrenCount((short)0);
          newIndexNode.setChildrenCount((short)0);

          for(int i = 0; i < avg; ++i) {
            int key = keys[i];
            insert(key, map.get(key));
            key = keys[avg + i];
            newIndexNode.insert(key, map.get(key));
          }

          /*setHashedLeaf(false);
                  setChildrenCount((short)keys.length);

View Full Code Here
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
            parent.dump("parent before");
          }
         
          final int childrenCount = getChildrenCount();
          final int[] keys = hashLeafData.keys;
          final TIntIntHashMap map = hashLeafData.values;
         
          for(int i = 0; i < numberOfKeysToMove; ++i) {
            final int key = keys[i];
            sibling.insert(key, map.get(key));
          }
         
          if (doSanityCheck) {
            sibling.dump("Left sibling after");
          }
 
          parent.setKeyAt(indexInParent, keys[numberOfKeysToMove]);
         
          setChildrenCount((short)0);
          --btree.hashedPagesCount;
          hashLeafData.clean();
         
          for(int i = numberOfKeysToMove; i < childrenCount; ++i) {
            final int key = keys[i];
            insert(key, map.get(key));
          }
        } else if (indexInParent + 1 < parent.getChildrenCount()) {
          insertToRightSiblingWhenHashed(parent, hashLeafData, indexInParent, sibling);
        }
      } else if (indexInParent == -1) {
View Full Code Here
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
          sibling.dump("Offloading to right sibling");
          parent.dump("parent before");
        }

        final int[] keys = hashLeafData.keys;
        final TIntIntHashMap map = hashLeafData.values;

        final int childrenCount = getChildrenCount();
        final int lastChildIndex = childrenCount - numberOfKeysToMove;
        for(int i = lastChildIndex; i < childrenCount; ++i) {
          final int key = keys[i];
          sibling.insert(key, map.get(key));
        }
       
        if (doSanityCheck) {
          sibling.dump("Right sibling after");
        }
        parent.setKeyAt(indexInParent, keys[lastChildIndex]);

        setChildrenCount((short)0);
        --btree.hashedPagesCount;
        hashLeafData.clean();

        for(int i = 0; i < lastChildIndex; ++i) {
          final int key = keys[i];
          insert(key, map.get(key));
        }
      }
    }
View Full Code Here
486
487
488
489
490
491
492
493
494
495
496
        final int offset = nodeView.myAddressInBuffer + nodeView.indexToOffset(0);
        final ByteBuffer buffer = nodeView.myBuffer;
       
        keys = new int[recordCount];
        values = new TIntIntHashMap(recordCount);
        int keyNumber = 0;
       
        for(int i = 0; i < btree.hashPageCapacity; ++i) {
          if (nodeView.hashGetState(i) == HASH_FULL) {
            int key = buffer.getInt(offset + i * INTERIOR_SIZE + KEY_OFFSET);
View Full Code Here
28
29
30
31
32
33
34
35
  private final TIntIntHashMap mySingle;
  private final TIntObjectHashMap<TIntHashSet> myMulti;


  public IntToIntSetMap(int initialCapacity, float loadfactor) {
    mySingle = new TIntIntHashMap(initialCapacity, loadfactor);
    myMulti = new TIntObjectHashMap<TIntHashSet>(initialCapacity, loadfactor);
  }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
    for (int i = 0; i < n; i++) { factorsByVar[i] = new ArrayList (); }
    vertexPots = new List [n];
    my2global = new int [n];

    if (projectionMap == null) {
      projectionMap = new TIntIntHashMap (n);
      // projectionMap.setDefaultValue (-1);
    } else {
      projectionMap.ensureCapacity (n);
    }
   
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.