Table

java.lang.Object
- com.fr.third.jgroups.util.Table<T>

```
public class Table<T>
extends java.lang.Object
```
A store for elements (typically messages) to be retransmitted or delivered. Used on sender and receiver side, as a replacement for HashMap. Table should use less memory than HashMap, as HashMap.Entry has 4 fields, plus arrays for storage.
Table maintains a matrix (an array of arrays) of elements, which are stored in the matrix by mapping their seqno to an index. E.g. when we have 10 rows of 1000 elements each, and first_seqno is 3000, then an element with seqno=5600, will be stored in the 3rd row, at index 600.
Rows are removed when all elements in that row have been received.
Table started out as a copy of RetransmitTable, but is synchronized and maintains its own low, hd and hr pointers, so it can be used as a replacement for NakReceiverWindow. The idea is to put messages into Table, deliver them in order of seqnos, and periodically scan over all tables in NAKACK2 to do retransmission.

版本:

3.1

作者:

Bela Ban

嵌套类概要

嵌套类
限定符和类型	类和说明
`protected class`	`Table.Counter`
`protected class`	`Table.Dump`
`protected class`	`Table.Getter`
`protected class`	`Table.HighestDeliverable`
`protected class`	`Table.Missing`
`protected class`	`Table.Remover`
`protected class`	`Table.RemoverOnAdd`
`static interface`	`Table.Visitor<T>`

字段概要

字段
限定符和类型	字段和说明
`protected static long`	`DEFAULT_MAX_COMPACTION_TIME`
`protected static double`	`DEFAULT_RESIZE_FACTOR`
`protected int`	`elements_per_row` Must be a power of 2 for efficient modular arithmetic
`protected long`	`hd` The highest delivered (= removed) seqno
`protected long`	`hr` The highest received seqno
`protected long`	`last_compaction_timestamp` The time when the last compaction took place.
`protected java.util.concurrent.locks.Lock`	`lock`
`protected long`	`low` The highest seqno purged
`protected T[][]`	`matrix`
`protected long`	`max_compaction_time` Time (in nanoseconds) after which a compaction should take place. 0 disables compaction
`protected int`	`num_compactions`
`protected int`	`num_moves`
`protected int`	`num_purges`
`protected int`	`num_resizes`
`protected int`	`num_rows`
`protected long`	`offset` The first seqno, at matrix[0][0]
`protected java.util.concurrent.atomic.AtomicBoolean`	`processing`
`protected double`	`resize_factor`
`protected int`	`size`

构造器概要

构造器
构造器和说明
`Table()`
`Table(int num_rows, int elements_per_row, long offset)`
`Table(int num_rows, int elements_per_row, long offset, double resize_factor)`
`Table(int num_rows, int elements_per_row, long offset, double resize_factor, long max_compaction_time)` Creates a new table
`Table(long offset)`

方法概要

方法
限定符和类型	方法和说明
`protected boolean`	`_add(long seqno, T element, boolean check_if_resize_needed, Filter<T> remove_filter)`
`protected void`	`_compact()` Moves the contents of matrix down by the number of purged rows and resizes the matrix accordingly.
`T`	`_get(long seqno)` To be used only for testing; doesn't do any index or sanity checks
`boolean`	`add(java.util.List<Tuple<java.lang.Long,T>> list)` Adds elements from list to the table
`boolean`	`add(java.util.List<Tuple<java.lang.Long,T>> list, boolean remove_added_elements)` Adds elements from list to the table, removes elements from list that were not added to the table
`boolean`	`add(java.util.List<Tuple<java.lang.Long,T>> list, boolean remove_added_elements, T const_value)` Adds elements from the list to the table
`boolean`	`add(long seqno, T element)` Adds an element if the element at the given index is null.
`boolean`	`add(long seqno, T element, Filter<T> remove_filter)` Adds an element if the element at the given index is null.
`int`	`capacity()` Returns the total capacity in the matrix
`void`	`compact()`
`protected int`	`computeIndex(long seqno)` Computes and returns the index within a row for seqno
`protected int`	`computeRow(long seqno)` Computes and returns the row index for seqno.
`int`	`computeSize()` Iterate from low to hr and add up non-null values.
`java.lang.String`	`dump()` Dumps the seqnos in the table as a list
`protected long`	`findHighestSeqno(java.util.List<Tuple<java.lang.Long,T>> list)`
`void`	`forEach(long from, long to, Table.Visitor<T> visitor)` Iterates over the matrix with range [from .. to] (including from and to), and calls `Table.Visitor.visit(long, Object, int, int)`.
`T`	`get(long seqno)` Returns an element at seqno
`java.util.List<T>`	`get(long from, long to)`
`long[]`	`getDigest()`
`int`	`getElementsPerRow()`
`long`	`getHighestDeliverable()` Returns the highest deliverable (= removable) seqno.
`long`	`getHighestDelivered()`
`long`	`getHighestReceived()`
`long`	`getLow()`
`long`	`getMaxCompactionTime()`
`SeqnoList`	`getMissing()` Returns a list of missing (= null) elements
`int`	`getNumCompactions()`
`int`	`getNumMissing()` Returns the number of null elements in the range [hd+1 .. hr-1] excluding hd and hr
`int`	`getNumMoves()`
`int`	`getNumPurges()`
`int`	`getNumResizes()`
`int`	`getNumRows()`
`long`	`getOffset()`
`java.util.concurrent.atomic.AtomicBoolean`	`getProcessing()`
`protected T[]`	`getRow(int index)` Returns a row.
`boolean`	`isEmpty()`
`protected void`	`move(int num_rows)` Moves contents of matrix num_rows down.
`void`	`purge(long seqno)` Removes all elements less than or equal to seqno from the table.
`void`	`purge(long seqno, boolean force)` Removes all elements less than or equal to seqno from the table.
`T`	`remove()`
`T`	`remove(boolean nullify)` Removes the next non-null element and nulls the index if nullify=true
`java.util.List<T>`	`removeMany(java.util.concurrent.atomic.AtomicBoolean processing, boolean nullify, int max_results)`
`java.util.List<T>`	`removeMany(java.util.concurrent.atomic.AtomicBoolean processing, boolean nullify, int max_results, Filter<T> filter)` Removes between 0 and max_results elements from the table and returns them in a list.
`java.util.List<T>`	`removeMany(boolean nullify, int max_results)`
`void`	`resetStats()`
`protected void`	`resize(long seqno)` Moves rows down the matrix, by removing purged rows.
`void`	`setHighestDelivered(long seqno)` Only used internally by JGroups on a state transfer.
`void`	`setMaxCompactionTime(long max_compaction_time)`
`int`	`size()` Returns the numbers of elements in the table
`java.lang.String`	`toString()`

从类继承的方法 java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

- 字段详细资料
  - num_rows
```
protected final int num_rows
```
  - elements_per_row
```
protected final int elements_per_row
```
    Must be a power of 2 for efficient modular arithmetic
  - resize_factor
```
protected final double resize_factor
```
  - matrix
```
protected T[][] matrix
```
  - offset
```
protected long offset
```
    The first seqno, at matrix[0][0]
  - size
```
protected int size
```
  - low
```
protected long low
```
    The highest seqno purged
  - hr
```
protected long hr
```
    The highest received seqno
  - hd
```
protected long hd
```
    The highest delivered (= removed) seqno
  - max_compaction_time
```
protected long max_compaction_time
```
    Time (in nanoseconds) after which a compaction should take place. 0 disables compaction
  - last_compaction_timestamp
```
protected long last_compaction_timestamp
```
    The time when the last compaction took place. If a compact() takes place and sees that the last compaction is more than max_compaction_time nanoseconds ago, a compaction will take place
  - lock
```
protected final java.util.concurrent.locks.Lock lock
```
  - processing
```
protected final java.util.concurrent.atomic.AtomicBoolean processing
```
  - num_compactions
```
protected int num_compactions
```
  - num_resizes
```
protected int num_resizes
```
  - num_moves
```
protected int num_moves
```
  - num_purges
```
protected int num_purges
```
  - DEFAULT_MAX_COMPACTION_TIME
```
protected static final long DEFAULT_MAX_COMPACTION_TIME
```
    另请参阅:
    常量字段值
  - DEFAULT_RESIZE_FACTOR
```
protected static final double DEFAULT_RESIZE_FACTOR
```
    另请参阅:
    常量字段值
- 构造器详细资料
  - Table
```
public Table()
```
  - Table
```
public Table(long offset)
```
  - Table
```
public Table(int num_rows,
     int elements_per_row,
     long offset)
```
  - Table
```
public Table(int num_rows,
     int elements_per_row,
     long offset,
     double resize_factor)
```
  - Table
```
public Table(int num_rows,
     int elements_per_row,
     long offset,
     double resize_factor,
     long max_compaction_time)
```
    Creates a new table
    
    参数:
    num_rows - the number of rows in the matrix
    elements_per_row - the number of elements per row
    offset - the seqno before the first seqno to be inserted. E.g. if 0 then the first seqno will be 1
    resize_factor - teh factor with which to increase the number of rows
    max_compaction_time - the max time in milliseconds after we attempt a compaction
- 方法详细资料
  - getProcessing
```
public java.util.concurrent.atomic.AtomicBoolean getProcessing()
```
  - getOffset
```
public long getOffset()
```
  - getElementsPerRow
```
public int getElementsPerRow()
```
  - capacity
```
public int capacity()
```
    Returns the total capacity in the matrix
  - getNumCompactions
```
public int getNumCompactions()
```
  - getNumMoves
```
public int getNumMoves()
```
  - getNumResizes
```
public int getNumResizes()
```
  - getNumPurges
```
public int getNumPurges()
```
  - size
```
public int size()
```
    Returns the numbers of elements in the table
  - isEmpty
```
public boolean isEmpty()
```
  - getLow
```
public long getLow()
```
  - getHighestDelivered
```
public long getHighestDelivered()
```
  - getHighestReceived
```
public long getHighestReceived()
```
  - getMaxCompactionTime
```
public long getMaxCompactionTime()
```
  - setMaxCompactionTime
```
public void setMaxCompactionTime(long max_compaction_time)
```
  - getNumRows
```
public int getNumRows()
```
  - resetStats
```
public void resetStats()
```
  - getHighestDeliverable
```
public long getHighestDeliverable()
```
    Returns the highest deliverable (= removable) seqno. This may be higher than getHighestDelivered(), e.g. if elements have been added but not yet removed
  - setHighestDelivered
```
public void setHighestDelivered(long seqno)
```
    Only used internally by JGroups on a state transfer. Please don't use this in application code, or you're on your own !
    
    参数:
    seqno -
  - add
```
public boolean add(long seqno,
          T element)
```
    Adds an element if the element at the given index is null. Returns true if no element existed at the given index, else returns false and doesn't set the element.
    
    参数:
    seqno -
    element -
    
    返回:
    True if the element at the computed index was null, else false
  - add
```
public boolean add(long seqno,
          T element,
          Filter<T> remove_filter)
```
    Adds an element if the element at the given index is null. Returns true if no element existed at the given index, else returns false and doesn't set the element.
    
    参数:
    seqno -
    element -
    remove_filter - If not null, a filter used to remove all consecutive messages passing the filter
    
    返回:
    True if the element at the computed index was null, else false
  - add
```
public boolean add(java.util.List<Tuple<java.lang.Long,T>> list)
```
    Adds elements from list to the table
    
    参数:
    list -
    
    返回:
    True if at least 1 element was added successfully
  - add
```
public boolean add(java.util.List<Tuple<java.lang.Long,T>> list,
          boolean remove_added_elements)
```
    Adds elements from list to the table, removes elements from list that were not added to the table
    
    参数:
    list -
    
    返回:
    True if at least 1 element was added successfully. This guarantees that the list has at least 1 element
  - add
```
public boolean add(java.util.List<Tuple<java.lang.Long,T>> list,
          boolean remove_added_elements,
          T const_value)
```
    Adds elements from the list to the table
    
    参数:
    list - The list of tuples of seqnos and elements. If remove_added_elements is true, if elements could not be added to the table (e.g. because they were already present or the seqno was < HD), those elements will be removed from list
    remove_added_elements - If true, elements that could not be added to the table are removed from list
    const_value - If non-null, this value should be used rather than the values of the list tuples
    
    返回:
    True if at least 1 element was added successfully, false otherwise.
  - get
```
public T get(long seqno)
```
    Returns an element at seqno
    
    参数:
    seqno -
    
    返回:
  - _get
```
public T _get(long seqno)
```
    To be used only for testing; doesn't do any index or sanity checks
    
    参数:
    seqno -
    
    返回:
  - get
```
public java.util.List<T> get(long from,
                    long to)
```
  - remove
```
public T remove()
```
  - remove
```
public T remove(boolean nullify)
```
    Removes the next non-null element and nulls the index if nullify=true
  - removeMany
```
public java.util.List<T> removeMany(boolean nullify,
                           int max_results)
```
  - removeMany
```
public java.util.List<T> removeMany(java.util.concurrent.atomic.AtomicBoolean processing,
                           boolean nullify,
                           int max_results)
```
  - removeMany
```
public java.util.List<T> removeMany(java.util.concurrent.atomic.AtomicBoolean processing,
                           boolean nullify,
                           int max_results,
                           Filter<T> filter)
```
    Removes between 0 and max_results elements from the table and returns them in a list. If filter is non-null, only elements which the filter accepts are returned. Note that elements are always removed from the table, but may or may not get added to the returned list.
    
    返回:
    A list of element. A null list means no more elements are in the table and processing (if set) will be set to false
  - purge
```
public void purge(long seqno)
```
    Removes all elements less than or equal to seqno from the table. Does this by nulling entire rows in the matrix and nulling all elements < index(seqno) of the first row that cannot be removed
    
    参数:
    seqno -
  - purge
```
public void purge(long seqno,
         boolean force)
```
    Removes all elements less than or equal to seqno from the table. Does this by nulling entire rows in the matrix and nulling all elements < index(seqno) of the first row that cannot be removed.
    
    参数:
    seqno - All elements <= seqno will be nulled
    force - If true, we only ensure that seqno <= hr, but don't care about hd, and set hd=low=seqno.
  - compact
```
public void compact()
```
  - forEach
```
public void forEach(long from,
           long to,
           Table.Visitor<T> visitor)
```
    Iterates over the matrix with range [from .. to] (including from and to), and calls Table.Visitor.visit(long, Object, int, int). If the visit() method returns false, the iteration is terminated.
    This method must be called with the lock held
    
    参数:
    from - The starting seqno
    to - The ending seqno, the range is [from .. to] including from and to
    visitor - An instance of Visitor
  - _add
```
protected boolean _add(long seqno,
           T element,
           boolean check_if_resize_needed,
           Filter<T> remove_filter)
```
  - findHighestSeqno
```
protected long findHighestSeqno(java.util.List<Tuple<java.lang.Long,T>> list)
```
  - resize
```
protected void resize(long seqno)
```
    Moves rows down the matrix, by removing purged rows. If resizing to accommodate seqno is still needed, computes a new size. Then either moves existing rows down, or copies them into a new array (if resizing took place). The lock must be held by the caller of resize().
  - move
```
protected void move(int num_rows)
```
    Moves contents of matrix num_rows down. Avoids a System.arraycopy(). Caller must hold the lock.
  - _compact
```
protected void _compact()
```
    Moves the contents of matrix down by the number of purged rows and resizes the matrix accordingly. The capacity of the matrix should be size * resize_factor. Caller must hold the lock.
  - computeSize
```
public int computeSize()
```
    Iterate from low to hr and add up non-null values. Caller must hold the lock.
  - getNumMissing
```
public int getNumMissing()
```
    Returns the number of null elements in the range [hd+1 .. hr-1] excluding hd and hr
  - getMissing
```
public SeqnoList getMissing()
```
    Returns a list of missing (= null) elements
    
    返回:
  - getDigest
```
public long[] getDigest()
```
  - toString
```
public java.lang.String toString()
```
    覆盖:
    
    toString 在类中 java.lang.Object
  - dump
```
public java.lang.String dump()
```
    Dumps the seqnos in the table as a list
  - getRow
```
protected T[] getRow(int index)
```
    Returns a row. Creates a new row and inserts it at index if the row at index doesn't exist
    
    参数:
    index -
    
    返回:
    A row
  - computeRow
```
protected int computeRow(long seqno)
```
    Computes and returns the row index for seqno. The caller must hold the lock.
  - computeIndex
```
protected int computeIndex(long seqno)
```
    Computes and returns the index within a row for seqno

类 Table<T>

嵌套类概要

字段概要

构造器概要

方法概要

从类继承的方法 java.lang.Object

字段详细资料

num_rows

elements_per_row

resize_factor

matrix

offset

size

low

hr

hd

max_compaction_time

last_compaction_timestamp

lock

processing

num_compactions

num_resizes

num_moves

num_purges

DEFAULT_MAX_COMPACTION_TIME

DEFAULT_RESIZE_FACTOR

构造器详细资料

Table

Table

Table

Table

Table

方法详细资料

getProcessing

getOffset

getElementsPerRow

capacity

getNumCompactions

getNumMoves

getNumResizes

getNumPurges

size

isEmpty

getLow

getHighestDelivered

getHighestReceived

getMaxCompactionTime

setMaxCompactionTime

getNumRows

resetStats

getHighestDeliverable

setHighestDelivered

add

add

add

add

add

get

_get

get

remove

remove

removeMany

removeMany

removeMany

purge

purge

compact

forEach

_add

findHighestSeqno

resize

move

_compact

computeSize

getNumMissing

getMissing

getDigest

toString

dump