Examples of IntArray

beaver.comp.util.IntArray
cc.redberry.core.utils.IntArray
Immutable integer array. This class is a simple wrapper of generic array of integers. @author Dmitry Bolotin @author Stanislav Poslavsky @since 1.0
ch.akuhn.util.IntArray
Collection of integer values.
At the moment, this class is limited to growth. I might add shrinking later.
The iterator of this class is weakly consistent, thus the iterator does not throw a {@link ConcurrentModificationException} ever.
This class is not thread-safe.
@author Adrian Kuhn
com.almworks.integers.IntArray
com.badlogic.gdx.utils.IntArray
A resizable, ordered or unordered int array. Avoids the boxing that occurs with ArrayList. If unordered, this class avoids a memory copy when removing elements (the last element is moved to the removed element's position). @author Nathan Sweet
com.caucho.util.IntArray
The IntArray is a variable array containing integers. The API follows the JDK 1.2 collection classes.
com.esotericsoftware.kryo.util.IntArray
A resizable, ordered or unordered int array. Avoids the boxing that occurs with ArrayList. If unordered, this class avoids a memory copy when removing elements (the last element is moved to the removed element's position). @author Nathan Sweet
com.exigen.ie.constrainer.IntArray
It is an array-like container for the variables of type
IntExp
. The essential difference between
IntArray
and
IntExpArray
is that the former is able to use a variable of type
IntExp
as index. If an "index" in an "array" is a constrained integer expression, then the "array[index]" is also the constrained integer variable. To get the access to the element of an array using constrained index one has to use method {@link #elementAt(IntExp)}.
de.ailis.jollada.model.IntArray
Array with long integer (64bit) elements. @author Klaus Reimer (k@ailis.de)
de.esoco.j2me.util.IntArray
A dynamic array of integers that can grow and shrink to hold an arbitrary number of int values. @author eso
net.imglib2.img.basictypeaccess.array.IntArray
TODO @author Stephan Preibisch @author Stephan Saalfeld @author Stephan Saalfeld
org.antlr.runtime.misc.IntArray
A dynamic array that uses int not Integer objects. In principle this is more efficient in time, but certainly in space. This is simple enough that you can access the data array directly, but make sure that you append elements only with add() so that you get dynamic sizing. Make sure to call ensureCapacity() when you are manually adding new elements. Doesn't impl List because it doesn't return objects and I mean this really as just an array not a List per se. Manipulate the elements at will. This has stack methods too. When runtime can be 1.5, I'll make this generic.
org.antlr.runtime3_3_0.misc.IntArray
A dynamic array that uses int not Integer objects. In principle this is more efficient in time, but certainly in space. This is simple enough that you can access the data array directly, but make sure that you append elements only with add() so that you get dynamic sizing. Make sure to call ensureCapacity() when you are manually adding new elements. Doesn't impl List because it doesn't return objects and I mean this really as just an array not a List per se. Manipulate the elements at will. This has stack methods too. When runtime can be 1.5, I'll make this generic.
org.apache.lucene.facet.collections.IntArray
A Class wrapper for a grow-able int[] which can be sorted and intersect with other IntArrays. @lucene.experimental
org.apache.lucene.util.collections.IntArray
A Class wrapper for a grow-able int[] which can be sorted and intersect with other IntArrays. @lucene.experimental
org.apache.marmotta.commons.sesame.tripletable.IntArray
Add file description here!
Author: Sebastian Schaffert
org.apache.marmotta.kiwi.model.caching.IntArray
Add file description here!
Author: Sebastian Schaffert
org.eclipse.persistence.internal.libraries.antlr.runtime.misc.IntArray
A dynamic array that uses int not Integer objects. In principle this is more efficient in time, but certainly in space. This is simple enough that you can access the data array directly, but make sure that you append elements only with add() so that you get dynamic sizing. Make sure to call ensureCapacity() when you are manually adding new elements. Doesn't impl List because it doesn't return objects and I mean this really as just an array not a List per se. Manipulate the elements at will. This has stack methods too. When runtime can be 1.5, I'll make this generic.
org.elasticsearch.common.util.IntArray
Abstraction of an array of integer values.
org.h2.util.IntArray
An array with integer element.
org.lealone.util.IntArray
An array with integer element.

Examples of org.lealone.util.IntArray


    public synchronized double getCost(Session session, int[] masks, SortOrder sortOrder) {
        if (recursive) {
            return 1000;
        }
        IntArray masksArray = new IntArray(masks == null ? Utils.EMPTY_INT_ARRAY : masks);
        SynchronizedVerifier.check(costCache);
        CostElement cachedCost = costCache.get(masksArray);
        if (cachedCost != null) {
            long time = System.currentTimeMillis();
            if (time < cachedCost.evaluatedAt + Constants.VIEW_COST_CACHE_MAX_AGE) {
                return cachedCost.cost;
            }
        }
        Query q = (Query) session.prepare(querySQL, true);
        if (masks != null) {
            IntArray paramIndex = new IntArray();
            for (int i = 0; i < masks.length; i++) {
                int mask = masks[i];
                if (mask == 0) {
                    continue;
                }
                paramIndex.add(i);
            }
            int len = paramIndex.size();
            for (int i = 0; i < len; i++) {
                int idx = paramIndex.get(i);
                int mask = masks[idx];
                int nextParamIndex = q.getParameters().size() + view.getParameterOffset();
                if ((mask & IndexCondition.EQUALITY) != 0) {
                    Parameter param = new Parameter(nextParamIndex);
                    q.addGlobalCondition(param, idx, Comparison.EQUAL_NULL_SAFE);

View Full Code Here

Examples of org.lealone.util.IntArray

        if (!q.allowGlobalConditions()) {
            return q;
        }
        int firstIndexParam = originalParameters == null ? 0 : originalParameters.size();
        firstIndexParam += view.getParameterOffset();
        IntArray paramIndex = new IntArray();
        int indexColumnCount = 0;
        for (int i = 0; i < masks.length; i++) {
            int mask = masks[i];
            if (mask == 0) {
                continue;
            }
            indexColumnCount++;
            paramIndex.add(i);
            if (Integer.bitCount(mask) > 1) {
                // two parameters for range queries: >= x AND <= y
                paramIndex.add(i);
            }
        }
        int len = paramIndex.size();
        ArrayList<Column> columnList = New.arrayList();
        for (int i = 0; i < len;) {
            int idx = paramIndex.get(i);
            columnList.add(table.getColumn(idx));
            int mask = masks[idx];
            if ((mask & IndexCondition.EQUALITY) == IndexCondition.EQUALITY) {
                Parameter param = new Parameter(firstIndexParam + i);
                q.addGlobalCondition(param, idx, Comparison.EQUAL_NULL_SAFE);

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.