com.cinchapi.concourse.util

Class PrettyLinkedTableMap<R,C,V>

Object

AbstractMap<K,V>

HashMap<K,V>

LinkedHashMap<R,Map<C,V>>

PrettyLinkedTableMap<R,C,V>

All Implemented Interfaces:

Serializable, Cloneable, Map<R,Map<C,V>>

public class PrettyLinkedTableMap<R,C,V>
extends LinkedHashMap<R,Map<C,V>>

A special LinkedHashMap that simulates a sparse table where a row key maps to a set of columns and each column maps to a value (e.g. Map[R, -> Map[C -> V]]). This object has pretty toString() output that is formatted as such:

 +-----------------------------------------------------------+
 | Record           | name          | gender      | joinedBy |
 +-----------------------------------------------------------+
 | 1416242356271000 | Deary Hudson  | UNSPECIFIED | EMAIL    |
 | 1416242356407000 | Jeff Nelson   | UNSPECIFIED | EMAIL    |
 | 1416242356436000 | Morgan Debaun | UNSPECIFIED | EMAIL    |
 +-----------------------------------------------------------+
 

A PrettyLinkedTableMap is suitable for displaying information about multiple records or documents.

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class AbstractMap

AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>

Method Summary

Modifier and Type	Method and Description
static <R,C,V> PrettyLinkedTableMap<R,C,V>	newPrettyLinkedTableMap() Return an empty PrettyLinkedTableMap with the default row name.
static <R,C,V> PrettyLinkedTableMap<R,C,V>	newPrettyLinkedTableMap(String rowName) Return an empty PrettyLinkedTableMap with the specified rowName.
V	put(R row, C column, V value) Insert value under column in row.
Map<C,V>	put(R key, Map<C,V> value) THIS METHOD ALWAYS RETURNS NULL.
PrettyLinkedTableMap<R,C,V>	setRowName(String name) Set the rowName to name.
String	toString()

Methods inherited from class LinkedHashMap

clear, containsValue, entrySet, forEach, get, getOrDefault, keySet, removeEldestEntry, replaceAll, values

Methods inherited from class HashMap

clone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, putAll, putIfAbsent, remove, remove, replace, replace, size

Methods inherited from class AbstractMap

equals, hashCode

Methods inherited from class Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface Map

compute, computeIfAbsent, computeIfPresent, containsKey, equals, hashCode, isEmpty, merge, putAll, putIfAbsent, remove, remove, replace, replace, size

Method Detail

newPrettyLinkedTableMap

public static <R,C,V> PrettyLinkedTableMap<R,C,V> newPrettyLinkedTableMap()

Return an empty PrettyLinkedTableMap with the default row name.

Returns:

the PrettyLinkedTableMap

newPrettyLinkedTableMap

public static <R,C,V> PrettyLinkedTableMap<R,C,V> newPrettyLinkedTableMap(String rowName)

Return an empty PrettyLinkedTableMap with the specified rowName.

Parameters:

rowName -

Returns:

the PrettyLinkedTableMap

put

public V put(R row,
             C column,
             V value)

Insert value under column in row.

Parameters:

row -

column -

value -

Returns:

the previous value located at the intersection of row and column or null if one did not previously exist.

put

public Map<C,V> put(R key,
                    Map<C,V> value)

THIS METHOD ALWAYS RETURNS NULL.

Specified by:

put in interface Map<R,Map<C,V>>

Overrides:

put in class HashMap<R,Map<C,V>>

setRowName

public PrettyLinkedTableMap<R,C,V> setRowName(String name)

Set the rowName to name.

Parameters:

name -

Returns:

this

toString

public String toString()

Overrides:

toString in class AbstractMap<R,Map<C,V>>