Package gnu.trove.map.hash

Examples of gnu.trove.map.hash.TIntIntHashMap


  public TByteShortByteKeyedIntHashMap() {
    map = new TIntIntHashMap(100);
  }

  public TByteShortByteKeyedIntHashMap(int capacity) {
    map = new TIntIntHashMap(capacity);
  }
View Full Code Here


      int[] countOutcomeClasses, List<DoubleVector> features,
      List<DoubleVector> outcome) {

    if (featureTypes[featureIndex].isNominal()) {
      TIntObjectHashMap<int[]> featureValueOutcomeCount = new TIntObjectHashMap<>();
      TIntIntHashMap rowSums = new TIntIntHashMap();
      int numFeatures = 0;
      Iterator<DoubleVector> featureIterator = features.iterator();
      Iterator<DoubleVector> outcomeIterator = outcome.iterator();
      while (featureIterator.hasNext()) {
        DoubleVector feature = featureIterator.next();
        DoubleVector out = outcomeIterator.next();
        int classIndex = getOutcomeClassIndex(out);
        int nominalFeatureValue = (int) feature.get(featureIndex);
        int[] is = featureValueOutcomeCount.get(nominalFeatureValue);
        if (is == null) {
          is = new int[outcomeDimension];
          featureValueOutcomeCount.put(nominalFeatureValue, is);
        }
        is[classIndex]++;
        rowSums.put(nominalFeatureValue, rowSums.get(nominalFeatureValue) + 1);
        numFeatures++;
      }
      double entropySum = 0d;
      // now we can calculate the entropy
      TIntObjectIterator<int[]> iterator = featureValueOutcomeCount.iterator();
      while (iterator.hasNext()) {
        iterator.advance();
        int[] outcomeCounts = iterator.value();
        double condEntropy = rowSums.get(iterator.key()) / (double) numFeatures
            * getEntropy(outcomeCounts);
        entropySum += condEntropy;
      }
      return new Split(featureIndex, overallEntropy - entropySum);
    } else {
View Full Code Here

    @Test
    public void trove()
    {
        final char [] CHARS = DATA;
        final TIntIntHashMap map = new TIntIntHashMap();
   
        for (int i = 0; i < CHARS.length - 1; i++)
        {
            final int bigram = CHARS[i] << 16 | CHARS[i+1];
            map.adjustOrPutValue(bigram, 1, 1);
        }
   
        guard = map.size();
    }
View Full Code Here

public class TroveMap extends MapImplementation<TIntIntHashMap>
{
    public TroveMap()
    {
        super(new TIntIntHashMap(
            IntIntOpenHashMap.DEFAULT_CAPACITY,
            IntIntOpenHashMap.DEFAULT_LOAD_FACTOR));
    }
View Full Code Here

    public int get(int k) { return instance.get(k); }

    @Override
    public int containKeys(int [] keys)
    {
        final TIntIntHashMap prepared = this.instance;
        int count = 0;
        for (int i = 0; i < keys.length; i++)
            count += prepared.containsKey(keys[i]) ? 1 : 0;
        return count;
    }
View Full Code Here

    }
   
    @Override
    public int putAll(int [] keys, int [] values)
    {
        final TIntIntHashMap instance = this.instance;
        int count = 0;
        for (int i = 0; i < keys.length; i++)
        {
            count += instance.put(keys[i], values[i]);
        }
        return count;
    }   
View Full Code Here

  /**
   * Method makeLevelsTable.
   */
  private void makeLevelsTable()
  {
    _maxLevelsTable = new TIntIntHashMap();
    _baseLevelsTable = new TIntIntHashMap();
    for (Skill s : _skills.values())
    {
      int skillId = s.getId();
      int level = s.getLevel();
      int maxLevel = _maxLevelsTable.get(skillId);
View Full Code Here

    npc.getNpcId();
    st.getCond();
    Player player = st.getPlayer();
    if ((npc.getNpcId() == CON2) && (st.getCond() == 1))
    {
      TIntIntHashMap moblist = new TIntIntHashMap();
      moblist.put(CON2, 1);
      if (player.getParty() != null)
      {
        for (Player partyMember : player.getParty().getPartyMembers())
        {
          QuestState pst = partyMember.getQuestState("_472_ChallengeSteamCorridor");
View Full Code Here

    npc.getNpcId();
    int cond = st.getCond();
    Player player = st.getPlayer();
    if ((npc.getNpcId() == CON2) && (cond == 1))
    {
      TIntIntHashMap moblist = new TIntIntHashMap();
      moblist.put(CON2, 1);
      if (player.getParty() != null)
      {
        for (Player partyMember : player.getParty().getPartyMembers())
        {
          QuestState pst = partyMember.getQuestState("_473_InTheCoralGarden");
View Full Code Here

    npc.getNpcId();
    int cond = st.getCond();
    Player player = st.getPlayer();
    if (cond == 1)
    {
      TIntIntHashMap moblist = new TIntIntHashMap();
      moblist.put(CON3, 1);
      if (player.getParty() != null)
      {
        for (Player partyMember : player.getParty().getPartyMembers())
        {
          QuestState pst = partyMember.getQuestState("_471_BreakingThroughTheEmeraldSquare");
View Full Code Here

TOP

Related Classes of gnu.trove.map.hash.TIntIntHashMap

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.