Package gnu.trove.set.hash

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

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
182
183
184
185
186
187
188
189
190
191
192
      // for inner nodes, recurse
      for (ConcRel child : concept.getChildren()) {
        // if we've already visited a node, then don't bother adding
        // that node's leaves - we already have them
        if (!visitedNodesLocal.contains(child.getNodeIndex())) {
          leaves.addAll(getLeaves(child, leafCache, icInfoMap, cg, w,
              visitedNodesLocal));
        }
      }
      // add this node to the set of visited nodes so we know not to
      // revisit. This is only of importance if the caller gave us
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
        }

        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
129
130
131
132
133
134
135
136
137
138
139
        }

        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
175
176
177
178
179
180
181
182
183
184
185
        }

        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
88
89
90
91
92
93
94
95
96
97
98
                    indices = new int[var.getIndices().size()];

                    //lazy initialization
                    if (indices.length != 0 && ig == null) {
                        TIntHashSet forbidden = new TIntHashSet(iterator.getForbidden());
                        forbidden.addAll(TensorUtils.getAllIndicesNamesT(this.from));
                        forbidden.addAll(TensorUtils.getAllIndicesNamesT(this.to));
                        ig = new IndexGeneratorImpl(forbidden.toArray());

                    }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
                    //lazy initialization
                    if (indices.length != 0 && ig == null) {
                        TIntHashSet forbidden = new TIntHashSet(iterator.getForbidden());
                        forbidden.addAll(TensorUtils.getAllIndicesNamesT(this.from));
                        forbidden.addAll(TensorUtils.getAllIndicesNamesT(this.to));
                        ig = new IndexGeneratorImpl(forbidden.toArray());

                    }

                    for (j = indices.length - 1; j >= 0; --j)
View Full Code Here
390
391
392
393
394
395
396
397
398
399
400
        }

        TIntHashSet forbidden = new TIntHashSet();
        for (int[] sp : indicesSpace) {
            forbidden.ensureCapacity(sp.length);
            forbidden.addAll(IndicesUtils.getIndicesNames(sp));
        }

        //Creating resulting product
        ProductBuilder pb = new ProductBuilder(10, productSize);
        for (Tensor descriptor : descriptors) {
View Full Code Here
417
418
419
420
421
422
423
424
425
426
427
            }

            descriptor = ApplyIndexMapping.applyIndexMapping(descriptor,
                    new Mapping(free.getAllIndices().copy(), factorIndices), forbidden.toArray());
            descriptor = ApplyIndexMapping.renameDummy(descriptor, forbidden.toArray());
            forbidden.addAll(TensorUtils.getAllIndicesNamesT(descriptor));

            pb.put(descriptor);
        }

View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
        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
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.