@Override public Iterator<Tuple<NodeId>> findAsNodeIds(Node... nodes) { nodes = push(Node.class, prefix, nodes) ; return nodeTupleTable.findAsNodeIds(nodes) ; }
@Override public void close() { nodeTupleTable.close() ; } }
/** Add a quad - return true if it was added, false if it already existed */ public boolean add(Node g, Node s, Node p, Node o) { return table.addRow(g,s,p,o) ; }
/** Delete a quad - return true if it was deleted, false if it didn't exist */ public boolean delete(Node g, Node s, Node p, Node o) { return table.deleteRow(g, s, p, o) ; }
@Override public void sync() { table.sync() ; }
/** Clear - does not clear the associated node tuple table */ public void clearTriples() { table.clear() ; } }
@Override public TupleTable getTupleTable() // Need a projection of this? { return super.getTupleTable() ; } }
protected TableBase(int N, TupleIndex[] indexes, NodeTable nodeTable, DatasetControl policy) { table = new NodeTupleTableConcrete(N, indexes, nodeTable, policy) ; }
public NodeTupleTableWrapper(NodeTupleTable ntt) { setNodeTupleTable(ntt) ; }
@Override public void close() { nodeTupleTable.close() ; }
public boolean add(Node s, Node p, Node o) { return table.addRow(s, p, o) ; }
/** Delete a triple - return true if it was deleted, false if it didn't exist */ public boolean delete(Node s, Node p, Node o) { return table.deleteRow(s, p, o) ; }
@Override public void sync() { nodeTupleTable.sync() ; } }
/** Clear - does not clear the associated node tuple table */ public void clearQuads() { table.clear() ; } }
@Override public void close() { table.close() ; }