Created
December 21, 2013 15:08
-
-
Save maxdemarzi/8070560 to your computer and use it in GitHub Desktop.
Test running for 60 seconds, after 2x warm-ups: Using OpenBitSet: 265 requests, 4/s, mean 1831ms.
Using HashSet: 173 requests, 3/s, mean 2807ms.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Copyright (c) 2002-2013 "Neo Technology," | |
* Network Engine for Objects in Lund AB [http://neotechnology.com] | |
* | |
* This file is part of Neo4j. | |
* | |
* Neo4j is free software: you can redistribute it and/or modify | |
* it under the terms of the GNU General Public License as published by | |
* the Free Software Foundation, either version 3 of the License, or | |
* (at your option) any later version. | |
* | |
* This program is distributed in the hope that it will be useful, | |
* but WITHOUT ANY WARRANTY; without even the implied warranty of | |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
* GNU General Public License for more details. | |
* | |
* You should have received a copy of the GNU General Public License | |
* along with this program. If not, see <http://www.gnu.org/licenses/>. | |
*/ | |
package org.neo4j.kernel; | |
import org.apache.lucene.util.OpenBitSet; | |
import org.neo4j.graphdb.Path; | |
import org.neo4j.graphdb.traversal.TraversalBranch; | |
class GloballyUnique extends AbstractUniquenessFilter | |
{ | |
private final OpenBitSet visited = new OpenBitSet(); | |
GloballyUnique( PrimitiveTypeFetcher type ) | |
{ | |
super( type ); | |
} | |
public boolean check( TraversalBranch branch ) | |
{ | |
if ( visited.get( type.getId( branch ) ) ) { | |
return false; | |
} else { | |
visited.set( type.getId( branch ) ); | |
return true; | |
} | |
} | |
@Override | |
public boolean checkFull( Path path ) | |
{ | |
// Since this is for bidirectional uniqueness checks and | |
// uniqueness is enforced through the shared "visited" set | |
// this uniqueness contract is fulfilled automatically. | |
return true; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment