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 void close() { set.close(); } }
@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(); } }
@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(); } }
public static PrimitiveLongSet asSet( long... values ) { PrimitiveLongSet result = Primitive.longSet( values.length ); for ( long value: values ) { result.add( value ); } return result; }
results.add(result); } else { allNodes.add(node.getId()); PrimitiveLongIterator it = allNodes.iterator(); while (it.hasNext()) { try { long n = it.next(); List<CCVar> result = new LinkedList<CCVar>(); PrimitiveLongIterator reachableIDs = go(db.getNodeById(n), Direction.BOTH,result).iterator(); while (reachableIDs.hasNext()) { long id = (long) reachableIDs.next(); allNodes.remove(id); break; it = allNodes.iterator(); allNodes.close(); return results.stream().map((x) ->new CCResult( x.stream().map((z) -> new Long(z.getId())).collect(Collectors.toList()), x.stream().collect(Collectors.groupingBy(CCVar::getType)).entrySet().stream().collect(Collectors.toMap( e -> e.getKey(),
private static void assertQueryResultsMatch( ScoreEntityIterator result, long[] ids ) { PrimitiveLongSet set = PrimitiveLongCollections.setOf( ids ); while ( result.hasNext() ) { long next = result.next().entityId(); assertTrue( format( "Result returned node id %d, expected one of %s", next, Arrays.toString( ids ) ), set.remove( next ) ); } if ( !set.isEmpty() ) { List<Long> list = new ArrayList<>(); set.visitKeys( k -> !list.add( k ) ); fail( "Number of results differ from expected. " + set.size() + " IDs were not found in the result: " + list ); } }
for ( long key: valuesToAdd ) set.add( key ); expectedValues.add( key ); boolean existedBefore = set.contains( 679990875 ); boolean added = set.add( 679990875 ); boolean existsAfter = set.contains( 679990875 ); assertFalse( existedBefore, "679990875 should not exist before adding here" ); assertTrue( added, "679990875 should be reported as added here" ); set.visitKeys( value ->
/** * Convert primitive set into a plain old java {@link Set}, boxing each long. * * @param set {@link PrimitiveLongSet} set of primitive values. * @return a {@link Set} containing all items. */ public static Set<Long> toSet( PrimitiveLongSet set ) { return toSet( set.iterator() ); }
@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() ); }
@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 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(); } }
public static PrimitiveLongSet asSet( Collection<Long> collection ) { PrimitiveLongSet set = Primitive.longSet( collection.size() ); for ( Long next: collection ) { set.add( 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 existedBefore = set.contains( 2095121629 ); boolean added = set.add( 2095121629 ); boolean existsAfter = set.contains( 2095121629 ); assertFalse( existedBefore, "2095121629 should not exist before adding here" ); assertTrue( added, "2095121629 should be reported as added here" );
/** * Convert primitive set into a plain old java {@link Set}, boxing each long. * * @param set {@link PrimitiveLongSet} set of primitive values. * @return a {@link Set} containing all items. */ public static Set<Long> toSet( PrimitiveLongSet set ) { return toSet( set.iterator() ); }
@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() ); }