Examples of cern.colt.map.OpenIntObjectHashMap.values()

Class cern.colt.map.OpenIntObjectHashMap

Examples of cern.colt.map.OpenIntObjectHashMap.values()

cern.colt.map.OpenIntObjectHashMap.values()
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 {@link #forEachKey(IntProcedure)}.
This method can be used to iterate over the values of the receiver. @param list the list to be filled, can have any size.

        {
            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

        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

                ObjectArrayList intersections = (ObjectArrayList) structuresForConcordantShift.hsIntersections.get(h);
                intersections.clear();
                
                for (int sv = 0; sv < sTierSize; sv++)
                {
                    IVertex sTierVertex = (IVertex) sTierVertices.values().get(sv);
                    
                    ICompactTripletsStructure clone = (ICompactTripletsStructure) ((ICompactTripletsStructure) structuresForConcordantShift.substructureEdges.get(h)).clone();
                    clone.intersect(sTierVertex.getCTS());
                    intersections.add(clone);
                }

View Full Code Here

                {
                    IHyperStructure hs = (IHyperStructure) hss.get(h);
                    
                    OpenIntObjectHashMap tierVertices = (OpenIntObjectHashMap) hs.getTiers().get(j);
                    
                    IVertex tierVertex = (IVertex) tierVertices.values().get(s);
                    
                    ICompactTripletsStructure clone = (ICompactTripletsStructure) ((ICompactTripletsStructure) structures.get(h)).clone();
                    
                    clone.intersect(tierVertex.getCTS());

View Full Code Here

                    ObjectArrayList intersections = new ObjectArrayList();
                    hsIntersections.put(h, intersections);
                    for (int s = 0; s < nextTier.size(); s++)
                    {
                        ICompactTripletsStructure lastTierStructure = ((IVertex) verticesFromLastTiers.get(h)).getCTS();
                        IVertex nextTierVertex = (IVertex) nextTier.values().get(s);
                        ICompactTripletsStructure nextTierStructure = (ICompactTripletsStructure) nextTierVertex.getCTS().clone();
                        nextTierStructure.intersect(lastTierStructure);
                        
                        nextTierStructure.intersect((ICompactTripletsStructure) substructures.get(h));
                        intersections.add(nextTierStructure);

View Full Code Here

        for (int j = 0; j < hs.getTiers().size(); j++)
        {
            OpenIntObjectHashMap tierVertices = (OpenIntObjectHashMap) hs.getTiers().get(j);
            for (int i = 0; i < tierVertices.size(); i++)
            {
                IVertex tierVertex = (IVertex) tierVertices.values().get(i);
                ICompactTripletsStructure clone = ((ICompactTripletsStructure) tierVertex.getCTS().clone());
                clone.intersect(vertex.getCTS());
                if (!clone.isEmpty())
                {
                    result.add(tierVertex);

View Full Code Here

            ITier tier = basicCTS.getTier(j);
            if (tier.size() > 1)
            {
                //  Previous tier contains one vertex
                OpenIntObjectHashMap prevTier = (OpenIntObjectHashMap) ((IHyperStructure)hss.get(0)).getTiers().get(j - 1);
                IVertex prevVertex = (IVertex) prevTier.values().get(0);
                
                if (prevVertex.hasEmptyBottomEdge())
                {
                    //  If previous vertex contains only one bottom vertex 
                    //  then we should keep that vertex (and move forward to reduce next HSS tier?)

View Full Code Here

TOP

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.