Package gnu.trove.set.hash

Examples of gnu.trove.set.hash.TIntHashSet$TIntHashIterator

447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
        for ( int i = 0; i < keyset.size(); i++ ) {
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );

        TIntCollection test_collection = new TIntHashSet();
        for ( int i = 0; i < element_count; i++ ) {
            test_collection.add( keys[i] );
        }
        assertTrue( keyset.containsAll( test_collection ) ) ;
        assertTrue( keyset.equals( keyset ) );

        test_collection.remove( Integer.valueOf( keys[5] ) );
        assertTrue( "should contain all. keyset: " + keyset + ", " + test_collection,
                keyset.containsAll( test_collection ) );

        test_collection.add( 1138 );
        assertFalse( "should not contain all. keyset: " + keyset + ", " + test_collection,
                keyset.containsAll( test_collection ) );
    }
View Full Code Here
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
        for ( int i = 0; i < keyset.size(); i++ ) {
            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};
        TIntSet unequal = new TIntHashSet();
        unequal.addAll( mismatched );

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

        // Change length, different code branch
        unequal.add( 1 );
        assertFalse( "sets incorrectly equal: " + keyset + ", " + unequal,
                keyset.equals( unequal ) );

        //noinspection ObjectEqualsNull
        assertFalse( keyset.equals( null ) );
View Full Code Here
821
822
823
824
825
826
827
828
829
        }
        assertFalse( keyset.isEmpty() );

        assertEquals( keyset.hashCode(), keyset.hashCode() );

        TIntSet other = new TIntHashSet( keys );
        other.add( 1138 );
        assertTrue( keyset.hashCode() != other.hashCode() );
    }
View Full Code Here
323
324
325
326
327
328
329
330
331
332
333
334
335
            assertEquals( keys_array[count], key );
            count++;
        }
        assertEquals( keyset.getNoEntryValue(), keys_array[keyset.size()] );

        TIntSet other = new TIntHashSet( keyset );
        assertFalse( keyset.retainAll( other ) );
        other.remove( keys[5] );
        assertTrue( keyset.retainAll( other ) );
        assertFalse( keyset.contains( keys[5] ) );
        assertFalse( map.containsKey( keys[5] ) );

        keyset.clear();
View Full Code Here
373
374
375
376
377
378
379
380
381
382
383
384
        catch ( UnsupportedOperationException ex ) {
            // Expected
        }

        try {
            TIntSet test = new TIntHashSet();
            test.add( 1138 );
            keyset.addAll( test );
            fail( "Expected UnsupportedOperationException" );
        }
        catch ( UnsupportedOperationException ex ) {
            // Expected
View Full Code Here
349
350
351
352
353
354
355
356
357
358
359
            assertEquals(keys_array[count], key);
            count++;
        }
        assertNull(keys_array[keyset.size()]);

        TIntSet raw_other = new TIntHashSet(keyset);
        Set<Integer> other = TDecorators.wrap(raw_other);
        assertFalse(keyset.retainAll(other));
        other.remove(keys[5]);
        assertTrue(keyset.retainAll(other));
        assertFalse(keyset.contains(keys[5]));
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
  }


  public void testUnmodifiableSet() {
    final TIntSet one = new TIntHashSet( new int[]{ 1, 2, 3, 4 } );
    final TIntSet two = new TIntHashSet( new int[]{ 1, 2, 3, 4 } );
    TIntSet uOne = TCollections.unmodifiableSet( one );
    TIntSet uTwo = TCollections.unmodifiableSet( two );

    assertEquals( one, two );
    assertEquals( uOne, uTwo );
View Full Code Here
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
        if (toIsSymbolic)
            newTo = mapping.getSign() ? Tensors.negate(to) : to;
        else {
            if (possiblyAddsDummies) {
                if (forbidden.forbidden == null)
                    forbidden.forbidden = new TIntHashSet(iterator.getForbidden());

                TIntHashSet remainderIndices = new TIntHashSet(forbidden.forbidden);
                remainderIndices.addAll(getAllIndicesNamesT(indexlessRemainder));
                remainderIndices.addAll(getAllIndicesNamesT(dataRemainderT));
                newTo = applyIndexMapping(to, mapping, remainderIndices.toArray());
                forbidden.forbidden.addAll(getAllIndicesNamesT(newTo));
            } else {
                TIntHashSet allowed = new TIntHashSet();
                for (int index : indexlessBijection)
                    allowed.addAll(TensorUtils.getAllDummyIndicesT(content.indexless[index]));
                IndicesBuilder ib = new IndicesBuilder();
                for (int index : dataBijection) {
                    allowed.addAll(TensorUtils.getAllDummyIndicesT(currentData[index]));
                    ib.append(currentData[index]);
                }
                allowed.addAll(ib.getIndices().getNamesOfDummies());
                allowed.removeAll(IndicesUtils.getIndicesNames(mapping.getToData()));
                newTo = applyIndexMappingAndRenameAllDummies(to, mapping, allowed.toArray());
            }
        }
        return new SubsResult(newTo, remainder);
    }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
        if (supposeIndicesAreAdded) {
            StackPosition<ForbiddenContainer> previous = innerIterator.currentStackPosition().previous();
            if (previous != null) {

                TIntHashSet oldDummyIndices = TensorUtils.getAllDummyIndicesT(oldTensor);
                TIntHashSet newDummyIndices = TensorUtils.getAllDummyIndicesT(tensor);

                TIntHashSet added = new TIntHashSet(newDummyIndices);
                added.removeAll(oldDummyIndices);

                if (!added.isEmpty() || previous.isPayloadInitialized()) {
                    ForbiddenContainer fc = previous.getPayload();

                    TIntHashSet removed = new TIntHashSet(oldDummyIndices);
                    removed.removeAll(newDummyIndices);

                    fc.submit(removed, added);
                }
            }
        }
View Full Code Here
192
193
194
195
196
197
198
199
200
201
        public abstract void insureInitialized();

        @Override
        public TIntSet getForbidden() {
            insureInitialized();
            TIntHashSet result = new TIntHashSet(forbidden);
//            result.removeAll(TensorUtils.getAllIndicesNamesT(position.tensor.get(currentBranch)));
            result.removeAll(TensorUtils.getAllIndicesNamesT(tensor.get(position.currentIndex())));
            return result;
        }
View Full Code Here
TOP

Related Classes of gnu.trove.set.hash.TIntHashSet$TIntHashIterator

  • bgu.bio.algorithms.graphs.TestHSAOnInteger
  • cc.redberry.core.groups.permutations.PermutationGroup
  • cc.redberry.core.parser.ParseTokenDerivative
  • cc.redberry.core.parser.ParseUtils
  • cc.redberry.core.solver.ReduceEngine
  • cc.redberry.core.tensor.ApplyIndexMapping
  • cc.redberry.core.tensor.FactorNode
  • cc.redberry.core.tensor.Product
  • cc.redberry.core.tensor.Product$MatricesPrinter
  • cc.redberry.core.tensor.random.RandomTensor
    • 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.