public interface Int2IntFrequencyDistribution extends SortableEntries<PairOfInts>, org.apache.hadoop.io.Writable
SortableEntries.Order| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all events.
|
double |
computeLogRelativeFrequency(int key)
Computes the log (base e) of the relative frequency of a particular event
key. |
double |
computeRelativeFrequency(int key)
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,
int cnt)
Decrements the count of a particular event
key by cnt. |
int |
get(int key)
Returns the count of a particular event
key. |
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,
int cnt)
Increments the count of an event
key by cnt. |
int |
remove(int key)
Removes the count of a particular event
key. |
int |
set(int key,
int cnt)
Sets the count of a particular event
key to cnt. |
getEntries, getEntriesvoid increment(int key)
key.void increment(int key,
int cnt)
key by cnt.void decrement(int key)
key.void decrement(int key,
int cnt)
key by cnt.boolean contains(int key)
true if key exists in this object.int get(int key)
key.double computeRelativeFrequency(int key)
key. That is,
f(key) / SUM_i f(key_i).double computeLogRelativeFrequency(int key)
key.int set(int key,
int cnt)
key to cnt.int remove(int key)
key.void clear()
int getNumberOfEvents()
long getSumOfCounts()
SUM_i f(key_i).Copyright © 2014. All rights reserved.