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

Class gnu.trove.iterator.TObjectDoubleIterator

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

gnu.trove.iterator.TObjectDoubleIterator.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.

  // message (neighbor_node, current_node + DELIM + curr_node_label_scores
  output.collect(new Text((String) neighIterator.key()),
           new Text("labels" + _kDelim + fields[0] + _kDelim + fields[3]));
         
  // message (neighbor_node, curr_node + DELIM + curr_node_edge_weights + DELIM curr_node_cont_prob
  assert(neighbors.containsKey((String) neighIterator.key()));
  output.collect(new Text((String) neighIterator.key()),
           new Text("edge_info" + _kDelim +
        fields[0] + _kDelim +
        neighbors.get((String) neighIterator.key()) + _kDelim +
        rwProbabilities.get(Constants._kContProb)));

View Full Code Here

  output.collect(new Text((String) neighIterator.key()),
           new Text("labels" + _kDelim + fields[0] + _kDelim + fields[3]));
         
  // message (neighbor_node, curr_node + DELIM + curr_node_edge_weights + DELIM curr_node_cont_prob
  assert(neighbors.containsKey((String) neighIterator.key()));
  output.collect(new Text((String) neighIterator.key()),
           new Text("edge_info" + _kDelim +
        fields[0] + _kDelim +
        neighbors.get((String) neighIterator.key()) + _kDelim +
        rwProbabilities.get(Constants._kContProb)));
      }

View Full Code Here

  // message (neighbor_node, curr_node + DELIM + curr_node_edge_weights + DELIM curr_node_cont_prob
  assert(neighbors.containsKey((String) neighIterator.key()));
  output.collect(new Text((String) neighIterator.key()),
           new Text("edge_info" + _kDelim +
        fields[0] + _kDelim +
        neighbors.get((String) neighIterator.key()) + _kDelim +
        rwProbabilities.get(Constants._kContProb)));
      }
    }
  }

View Full Code Here

      while (nIter.hasNext()) {
  nIter.advance();
  totalNeighWeight +=
    randWalkProbs.get(Constants._kContProb) * nIter.value();


  String neighName = (String) nIter.key();
  totalNeighWeight += neighborContProb.get(neighName) *
    incomingEdgeWeights.get(neighName);
      }
      
      // mu1 x p^{inj} +

View Full Code Here


    // copy m1 into the difference map
    TObjectDoubleIterator iter = m1.iterator();
    while (iter.hasNext()) {
      iter.advance();
      diffMap.put(iter.key(), m1Mult * iter.value());
    }


    iter = m2.iterator();
    while (iter.hasNext()) {
      iter.advance();

View Full Code Here

    }


    iter = m2.iterator();
    while (iter.hasNext()) {
      iter.advance();
      diffMap.adjustOrPutValue(iter.key(), -1 * m2Mult * iter.value(), -1
                               * m2Mult * iter.value());
    }


    double val = 0;
    iter = diffMap.iterator();

View Full Code Here

        //        } else {
        // add a small quantity to the numerator and denominator to avoid
        // infinite divergence
        divergence += iter.value()
          * Math.log((iter.value() + Constants.GetSmallConstant())
                     / (m2.get(iter.key()) + Constants.GetSmallConstant()));
        //        }
      }
    }


    return (divergence);

View Full Code Here

    ArrayList<ObjectDoublePair> lsps = new ArrayList<ObjectDoublePair>();


    TObjectDoubleIterator mi = m.iterator();
    while (mi.hasNext()) {
      mi.advance();
      lsps.add(new ObjectDoublePair(mi.key(), mi.value()));
    }


    ObjectDoublePairComparator lspComparator = new ObjectDoublePairComparator();
    Collections.sort(lsps, lspComparator);

View Full Code Here

0 1

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.