/**
* 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 java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.Map;
import org.neo4j.graphdb.Direction;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.Relationship;
import org.neo4j.graphdb.RelationshipType;
import org.neo4j.helpers.Pair;
import org.neo4j.helpers.collection.MapUtil;
import org.neo4j.helpers.collection.NestingIterator;
public final class OrderedByTypeExpander extends
StandardExpander.RegularExpander
{
private final Collection<Pair<RelationshipType, Direction>> orderedTypes;
public OrderedByTypeExpander()
{
this( MapUtil.<Direction, RelationshipType[]>genericMap() );
}
OrderedByTypeExpander( Map<Direction, RelationshipType[]> types )
{
super( types );
orderedTypes = constructOrderedList( types );
}
private Collection<Pair<RelationshipType, Direction>> constructOrderedList(
Map<Direction, RelationshipType[]> types )
{
Collection<Pair<RelationshipType, Direction>> list = new ArrayList<Pair<RelationshipType,Direction>>();
for ( Map.Entry<Direction, RelationshipType[]> entry : types.entrySet() )
{
for ( RelationshipType type : entry.getValue() )
{
list.add( Pair.of( type, entry.getKey() ) );
}
}
return list;
}
@Override
RegularExpander createNew( Map<Direction, RelationshipType[]> newTypes )
{
return new OrderedByTypeExpander( newTypes );
}
@Override
Iterator<Relationship> doExpand( final Node start )
{
return new NestingIterator<Relationship, Pair<RelationshipType, Direction>>(
orderedTypes.iterator() )
{
@Override
protected Iterator<Relationship> createNestedIterator(
Pair<RelationshipType, Direction> entry )
{
RelationshipType type = entry.first();
Direction dir = entry.other();
return ( ( dir == Direction.BOTH ) ? start.getRelationships( type ) :
start.getRelationships( type, dir ) ).iterator();
}
};
}
}