public static PrimitiveLongSet asSet( long... values ) { PrimitiveLongSet result = Primitive.longSet( values.length ); for ( long value: values ) { result.add( value ); } return result; }
public static PrimitiveLongSet asSet( Collection<Long> collection ) { PrimitiveLongSet set = Primitive.longSet( collection.size() ); for ( Long next: collection ) { set.add( next ); } return set; }
public static PrimitiveLongSet setOf( long... values ) { Objects.requireNonNull( values, "Values array is null" ); PrimitiveLongSet set = Primitive.longSet( values.length ); for ( long value: values ) { set.add( value ); } return set; }
/** * Produce a random long that hasn't been seen before by any test. */ private static long randomLong() { long n; do { n = ThreadLocalRandom.current().nextLong(); } while ( n == -1 || !observedRandomLongs.add( n ) ); return n; }
public static PrimitiveLongSet asSet( PrimitiveLongIterator iterator ) { PrimitiveLongSet set = Primitive.longSet(); while ( iterator.hasNext() ) { set.add( iterator.next() ); } return set; }
set.add( 492321488 ); set.add( 877087251 ); set.add( 1809668113 ); set.add( 1766034186 ); set.add( 1879253467 ); set.add( 669295491 ); set.add( 176011165 ); set.add( 1638959981 ); set.add( 1093132636 ); set.add( 6133241 ); set.add( 486112773 ); set.add( 205218385 ); set.add( 1756491867 ); set.add( 90390732 ); set.add( 937266036 ); set.add( 1269020584 ); set.add( 521469166 ); set.add( 1314928747 ); boolean added = set.add( 2095121629 ); boolean existsAfter = set.contains( 2095121629 ); assertFalse( existedBefore, "2095121629 should not exist before adding here" );
set.add( 375712513 ); set.remove( 1507941820 ); set.add( 671750317 ); set.remove( 1054641019 ); set.add( 671750317 ); set.add( 1768202223 ); set.add( 1768202223 ); set.add( 1927780165 ); set.add( 2139399764 ); set.remove( 1243370828 ); set.add( 1768202223 ); set.add( 1335041891 ); set.remove( 1578984313 ); set.add( 1227954408 ); set.remove( 946917826 ); set.add( 1768202223 ); set.add( 375712513 ); set.add( 1668515054 ); set.add( 401047579 ); set.add( 33226244 ); set.add( 126791689 ); set.add( 401047579 ); set.add( 1963437853 ); set.add( 1739617766 ); set.add( 671750317 ); set.add( 401047579 ); set.add( 789094467 ); set.add( 1291421506 ); set.add( 1694968582 );
@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(); } }
set.add( 52450040186687566L ); set.add( 52450040186687566L ); set.add( 5165002753277288833L ); set.add( 4276883133717080762L ); set.add( 5547940863757133161L ); set.add( 8933830774911919116L ); set.add( 3298254474623565974L ); set.add( 3366017425691021883L ); set.add( 8933830774911919116L ); set.add( 2962608069916354604L ); set.add( 3366017425691021883L ); set.remove( 4008464697042048519L ); set.add( 5547940863757133161L ); set.add( 52450040186687566L ); set.add( 4276883133717080762L ); set.remove( 3298254474623565974L ); set.remove( 180852386934131061L ); set.add( 4835176885665539239L ); set.add( 52450040186687566L ); set.add( 4591251124405056753L ); set.add( 5165002753277288833L ); set.add( 8933830774911919116L ); set.remove( 3458250832356869483L ); set.add( 3038543946711308923L ); set.add( 8743060827282266460L ); set.add( 5771902951077476377L ); set.add( 4591251124405056753L ); set.add( 4835176885665539239L ); set.remove( 4827343064671369647L );
public static PrimitiveLongSet asSet( PrimitiveLongSet set ) { PrimitiveLongSet result = Primitive.longSet( set.size() ); PrimitiveLongIterator iterator = set.iterator(); while ( iterator.hasNext() ) { result.add( iterator.next() ); } return result; }
@SuppressWarnings( "unchecked" ) @Test void longVisitorShouldSeeAllEntriesIfItDoesNotBreakOut() { // GIVEN PrimitiveLongSet set = Primitive.longSet(); set.add( 1 ); set.add( 2 ); set.add( 3 ); PrimitiveLongVisitor<RuntimeException> visitor = mock( PrimitiveLongVisitor.class ); // WHEN set.visitKeys( visitor ); // THEN verify( visitor ).visited( 1 ); verify( visitor ).visited( 2 ); verify( visitor ).visited( 3 ); verifyNoMoreInteractions( visitor ); }
private static int figureOutGrowthThreshold() { final AtomicBoolean grew = new AtomicBoolean(); Monitor monitor = new Monitor.Adapter() { @Override public boolean tableGrew( int fromCapacity, int toCapacity, int currentSize ) { grew.set( true ); return true; } }; try ( PrimitiveLongSet set = new PrimitiveLongHashSet( new LongKeyTable<>( DEFAULT_H, VALUE_MARKER ), VALUE_MARKER, monitor ) ) { int i = 0; for ( i = 0; !grew.get(); i++ ) { set.add( i * 3 ); } return i; } } }
@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" ); }
@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 shouldHandlePathologicalSequenceCase() { // Given PrimitiveLongSet set = Primitive.longSet(); Sequence seqGen = new Sequence(); // When for ( int i = 0; i < 10000; i++ ) { set.add( seqGen.next() ); } }
private void verifyNodeData( FulltextIndexProvider provider, long thirdNodeid ) throws Exception { try ( Transaction tx = db.beginTx() ) { KernelTransaction ktx = LuceneFulltextTestSupport.kernelTransaction( tx ); ScoreEntityIterator result = provider.query( ktx, "fulltext", "value" ); assertTrue( result.hasNext() ); assertEquals( 0L, result.next().entityId() ); assertFalse( result.hasNext() ); result = provider.query( ktx, "fulltext", "villa" ); assertTrue( result.hasNext() ); assertEquals( thirdNodeid, result.next().entityId() ); assertFalse( result.hasNext() ); result = provider.query( ktx, "fulltext", "value3" ); PrimitiveLongSet ids = Primitive.longSet(); ids.add( 0L ); ids.add( thirdNodeid ); assertTrue( result.hasNext() ); assertTrue( ids.remove( result.next().entityId() ) ); assertTrue( result.hasNext() ); assertTrue( ids.remove( result.next().entityId() ) ); assertFalse( result.hasNext() ); tx.success(); } }
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; } }
results.add(result); } else { allNodes.add(node.getId());