Package gnu.trove.set.hash

Examples of gnu.trove.set.hash.TIntHashSet.addAll()

128
129
130
131
132
133
134
135
136
137
138
        }

        if (fromL == null)
            return tensor;

        allIndicesNames.addAll(getIndicesNames(tensor.getIndices().getFree()));
        IndexGenerator generator = new IndexGenerator(allIndicesNames.toArray());
        int[] from = fromL.toArray(), to = new int[fromL.size()];
        Arrays.sort(from);
        int i;
        for (i = from.length - 1; i >= 0; --i)
View Full Code Here
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
  /**
   * Computes the union of two arrays.
   */
  public static int[] union(int[] a, int[] b) {
    TIntHashSet set = new TIntHashSet();
    set.addAll(a);
    set.addAll(b);
    return set.toArray();
  }

  /**
 
View Full Code Here
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
   * Computes the union of two arrays.
   */
  public static int[] union(int[] a, int[] b) {
    TIntHashSet set = new TIntHashSet();
    set.addAll(a);
    set.addAll(b);
    return set.toArray();
  }

  /**
   * Computes the intersection of two <b>sorted</b> arrays. Will deduplicate the
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
  private static void expand(List<DoubleVector> points,
      DistanceMeasurer measurer, TIntHashSet visited, TIntArrayList neighbours,
      List<DoubleVector> currentCluster, double epsilon, int minPoints) {
    TIntHashSet currentNeighbours = new TIntHashSet();
    currentNeighbours.addAll(currentNeighbours);
    // note that neighbours is growing while we are iterating over it
    for (int i = 0; i < neighbours.size(); i++) {
      int neighbour = neighbours.get(i);
      if (!visited.contains(neighbour)) {
        visited.add(neighbour);
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
      if (!visited.contains(neighbour)) {
        visited.add(neighbour);
        TIntArrayList expandedNeighbours = getNearestNeighbours(visited,
            currentNeighbours, points, neighbour, measurer, epsilon);
        // add the expanded list to our neighbours
        currentNeighbours.addAll(expandedNeighbours);
        neighbours.addAll(expandedNeighbours);
        // add the point to our cluster
        currentCluster.add(points.get(neighbour));
      }
    }
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
        }

        if (fromL == null)
            return tensor;

        allIndicesNames.addAll(getIndicesNames(tensor.getIndices().getFree()));
        int[] from = fromL.toArray(), to = new int[fromL.size()];
        Arrays.sort(from);
        int i;
        IndexGeneratorFromData generator = new IndexGeneratorFromData(allowedDummiesNames);
        for (i = from.length - 1; i >= 0; --i)
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
        }

        if (fromL == null)
            return tensor;

        allIndicesNames.addAll(getIndicesNames(tensor.getIndices().getFree()));
        IndexGeneratorImpl generator = new IndexGeneratorImpl(allIndicesNames.toArray());
        int[] from = fromL.toArray(), to = new int[fromL.size()];
        Arrays.sort(from);
        added.ensureCapacity(from.length);
        int i;
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
        }

        if (fromL == null)
            return tensor;

        allIndicesNames.addAll(getIndicesNames(tensor.getIndices().getFree()));
        IndexGeneratorImpl generator = new IndexGeneratorImpl(allIndicesNames.toArray());
        int[] from = fromL.toArray(), to = new int[fromL.size()];
        Arrays.sort(from);
        int i;
        for (i = from.length - 1; i >= 0; --i)
View Full Code Here
178
179
180
181
182
183
184
185
186
187
188
        int i;
        Tensor f;
        for (i = factors.length - 1; i >= 0; --i) {
            if ((f = factors[i]) instanceof Sum || f.getIndices().getFree().size() == 0) {
                toResolve.add(f);
                forbidden.addAll(f.getIndices().getFree().getAllIndices().copy());
            } else {
                forbidden.addAll(TensorUtils.getAllIndicesNamesT(f));
                result[i] = f;
            }
        }
View Full Code Here
180
181
182
183
184
185
186
187
188
189
190
        for (i = factors.length - 1; i >= 0; --i) {
            if ((f = factors[i]) instanceof Sum || f.getIndices().getFree().size() == 0) {
                toResolve.add(f);
                forbidden.addAll(f.getIndices().getFree().getAllIndices().copy());
            } else {
                forbidden.addAll(TensorUtils.getAllIndicesNamesT(f));
                result[i] = f;
            }
        }

        Tensor factor, newFactor;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.