Package org.apache.jena.sparql.util.graph

Class GraphList

java.lang.Object

org.apache.jena.sparql.util.graph.GraphList

public class GraphList
extends java.lang.Object

Constructor Summary

Constructors

Constructor	Description
GraphList()

Method Summary

Modifier and Type	Method	Description
static java.util.List<Triple>	allTriples(GNode gnode)
static void	allTriples(GNode gnode, java.util.Collection<Triple> acc)
static boolean	contains(GNode gnode, Node item)
static java.util.Set<Node>	findAllLists(Graph graph)	Expensive operation to find all the likely looking list heads in a model
static Node	get(GNode gnode, int idx)
static int	index(GNode gnode, Node value)
static java.util.List<java.lang.Integer>	indexes(GNode gnode, Node value)
static boolean	isListNode(GNode gnode)
static int	length(GNode gnode)
static java.util.List<Node>	listFromMember(GNode gnode)	Starting at a list element, find the heads of lists it is in
static void	listFromMember(GNode gnode, java.util.Collection<Node> acc)
static java.util.Iterator<Triple>	listMember(Graph graph, Node s, Node o)	Calculate ?s list:member ?o as if it were a graph.find
static Node	listToTriples(java.util.List<Node> list, BasicPattern bgp)	Convert a list of nodes into triples, placing them in BPG, returning the head of the list
static java.util.List<Node>	members(GNode gnode)
static void	members(GNode gnode, java.util.Collection<Node> acc)
static int	occurs(GNode gnode, Node item)
static void	triples(GNode gnode, java.util.Collection<Triple> acc)

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphList

public GraphList()

Method Detail

listFromMember

public static java.util.List<Node> listFromMember(GNode gnode)

Starting at a list element, find the heads of lists it is in

listFromMember

public static void listFromMember(GNode gnode,
                                  java.util.Collection<Node> acc)

listMember

public static java.util.Iterator<Triple> listMember(Graph graph,
                                                    Node s,
                                                    Node o)

Calculate ?s list:member ?o as if it were a graph.find

members

public static java.util.List<Node> members(GNode gnode)

members

public static void members(GNode gnode,
                           java.util.Collection<Node> acc)

length

public static int length(GNode gnode)

occurs

public static int occurs(GNode gnode,
                         Node item)

contains

public static boolean contains(GNode gnode,
                               Node item)

get

public static Node get(GNode gnode,
                       int idx)

index

public static int index(GNode gnode,
                        Node value)

indexes

public static java.util.List<java.lang.Integer> indexes(GNode gnode,
                                                        Node value)

triples

public static void triples(GNode gnode,
                           java.util.Collection<Triple> acc)

allTriples

public static java.util.List<Triple> allTriples(GNode gnode)

allTriples

public static void allTriples(GNode gnode,
                              java.util.Collection<Triple> acc)

findAllLists

public static java.util.Set<Node> findAllLists(Graph graph)

Expensive operation to find all the likely looking list heads in a model

listToTriples

public static Node listToTriples(java.util.List<Node> list,
                                 BasicPattern bgp)

Convert a list of nodes into triples, placing them in BPG, returning the head of the list

isListNode

public static boolean isListNode(GNode gnode)