AddressHashMap

extends ConcurrentHashMap<K, V>

java.lang.Object
↳	java.util.AbstractMap<K, V>
	↳	java.util.concurrent.ConcurrentHashMap<K, V>
		↳	com.pnfsoftware.jeb.util.collect.AddressHashMap<V>

Class Overview

A concurrent map whose keys are 'addresses' hardcoded as unsigned long.

Summary

Public Constructors
	AddressHashMap(int bitsize) Create a map designed to hold memory keys as addresses.

Public Methods
V	put(Long k, V v)

[Expand]

Inherited Methods

From class java.util.concurrent.ConcurrentHashMap

void	clear()
V	compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
V	computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1)
V	computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
boolean	contains(Object arg0)
boolean	containsKey(Object arg0)
boolean	containsValue(Object arg0)
Enumeration<V>	elements()
Set<Entry<K, V>>	entrySet()
boolean	equals(Object arg0)
void	forEach(BiConsumer<? super K, ? super V> arg0)
void	forEach(long arg0, BiConsumer<? super K, ? super V> arg1)
<U> void	forEach(long arg0, BiFunction<? super K, ? super V, ? extends U> arg1, Consumer<? super U> arg2)
<U> void	forEachEntry(long arg0, Function<Entry<K, V>, ? extends U> arg1, Consumer<? super U> arg2)
void	forEachEntry(long arg0, Consumer<? super Entry<K, V>> arg1)
<U> void	forEachKey(long arg0, Function<? super K, ? extends U> arg1, Consumer<? super U> arg2)
void	forEachKey(long arg0, Consumer<? super K> arg1)
<U> void	forEachValue(long arg0, Function<? super V, ? extends U> arg1, Consumer<? super U> arg2)
void	forEachValue(long arg0, Consumer<? super V> arg1)
V	get(Object arg0)
V	getOrDefault(Object arg0, V arg1)
int	hashCode()
boolean	isEmpty()
Set	keySet()
KeySetView<K, V>	keySet(V arg0)
Enumeration<K>	keys()
long	mappingCount()
V	merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2)
static <K> KeySetView<K, Boolean>	newKeySet()
static <K> KeySetView<K, Boolean>	newKeySet(int arg0)
V	put(K arg0, V arg1)
void	putAll(Map<? extends K, ? extends V> arg0)
V	putIfAbsent(K arg0, V arg1)
<U> U	reduce(long arg0, BiFunction<? super K, ? super V, ? extends U> arg1, BiFunction<? super U, ? super U, ? extends U> arg2)
Entry<K, V>	reduceEntries(long arg0, BiFunction<Entry<K, V>, Entry<K, V>, ? extends Entry<K, V>> arg1)
<U> U	reduceEntries(long arg0, Function<Entry<K, V>, ? extends U> arg1, BiFunction<? super U, ? super U, ? extends U> arg2)
double	reduceEntriesToDouble(long arg0, ToDoubleFunction<Entry<K, V>> arg1, double arg2, DoubleBinaryOperator arg3)
int	reduceEntriesToInt(long arg0, ToIntFunction<Entry<K, V>> arg1, int arg2, IntBinaryOperator arg3)
long	reduceEntriesToLong(long arg0, ToLongFunction<Entry<K, V>> arg1, long arg2, LongBinaryOperator arg3)
K	reduceKeys(long arg0, BiFunction<? super K, ? super K, ? extends K> arg1)
<U> U	reduceKeys(long arg0, Function<? super K, ? extends U> arg1, BiFunction<? super U, ? super U, ? extends U> arg2)
double	reduceKeysToDouble(long arg0, ToDoubleFunction<? super K> arg1, double arg2, DoubleBinaryOperator arg3)
int	reduceKeysToInt(long arg0, ToIntFunction<? super K> arg1, int arg2, IntBinaryOperator arg3)
long	reduceKeysToLong(long arg0, ToLongFunction<? super K> arg1, long arg2, LongBinaryOperator arg3)
double	reduceToDouble(long arg0, ToDoubleBiFunction<? super K, ? super V> arg1, double arg2, DoubleBinaryOperator arg3)
int	reduceToInt(long arg0, ToIntBiFunction<? super K, ? super V> arg1, int arg2, IntBinaryOperator arg3)
long	reduceToLong(long arg0, ToLongBiFunction<? super K, ? super V> arg1, long arg2, LongBinaryOperator arg3)
V	reduceValues(long arg0, BiFunction<? super V, ? super V, ? extends V> arg1)
<U> U	reduceValues(long arg0, Function<? super V, ? extends U> arg1, BiFunction<? super U, ? super U, ? extends U> arg2)
double	reduceValuesToDouble(long arg0, ToDoubleFunction<? super V> arg1, double arg2, DoubleBinaryOperator arg3)
int	reduceValuesToInt(long arg0, ToIntFunction<? super V> arg1, int arg2, IntBinaryOperator arg3)
long	reduceValuesToLong(long arg0, ToLongFunction<? super V> arg1, long arg2, LongBinaryOperator arg3)
V	remove(Object arg0)
boolean	remove(Object arg0, Object arg1)
boolean	replace(K arg0, V arg1, V arg2)
V	replace(K arg0, V arg1)
void	replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)
<U> U	search(long arg0, BiFunction<? super K, ? super V, ? extends U> arg1)
<U> U	searchEntries(long arg0, Function<Entry<K, V>, ? extends U> arg1)
<U> U	searchKeys(long arg0, Function<? super K, ? extends U> arg1)
<U> U	searchValues(long arg0, Function<? super V, ? extends U> arg1)
int	size()
String	toString()
Collection<V>	values()

From class java.util.AbstractMap

void	clear()
Object	clone()
boolean	containsKey(Object arg0)
boolean	containsValue(Object arg0)
abstract Set<Entry<K, V>>	entrySet()
boolean	equals(Object arg0)
V	get(Object arg0)
int	hashCode()
boolean	isEmpty()
Set<K>	keySet()
V	put(K arg0, V arg1)
void	putAll(Map<? extends K, ? extends V> arg0)
V	remove(Object arg0)
int	size()
String	toString()
Collection<V>	values()

From class java.lang.Object

From interface java.util.Map

abstract void	clear()
abstract V	compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
abstract V	computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1)
abstract V	computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
abstract boolean	containsKey(Object arg0)
abstract boolean	containsValue(Object arg0)
abstract static <K, V> Map<K, V>	copyOf(Map<? extends K, ? extends V> arg0)
abstract static <K, V> Entry<K, V>	entry(K arg0, V arg1)
abstract Set<Entry<K, V>>	entrySet()
abstract boolean	equals(Object arg0)
abstract void	forEach(BiConsumer<? super K, ? super V> arg0)
abstract V	get(Object arg0)
abstract V	getOrDefault(Object arg0, V arg1)
abstract int	hashCode()
abstract boolean	isEmpty()
abstract Set<K>	keySet()
abstract V	merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13, K arg14, V arg15)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5)
abstract static <K, V> Map<K, V>	of()
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13, K arg14, V arg15, K arg16, V arg17)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13)
abstract static <K, V> Map<K, V>	of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13, K arg14, V arg15, K arg16, V arg17, K arg18, V arg19)
abstract static <K, V> Map<K, V>	ofEntries(Entry...<? extends K, ? extends V> arg0)
abstract V	put(K arg0, V arg1)
abstract void	putAll(Map<? extends K, ? extends V> arg0)
abstract V	putIfAbsent(K arg0, V arg1)
abstract boolean	remove(Object arg0, Object arg1)
abstract V	remove(Object arg0)
abstract boolean	replace(K arg0, V arg1, V arg2)
abstract V	replace(K arg0, V arg1)
abstract void	replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)
abstract int	size()
abstract Collection<V>	values()

From interface java.util.concurrent.ConcurrentMap

abstract V	compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
abstract V	computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1)
abstract V	computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
abstract void	forEach(BiConsumer<? super K, ? super V> arg0)
abstract V	getOrDefault(Object arg0, V arg1)
abstract V	merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2)
abstract V	putIfAbsent(K arg0, V arg1)
abstract boolean	remove(Object arg0, Object arg1)
abstract boolean	replace(K arg0, V arg1, V arg2)
abstract V	replace(K arg0, V arg1)
abstract void	replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)

Public Constructors

public AddressHashMap (int bitsize)

Create a map designed to hold memory keys as addresses.

Parameters

bitsize	in [1, 64]

Interfaces

Classes

Enums