Examples of com.carrotsearch.hppc.IntStack.push()

com.carrotsearch.hppc.IntStack.push()
Adds one int to the stack.

        }


        IntStack ids = IntStack.newInstanceWithCapacity(selected.size());
        for (Cluster cluster : selected)
        {
            ids.push(cluster.getId());
        }
        browser.execute("javascript:selectGroupsById(" + Arrays.toString(ids.toArray()) + ");");


        return Status.OK_STATUS;
    }

View Full Code Here

        // A stack for pushing information about the term's documents.
        final IntStack wordDocuments = new IntStack();


        if (documentIndexesArray[tokenImagesOrder[0]] >= 0)
        {
            wordDocuments.push(documentIndexesArray[tokenImagesOrder[0]]);
        }


        // Go through the ordered token images
        for (int i = 0; i < tokenImagesOrder.length - 1; i++)
        {

View Full Code Here

            if (sameCase)
            {
                // Case has not changed, just increase counters
                tf++;
                totalTf++;
                wordDocuments.push(documentIndex);
                continue;
            }


            // Case (or even token image) has changed. Update most frequent case
            // variant

View Full Code Here


            // Check if token image has changed
            if (sameImage)
            {
                totalTf++;
                wordDocuments.push(documentIndex);
            }
            else
            {
                // The image has changed completely.
                // Before we start processing the new image, we need to

View Full Code Here

         */


        // [i] - next neighbor or END, [i + 1] - neighbor cluster index.
        final int END = -1;
        final IntStack neighborList = new IntStack();
        neighborList.push(END);
        final int [] neighbors = new int [baseClusters.size()];
        final float m = (float) mergeThreshold;
        for (int i = 0; i < baseClusters.size(); i++)
        {
            for (int j = i + 1; j < baseClusters.size(); j++)

View Full Code Here

                final float b = c2.cardinality;
                final float c = BitSet.intersectionCount(c1.documents, c2.documents);


                if (c / a > m && c / b > m)
                {
                    neighborList.push(neighbors[i], j);
                    neighbors[i] = neighborList.size() - 2;
                    neighborList.push(neighbors[j], i);
                    neighbors[j] = neighborList.size() - 2;
                }
            }

View Full Code Here


                if (c / a > m && c / b > m)
                {
                    neighborList.push(neighbors[i], j);
                    neighbors[i] = neighborList.size() - 2;
                    neighborList.push(neighbors[j], i);
                    neighbors[j] = neighborList.size() - 2;
                }
            }
        }

View Full Code Here


                assert merged[c] == NO_INDEX || merged[c] == mergedIndex;
                if (merged[c] == mergedIndex) continue;


                merged[c] = mergedIndex;
                mergeList.push(c);


                for (int i = neighbors[c]; neighborList.get(i) != END;)
                {
                    final int neighbor = neighborList.get(i + 1);
                    if (merged[neighbor] == NO_INDEX)

View Full Code Here

            {
              stack = new IntStack();
              map.put(key, stack);
            }
            
            stack.push(i+1);
          }
        }
        else //if (coref.endsWith(")"))
        {
          key = coref.substring(0, coref.length()-1);

View Full Code Here

        assert sequenceLength <= sa.length && sequenceLength <= lcp.length : "Input sequence length larger than suffix array or the LCP.";


        final IntStack stack = new IntStack();


        // Push the stack bottom marker (sentinel).
        stack.push(-1, -1);


        // Process every leaf.
        int top_h;
        for (int i = 0; i <= sequenceLength; i++)
        {

View Full Code Here

0 1

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.