aa
com.cliffc.aa.tvar.UQNodes Member List

This is the complete list of members for com.cliffc.aa.tvar.UQNodes, including all inherited members.

_chmcom.cliffc.aa.util.NonBlockingHashMapLong< Node >private
_chm_offsetcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
_hashcom.cliffc.aa.tvar.UQNodesprivate
_last_resize_millicom.cliffc.aa.util.NonBlockingHashMapLong< Node >private
_Lbasecom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
_Lscalecom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
_Obasecom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
_opt_for_spacecom.cliffc.aa.util.NonBlockingHashMapLong< Node >private
_Oscalecom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
_reprobescom.cliffc.aa.util.NonBlockingHashMapLong< Node >private
_val_1com.cliffc.aa.util.NonBlockingHashMapLong< Node >private
_val_1_offsetcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
add(Node tn)com.cliffc.aa.tvar.UQNodes
addAll(UQNodes uq)com.cliffc.aa.tvar.UQNodes
CAS(final long offset, final Object old, final Object nnn)com.cliffc.aa.util.NonBlockingHashMapLong< Node >private
clear()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
clear(boolean large)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
clone()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
contains(Object val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
containsKey(long key)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
containsKey(Object key)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
containsValue(Object val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
elements()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
entrySet()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
equals(Object o)com.cliffc.aa.tvar.UQNodes
get(long key)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
get(Object key)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
hash(long h)com.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
hashCode()com.cliffc.aa.tvar.UQNodes
help_copy()com.cliffc.aa.util.NonBlockingHashMapLong< Node >private
initialize(final int initial_sz)com.cliffc.aa.util.NonBlockingHashMapLong< Node >private
intern()com.cliffc.aa.tvar.UQNodesprivatestatic
KEYcom.cliffc.aa.tvar.UQNodesprivatestatic
keys()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
keySet()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
keySetLong()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
make(Node tn)com.cliffc.aa.tvar.UQNodesstatic
MATCH_ANYcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
MIN_SIZEcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
MIN_SIZE_LOGcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
NO_KEYcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
NO_MATCH_OLDcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
NonBlockingHashMapLong()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
NonBlockingHashMapLong(final int initial_sz)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
NonBlockingHashMapLong(final boolean opt_for_space)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
NonBlockingHashMapLong(final int initial_sz, final boolean opt_for_space)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
print()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
print2()com.cliffc.aa.util.NonBlockingHashMapLong< Node >private
print2_impl(final int i, final long K, final Object V)com.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
print_impl(final int i, final long K, final Object V)com.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
put(long key, TypeV val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
put(Long key, TypeV val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
putIfAbsent(long key, TypeV val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
putIfAbsent(Long key, TypeV val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
putIfMatch(long key, Object newVal, Object oldVal)com.cliffc.aa.util.NonBlockingHashMapLong< Node >private
rawIndex(final Object[] ary, final int idx)com.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
rawIndex(final long[] ary, final int idx)com.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
readObject(java.io.ObjectInputStream s)com.cliffc.aa.util.NonBlockingHashMapLong< Node >private
remove(long key)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
remove(long key, Object val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
remove(Object key)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
remove(Object key, Object Val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
rename(HashMap< Node, Node > map)com.cliffc.aa.tvar.UQNodes
replace(long key, TypeV val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
replace(long key, TypeV oldValue, TypeV newValue)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
replace(Long key, TypeV Val)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
replace(Long key, TypeV oldValue, TypeV newValue)com.cliffc.aa.util.NonBlockingHashMapLong< Node >
reprobe_limit(int len)com.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
REPROBE_LIMITcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
reprobes()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
serialVersionUIDcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
setHash()com.cliffc.aa.tvar.UQNodesprivate
size()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
TOMBPRIMEcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
TOMBSTONEcom.cliffc.aa.util.NonBlockingHashMapLong< Node >privatestatic
UQSETScom.cliffc.aa.tvar.UQNodesprivatestatic
values()com.cliffc.aa.util.NonBlockingHashMapLong< Node >
writeObject(java.io.ObjectOutputStream s)com.cliffc.aa.util.NonBlockingHashMapLong< Node >private