Examples of org.apache.commons.lang.mutable.MutableLong

org.apache.commons.lang.mutable.MutableLong
A mutable long wrapper. @see Long @since 2.1 @version $Id: MutableLong.java 161243 2005-04-14 04:30:28Z ggregory $

    Pair<V,MutableLong> data = dataMap.get(key);
    if (data == null) {
      return null;
    } else {
      V value = data.getFirst();
      MutableLong count = data.getSecond();
      long oldCount = count.longValue();
      count.increment();
      incrementHit(key, oldCount);
      return value;
    }
    
  }

View Full Code Here

      return;
    }
    if (capacity == dataMap.size()) { // Cache Full
      removeLeastFrequent();
    }
    MutableLong count = new MutableLong(1L);
    Pair<V,MutableLong> data = new Pair<V,MutableLong>(value, count);
    dataMap.put(key, data);
    
    Long countKey = 1L;
    Set<K> keys = evictionMap.get(countKey);

View Full Code Here

      Pair<List<Integer>,Long> p = it.next();
      //items += p.getFirst().size();
      //count++;
      for (Integer i : p.getFirst()) {
        if (!frequencyList.containsKey(i)) {
          frequencyList.put(i, new MutableLong(0));
        }
        frequencyList.get(i).add(p.getSecond());
      }
    }
    return frequencyList;

View Full Code Here


      int count = 0;
      for (Set<ByteSequence> cfset : groups.values()) {
        HashMap<ByteSequence,MutableLong> map = new HashMap<ByteSequence,MutableLong>();
        for (ByteSequence bs : cfset)
          map.put(bs, new MutableLong(1));
        this.groupFams[count++] = map;
        nonDefaultColumnFamilies.addAll(cfset);
      }
      
      partitioner = new LocalityGroupUtil.Partitioner(this.groupFams);

View Full Code Here

    TabletClientService.Iface client = null;
    
    TInfo tinfo = Tracer.traceInfo();
    
    Map<Long,CMK> cmidToCm = new HashMap<Long,CMK>();
    MutableLong cmid = new MutableLong(0);
    
    SessionID sessionId = null;
    
    try {        
      Map<TKeyExtent,List<TConditionalMutation>> tmutations = new HashMap<TKeyExtent,List<TConditionalMutation>>();

View Full Code Here

      //items += p.getFirst().size();
      //count++;
      IntArrayList items= p.getFirst();
      for (int idx = 0; idx < items.size(); idx++) {
        if (!frequencyList.containsKey(items.get(idx))) {
          frequencyList.put(items.get(idx), new MutableLong(0));
        }
        frequencyList.get(items.get(idx)).add(p.getSecond());
      }
    }
    return frequencyList;

View Full Code Here

      Pair<List<A>,Long> transaction = transactions.next();
      for (A attribute : transaction.getFirst()) {
        if (attributeSupport.containsKey(attribute)) {
          attributeSupport.get(attribute).add(transaction.getSecond().longValue());
        } else {
          attributeSupport.put(attribute, new MutableLong(transaction.getSecond()));
        }
      }
    }
    List<Pair<A,Long>> fList = Lists.newArrayList();
    for (Entry<A,MutableLong> e : attributeSupport.entrySet()) {

View Full Code Here


    Map<Integer,FrequentPatternMaxHeap> patterns = Maps.newHashMap();
    for (int attribute : tree.attrIterableRev()) {
      if (requiredFeatures.contains(attribute)) {
        log.info("Mining FTree Tree for all patterns with {}", attribute);
        MutableLong minSupport = new MutableLong(minSupportValue);
        FrequentPatternMaxHeap frequentPatterns = growth(tree, minSupport, k,
                                                         attribute, updater);
        patterns.put(attribute, frequentPatterns);
        outputCollector.collect(attribute, frequentPatterns);


        minSupportValue = Math.max(minSupportValue, minSupport.longValue() / 2);
        log.info("Found {} Patterns with Least Support {}", patterns.get(
            attribute).count(), patterns.get(attribute).leastSupport());
      }
    }
    return patterns;

View Full Code Here

    Map<Integer,FrequentPatternMaxHeap> patterns = Maps.newHashMap();
    requiredFeatures.sort();
    for (int attribute : tree.attrIterableRev()) {
      if (requiredFeatures.binarySearch(attribute) >= 0) {
        log.info("Mining FTree Tree for all patterns with {}", attribute);
        MutableLong minSupport = new MutableLong(minSupportValue);
        FrequentPatternMaxHeap frequentPatterns = growth(tree, minSupport, k,
                                                         attribute, updater);
        patterns.put(attribute, frequentPatterns);
        outputCollector.collect(attribute, frequentPatterns);


        minSupportValue = Math.max(minSupportValue, minSupport.longValue() / 2);
        log.info("Found {} Patterns with Least Support {}", patterns.get(
            attribute).count(), patterns.get(attribute).leastSupport());
      }
    }
    return patterns;

View Full Code Here

    public void addValue(T val) {
        addValue(val, 1L);
    }


    private void updateValueCount(T actualValue, long sampleCount) {
        MutableLong count = valuesMap.get(actualValue);
        if (count != null) {
            count.add(sampleCount);
        } else {
            // insert new value
            valuesMap.put(actualValue, new MutableLong(sampleCount));
        }
    }

View Full Code Here

0 1 2 3 4

TOP

Related Classes of org.apache.commons.lang.mutable.MutableLong

com.ebay.erl.mobius.core.mapred.CounterUpdateThread

org.apache.accumulo.core.client.impl.ConditionalWriterImpl

org.apache.accumulo.core.file.rfile.RFile$LocalityGroupMetadata

org.apache.accumulo.core.util.PartitionerTest

org.apache.accumulo.tserver.InMemoryMap$LocalityGroupMap

org.apache.jorphan.math.StatCalculator

org.apache.mahout.common.cache.LFUCache

org.apache.mahout.common.DummyReporter

org.apache.mahout.fpm.pfpgrowth.fpgrowth.FPGrowth

org.apache.mahout.fpm.pfpgrowth.fpgrowth2.FPGrowthIds

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.