How to use

indexOf

method

in

org.drools.core.util.ObjectHashMap

public Entry getBucket(final Object object) {
  final int hashCode = this.comparator.hashCodeOf( object );
  final int index = indexOf( hashCode,
                this.table.length );
  return this.table[index];
}

public Object get(final Object key) {
  final int hashCode = this.comparator.hashCodeOf( key );
  final int index = indexOf( hashCode,
                this.table.length );
  ObjectEntry current = (ObjectEntry) this.table[index];
  while ( current != null ) {
    if ( hashCode == current.cachedHashCode && this.comparator.equal( key,
                                  current.key ) ) {
      return current.value;
    }
    current = (ObjectEntry) current.getNext();
  }
  return null;
}

public Object remove(final Object key) {
  final int hashCode = this.comparator.hashCodeOf( key );
  final int index = indexOf( hashCode,
                this.table.length );
  ObjectEntry previous = (ObjectEntry) this.table[index];
  ObjectEntry current = previous;
  while ( current != null ) {
    final ObjectEntry next = (ObjectEntry) current.getNext();
    if ( hashCode == current.cachedHashCode && this.comparator.equal( key,
                                  current.key ) ) {
      if ( previous == current ) {
        this.table[index] = next;
      } else {
        previous.setNext( next );
      }
      current.setNext( null );
      this.size--;
      return current.value;
    }
    previous = current;
    current = next;
  }
  return null;
}

public Object put(final Object key,
         final Object value,
         final boolean checkExists) {
  final int hashCode = this.comparator.hashCodeOf( key );
  final int index = indexOf( hashCode,
                this.table.length );
  // scan the linked entries to see if it exists
  if ( checkExists ) {
    ObjectEntry current = (ObjectEntry) this.table[index];
    while ( current != null ) {
      if ( hashCode == current.cachedHashCode && this.comparator.equal( key,
                                    current.key ) ) {
        final Object oldValue = current.value;
        current.value = value;
        return oldValue;
      }
      current = (ObjectEntry) current.getNext();
    }
  }
  // We aren't checking the key exists, or it didn't find the key
  final ObjectEntry entry = new ObjectEntry( key,
                        value,
                        hashCode );
  entry.next = this.table[index];
  this.table[index] = entry;
  if ( this.size++ >= this.threshold ) {
    resize( 2 * this.table.length );
  }
  return null;
}