Package stallone.ints

Examples of stallone.ints.PrimitiveIntArray

90
91
92
93
94
95
96

    public IIntArray arrayFrom(float[] a)
    {
        int[] res = PrimitiveIntTools.from(a);
        return (new PrimitiveIntArray(res));
    }
View Full Code Here
101
102
103
104
105
106
107
       is returned.
    */
    public IIntArray arrayRandomIndexes(int N, int n)
    {
        int[] res = PrimitiveIntTools.randomIndexes(N,n);
        return (new PrimitiveIntArray(res));
    }
View Full Code Here
113
114
115
116
117
118
119
    previous value by step.
     */
    public IIntArray arrayRange(int start, int end, int step)
    {
        int[] res = PrimitiveIntTools.range(start, end, step);
        return (new PrimitiveIntArray(res));
    }
View Full Code Here
124
125
126
127
128
129
130
    previous value by step.
     */
    public IIntArray arrayRange(int start, int end)
    {
        int[] res = PrimitiveIntTools.range(start, end);
        return (new PrimitiveIntArray(res));
    }
View Full Code Here
135
136
137
138
139
140
141
    previous value by step.
     */
    public IIntArray arrayRange(int end)
    {
        int[] res = PrimitiveIntTools.range(end);
        return (new PrimitiveIntArray(res));
    }
View Full Code Here
273
274
275
276
277
278
279
     * Returns an array with cluster allocations. <code>int[i]</code> is the cluster to which data point i was
     * allocated.
     */
    public IIntArray getClusters()
    {
        return(new PrimitiveIntArray(CLUSTER));
    }
View Full Code Here
281
282
283
284
285
286
287
    /**
     * Returns an array containing the number of data points in each cluster.
     */
    public IIntArray getClusterSize()
    {
        return(new PrimitiveIntArray(CLUSTER_SIZE));
    }
View Full Code Here
294
295
296
297
298
299
300
    /**
     * Returns the permutation which is needed to arrange the data points according to their cluster.
     */
    public IIntArray getPermutationArray()
    {
        return(new PrimitiveIntArray(SORTARRAY));
    }
View Full Code Here
92
93
94
95
96
97
98
99
100
101
        }

        numbers[dim-1] = 1;
        for (int i=(dim-2); i>=0; i--)
            numbers[i] = numbers[i+1] * sizes[i];
        preNeighborIndexes = new IntArrayView(new PrimitiveIntArray(dim*2), 0, dim*2);
        preMultIndex = new IntArrayView(new PrimitiveIntArray(dim), 0, dim);
        prePoint = new DoubleArrayView(doublesNew.array(dim),0, dim);
        preNeighborMultIndexes = new IntArrayView(new PrimitiveIntTable(dim*2,dim), 0, 0, dim*2, dim);
    }
View Full Code Here
TOP

Related Classes of stallone.ints.PrimitiveIntArray

  • stallone.api.ints.IIntArray
  • stallone.api.ints.IntFactory
  • stallone.discretization.Grid
  • stallone.doubles.DoubleArrayView
  • stallone.mc.MarkovChain
  • stallone.mc.pcca.PCCA
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.