Examples of cern.colt.map.OpenIntObjectHashMap

cern.colt.map.OpenIntObjectHashMap
Hash map holding (key,value) associations of type (int-->Object); Automatically grows and shrinks as needed; Implemented using open addressing with double hashing. First see the package summary and javadoc tree view to get the broad picture. Overrides many methods for performance reasons only. @author wolfgang.hoschek@cern.ch @version 1.0, 09/24/99 @see java.util.HashMap

 * @throws  IllegalArgumentException if <tt>initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) || (maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >= maxLoadFactor)</tt>.
 * @throws  IllegalArgumentException if <tt>rows<0 || columns<0 || (double)columns*rows > Integer.MAX_VALUE</tt>.
 */
public SparseObjectMatrix2D(int rows, int columns, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
  setUp(rows,columns); 
  this.elements = new OpenIntObjectHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
}

View Full Code Here

 * @throws  IllegalArgumentException if <tt>(double)slices*columns*rows > Integer.MAX_VALUE</tt>.
 * @throws  IllegalArgumentException if <tt>slices<0 || rows<0 || columns<0</tt>.
 */
public SparseObjectMatrix3D(int slices, int rows, int columns, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
  setUp(slices,rows,columns);
  this.elements = new OpenIntObjectHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
}

View Full Code Here

 * @throws  IllegalArgumentException if <tt>initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) || (maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >= maxLoadFactor)</tt>.
 * @throws IllegalArgumentException if <tt>size<0</tt>.
 */
public SparseObjectMatrix1D(int size, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
  setUp(size);
  this.elements = new OpenIntObjectHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
}

View Full Code Here

 * @throws  IllegalArgumentException if <tt>initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) || (maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >= maxLoadFactor)</tt>.
 * @throws  IllegalArgumentException if <tt>rows<0 || columns<0 || (double)columns*rows > Integer.MAX_VALUE</tt>.
 */
public SparseObjectMatrix2D(int rows, int columns, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
  setUp(rows,columns); 
  this.elements = new OpenIntObjectHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
}

View Full Code Here

 * @throws  IllegalArgumentException if <tt>(double)slices*columns*rows > Integer.MAX_VALUE</tt>.
 * @throws  IllegalArgumentException if <tt>slices<0 || rows<0 || columns<0</tt>.
 */
public SparseObjectMatrix3D(int slices, int rows, int columns, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
  setUp(slices,rows,columns);
  this.elements = new OpenIntObjectHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
}

View Full Code Here

 * @throws  IllegalArgumentException if <tt>initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) || (maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >= maxLoadFactor)</tt>.
 * @throws IllegalArgumentException if <tt>size<0</tt>.
 */
public SparseObjectMatrix1D(int size, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
  setUp(size);
  this.elements = new OpenIntObjectHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
}

View Full Code Here

                final int nextTierIndex = j;
                final int prevTierIndex = nextTierIndex - 1;
                final ITier basicPrevTier = (ITier) basicTiers.get(prevTierIndex);
                final ITier basicNextTier = (ITier) basicTiers.get(nextTierIndex);
    
                OpenIntObjectHashMap basicPrevTierVertices = (OpenIntObjectHashMap) basicGraph.getTiers().get(prevTierIndex);
                
                if (LOGGER.isDebugEnabled())
                {
                    LOGGER.debug("HSS   tier #{} is: {}", nextTierIndex, verticesTripletsToString(basicPrevTierVertices));
                    LOGGER.debug("Basic tier #{} is: {}", nextTierIndex, tripletsToString(basicPrevTier));
                    LOGGER.debug("Basic tier #{} is: {}", nextTierIndex + 1, tripletsToString(basicNextTier));
                }
    
                if (basicPrevTier.size() != basicPrevTierVertices.size())
                {
                    throw new AssertionError("BG and HSS should be isomorphic");
                }
                
                //  Shift each vertex of the tier along associated edges to the next tier
                
                IntArrayList keys = basicPrevTierVertices.keys();
                int keysSize = keys.size();
                for (int k = 0; k < keysSize; k++)
                {
                    int tierKeyOfTheVertexToShift = keys.get(k);

View Full Code Here

    {
        int count = 0;
        for (int h = 0; h < hss.size(); h++)
        {
            IHyperStructure hs = (IHyperStructure) hss.get(h);
            OpenIntObjectHashMap tierVertices = ((OpenIntObjectHashMap) hs.getTiers().get(tierIndex));
            for (int i = 0; i < tierVertices.size(); i++)
            {
                IVertex vertex = (IVertex) tierVertices.values().get(i);
                if (vertex.bothEdgesAreEmpty())
                {
                    if (LOGGER.isDebugEnabled())
                    {
                        LOGGER.debug("Clearing leaf-vertex {} on tier #{} of HSS({})",

View Full Code Here

        {
            ITier basicTier = basicCTS.getTier(j);
            for (int h = 0; h < hss.size(); h++)
            {
                IHyperStructure hs = (IHyperStructure) hss.get(h);
                OpenIntObjectHashMap hsTier = (OpenIntObjectHashMap) hs.getTiers().get(j);
                if (hsTier.size() != basicTier.size())
                {
                    throw new AssertionError("hsTier.size() != basicTier.size(), tierIndex=" + tierIndex);
                }
                assertBothContainsTripletValue(basicTier, hsTier, _000_instance);
                assertBothContainsTripletValue(basicTier, hsTier, _001_instance);

View Full Code Here

    }


    private static void assertIntersectionOfTierSubstructuresIsEmpty(IHyperStructure basicGraph, final int tierIndex)
            throws AssertionError
    {
        OpenIntObjectHashMap tierVertices = (OpenIntObjectHashMap) basicGraph.getTiers().get(tierIndex);
        if (tierVertices.size() == 1)
        {
            return;
        }
        ICompactTripletsStructure intersection = intersectAll(tierVertices.values());
        if (!intersection.isEmpty())
        {
            Helper.prettyPrint(intersection);
            throw new AssertionError("By the construction rules, intersection of substructure-vertices of a single tier should be an empty substructure");
        }

View Full Code Here

0 1 2 3

TOP

Related Classes of cern.colt.map.OpenIntObjectHashMap

cern.colt.list.ByteArrayList

cern.colt.list.ObjectArrayList

cern.colt.matrix.impl.SparseObjectMatrix1D

cern.colt.matrix.impl.SparseObjectMatrix2D

cern.colt.matrix.impl.SparseObjectMatrix3D

com.anjlab.sat3.Helper

com.anjlab.sat3.Helper$StructuresForConcordantShift

com.anjlab.sat3.SimpleFormula

com.anjlab.sat3.SimpleHyperStructure

com.anjlab.sat3.TestHelper

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.