Refine search
@Override protected Node[] createNodes(Quad tuple) { return new Node[] { tuple.getGraph(), tuple.getSubject(), tuple.getPredicate(), tuple.getObject() }; }
public Quad createQuad(Node o) { Node g = quad.getGraph(); Node s = quad.getSubject(); Node p = quad.getPredicate(); Quad result = new Quad(g, s, p, o); return result; }
@Override protected final void print(Quad quad) { Node g = quad.getGraph() ; Node s = quad.getSubject() ; batch(g, s, false); processQuad(quad) ; }
@Override protected Node[] createNodes(Quad tuple) { return new Node[] { tuple.getGraph(), tuple.getSubject(), tuple.getPredicate(), tuple.getObject() }; }
public Model export(Model result, ViewDefinition viewDef) { // Partition view definitions by graph and subject List<Quad> template = viewDef.getConstructTemplate(); Multimap<Entry<Node, Node>, Quad> gsToQuadsIndex = Multimaps.index(template, q -> new SimpleEntry<>(q.getGraph(), q.getSubject())); for(Entry<Entry<Node, Node>, Collection<Quad>> gsToQuads : gsToQuadsIndex.asMap().entrySet()) { Entry<Node, Node> key = gsToQuads.getKey(); Node g = key.getKey(); Node s = key.getValue(); Collection<Quad> quads = gsToQuads.getValue(); exportTriplesMapSameGraphAndSubject(result, viewDef, g, s, quads); } return result; }
public static Node[] quadToArray(Quad quad) { return new Node[] { quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject() }; }
public Model export(Model result, ViewDefinition viewDef) { // Partition view definitions by graph and subject List<Quad> template = viewDef.getConstructTemplate(); Multimap<Entry<Node, Node>, Quad> gsToQuadsIndex = Multimaps.index(template, q -> new SimpleEntry<>(q.getGraph(), q.getSubject())); for(Entry<Entry<Node, Node>, Collection<Quad>> gsToQuads : gsToQuadsIndex.asMap().entrySet()) { Entry<Node, Node> key = gsToQuads.getKey(); Node g = key.getKey(); Node s = key.getValue(); Collection<Quad> quads = gsToQuads.getValue(); exportTriplesMapSameGraphAndSubject(result, viewDef, g, s, quads); } return result; }
public static List<Node> quadToList(Quad quad) { List<Node> result = new ArrayList<Node>(); result.add(quad.getGraph()); result.add(quad.getSubject()); result.add(quad.getPredicate()); result.add(quad.getObject()); return result; }
@Override public void add(Quad quad) { store.computeIfAbsent(quad.getGraph(), g -> new LinkedHashMap<>()) .computeIfAbsent(quad.getSubject(), s -> new LinkedHashMap<>()) .computeIfAbsent(quad.getPredicate(), p -> new LinkedHashMap<>()) .computeIfAbsent(quad.getObject(), o -> quad); }
@Override public void delete(Quad quad) { Map<Node, Map<Node, Map<Node, Quad>>> sm = store.getOrDefault(quad.getGraph(), Collections.emptyMap()); Map<Node, Map<Node, Quad>> pm = sm.getOrDefault(quad.getSubject(), Collections.emptyMap()); Map<Node, Quad> om = pm.getOrDefault(quad.getPredicate(), Collections.emptyMap()); if(om.containsKey(quad.getObject())) { om.remove(quad.getObject()); if(om.isEmpty()) { pm.remove(quad.getPredicate()); } if(pm.isEmpty()) { sm.remove(quad.getSubject()); } if(sm.isEmpty()) { store.remove(quad.getGraph()); } } }
public static Node getNode(Quad quad, int index) { switch (index) { case 0: return quad.getGraph(); case 1: return quad.getSubject(); case 2: return quad.getPredicate(); case 3: return quad.getObject(); default: throw new IndexOutOfBoundsException( "Index: " + index + " Size: " + 4); } }
/** Delete a quad - return true if it was deleted, false if it didn't exist */ public boolean delete( Quad quad ) { return delete(quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject()) ; }
/** Create an Entity from a quad. * Returns null if the quad is not a candidate for indexing. */ public static Entity entityFromQuad(EntityDefinition defn , Quad quad ) { return entityFromQuad(defn, quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject()) ; }
private static List<Tuple<Node>> tuplesQuads(Iterator<Quad> iter) { List<Tuple<Node>> tuples = new ArrayList<>() ; for ( ; iter.hasNext() ; ) { Quad q = iter.next() ; Tuple<Node> tuple = tuple(q.getGraph(), q.getSubject(), q.getPredicate(), q.getObject()) ; tuples.add(tuple) ; } return tuples ; }
@Override public void quad(Quad quad) { quadsLoader.load(quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject()); countQuads++; } };
/** Add a quad - return true if it was added, false if it already existed */ public boolean add( Quad quad ) { return add(quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject()) ; }
@Override public Iterator<Quad> find(Quad q) { return find(q.getGraph(), q.getSubject(), q.getPredicate(), q.getObject()); }
/** Create an Entity from a quad. * Returns null if the quad is not a candidate for indexing. */ public static Entity entityFromQuad(EntityDefinition defn , Quad quad ) { return entityFromQuad(defn, quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject()) ; }
@Override public boolean contains(Quad q) { return contains(q.getGraph(), q.getSubject(), q.getPredicate(), q.getObject()); }