Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
 
 
 /*
 Copyright ï¿½ 1999 CERN - European Organization for Nuclear Research.
 Permission to use, copy, modify, distribute and sell this software and its documentation for any purpose 
 is hereby granted without fee, provided that the above copyright notice appear in all copies and 
 that both that copyright notice and this permission notice appear in supporting documentation. 
 CERN makes no representations about the suitability of this software for any purpose. 
 It is provided "as is" without expressed or implied warranty.
 */
 package org.apache.mahout.math.map;
 
 
 
Open hash map from short keys to byte values.
 
 public class OpenShortByteHashMap extends AbstractShortByteMap {
   protected static final byte FREE = 0;
   protected static final byte FULL = 1;
   protected static final byte REMOVED = 2;
   protected static final short NO_KEY_VALUE = 0;

  
The hash table keys.
 
   protected short[] table;

  
The hash table values.
 
   protected byte[] values;

  
The state of each hash table entry (FREE, FULL, REMOVED).
 
   protected byte[] state;

  
The number of table entries in state==FREE.
 
   protected int freeEntries;


  
Constructs an empty map with default capacity and default load factors.
 
   public OpenShortByteHashMap() {
     this();
   }

  
Constructs an empty map with the specified initial capacity and default load factors.

Parameters:
initialCapacity the initial capacity of the map.
Throws:
java.lang.IllegalArgumentException if the initial capacity is less than zero.
 
   public OpenShortByteHashMap(int initialCapacity) {
     this(initialCapacity);
   }

  
Constructs an empty map with the specified initial capacity and the specified minimum and maximum load factor.

Parameters:
initialCapacity the initial capacity.
minLoadFactor the minimum load factor.
maxLoadFactor the maximum load factor.
Throws:
java.lang.IllegalArgumentException if initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) || (maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >= maxLoadFactor).
 
   public OpenShortByteHashMap(int initialCapacitydouble minLoadFactordouble maxLoadFactor) {
     setUp(initialCapacityminLoadFactormaxLoadFactor);
   }

  
Removes all (key,value) associations from the receiver. Implicitly calls trimToSize().
 
   @Override
   public void clear() {
     Arrays.fill(this.);
      = 0;
      = .// delta
    trimToSize();
  }

  
Returns a deep copy of the receiver.

Returns:
a deep copy of the receiver.
  public Object clone() {
    OpenShortByteHashMap copy = (OpenShortByteHashMapsuper.clone();
    copy.table = copy.table.clone();
    copy.values = copy.values.clone();
    copy.state = copy.state.clone();
    return copy;
  }

  
Returns true if the receiver contains the specified key.

Returns:
true if the receiver contains the specified key.
  public boolean containsKey(short key) {
    return indexOfKey(key) >= 0;
  }

  
Returns true if the receiver contains the specified value.

Returns:
true if the receiver contains the specified value.
  public boolean containsValue(byte value) {
    return indexOfValue(value) >= 0;
  }

  
Ensures that the receiver can hold at least the specified number of associations without needing to allocate new internal memory. If necessary, allocates new internal memory and increases the capacity of the receiver.

This method never need be called; it is for performance tuning only. Calling this method before put()ing a large number of associations boosts performance, because the receiver will grow only once instead of potentially many times and hash collisions get less probable.

Parameters:
minCapacity the desired minimum capacity.
  public void ensureCapacity(int minCapacity) {
    if (. < minCapacity) {
      int newCapacity = nextPrime(minCapacity);
      rehash(newCapacity);
    }
  }

  
Applies a procedure to each key of the receiver, if any. Note: Iterates over the keys in no particular order. Subclasses can define a particular order, for example, "sorted by key". All methods which can be expressed in terms of this method (most methods can) must guarantee to use the same order defined by this method, even if it is no particular order. This is necessary so that, for example, methods keys and values will yield association pairs, not two uncorrelated lists.

Parameters:
procedure the procedure to be applied. Stops iteration if the procedure returns false, otherwise continues.
Returns:
false if the procedure stopped before all keys where iterated over, true otherwise.
  public boolean forEachKey(ShortProcedure procedure) {
    for (int i = .i-- > 0;) {
      if ([i] ==  && !procedure.apply([i])) {
        return false;
      }
    }
    return true;
  }

  
Applies a procedure to each (key,value) pair of the receiver, if any. Iteration order is guaranteed to be identical to the order used by method forEachKey(org.apache.mahout.math.function.ShortProcedure).

Parameters:
procedure the procedure to be applied. Stops iteration if the procedure returns false, otherwise continues.
Returns:
false if the procedure stopped before all keys where iterated over, true otherwise.
  public boolean forEachPair(ShortByteProcedure procedure) {
    for (int i = .i-- > 0;) {
      if ([i] ==  && !procedure.apply([i], [i])) {
        return false;
      }
    }
    return true;
  }

  
Returns the value associated with the specified key. It is often a good idea to first check with containsKey(short) whether the given key has a value associated or not, i.e. whether there exists an association for the given key or not.

Parameters:
key the key to be searched for.
Returns:
the value associated with the specified key; 0 if no such key is present.
  public byte get(short key) {
    final int i = indexOfKey(key);
    if (i < 0) {
      return 0;
    } //not contained
    return [i];
  }

  

Parameters:
key the key to be added to the receiver.
Returns:
the index where the key would need to be inserted, if it is not already contained. Returns -index-1 if the key is already contained at slot index. Therefore, if the returned index < 0, then it is already contained at slot -index-1. If the returned index >= 0, then it is NOT already contained and should be inserted at slot index.
  protected int indexOfInsertion(short key) {
    final int length = .;
    final int hash = HashFunctions.hash(key) & 0x7FFFFFFF;
    int i = hash % length;
    int decrement = hash % (length - 2); // double hashing, see http://www.eece.unm.edu/faculty/heileman/hash/node4.html
    //int decrement = (hash / length) % length;
    if (decrement == 0) {
      decrement = 1;
    }
    // stop if we find a removed or free slot, or if we find the key itself
    // do NOT skip over removed slots (yes, open addressing is like that...)
    while ([i] ==  && [i] != key) {
      i -= decrement;
      //hashCollisions++;
      if (i < 0) {
        i += length;
      }
    }
    if ([i] == ) {
      // stop if we find a free slot, or if we find the key itself.
      // do skip over removed slots (yes, open addressing is like that...)
      // assertion: there is at least one FREE slot.
      final int j = i;
      while ([i] !=  && ([i] ==  || [i] != key)) {
        i -= decrement;
        //hashCollisions++;
        if (i < 0) {
          i += length;
        }
      }
      if ([i] == ) {
        i = j;
      }
    }
    if ([i] == ) {
      // key already contained at slot i.
      // return a negative number identifying the slot.
      return -i - 1;
    }
    // not already contained, should be inserted at slot i.
    // return a number >= 0 identifying the slot.
    return i;
  }

  

Parameters:
key the key to be searched in the receiver.
Returns:
the index where the key is contained in the receiver, returns -1 if the key was not found.
  protected int indexOfKey(short key) {
    final int length = .;
    final int hash = HashFunctions.hash(key) & 0x7FFFFFFF;
    int i = hash % length;
    int decrement = hash % (length - 2); // double hashing, see http://www.eece.unm.edu/faculty/heileman/hash/node4.html
    //int decrement = (hash / length) % length;
    if (decrement == 0) {
      decrement = 1;
    }
    // stop if we find a free slot, or if we find the key itself.
    // do skip over removed slots (yes, open addressing is like that...)
    while ([i] !=  && ([i] ==  || [i] != key)) {
      i -= decrement;
      //hashCollisions++;
      if (i < 0) {
        i += length;
      }
    }
    if ([i] == ) {
      return -1;
    } // not found
    return i//found, return index where key is contained
  }

  

Parameters:
value the value to be searched in the receiver.
Returns:
the index where the value is contained in the receiver, returns -1 if the value was not found.
  protected int indexOfValue(byte value) {
    byte[] val = ;
    byte[] stat = ;
    for (int i = stat.length; --i >= 0;) {
      if (stat[i] ==  && val[i] == value) {
        return i;
      }
    }
    return -1; // not found
  }

  
Fills all keys contained in the receiver into the specified list. Fills the list, starting at index 0. After this call returns the specified list has a new size that equals this.size(). Iteration order is guaranteed to be identical to the order used by method forEachKey(org.apache.mahout.math.function.ShortProcedure).

This method can be used to iterate over the keys of the receiver.

Parameters:
list the list to be filled, can have any size.
  public void keys(ShortArrayList list) {
    list.setSize();
    short [] elements = list.elements();
    int j = 0;
    for (int i = .i-- > 0;) {
      if ([i] == ) {
        elements[j++] = [i];
      }
    }
  }
  
  public Iterator<MapElementiterator() {
    return new MapIterator();
  }
  public final class MapElement {
    private int offset = -1;
    int seen = 0;
    boolean advanceOffset() {
      ++;
      while ( < . && [] != ) {
        ++;
      }
      if ( < .) {
        ++;
      }
      return  < .;
    }
    
    public byte get() {
      return [];
    }
    public short index() {
      return [];
    }
    public void set(byte value) {
      [] = value;
    }
  }
  
  public final class MapIterator implements Iterator<MapElement> {
    private final MapElement element = new MapElement();
    private MapIterator() { }
    
    @Override
    public boolean hasNext() {
      return . < ;
    }
    @Override
    public MapElement next() {
      if (.advanceOffset()) {
        return ;
      }
      throw new NoSuchElementException();
    }
    @Override
    public void remove() {
      throw new UnsupportedOperationException();
    }
  }
  
  
Fills all pairs satisfying a given condition into the specified lists. Fills into the lists, starting at index 0. After this call returns the specified lists both have a new size, the number of pairs satisfying the condition. Iteration order is guaranteed to be identical to the order used by method forEachKey(org.apache.mahout.math.function.ShortProcedure).

Example:

 ShortByteProcedure condition = new ShortByteProcedure() { // match even values only
 public boolean apply(short key, byte value) { return value%2==0; }
 }
 keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)
 

Parameters:
condition the condition to be matched. Takes the current key as first and the current value as second argument.
keyList the list to be filled with keys, can have any size.
valueList the list to be filled with values, can have any size.
  public void pairsMatching(ShortByteProcedure condition
                            ShortArrayList keyList
                            ByteArrayList valueList) {
    keyList.clear();
    valueList.clear();
    for (int i = .i-- > 0;) {
      if ([i] ==  && condition.apply([i], [i])) {
        keyList.add([i]);
        valueList.add([i]);
      }
    }
  }

  
Associates the given key with the given value. Replaces any old (key,someOtherValue) association, if existing.

Parameters:
key the key the value shall be associated with.
value the value to be associated.
Returns:
true if the receiver did not already contain such a key; false if the receiver did already contain such a key - the new value has now replaced the formerly associated value.
  public boolean put(short keybyte value) {
    int i = indexOfInsertion(key);
    if (i < 0) { // already contained
      i = -i - 1;
      this.[i] = value;
      return false;
    }
    if (this. > this.) {
      int newCapacity = chooseGrowCapacity(this. + 1, this.this.);
      rehash(newCapacity);
      return put(keyvalue);
    }
    this.[i] = key;
    this.[i] = value;
    if (this.[i] == ) {
      this.--;
    }
    this.[i] = ;
    this.++;
    if (this. < 1) { //delta
      int newCapacity = chooseGrowCapacity(this. + 1, this.this.);
      rehash(newCapacity);
    }
    return true;
  }
  public byte adjustOrPutValue(short keybyte newValuebyte incrValue) {
    int i = indexOfInsertion(key);
    if (i < 0) { //already contained
      i = -i - 1;
      this.[i] += incrValue;
      return this.[i];
    } else {
      put(keynewValue);
      return newValue;
    }
 }
  
  
Rehashes the contents of the receiver into a new table with a smaller or larger capacity. This method is called automatically when the number of keys in the receiver exceeds the high water mark or falls below the low water mark.
  protected void rehash(int newCapacity) {
    int oldCapacity = .;
    //if (oldCapacity == newCapacity) return;
    short[] oldTable = ;
    byte[] oldValues = ;
    byte[] oldState = ;
    this. = new short[newCapacity];
    this. = new byte[newCapacity];
    this. = new byte[newCapacity];
    this. = chooseLowWaterMark(newCapacitythis.);
    this. = chooseHighWaterMark(newCapacitythis.);
    this. = newCapacity - this.// delta
    for (int i = oldCapacityi-- > 0;) {
      if (oldState[i] == ) {
        short element = oldTable[i];
        int index = indexOfInsertion(element);
        this.[index] = element;
        this.[index] = oldValues[i];
        this.[index] = ;
      }
    }
  }

  
Removes the given key with its associated element from the receiver, if present.

Parameters:
key the key to be removed from the receiver.
Returns:
true if the receiver contained the specified key, false otherwise.
  public boolean removeKey(short key) {
    int i = indexOfKey(key);
    if (i < 0) {
      return false;
    } // key not contained
    this.[i] = ;
    //this.values[i]=0; // delta
    this.--;
    if (this. < this.) {
      int newCapacity = chooseShrinkCapacity(this.this.this.);
      rehash(newCapacity);
    }
    return true;
  }

  
Initializes the receiver.

Parameters:
initialCapacity the initial capacity of the receiver.
minLoadFactor the minLoadFactor of the receiver.
maxLoadFactor the maxLoadFactor of the receiver.
Throws:
java.lang.IllegalArgumentException if initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) || (maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >= maxLoadFactor).
  final protected void setUp(int initialCapacitydouble minLoadFactordouble maxLoadFactor) {
    int capacity = initialCapacity;
    super.setUp(capacityminLoadFactormaxLoadFactor);
    capacity = nextPrime(capacity);
    if (capacity == 0) {
      capacity = 1;
    } // open addressing needs at least one FREE slot at any time.
    this. = new short[capacity];
    this. = new byte[capacity];
    this. = new byte[capacity];
    // memory will be exhausted long before this pathological case happens, anyway.
    this. = minLoadFactor;
    if (capacity == .) {
      this. = 1.0;
    } else {
      this. = maxLoadFactor;
    }
    this. = 0;
    this. = capacity// delta
    // lowWaterMark will be established upon first expansion.
    // establishing it now (upon instance construction) would immediately make the table shrink upon first put(...).
    // After all the idea of an "initialCapacity" implies violating lowWaterMarks when an object is young.
    // See ensureCapacity(...)
    this. = 0;
    this. = chooseHighWaterMark(capacitythis.);
  }

  
Trims the capacity of the receiver to be the receiver's current size. Releases any superfluous internal memory. An application can use this operation to minimize the storage of the receiver.
  public void trimToSize() {
    // * 1.2 because open addressing's performance exponentially degrades beyond that point
    // so that even rehashing the table can take very long
    int newCapacity = nextPrime((int) (1 + 1.2 * size()));
    if (. > newCapacity) {
      rehash(newCapacity);
    }
  }

  
Fills all values contained in the receiver into the specified list. Fills the list, starting at index 0. After this call returns the specified list has a new size that equals this.size(). Iteration order is guaranteed to be identical to the order used by method forEachKey(org.apache.mahout.math.function.ShortProcedure).

This method can be used to iterate over the values of the receiver.

Parameters:
list the list to be filled, can have any size.
  public void values(ByteArrayList list) {
    list.setSize();
    byte[] elements = list.elements();
    int j = 0;
    for (int i = .i-- > 0;) {
      if ([i] == ) {
        elements[j++] = [i];
      }
    }
  }
  
  
Access for unit tests.

Parameters:
capacity
minLoadFactor
maxLoadFactor
  protected void getInternalFactors(int[] capacity
      double[] minLoadFactor
      double[] maxLoadFactor) {
    capacity[0] = .;
    minLoadFactor[0] = this.;
    maxLoadFactor[0] = this.;
  }
New to GrepCode? Check out our FAQ X