private void AddElement(long element)
{
if (_removed.Empty || !_removed.remove(element))
{
_added.add(element);
}
}
private bool RemoveElement(long element)
{
if (!_added.Empty && _added.remove(element))
{
return(true);
}
return(_removed.add(element));
}
internal static void AssertFoundRelationships(RelationshipIndexCursor edge, int edges, MutableLongSet uniqueIds)
{
for (int i = 0; i < edges; i++)
{
assertTrue("at least " + edges + " relationships", edge.Next());
assertTrue(uniqueIds.add(edge.RelationshipReference()));
}
assertFalse("no more than " + edges + " relationships", edge.Next());
}
internal static void AssertNodeCount(NodeIndexCursor node, int expectedCount, MutableLongSet uniqueIds)
{
uniqueIds.clear();
for (int i = 0; i < expectedCount; i++)
{
assertTrue("at least " + expectedCount + " nodes", node.Next());
assertTrue(uniqueIds.add(node.NodeReference()));
}
assertFalse("no more than " + expectedCount + " nodes", node.Next());
}
internal static void AssertNodes(NodeIndexCursor node, MutableLongSet uniqueIds, params long[] expected)
{
uniqueIds.clear();
foreach (long count in expected)
{
assertTrue("at least " + expected.Length + " nodes", node.Next());
assertTrue(uniqueIds.add(node.NodeReference()));
}
assertFalse("no more than " + expected.Length + " nodes", node.Next());
assertEquals("all nodes are unique", expected.Length, uniqueIds.size());
foreach (long expectedNode in expected)
{
assertTrue("expected node " + expectedNode, uniqueIds.contains(expectedNode));
}
}
public override bool Check(TraversalBranch branch)
{
return(_visited.add(Type.getId(branch)));
}
public override void Node(long id)
{
_nodeIds.add(id);
}
public override void Property(long id)
{
_propertyIds.add(id);
}
public override void Relationship(long id)
{
_relationshipIds.add(id);
}
public override void SchemaIndex(long id)
{
_schemaIndexesIds.add(id);
}