public class Int2LongFrequencyDistributionEntry extends Object implements Int2LongFrequencyDistribution
Int2LongFrequencyDistribution based on HMapIL.SortableEntries.Order| Constructor and Description |
|---|
Int2LongFrequencyDistributionEntry() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all events.
|
double |
computeLogRelativeFrequency(int k)
Computes the log (base e) of the relative frequency of a particular event
key. |
double |
computeRelativeFrequency(int k)
Computes the relative frequency of a particular event
key. |
boolean |
contains(int key)
Returns
true if key exists in this object. |
void |
decrement(int key)
Decrements the count of an event
key. |
void |
decrement(int key,
long cnt)
Decrements the count of a particular event
key by cnt. |
long |
get(int key)
Returns the count of a particular event
key. |
List<PairOfIntLong> |
getEntries(SortableEntries.Order ordering) |
List<PairOfIntLong> |
getEntries(SortableEntries.Order ordering,
int n) |
int |
getNumberOfEvents()
Returns number of distinct events observed.
|
long |
getSumOfCounts()
Returns the sum of counts of all observed events.
|
void |
increment(int key)
Increments the count of an event
key. |
void |
increment(int key,
long cnt)
Increments the count of an event
key by cnt. |
Iterator<PairOfIntLong> |
iterator()
Iterator returns the same object every time, just with a different payload.
|
void |
readFields(DataInput in) |
long |
remove(int k)
Removes the count of a particular event
key. |
long |
set(int k,
long v)
Sets the count of a particular event
key to cnt. |
void |
write(DataOutput out) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitforEach, spliteratorpublic void increment(int key)
Int2LongFrequencyDistributionkey.increment in interface Int2LongFrequencyDistributionpublic void increment(int key,
long cnt)
Int2LongFrequencyDistributionkey by cnt.increment in interface Int2LongFrequencyDistributionpublic void decrement(int key)
Int2LongFrequencyDistributionkey.decrement in interface Int2LongFrequencyDistributionpublic void decrement(int key,
long cnt)
Int2LongFrequencyDistributionkey by cnt.decrement in interface Int2LongFrequencyDistributionpublic boolean contains(int key)
Int2LongFrequencyDistributiontrue if key exists in this object.contains in interface Int2LongFrequencyDistributionpublic long get(int key)
Int2LongFrequencyDistributionkey.get in interface Int2LongFrequencyDistributionpublic double computeRelativeFrequency(int k)
Int2LongFrequencyDistributionkey. That is,
f(key) / SUM_i f(key_i).computeRelativeFrequency in interface Int2LongFrequencyDistributionpublic double computeLogRelativeFrequency(int k)
Int2LongFrequencyDistributionkey.computeLogRelativeFrequency in interface Int2LongFrequencyDistributionpublic long set(int k,
long v)
Int2LongFrequencyDistributionkey to cnt.set in interface Int2LongFrequencyDistributionpublic long remove(int k)
Int2LongFrequencyDistributionkey.remove in interface Int2LongFrequencyDistributionpublic void clear()
Int2LongFrequencyDistributionclear in interface Int2LongFrequencyDistributionpublic int getNumberOfEvents()
Int2LongFrequencyDistributiongetNumberOfEvents in interface Int2LongFrequencyDistributionpublic long getSumOfCounts()
Int2LongFrequencyDistributionSUM_i f(key_i).getSumOfCounts in interface Int2LongFrequencyDistributionpublic Iterator<PairOfIntLong> iterator()
iterator in interface Iterable<PairOfIntLong>public List<PairOfIntLong> getEntries(SortableEntries.Order ordering)
getEntries in interface SortableEntries<PairOfIntLong>public List<PairOfIntLong> getEntries(SortableEntries.Order ordering, int n)
getEntries in interface SortableEntries<PairOfIntLong>public void readFields(DataInput in) throws IOException
readFields in interface org.apache.hadoop.io.WritableIOExceptionpublic void write(DataOutput out) throws IOException
write in interface org.apache.hadoop.io.WritableIOExceptionCopyright © 2018. All rights reserved.