Examples of gnu.trove.iterator.TIntFloatIterator.key()

Class gnu.trove.iterator.TIntFloatIterator

Examples of gnu.trove.iterator.TIntFloatIterator.key()

gnu.trove.iterator.TIntFloatIterator.key()
Provides access to the key of the mapping at the iterator's position. Note that you must advance() the iterator at least once before invoking this method. @return the key of the entry at the iterator's current position.

        it2.advance();
      }
      if(it1.key()<it2.key()){
        dist += it1.value()*it1.value();
        increa = 1;
      }else if(it1.key()>it2.key()){
        dist += it2.value()*it2.value();
        increa = 2;
      }else{
        float t = it1.value() - it2.value();
        dist += t*t;

View Full Code Here

  public String toString(){
    StringBuilder sb = new StringBuilder();
    TIntFloatIterator it = data.iterator();
    while(it.hasNext()){
      it.advance();
      sb.append(it.key());
      sb.append(":");
      sb.append(it.value());
      if(it.hasNext())
        sb.append(", ");
    }

View Full Code Here

      data=fs.select(data);
    TIntFloatIterator it = data.data.iterator();
    float feaSize=tf.getFeatureSize();
    while (it.hasNext()) {
      it.advance();
      if(it.key()==0)
        continue;
      int feature=it.key();
      for(int type=0;type<typeSize;type++){
        float itemF=tf.getItemFrequency(feature, type);
        float typeF=tf.getTypeFrequency(type);

View Full Code Here

    float feaSize=tf.getFeatureSize();
    while (it.hasNext()) {
      it.advance();
      if(it.key()==0)
        continue;
      int feature=it.key();
      for(int type=0;type<typeSize;type++){
        float itemF=tf.getItemFrequency(feature, type);
        float typeF=tf.getTypeFrequency(type);
        score[type]+=it.value()*Math.log((itemF+0.1)/(typeF+feaSize));
      }

View Full Code Here

        float dist = baseDistance / (count * count);
        TIntFloatHashMap data = center.data;
        TIntFloatIterator it = sv.data.iterator();
        while (it.hasNext()) {
            it.advance();
            int key = it.key();
            if (!data.containsKey(key)) {
                dist += it.value() * it.value();
            }
            else {
                float temp = data.get(key) / count;

View Full Code Here

        if (it1.hasNext() && it2.hasNext()) {
            it1.advance();
            it2.advance();
        }
        while (it1.hasNext() && it2.hasNext()) {
            if(it1.key()<it2.key()){
                dist += it1.value()*it1.value();
                it1.advance();
            }else if(it1.key()>it2.key()){
                dist += it2.value()*it2.value();
                it2.advance();

View Full Code Here

        }
        while (it1.hasNext() && it2.hasNext()) {
            if(it1.key()<it2.key()){
                dist += it1.value()*it1.value();
                it1.advance();
            }else if(it1.key()>it2.key()){
                dist += it2.value()*it2.value();
                it2.advance();
            }else{
                float t = it1.value() - it2.value();
                dist += t*t;

View Full Code Here

        float base = baseDistList.get(classid);
        TIntFloatHashMap center = classCenter.get(classid).data;
        TIntFloatIterator it =  vector.data.iterator();
        while (it.hasNext()) {
            it.advance();
            if (!center.containsKey(it.key())) {
                base += it.value() * it.value();
            }
            else {
                float temp = center.get(it.key());
                base -= temp * temp;

View Full Code Here

            it.advance();
            if (!center.containsKey(it.key())) {
                base += it.value() * it.value();
            }
            else {
                float temp = center.get(it.key());
                base -= temp * temp;
                base += (it.value() - temp) * (it.value() - temp);
            }
        }
        baseDistList.set(classid, base);

View Full Code Here

        while(itt.hasNext()){
          itt.advance();
          float v = itt.value();
          if(Math.abs(v)<1e-3f)
            continue;
          String fea = index.get(itt.key());
          int newidx = newfeat.lookupIndex(fea);
          ww.put(newidx, v);        
      }
      weights[i] = ww;  
    }

View Full Code Here

0 1 2 3

TOP

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.