Package com.hp.hpl.jena.tdb.store

Examples of com.hp.hpl.jena.tdb.store.NodeId

49
50
51
52
53
54
55
56
57
    }

    @Override
    public NodeId getAllocateNodeId(Node node)
    {
        NodeId nid = NodeId.create(id) ;
        id++ ;
        return nid ;
    }
View Full Code Here
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
        }

      
        private void process(Node g, Node s, Node p, Node o)
        {
            NodeId sId = nodeTable.getAllocateNodeId(s) ;
            NodeId pId = nodeTable.getAllocateNodeId(p) ;
            NodeId oId = nodeTable.getAllocateNodeId(o) ;
           
            if ( g != null )
            {
                NodeId gId = nodeTable.getAllocateNodeId(g) ;
                writerQuads.write(gId.getId()) ;
                writerQuads.write(sId.getId()) ;
                writerQuads.write(pId.getId()) ;
                writerQuads.write(oId.getId()) ;
                writerQuads.endOfRow() ;
                stats.record(gId, sId, pId, oId) ;
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
        {
            // Makes nodes immediately.  Causing unnecessary NodeTable accesses (e.g. project)
            BindingMap b = BindingFactory.create() ;
            for ( Var v : bindingNodeIds )
            {
                NodeId id = bindingNodeIds.get(v) ;
                Node n = nodeTable.getNodeForNodeId(id) ;
                b.add(v, n) ;
            }
            return b ;
        }
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
                        // Can occur with BindingProject
                        continue ;
                   
                    // Rely on the node table cache for efficency - we will likely be
                    // repeatedly looking up the same node in different bindings.
                    NodeId id = nodeTable.getNodeIdForNode(n) ;
                    // Even put in "does not exist" for a node now known not to be in the DB.
                    b.put(v, id) ;
                }
                return b ;
            }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
        assertEquals(1, r.getCount()) ;
        assertEquals(1, r.getPredicates().keySet().size()) ;
    }

    @Test public void stats_02() {
        NodeId gid = nt.getNodeIdForNode(NodeFactory.createURI("g1")) ;
        StatsResults r = statsForGraph(gid) ;
        assertEquals(1, r.getCount()) ;
        assertEquals(1, r.getPredicates().keySet().size()) ;
    }
View Full Code Here
95
96
97
98
99
100
101
102
103
104
        assertEquals(1, r.getCount()) ;
        assertEquals(1, r.getPredicates().keySet().size()) ;
    }
   
    @Test public void stats_03() {
        NodeId gid = nt.getNodeIdForNode(NodeFactory.createURI("g2")) ;
        StatsResults r = statsForGraph(gid) ;
        assertEquals(2, r.getCount()) ;
        assertEquals(1, r.getPredicates().keySet().size()) ;
    }
View Full Code Here
62
63
64
65
66
67
68
69
70
    static void contains(NodeTable nt, Node...nodes)
    {
        for ( Node n : nodes)
        {
            NodeId nodeId = nt.getNodeIdForNode(n) ;
            assertFalse(NodeId.isDoesNotExist(nodeId)) ;
        }
    }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
        NodeTableTrans ntt = create(txn) ;
        NodeTable nt0 = ntt.getBaseNodeTable() ;
       
        ntt.begin(txn) ;
        // Add a node
        NodeId nodeId = ntt.getAllocateNodeId(node1) ;
        // Check not in the base.
        assertNull(nt0.getNodeForNodeId(nodeId)) ;
        // Check is in the transaction node table.
        assertEquals(NodeId.NodeDoesNotExist, nt0.getNodeIdForNode(node1)) ;
        assertEquals(node1, ntt.getNodeForNodeId(nodeId)) ;
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
        NodeTableTrans ntt = create(txn) ;
        NodeTable nt0 = ntt.getBaseNodeTable() ;
        
        ntt.begin(txn) ;
        // Add a node
        NodeId nodeId = ntt.getAllocateNodeId(node1) ;
        // Check not in the base.
        assertEquals(NodeId.NodeDoesNotExist, nt0.getNodeIdForNode(node1)) ;
        assertNull(nt0.getNodeForNodeId(nodeId)) ;
        // Check is in the transaction node table.
        assertEquals(node1, ntt.getNodeForNodeId(nodeId)) ;
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
        Transaction txn = createTxn(11) ;
        NodeTableTrans ntt = create(txn, node1) ;
        NodeTable nt0 = ntt.getBaseNodeTable() ;
        ntt.begin(txn) ;
        // Add a node
        NodeId nodeId = ntt.getAllocateNodeId(node2) ;
        // Not here
        assertEquals(NodeId.NodeDoesNotExist, nt0.getNodeIdForNode(node2)) ;
        // Is here
        assertEquals(nodeId, ntt.getNodeIdForNode(node2)) ;
        ntt.commitPrepare(txn) ;
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.tdb.store.NodeId

  • com.hp.hpl.jena.graph.impl.LiteralLabel
  • com.hp.hpl.jena.graph.Node
  • com.hp.hpl.jena.tdb.index.TupleIndexBase
  • com.hp.hpl.jena.tdb.index.TupleIndexRecord
  • com.hp.hpl.jena.tdb.index.TupleTable
  • com.hp.hpl.jena.tdb.lib.DumpOps
  • com.hp.hpl.jena.tdb.lib.TupleLib
  • com.hp.hpl.jena.tdb.nodetable.AbstractTestNodeTable
  • com.hp.hpl.jena.tdb.nodetable.NodeTableCache
  • com.hp.hpl.jena.tdb.nodetable.NodeTableInline
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.