@Override public String apply( Sets target ) { try { boolean alreadyExisting = target.normalSet.contains( value ); PrimitiveLongSet set = target.set; boolean existedBefore = set.contains( value ); boolean added = set.add( value ); boolean existsAfter = set.contains( value ); target.normalSet.add( value ); boolean ok = (existedBefore == alreadyExisting) & (added == !alreadyExisting) & existsAfter; return ok ? null : "" + value + alreadyExisting + "," + existedBefore + "," + added + "," + existsAfter; } catch ( Exception e ) { return "exception:" + e.getMessage(); } }
@Override public String apply( Sets target ) { try { boolean alreadyExisting = target.normalSet.contains( value ); PrimitiveLongSet set = target.set; boolean existedBefore = set.contains( value ); boolean removed = set.remove( value ); boolean existsAfter = set.contains( value ); target.normalSet.remove( value ); boolean ok = (existedBefore == alreadyExisting) & (removed == alreadyExisting) & !existsAfter; return ok ? null : "" + value + alreadyExisting + "," + existedBefore + "," + removed + "," + existsAfter; } catch ( Exception e ) { return "exception: " + e.getMessage(); } }
@Test void iteratorAsSet() { // GIVEN PrimitiveLongIterator items = PrimitiveLongCollections.iterator( 1, 2, 3 ); // WHEN PrimitiveLongSet set = PrimitiveLongCollections.asSet( items ); // THEN assertTrue( set.contains( 1 ) ); assertTrue( set.contains( 2 ) ); assertTrue( set.contains( 3 ) ); assertFalse( set.contains( 4 ) ); }
@Test void convertJavaCollectionToSetOfPrimitives() { List<Long> longs = asList( 1L, 4L, 7L ); PrimitiveLongSet longSet = PrimitiveLongCollections.asSet( longs ); assertTrue( longSet.contains( 1L ) ); assertTrue( longSet.contains( 4L ) ); assertTrue( longSet.contains( 7L ) ); assertEquals( 3, longSet.size() ); }
@Test void shouldHandleEmptySet() { // GIVEN PrimitiveLongSet set = Primitive.longSet( 0 ); // THEN assertFalse( set.contains( 564 ) ); }
@Test void copyPrimitiveSet() { PrimitiveLongSet longSet = PrimitiveLongCollections.setOf( 1L, 3L, 5L ); PrimitiveLongSet copySet = PrimitiveLongCollections.asSet( longSet ); assertNotSame( copySet, longSet ); assertTrue( copySet.contains( 1L ) ); assertTrue( copySet.contains( 3L ) ); assertTrue( copySet.contains( 5L ) ); assertEquals( 3, copySet.size() ); }
@Test void shouldContainReallyBigLongValue() { // GIVEN PrimitiveLongSet set = newSet( 10 ); set.add( 7416509207113022571L ); // WHEN/THEN boolean existedBefore = set.contains( 7620037383187366331L ); boolean added = set.add( 7620037383187366331L ); boolean existsAfter = set.contains( 7620037383187366331L ); assertFalse( existedBefore, "7620037383187366331 should not exist before adding here" ); assertTrue( added, "7620037383187366331 should be reported as added here" ); assertTrue( existsAfter, "7620037383187366331 should exist" ); }
@Test void shouldContainAddedValues_generated_4() { // GIVEN PrimitiveLongSet set = newSet( 9 ); set.add( 1934106304 ); set.add( 783754072 ); set.remove( 1934106304 ); // WHEN/THEN boolean existedBefore = set.contains( 783754072 ); boolean added = set.add( 783754072 ); boolean existsAfter = set.contains( 783754072 ); assertTrue( existedBefore, "783754072 should exist before adding here" ); assertFalse( added, "783754072 should not be reported as added here" ); assertTrue( existsAfter, "783754072 should exist" ); }
private PrimitiveLongSet go(Node node, Direction direction, List<CCVar> result) { PrimitiveLongSet visitedIDs = Primitive.longSet(0); Stack<Node> frontierList = new Stack<Node>(); frontierList.push(node); visitedIDs.add(node.getId()); result.add(new CCVar(node.getId()+"",node.getLabels().iterator().next().name())); while (!frontierList.isEmpty()) { node = frontierList.pop(); Iterator<Relationship> itR = node.getRelationships(direction).iterator(); while (itR.hasNext()) { Node child = itR.next().getOtherNode(node); if (visitedIDs.contains(child.getId())) { continue; } visitedIDs.add(child.getId()); frontierList.push(child); result.add(new CCVar(child.getId()+"",child.getLabels().iterator().next().name())); } } return visitedIDs; } }
boolean existedBefore = set.contains( 1103190229303827372L ); boolean added = set.add( 1103190229303827372L ); boolean existsAfter = set.contains( 1103190229303827372L ); assertFalse( existedBefore, "1103190229303827372 should not exist before adding here" ); assertTrue( added, "1103190229303827372 should be reported as added here" );