NodesAndNeighborsIterator.java

/*
 * Copyright © 2012-2013 The University of Texas at Dallas
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package edu.utdallas.cs.stormrider.store.iterator.impl;

import com.hp.hpl.jena.query.QuerySolution;
import com.hp.hpl.jena.query.ResultSet;

import edu.utdallas.cs.stormrider.store.iterator.AbstractIterator;

public class NodesAndNeighborsIterator extends AbstractIterator<NodeAndNeighbor>
{
	private ResultSet rs = null ;
	
	public NodesAndNeighborsIterator( ResultSet rs ) { this.rs = rs ; }
	
	@Override
	public NodeAndNeighbor _next()
	{
		NodeAndNeighbor nn = null ;
		if( rs.hasNext() )
		{
			QuerySolution qs = rs.next() ;
			String node = qs.getResource( "?x" ).toString(), neighbor = qs.getResource( "?y" ).toString() ;
			nn = new NodeAndNeighbor( node, neighbor ) ;
		}
		return nn ;
	}
}