com.cliffc.aa.tvar.UQNodes Class Reference

Inheritance diagram for com.cliffc.aa.tvar.UQNodes:

Collaboration diagram for com.cliffc.aa.tvar.UQNodes:

Public Member Functions
UQNodes	add (Node tn)
UQNodes	addAll (UQNodes uq)
void	clear ()
	Removes all of the mappings from this map. More...
void	clear (boolean large)
NonBlockingHashMapLong< TypeV >	clone ()
	Creates a shallow copy of this hashtable. More...
boolean	contains (Object val)
	Legacy method testing if some key maps into the specified value in this table. More...
boolean	containsKey (long key)
	Tests if the key in the table. More...
boolean	containsKey (Object key)
	Auto-boxing version of containsKey(long). More...
boolean	containsValue (Object val)
	Returns true if this Map maps one or more keys to the specified value. More...
Enumeration< TypeV >	elements ()
	Returns an enumeration of the values in this table. More...
Set< Map.Entry< Long, TypeV > >	entrySet ()
	Returns a Set view of the mappings contained in this map. More...
boolean	equals (Object o)
final TypeV	get (long key)
	Returns the value to which the specified key is mapped, or. More...
TypeV	get (Object key)
	Auto-boxing version of get(long). More...
int	hashCode ()
Enumeration< Long >	keys ()
	Returns an enumeration of the auto-boxed keys in this table. More...
Set< Long >	keySet ()
	Returns a Set view of the keys contained in this map; with care the keys may be iterated over without auto-boxing. More...
long[]	keySetLong ()
	Keys as a long array. More...
final void	print ()
	Verbose printout of table internals, useful for debugging. More...
TypeV	put (long key, TypeV val)
	Maps the specified key to the specified value in the table. More...
TypeV	put (Long key, TypeV val)
	Auto-boxing version of put. More...
TypeV	putIfAbsent (long key, TypeV val)
	Atomically, do a put if-and-only-if the key is not mapped. More...
TypeV	putIfAbsent (Long key, TypeV val)
	Auto-boxing version of putIfAbsent. More...
TypeV	remove (long key)
	Removes the key (and its corresponding value) from this map. More...
boolean	remove (long key, Object val)
	Atomically do a remove(long) if-and-only-if the key is mapped to a value which is equals to the given value. More...
TypeV	remove (Object key)
	Auto-boxing version of remove(long). More...
boolean	remove (Object key, Object Val)
	Auto-boxing version of remove(long,Object). More...
UQNodes	rename (HashMap< Node, Node > map)
boolean	replace (long key, TypeV oldValue, TypeV newValue)
	Atomically do a put(key,newValue) if-and-only-if the key is mapped a value which is equals to oldValue. More...
boolean	replace (Long key, TypeV oldValue, TypeV newValue)
	Auto-boxing version of replace. More...
TypeV	replace (long key, TypeV val)
	Atomically do a put(key,val) if-and-only-if the key is mapped to some value already. More...
TypeV	replace (Long key, TypeV Val)
	Auto-boxing version of replace. More...
long	reprobes ()
	Get and clear the current count of reprobes. More...
int	size ()
	Returns the number of key-value mappings in this map. More...
Collection< TypeV >	values ()
	Returns a Collection view of the values contained in this map. More...

Static Public Member Functions
static UQNodes	make (Node tn)

Private Member Functions
final boolean	CAS (final long offset, final Object old, final Object nnn)
void	help_copy ()
void	initialize (final int initial_sz)
void	print2 ()
TypeV	putIfMatch (long key, Object newVal, Object oldVal)
void	readObject (java.io.ObjectInputStream s) throws IOException, ClassNotFoundException
void	setHash ()
void	writeObject (java.io.ObjectOutputStream s) throws IOException

Static Private Member Functions
static final int	hash (long h)
static UQNodes	intern ()
static void	print2_impl (final int i, final long K, final Object V)
static void	print_impl (final int i, final long K, final Object V)
static long	rawIndex (final long[] ary, final int idx)
static long	rawIndex (final Object[] ary, final int idx)
static int	reprobe_limit (int len)

Private Attributes
transient CHM	_chm
int	_hash
transient long	_last_resize_milli
final boolean	_opt_for_space
transient ConcurrentAutoTable	_reprobes
transient Object	_val_1

Static Private Attributes
static final long	_chm_offset
static final int	_Lbase
static final int	_Lscale
static final int	_Obase
static final int	_Oscale
static final long	_val_1_offset
static UQNodes	KEY = new UQNodes()
static final Object	MATCH_ANY
static final int	MIN_SIZE
static final int	MIN_SIZE_LOG
static final long	NO_KEY
static final Object	NO_MATCH_OLD
static final int	REPROBE_LIMIT
static final long	serialVersionUID
static final Prime	TOMBPRIME
static final Object	TOMBSTONE
static final NonBlockingHashMap< UQNodes, UQNodes >	UQSETS = new NonBlockingHashMap<>()

Detailed Description

Definition at line 8 of file UQNodes.java.

Member Function Documentation

add()

UQNodes com.cliffc.aa.tvar.UQNodes.add

(

Node

tn

)

Definition at line 36 of file UQNodes.java.

                                {
    assert KEY.isEmpty();
    assert !tn.is_dead();
    if( get(tn._uid)!=null ) return this; // Already in there
    // Fold them together
    for( Node n : values() ) if( !n.is_dead() ) KEY.put(n._uid,n);
    KEY.put(tn._uid,tn);
    return intern();
  }

References com.cliffc.aa.node.Node._uid, com.cliffc.aa.tvar.UQNodes.intern(), com.cliffc.aa.node.Node.is_dead(), com.cliffc.aa.tvar.UQNodes.KEY, com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.put(), and com.cliffc.aa.util.NonBlockingHashMapLong< Node >.values().

Referenced by com.cliffc.aa.tvar.TV2._push_update().

Here is the call graph for this function:

Here is the caller graph for this function:

addAll()

UQNodes com.cliffc.aa.tvar.UQNodes.addAll

(

UQNodes

uq

)

Definition at line 47 of file UQNodes.java.

                                      {
    assert KEY.isEmpty();
    if( uq==null ) return this;
 
    // Get smaller in uq0
    UQNodes uq0 = this;
    UQNodes uq1 = uq;
    if( uq1.size() < uq0.size() ) { uq0=uq; uq1=this; }
    // See if all of smaller is in larger
    boolean progress=false;
    for( Node n : uq0.values() )
      if( !n.is_dead() && uq1.get(n._uid)!=n )
        { progress = true; break; }
    if( !progress ) return uq1;
 
    // Fold them together
    for( Node n : uq0.values() ) if( !n.is_dead() ) KEY.put(n._uid,n);
    for( Node n : uq1.values() ) if( !n.is_dead() ) KEY.put(n._uid,n);
 
    return intern();
  }

References com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.get(), com.cliffc.aa.tvar.UQNodes.intern(), com.cliffc.aa.tvar.UQNodes.KEY, com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.put(), com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.size(), and com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.values().

Referenced by com.cliffc.aa.tvar.TV2.merge_deps(), and com.cliffc.aa.tvar.TV2.merge_ns().

Here is the call graph for this function:

Here is the caller graph for this function:

CAS()

final boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.CAS ( final long  offset, final Object  old, final Object  nnn  )

privateinherited

Definition at line 119 of file NonBlockingHashMapLong.java.

                                                                                     {
    return UNSAFE.compareAndSwapObject(this, offset, old, nnn );
  }

clear() [1/2]

void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.clear

inherited

Removes all of the mappings from this map.

Definition at line 332 of file NonBlockingHashMapLong.java.

                      {         // Smack a new empty table down
    CHM newchm = new CHM(this,new ConcurrentAutoTable(),MIN_SIZE_LOG);
    while( !CAS(_chm_offset,_chm,newchm) ) { /*Spin until the clear works*/}
    CAS(_val_1_offset,_val_1,TOMBSTONE);
  }

clear() [2/2]

void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.clear ( boolean  large )

inherited

Definition at line 338 of file NonBlockingHashMapLong.java.

                                   {         // Smack a new empty table down
    _chm.clear();
    CAS(_val_1_offset,_val_1,TOMBSTONE);
  }

clone()

NonBlockingHashMapLong<TypeV> com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.clone

inherited

Creates a shallow copy of this hashtable.

All the structure of the hashtable itself is copied, but the keys and values are not cloned. This is a relatively expensive operation.

Returns

a clone of the hashtable.

Definition at line 1290 of file NonBlockingHashMapLong.java.

                                               {
    try {
      // Must clone, to get the class right; NBHML might have been
      // extended so it would be wrong to just make a new NBHML.
      NonBlockingHashMapLong<TypeV> t = (NonBlockingHashMapLong<TypeV>) super.clone();
      // But I don't have an atomic clone operation - the underlying _kvs
      // structure is undergoing rapid change.  If I just clone the _kvs
      // field, the CHM in _kvs[0] won't be in sync.
      //
      // Wipe out the cloned array (it was shallow anyways).
      t.clear();
      // Now copy sanely
      for( long K : keySetLong() )
        t.put(K,get(K));
      return t;
    } catch (CloneNotSupportedException e) {
      // this shouldn't happen, since we are Cloneable
      throw new InternalError();
    }
  }

contains()

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.contains ( Object  val )

inherited

Legacy method testing if some key maps into the specified value in this table.

This method is identical in functionality to {}, and exists solely to ensure full compatibility with class java.util.Hashtable}, which supported this method prior to introduction of the Java Collections framework. val a value to search for true if this map maps one or more keys to the specified value NullPointerException if the specified value is null

Definition at line 268 of file NonBlockingHashMapLong.java.

{ return containsValue(val); }

containsKey() [1/2]

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.containsKey ( long  key )

inherited

Tests if the key in the table.

Returns

true if the key is in the table

Definition at line 258 of file NonBlockingHashMapLong.java.

{ return get(key) != null; }

containsKey() [2/2]

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.containsKey ( Object  key )

inherited

Auto-boxing version of containsKey(long).

Definition at line 386 of file NonBlockingHashMapLong.java.

{ return (key instanceof Long) && containsKey(((Long) key).longValue()); }

containsValue()

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.containsValue ( Object  val )

inherited

Returns true if this Map maps one or more keys to the specified value.

Note: This method requires a full internal traversal of the hash table and is much slower than containsKey.

Parameters

val	value whose presence in this map is to be tested

Returns

true if this Map maps one or more keys to the specified value

Exceptions

NullPointerException

if the specified value is null

Definition at line 349 of file NonBlockingHashMapLong.java.

                                             {
    if( val == null ) return false;
    if( val == _val_1 ) return true; // Key 0
    for( TypeV V : values() )
      if( V == val || V.equals(val) )
        return true;
    return false;
  }

elements()

Enumeration<TypeV> com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.elements

inherited

Returns an enumeration of the values in this table.

Returns

an enumeration of the values in this table

See also

values()

Definition at line 1102 of file NonBlockingHashMapLong.java.

{ return new SnapshotV(); }

entrySet()

Set<Map.Entry<Long,TypeV> > com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.entrySet

inherited

Returns a Set view of the mappings contained in this map.

The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.

The view's iterator is a "weakly consistent" iterator that will never throw ConcurrentModificationException, and guarantees to traverse elements as they existed upon construction of the iterator, and may (but is not guaranteed to) reflect any modifications subsequent to construction.

Warning: the iterator associated with this Set requires the creation of java.util.Map.Entry objects with each iteration. The org.jctools.maps.NonBlockingHashMap does not normally create or using java.util.Map.Entry objects so they will be created soley to support this iteration. Iterating using Map#keySet or Map#values will be more efficient. In addition, this version requires auto-boxing the keys.

Definition at line 1235 of file NonBlockingHashMapLong.java.

                                               {
    return new AbstractSet<Map.Entry<Long,TypeV>>() {
      public void    clear   (          ) {        NonBlockingHashMapLong.this.clear( ); }
      public int     size    (          ) { return NonBlockingHashMapLong.this.size ( ); }
      public boolean remove( final Object o ) {
        if (!(o instanceof Map.Entry)) return false;
        final Map.Entry<?,?> e = (Map.Entry<?,?>)o;
        return NonBlockingHashMapLong.this.remove(e.getKey(), e.getValue());
      }
      public boolean contains(final Object o) {
        if (!(o instanceof Map.Entry)) return false;
        final Map.Entry<?,?> e = (Map.Entry<?,?>)o;
        TypeV v = get(e.getKey());
        return v != null && v.equals(e.getValue());
      }
      public Iterator<Map.Entry<Long,TypeV>> iterator() { return new SnapshotE(); }
    };
  }

equals()

boolean com.cliffc.aa.tvar.UQNodes.equals

(

Object

o

)

Definition at line 89 of file UQNodes.java.

                                              {
    if( !(o instanceof UQNodes) ) return false;
    UQNodes uq = (UQNodes)o;
    assert _hash!=0 && uq._hash!=0;
    if( _hash!=uq._hash ) return false;
    if( size() != uq.size() ) return false;
    for( Node n : values() )
      if( n!=uq.get(n._uid) )
        return false;
    return true;
  }

References com.cliffc.aa.tvar.UQNodes._hash, com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.get(), com.cliffc.aa.util.NonBlockingHashMapLong< Node >.size(), com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.size(), and com.cliffc.aa.util.NonBlockingHashMapLong< Node >.values().

Here is the call graph for this function:

get() [1/2]

final TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.get ( long  key )

inherited

Returns the value to which the specified key is mapped, or.

null 

if this map contains no mapping for the key.

More formally, if this map contains a mapping from a key

k 

to a value

v 

such that

key==k 

, then this method returns

v 

; otherwise it returns

null 

. (There can be at most one such mapping.)

Exceptions

NullPointerException

if the specified key is null

Definition at line 368 of file NonBlockingHashMapLong.java.

                                     {
    if( key == NO_KEY ) {
      final Object V = _val_1;
      return V == TOMBSTONE ? null : (TypeV)V;
    }
    final Object V = _chm.get_impl(key);
    assert !(V instanceof Prime); // Never return a Prime
    assert V != TOMBSTONE;
    return (TypeV)V;
  }

get() [2/2]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.get ( Object  key )

inherited

Auto-boxing version of get(long).

Definition at line 380 of file NonBlockingHashMapLong.java.

{ return (key instanceof Long) ? get    (((Long)key).longValue()) : null;  }

hash()

static final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.hash ( long  h )

staticprivateinherited

Definition at line 416 of file NonBlockingHashMapLong.java.

                                        {
    h ^= (h>>>20) ^ (h>>>12);
    h ^= (h>>> 7) ^ (h>>> 4);
    h += h<<7; // smear low bits up high, for hashcodes that only differ by 1
    return (int)h;
  }

hashCode()

int com.cliffc.aa.tvar.UQNodes.hashCode

(

)

Definition at line 88 of file UQNodes.java.

{ assert _hash!=0; return _hash; }

References com.cliffc.aa.tvar.UQNodes._hash.

help_copy()

void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.help_copy

privateinherited

Definition at line 403 of file NonBlockingHashMapLong.java.

                            {
    // Read the top-level CHM only once.  We'll try to help this copy along,
    // even if it gets promoted out from under us (i.e., the copy completes
    // and another KVS becomes the top-level copy).
    CHM topchm = _chm;
    if( topchm._newchm == null ) return; // No copy in-progress
    topchm.help_copy_impl(false);
  }

initialize()

void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.initialize ( final int  initial_sz )

privateinherited

Definition at line 242 of file NonBlockingHashMapLong.java.

                                                  {
    if( initial_sz < 0 ) throw new IllegalArgumentException("initial_sz argument must be >= 0");
    int i;                      // Convert to next largest power-of-2
    for( i=MIN_SIZE_LOG; (1<<i) < initial_sz; i++ ) {/*empty*/}
    _chm = new CHM(this,new ConcurrentAutoTable(),i);
    _val_1 = TOMBSTONE;         // Always as-if deleted
    _last_resize_milli = System.currentTimeMillis();
  }

intern()

static UQNodes com.cliffc.aa.tvar.UQNodes.intern ( )

staticprivate

Definition at line 14 of file UQNodes.java.

                                  {
    KEY.setHash();
    UQNodes uqset = UQSETS.get(KEY);
    if( uqset==null ) {
      UQSETS.put(uqset=KEY,KEY);
      KEY=new UQNodes();
    } else {
      KEY.clear();
      KEY._hash=0;
    }
    return uqset;
  }

References com.cliffc.aa.tvar.UQNodes._hash, com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.clear(), com.cliffc.aa.tvar.UQNodes.KEY, com.cliffc.aa.tvar.UQNodes.setHash(), and com.cliffc.aa.tvar.UQNodes.UQSETS.

Referenced by com.cliffc.aa.tvar.UQNodes.add(), com.cliffc.aa.tvar.UQNodes.addAll(), com.cliffc.aa.tvar.UQNodes.make(), and com.cliffc.aa.tvar.UQNodes.rename().

Here is the call graph for this function:

Here is the caller graph for this function:

keys()

Enumeration<Long> com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.keys

inherited

Returns an enumeration of the auto-boxed keys in this table.

Warning: this version will auto-box all returned keys.

Returns

an enumeration of the auto-boxed keys in this table

See also

keySet()

Definition at line 1152 of file NonBlockingHashMapLong.java.

{ return new IteratorLong(); }

keySet()

Set<Long> com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.keySet

inherited

Returns a Set view of the keys contained in this map; with care the keys may be iterated over without auto-boxing.

The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. The set supports element removal, which removes the corresponding mapping from this map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.

The view's iterator is a "weakly consistent" iterator that will never throw ConcurrentModificationException, and guarantees to traverse elements as they existed upon construction of the iterator, and may (but is not guaranteed to) reflect any modifications subsequent to construction.

Definition at line 1168 of file NonBlockingHashMapLong.java.

                            {
    return new AbstractSet<Long> () {
      public void    clear   (          ) {        NonBlockingHashMapLong.this.clear   ( ); }
      public int     size    (          ) { return NonBlockingHashMapLong.this.size    ( ); }
      public boolean contains( Object k ) { return NonBlockingHashMapLong.this.containsKey(k); }
      public boolean remove  ( Object k ) { return NonBlockingHashMapLong.this.remove  (k) != null; }
      public IteratorLong iterator()    { return new IteratorLong(); }
    };
  }

keySetLong()

long [] com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.keySetLong

inherited

Keys as a long array.

Array may be zero-padded if keys are concurrently deleted.

Definition at line 1180 of file NonBlockingHashMapLong.java.

                             {
    long[] dom = new long[size()];
    IteratorLong i=(IteratorLong)keySet().iterator();
    int j=0;
    while( j < dom.length && i.hasNext() )
      dom[j++] = i.nextLong();
    return dom;
  }

make()

static UQNodes com.cliffc.aa.tvar.UQNodes.make ( Node  tn )

static

Definition at line 28 of file UQNodes.java.

                                        {
    assert !tn.is_dead();
    assert KEY.isEmpty();
    KEY.put(tn._uid,tn);
    return intern();
  }

References com.cliffc.aa.node.Node._uid, com.cliffc.aa.tvar.UQNodes.intern(), com.cliffc.aa.node.Node.is_dead(), com.cliffc.aa.tvar.UQNodes.KEY, and com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.put().

Referenced by com.cliffc.aa.tvar.TV2._push_update(), com.cliffc.aa.tvar.TV2.make(), com.cliffc.aa.tvar.TV2.make_base(), com.cliffc.aa.tvar.TV2.make_err(), and com.cliffc.aa.tvar.TV2.make_leaf().

Here is the call graph for this function:

Here is the caller graph for this function:

print()

final void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.print

inherited

Verbose printout of table internals, useful for debugging.

Definition at line 171 of file NonBlockingHashMapLong.java.

                            {
    System.out.println("=========");
    print_impl(-99,NO_KEY,_val_1);
    _chm.print();
    System.out.println("=========");
  }

print2()

void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.print2

privateinherited

Definition at line 184 of file NonBlockingHashMapLong.java.

                        {
    System.out.println("=========");
    print2_impl(-99,NO_KEY,_val_1);
    _chm.print();
    System.out.println("=========");
  }

print2_impl()

static void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.print2_impl ( final int  i, final long  K, final Object  V  )

staticprivateinherited

Definition at line 190 of file NonBlockingHashMapLong.java.

                                                                             {
    if( V != null && Prime.unbox(V) != TOMBSTONE )
      print_impl(i,K,V);
  }

print_impl()

static void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.print_impl ( final int  i, final long  K, final Object  V  )

staticprivateinherited

Definition at line 177 of file NonBlockingHashMapLong.java.

                                                                            {
    String p = (V instanceof Prime) ? "prime_" : "";
    Object V2 = Prime.unbox(V);
    String VS = (V2 == TOMBSTONE) ? "tombstone" : V2.toString();
    System.out.println("["+i+"]=("+K+","+p+VS+")");
  }

put() [1/2]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.put ( long  key, TypeV  val  )

inherited

Maps the specified key to the specified value in the table.

The value cannot be null.

The value can be retrieved by calling get with a key that is equal to the original key.

Parameters

key	key with which the specified value is to be associated
val	value to be associated with the specified key

Returns

the previous value associated with key, or null if there was no mapping for key

Exceptions

NullPointerException

if the specified value is null

Definition at line 278 of file NonBlockingHashMapLong.java.

{ return putIfMatch( key,      val,NO_MATCH_OLD);}

put() [2/2]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.put ( Long  key, TypeV  val  )

inherited

Auto-boxing version of put.

Definition at line 392 of file NonBlockingHashMapLong.java.

{ return put(key.longValue(),val); }

putIfAbsent() [1/2]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.putIfAbsent ( long  key, TypeV  val  )

inherited

Atomically, do a put if-and-only-if the key is not mapped.

Useful to ensure that only a single mapping for the key exists, even if many threads are trying to create the mapping in parallel.

Returns

the previous value associated with the specified key, or null if there was no mapping for the key

Exceptions

NullPointerException

if the specified is value is null

Definition at line 286 of file NonBlockingHashMapLong.java.

{ return putIfMatch( key,      val,TOMBSTONE   );}

putIfAbsent() [2/2]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.putIfAbsent ( Long  key, TypeV  val  )

inherited

Auto-boxing version of putIfAbsent.

Definition at line 388 of file NonBlockingHashMapLong.java.

{ return putIfAbsent( key.longValue(), val ); }

putIfMatch()

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.putIfMatch ( long  key, Object  newVal, Object  oldVal  )

privateinherited

Definition at line 312 of file NonBlockingHashMapLong.java.

                                                                     {
    if (oldVal == null || newVal == null)  throw new NullPointerException();
    if( key == NO_KEY ) {
      Object curVal = _val_1;
      if( oldVal == NO_MATCH_OLD || // Do we care about expected-Value at all?
          curVal == oldVal ||       // No instant match already?
          (oldVal == MATCH_ANY && curVal != TOMBSTONE) ||
          oldVal.equals(curVal) ) { // Expensive equals check
        if( !CAS(_val_1_offset,curVal,newVal) ) // One shot CAS update attempt
          curVal = _val_1;                      // Failed; get failing witness
      }
      return curVal == TOMBSTONE ? null : (TypeV)curVal; // Return the last value present
    }
    final Object res = _chm.putIfMatch( key, newVal, oldVal );
    assert !(res instanceof Prime);
    assert res != null;
    return res == TOMBSTONE ? null : (TypeV)res;
  }

rawIndex() [1/2]

static long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.rawIndex ( final long[]  ary, final int  idx  )

staticprivateinherited

Definition at line 108 of file NonBlockingHashMapLong.java.

                                                                {
    assert idx >= 0 && idx < ary.length;
    // Note the long-math requirement, to handle arrays of more than 2^31 bytes
    // - or 2^28 - or about 268M - 8-byte pointer elements.
    return _Lbase + ((long)idx * _Lscale);
  }

rawIndex() [2/2]

static long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.rawIndex ( final Object[]  ary, final int  idx  )

staticprivateinherited

Definition at line 100 of file NonBlockingHashMapLong.java.

                                                                  {
    assert idx >= 0 && idx < ary.length;
    // Note the long-math requirement, to handle arrays of more than 2^31 bytes
    // - or 2^28 - or about 268M - 8-byte pointer elements.
    return _Obase + ((long)idx * _Oscale);
  }

readObject()

void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.readObject ( java.io.ObjectInputStream  s ) throws IOException, ClassNotFoundException

privateinherited

Definition at line 1270 of file NonBlockingHashMapLong.java.

                                                                                                   {
    s.defaultReadObject();      // Read nothing
    initialize(MIN_SIZE);
    for (;;) {
      final long K = s.readLong();
      final TypeV V = (TypeV) s.readObject();
      if( K == NO_KEY && V == null ) break;
      put(K,V);               // Insert with an offical put
    }
  }

remove() [1/4]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.remove ( long  key )

inherited

Removes the key (and its corresponding value) from this map.

This method does nothing if the key is not in the map.

Returns

the previous value associated with key, or null if there was no mapping for key

Definition at line 292 of file NonBlockingHashMapLong.java.

{ return putIfMatch( key,TOMBSTONE,NO_MATCH_OLD);}

remove() [2/4]

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.remove ( long  key, Object  val  )

inherited

Atomically do a remove(long) if-and-only-if the key is mapped to a value which is equals to the given value.

Exceptions

NullPointerException

if the specified value is null

Definition at line 297 of file NonBlockingHashMapLong.java.

{ return putIfMatch( key,TOMBSTONE,val ) == val ;}

remove() [3/4]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.remove ( Object  key )

inherited

Auto-boxing version of remove(long).

Definition at line 382 of file NonBlockingHashMapLong.java.

{ return (key instanceof Long) ? remove (((Long)key).longValue()) : null;  }

remove() [4/4]

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.remove ( Object  key, Object  Val  )

inherited

Auto-boxing version of remove(long,Object).

Definition at line 384 of file NonBlockingHashMapLong.java.

{ return (key instanceof Long) && remove(((Long) key).longValue(), Val);  }

rename()

UQNodes com.cliffc.aa.tvar.UQNodes.rename

(

HashMap< Node, Node >

map

)

Definition at line 70 of file UQNodes.java.

                                                {
    assert KEY.isEmpty();
    for( Node n : values() )
      if( !n.is_dead() ) {
        Node c = map.get(n);
        if( c==null ) c = n;
        KEY.put(c._uid,c);
      }
    return intern();
  }

References com.cliffc.aa.node.Node._uid, com.cliffc.aa.tvar.UQNodes.intern(), com.cliffc.aa.tvar.UQNodes.KEY, com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.put(), and com.cliffc.aa.util.NonBlockingHashMapLong< Node >.values().

Referenced by com.cliffc.aa.tvar.TV2._rename().

Here is the call graph for this function:

Here is the caller graph for this function:

replace() [1/4]

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.replace ( long  key, TypeV  oldValue, TypeV  newValue  )

inherited

Atomically do a put(key,newValue) if-and-only-if the key is mapped a value which is equals to oldValue.

Exceptions

NullPointerException

if the specified value is null

Definition at line 307 of file NonBlockingHashMapLong.java.

                                                                          {
    return putIfMatch( key, newValue, oldValue ) == oldValue;
  }

replace() [2/4]

boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.replace ( Long  key, TypeV  oldValue, TypeV  newValue  )

inherited

Auto-boxing version of replace.

Definition at line 394 of file NonBlockingHashMapLong.java.

                                                                     {
    return replace(key.longValue(), oldValue, newValue);
  }

replace() [3/4]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.replace ( long  key, TypeV  val  )

inherited

Atomically do a put(key,val) if-and-only-if the key is mapped to some value already.

Exceptions

NullPointerException

if the specified value is null

Definition at line 302 of file NonBlockingHashMapLong.java.

{ return putIfMatch( key,      val,MATCH_ANY   );}

replace() [4/4]

TypeV com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.replace ( Long  key, TypeV  Val  )

inherited

Auto-boxing version of replace.

Definition at line 390 of file NonBlockingHashMapLong.java.

{ return replace(key.longValue(), Val);  }

reprobe_limit()

static int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.reprobe_limit ( int  len )

staticprivateinherited

Definition at line 210 of file NonBlockingHashMapLong.java.

                                              {
    return REPROBE_LIMIT + (len>>4);
  }

reprobes()

long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.reprobes

inherited

Get and clear the current count of reprobes.

Reprobes happen on key collisions, and a high reprobe rate may indicate a poor hash function or weaknesses in the table resizing function.

Returns

the count of reprobes since the last call to reprobes or since the table was created.

Definition at line 202 of file NonBlockingHashMapLong.java.

{ long r = _reprobes.get(); _reprobes = new ConcurrentAutoTable(); return r; }

setHash()

void com.cliffc.aa.tvar.UQNodes.setHash ( )

private

Definition at line 81 of file UQNodes.java.

                         {
    long hash=0;
    for( Node n : values() )
      hash = hash^System.identityHashCode(n);
    if( hash==0 ) hash=1;
    _hash = (int)hash;
  }

References com.cliffc.aa.tvar.UQNodes._hash, com.cliffc.aa.util.NonBlockingHashMapLong< Node >.hash(), and com.cliffc.aa.util.NonBlockingHashMapLong< Node >.values().

Referenced by com.cliffc.aa.tvar.UQNodes.intern().

Here is the call graph for this function:

Here is the caller graph for this function:

size()

int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.size

inherited

Returns the number of key-value mappings in this map.

Returns

the number of key-value mappings in this map

Definition at line 255 of file NonBlockingHashMapLong.java.

{ return (_val_1==TOMBSTONE?0:1) + _chm.size(); }

values()

Collection<TypeV> com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.values

inherited

Returns a Collection view of the values contained in this map.

The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. The collection supports element removal, which removes the corresponding mapping from this map, via the Iterator.remove, Collection.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.

The view's iterator is a "weakly consistent" iterator that will never throw ConcurrentModificationException, and guarantees to traverse elements as they existed upon construction of the iterator, and may (but is not guaranteed to) reflect any modifications subsequent to construction.

Definition at line 1118 of file NonBlockingHashMapLong.java.

                                    {
    return new AbstractCollection<TypeV>() {
      public void    clear   (          ) {        NonBlockingHashMapLong.this.clear   ( ); }
      public int     size    (          ) { return NonBlockingHashMapLong.this.size    ( ); }
      public boolean contains( Object v ) { return NonBlockingHashMapLong.this.containsValue(v); }
      public Iterator<TypeV> iterator()   { return new SnapshotV(); }
    };
  }

writeObject()

void com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.writeObject ( java.io.ObjectOutputStream  s ) throws IOException

privateinherited

Definition at line 1256 of file NonBlockingHashMapLong.java.

                                                                             {
    s.defaultWriteObject();     // Write nothing
    for( long K : keySet() ) {
      final Object V = get(K);  // Do an official 'get'
      s.writeLong  (K);         // Write the <long,TypeV> pair
      s.writeObject(V);
    }
    s.writeLong(NO_KEY);        // Sentinel to indicate end-of-data
    s.writeObject(null);
  }

Member Data Documentation

_chm

transient CHM com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._chm

privateinherited

Definition at line 131 of file NonBlockingHashMapLong.java.

_chm_offset

final long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._chm_offset

staticprivateinherited

Definition at line 116 of file NonBlockingHashMapLong.java.

_hash

int com.cliffc.aa.tvar.UQNodes._hash

private

Definition at line 11 of file UQNodes.java.

Referenced by com.cliffc.aa.tvar.UQNodes.equals(), com.cliffc.aa.tvar.UQNodes.hashCode(), com.cliffc.aa.tvar.UQNodes.intern(), and com.cliffc.aa.tvar.UQNodes.setHash().

_last_resize_milli

transient long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._last_resize_milli

privateinherited

Definition at line 137 of file NonBlockingHashMapLong.java.

_Lbase

final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._Lbase

staticprivateinherited

Definition at line 106 of file NonBlockingHashMapLong.java.

_Lscale

final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._Lscale

staticprivateinherited

Definition at line 107 of file NonBlockingHashMapLong.java.

_Obase

final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._Obase

staticprivateinherited

Definition at line 98 of file NonBlockingHashMapLong.java.

_opt_for_space

final boolean com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._opt_for_space

privateinherited

Definition at line 140 of file NonBlockingHashMapLong.java.

_Oscale

final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._Oscale

staticprivateinherited

Definition at line 99 of file NonBlockingHashMapLong.java.

_reprobes

transient ConcurrentAutoTable com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._reprobes

privateinherited

Definition at line 196 of file NonBlockingHashMapLong.java.

_val_1

transient Object com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._val_1

privateinherited

Definition at line 134 of file NonBlockingHashMapLong.java.

_val_1_offset

final long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >._val_1_offset

staticprivateinherited

Definition at line 117 of file NonBlockingHashMapLong.java.

KEY

UQNodes com.cliffc.aa.tvar.UQNodes.KEY = new UQNodes()

staticprivate

Definition at line 10 of file UQNodes.java.

Referenced by com.cliffc.aa.tvar.UQNodes.add(), com.cliffc.aa.tvar.UQNodes.addAll(), com.cliffc.aa.tvar.UQNodes.intern(), com.cliffc.aa.tvar.UQNodes.make(), and com.cliffc.aa.tvar.UQNodes.rename().

MATCH_ANY

final Object com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.MATCH_ANY

staticprivateinherited

Definition at line 154 of file NonBlockingHashMapLong.java.

MIN_SIZE

final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.MIN_SIZE

staticprivateinherited

Definition at line 146 of file NonBlockingHashMapLong.java.

MIN_SIZE_LOG

final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.MIN_SIZE_LOG

staticprivateinherited

Definition at line 145 of file NonBlockingHashMapLong.java.

NO_KEY

final long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.NO_KEY

staticprivateinherited

Definition at line 167 of file NonBlockingHashMapLong.java.

NO_MATCH_OLD

final Object com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.NO_MATCH_OLD

staticprivateinherited

Definition at line 151 of file NonBlockingHashMapLong.java.

REPROBE_LIMIT

final int com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.REPROBE_LIMIT

staticprivateinherited

Definition at line 95 of file NonBlockingHashMapLong.java.

serialVersionUID

final long com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.serialVersionUID

staticprivateinherited

Definition at line 93 of file NonBlockingHashMapLong.java.

TOMBPRIME

final Prime com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.TOMBPRIME

staticprivateinherited

Definition at line 162 of file NonBlockingHashMapLong.java.

TOMBSTONE

final Object com.cliffc.aa.util.NonBlockingHashMapLong< TypeV >.TOMBSTONE

staticprivateinherited

Definition at line 157 of file NonBlockingHashMapLong.java.

UQSETS

final NonBlockingHashMap<UQNodes,UQNodes> com.cliffc.aa.tvar.UQNodes.UQSETS = new NonBlockingHashMap<>()

staticprivate

Definition at line 9 of file UQNodes.java.

Referenced by com.cliffc.aa.tvar.UQNodes.intern().

---

The documentation for this class was generated from the following file:

• UQNodes.java