Examples of IntSet

bak.pcj.set.IntSet
This interface defines sets of int values. @see java.util.Set @author Søren Bak @version 1.0 2002/29/12 @since 1.0
client.net.sf.saxon.ce.expr.z.IntSet
A set of integers represented as int values
com.android.dx.util.IntSet
com.carrotsearch.hppc.IntSet
A set of ints.
com.caucho.util.IntSet
com.gs.collections.api.set.primitive.IntSet
This file was automatically generated from template file primitiveSet.stg. @since 3.0.
com.samskivert.util.IntSet
A set that holds integers and provides accessors that eliminate the need to create and manipulate superfluous Integer objects. It extends the Set interface and therefore provides all of the standard methods (in which Integer objects will be converted to ints).
com.thinkaurelius.titan.util.datastructures.IntSet
edu.ucla.sspace.util.primitive.IntSet
A refinement of the {@link Set} interface for implementations that store{@code int} values. Implementations are expected to provide increasedperformance through primitive {@code int} methods and storage rather thanusing {@link Integer}-based operations that the exiting Collections libraries use. @author David Jurgens
it.unimi.dsi.fastutil.ints.IntSet
kodkod.util.ints.IntSet
An ordered set of integers. @specfield ints: set int @author Emina Torlak
net.sf.saxon.sort.IntSet
A set of integers represented as int values
org.antlr.misc.IntSet
A generic set of ints that has an efficient implementation, BitSet, which is a compressed bitset and is useful for ints that are small, for example less than 500 or so, and w/o many ranges. For ranges with large values like unicode char sets, this is not very efficient. Consider using IntervalSet. Not all methods in IntervalSet are implemented. @see org.antlr.misc.BitSet @see org.antlr.misc.IntervalSet
org.apache.hadoop.hbase.regionserver.idx.support.sets.IntSet
A set of integers ranged between 0 and MAX. Elements to this set have to be added in order.
org.apache.uima.internal.util.IntSet
This class implements a set of integers. It does not implement the Set interface for performance reasons, though methods with the same name are equivalent.
org.jacoco.core.instr.IntSet
Lightweight set of sorted int values. The implementation is designed for a small number of elements only. @author Marc R. Hoffmann @version $Revision: $
org.mindswap.pellet.utils.intset.IntSet
larkparsia.com>
@author Evren Sirin
org.napile.primitive.sets.IntSet
org.pdf4j.saxon.sort.IntSet
A set of integers represented as int values

Examples of edu.ucla.sspace.util.primitive.IntSet

        @Override public IntIterator iterator() {
            return new CombinedIterator();
        }


         @Override public int size() {
             IntSet smaller, larger;
             if (inEdges.size() < outEdges.size()) {
                 smaller = inEdges;
                 larger = outEdges;
             }
             else {
                 smaller = outEdges;
                 larger = inEdges;
             }
             int size = larger.size();
             IntIterator iter = smaller.iterator();
             while (iter.hasNext()) {
                 int i = iter.nextInt();
                 if (!larger.contains(i))
                     size++;
             }

View Full Code Here

Examples of edu.ucla.sspace.util.primitive.IntSet

    private void flushBuffer(ByteBuffer buffer, boolean force) throws IOException {
        if (buffer.position()==0) return;
        if (force || buffer.position()==buffer.limit()) {
            buffer.limit(buffer.position());
            buffer.position(0);
            IntSet failedPositions = new TroveIntSet(100);
            long time=System.currentTimeMillis();
            while (buffer.position() != buffer.limit()) {
                final int position = buffer.position();
                if (!updateFromBuffer(buffer)) failedPositions.add(position);
            }
            if (log.isInfoEnabled()) log.info(String.format("flushed buffer %d, kept %d took %d ms.",idx(buffer),failedPositions.size(),System.currentTimeMillis()-time));
            stats[idx(buffer)].written(buffer.position()/RECORD_SIZE - failedPositions.size());
            buffer.limit(capacity);
            int initialPos=failedPositions.isEmpty() ? 0 : copyFailedPositions(buffer, failedPositions);
            buffer.position(initialPos);
        }
    }

View Full Code Here

Examples of edu.ucla.sspace.util.primitive.IntSet

            final int v1 = iter1.nextInt();
            WORK_QUEUE.add(taskKey, new Runnable() { 
                    public void run() {
                        veryVerbose(LOGGER, "Computing similarities for " + 
                                    "vertex %d", v1);
                        IntSet neighbors = g.getNeighbors(v1);
                        IntIterator it1 = neighbors.iterator();
                        while (it1.hasNext()) {
                            int v2 = it1.nextInt();
                            IntIterator it2 = neighbors.iterator();
                            while (it2.hasNext()) {
                                int v3 = it2.nextInt();
                                if (v2 == v3)
                                    break;
                                double sim = getConnectionSimilarity(

View Full Code Here

Examples of edu.ucla.sspace.util.primitive.IntSet

            final int v1 = iter1.nextInt();
            WORK_QUEUE.add(taskKey, new Runnable() { 
                    public void run() {
                        veryVerbose(LOGGER, "Computing similarities for " + 
                                    "vertex %d", v1);
                        IntSet neighbors = g.getNeighbors(v1);
                        IntIterator it1 = neighbors.iterator();
                        while (it1.hasNext()) {
                            int v2 = it1.nextInt();
                            IntIterator it2 = neighbors.iterator();
                            while (it2.hasNext()) {
                                int v3 = it2.nextInt();
                                if (v2 == v3)
                                    break;
                                double sim = getConnectionSimilarity(

View Full Code Here

Examples of edu.ucla.sspace.util.primitive.IntSet

            WORK_QUEUE.add(key, new Runnable() {
                    public void run() {
                        veryVerbose(LOGGER, "Computing similarities for " + 
                                    "vertex %d", v1);
                        //Set<E> adjList = graph.getAdjacencyList(v1);
                        IntSet neighbors = graph.getNeighbors(v1);
                        // Create a thread-local PriorityQueue that will hold
                        // the edge similarities for this vertex.  Once all the
                        // simialrites have been computed, we can update the
                        // thread-shared queue with minimal locking
                        PriorityQueue<EdgePair> localQ = 
                            new PriorityQueue<EdgePair>(neighbors.size());
                        IntIterator it1 = neighbors.iterator();
                        // for (E e1 : adjList) {
                        while (it1.hasNext()) {
                            // int v2 = (e1.to() == v1) ? e1.from() : e1.to();
                            int v2 = it1.nextInt();
                            
                            IntIterator it2 = neighbors.iterator();
                            // for (Edge e2 : graph.getAdjacencyList(v1)) {
                            while (it2.hasNext()) {
                                int v3 = it2.nextInt();
                                if (v2 == v3)
                                    break;

View Full Code Here

Examples of edu.ucla.sspace.util.primitive.IntSet

     * @return the similarity of the edges.a
     */
    protected <E extends Edge> double getConnectionSimilarity(
            Graph<E> graph, int keystone, int impost1, int impost2) {
        
        IntSet n1 = graph.getNeighbors(impost1);
        IntSet n2 = graph.getNeighbors(impost2);
        int n1size = n1.size();
        int n2size = n2.size();
        // Swap based on size prior to searching for which vertices are in
        // common
        if (n1size > n2size) {
            IntSet tmp = n2;
            n2 = n1;
            n1 = tmp;
            int t = impost1;
            impost1 = impost2;
            impost2 = t;

View Full Code Here

Examples of edu.ucla.sspace.util.primitive.IntSet

    /**
     * {@inheritDoc}
     */
    public IntSet predecessors(int vertex) {
        Set<T> in = inEdges(vertex);
        IntSet preds = new TroveIntSet();
        if (in.isEmpty()) 
            return preds;
        for (T e : in)
            preds.add(e.from());
        return preds;
    }

View Full Code Here

Examples of edu.ucla.sspace.util.primitive.IntSet

    /**
     * {@inheritDoc}
     */
    public IntSet successors(int vertex) {
        Set<T> out = outEdges(vertex);
        IntSet succs = new TroveIntSet();
        if (out.isEmpty())
            return succs;
        for (T e : out)
            succs.add(e.to());
        return succs;
    }

View Full Code Here

Examples of it.unimi.dsi.fastutil.ints.IntSet

      _numIter = numIter;
      _collector = statsCollector;


      int maxDoc = reader.maxDoc();


      IntSet idSet = new IntOpenHashSet();
      while (idSet.size() < numToFetch) {
        int docid = _rand.nextInt(maxDoc);
        if (!idSet.contains(docid) && !reader.isDeleted(docid)) {
          idSet.add(docid);
        }
      }


      docsToFetch = idSet.toIntArray();
    }

View Full Code Here

Examples of it.unimi.dsi.fastutil.ints.IntSet

        }  
      }
    }
    
    public int[] convert(FacetDataCache dataCache, String[] vals) {
      IntSet intSet = new IntOpenHashSet();
        getFilters(dataCache,intSet,vals, _depth, _strict);
        return intSet.toIntArray();
    }

View Full Code Here

0 1 2 3 4 5 6

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.