Package gnu.trove.set.hash

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

778
779
780
781
782
783
784
785
786
787
788
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );

        TIntSet other = new TIntHashSet();
        other.addAll( keys );

        assertTrue( "sets incorrectly not equal: " + keyset + ", " + other,
                keyset.equals( other ) );

        int[] mismatched = {72, 49, 53, 1024, 999};
View Full Code Here
785
786
787
788
789
790
791
792
793
794
795
        assertTrue( "sets incorrectly not equal: " + keyset + ", " + other,
                keyset.equals( other ) );

        int[] mismatched = {72, 49, 53, 1024, 999};
        TIntSet unequal = new TIntHashSet();
        unequal.addAll( mismatched );

        assertFalse( "sets incorrectly equal: " + keyset + ", " + unequal,
                keyset.equals( unequal ) );

        // Change length, different code branch
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
        Tensor newTo;
        if (toIsSymbolic)
            newTo = mapping.getSign() ? Tensors.negate(to) : to;
        else {
            TIntHashSet remainderIndices = new TIntHashSet(forbidden);
            remainderIndices.addAll(getAllIndicesNamesT(indexlessRemainder));
            remainderIndices.addAll(getAllIndicesNamesT(dataRemainderT));
            newTo = applyIndexMapping(to, mapping, remainderIndices.toArray());
            forbidden.addAll(getAllIndicesNamesT(newTo));
        }
        return new SubsResult(newTo, remainder);
View Full Code Here
254
255
256
257
258
259
260
261
262
263
264
        if (toIsSymbolic)
            newTo = mapping.getSign() ? Tensors.negate(to) : to;
        else {
            TIntHashSet remainderIndices = new TIntHashSet(forbidden);
            remainderIndices.addAll(getAllIndicesNamesT(indexlessRemainder));
            remainderIndices.addAll(getAllIndicesNamesT(dataRemainderT));
            newTo = applyIndexMapping(to, mapping, remainderIndices.toArray());
            forbidden.addAll(getAllIndicesNamesT(newTo));
        }
        return new SubsResult(newTo, remainder);
    }
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
        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
166
167
168
169
170
171
172
173
174
175
176
        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
177
178
179
180
181
182
183
184
185
186
187
        int toResolvePosition = toResolve.size();
        for (i = factors.length - 1; i >= 0; --i)
            if (result[i] == null) {
                factor = toResolve.get(--toResolvePosition);
                newFactor = ApplyIndexMapping.renameDummy(factor, forbidden.toArray());
                forbidden.addAll(TensorUtils.getAllIndicesNamesT(newFactor));
                result[i] = newFactor;
            }
//        for (int i = toResolve.size() - 1; i >= 0; --i) {
//            factor = toResolve.get(i);
//            newFactor = ApplyIndexMapping.renameDummy(factor, forbidden.toArray());
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
        SimpleTensor[] resolvedVars = vars;
        if (needRename) {
            TIntHashSet forbidden = TensorUtils.getAllIndicesNamesT(tensor);
            for (SimpleTensor var : vars)
                forbidden.addAll(getIndicesNames(var.getIndices().getFree()));

            resolvedVars = vars.clone();
            for (int i = 0; i < vars.length; ++i)
                if (!forbidden.isEmpty() && resolvedVars[i].getIndices().size() != 0) {
                    if (resolvedVars[i].getIndices().size() != resolvedVars[i].getIndices().getFree().size())
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
            resolvedVars = vars.clone();
            for (int i = 0; i < vars.length; ++i)
                if (!forbidden.isEmpty() && resolvedVars[i].getIndices().size() != 0) {
                    if (resolvedVars[i].getIndices().size() != resolvedVars[i].getIndices().getFree().size())
                        resolvedVars[i] = (SimpleTensor) renameDummy(resolvedVars[i], forbidden.toArray());
                    forbidden.addAll(getIndicesNames(resolvedVars[i].getIndices()));
                }
            tensor = renameDummy(tensor, TensorUtils.getAllIndicesNamesT(resolvedVars).toArray(), forbidden);
            tensor = renameIndicesOfFieldsArguments(tensor, forbidden);
        }
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
    private static Tensor differentiate(Tensor tensor, Transformation[] expandAndContract, SimpleTensor var) {
        if (var.getIndices().size() != 0) {
            TIntHashSet forbidden = TensorUtils.getAllIndicesNamesT(tensor);
            var = (SimpleTensor) renameDummy(var, TensorUtils.getAllIndicesNamesT(tensor).toArray());
            forbidden.addAll(IndicesUtils.getIndicesNames(var.getIndices()));
            tensor = renameDummy(tensor, TensorUtils.getAllIndicesNamesT(var).toArray(), forbidden);
            tensor = renameIndicesOfFieldsArguments(tensor, forbidden);
        }
        return differentiate1(tensor, createRule(var), expandAndContract);
    }
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.