1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
"""Tests the Graph class' cbd() function"""
import pytest
from rdflib import Graph, Namespace
from rdflib.namespace import RDF, RDFS
from rdflib.term import Literal, URIRef
from test.data import TEST_DATA_DIR
from test.utils import BNodeHandling, GraphHelper
EXAMPLE_GRAPH_FILE_PATH = TEST_DATA_DIR / "spec" / "cbd" / "example_graph.rdf"
EXAMPLE_GRAPH_CBD_FILE_PATH = TEST_DATA_DIR / "spec" / "cbd" / "example_graph_cbd.rdf"
EX = Namespace("http://ex/")
@pytest.fixture
def get_graph():
g = Graph()
# adding example data for testing
g.parse(
data="""
PREFIX ex: <http://ex/>
PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
ex:R1
a rdf:Resource ;
ex:hasChild ex:R2 , ex:R3 .
ex:R2
ex:propOne ex:P1 ;
ex:propTwo ex:P2 .
ex:R3
ex:propOne ex:P3 ;
ex:propTwo ex:P4 ;
ex:propThree [
a rdf:Resource ;
ex:propFour "Some Literal" ;
ex:propFive ex:P5 ;
ex:propSix [
ex:propSeven ex:P7 ;
] ;
] .
""",
format="turtle",
)
g.bind("ex", EX)
yield g
g.close()
def testCbd(get_graph): # noqa: N802
g = get_graph
assert len(g.cbd(EX.R1)) == 3, "cbd() for R1 should return 3 triples"
assert len(g.cbd(EX.R2)) == 2, "cbd() for R3 should return 2 triples"
assert len(g.cbd(EX.R3)) == 8, "cbd() for R3 should return 8 triples"
assert len(g.cbd(EX.R4)) == 0, "cbd() for R4 should return 0 triples"
def testCbdReified(get_graph): # noqa: N802
g = get_graph
# add some reified triples to the testing graph
g.parse(
data="""
PREFIX ex: <http://ex/>
PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
ex:R5
ex:propOne ex:P1 ;
ex:propTwo ex:P2 ;
ex:propRei ex:Pre1 .
ex:S
a rdf:Statement ;
rdf:subject ex:R5 ;
rdf:predicate ex:propRei ;
rdf:object ex:Pre1 ;
ex:otherReiProp ex:Pre2 .
""",
format="turtle",
)
# this cbd() call should get the 3 basic triples with ex:R5 as subject as well as 5 more from the reified
# statement
assert len(g.cbd(EX.R5)) == (3 + 5), "cbd() for R5 should return 8 triples"
# add crazy reified triples to the testing graph
g.parse(
data="""
PREFIX ex: <http://ex/>
PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
ex:R6
ex:propOne ex:P1 ;
ex:propTwo ex:P2 ;
ex:propRei ex:Pre1 .
ex:S1
a rdf:Statement ;
rdf:subject ex:R6 ;
rdf:predicate ex:propRei ;
rdf:object ex:Pre1 ;
ex:otherReiProp ex:Pre3 .
ex:S2
rdf:subject ex:R6 ;
rdf:predicate ex:propRei2 ;
rdf:object ex:Pre2 ;
ex:otherReiProp ex:Pre4 ;
ex:otherReiProp ex:Pre5 .
""",
format="turtle",
)
assert len(g.cbd(EX.R6)) == (3 + 5 + 5), "cbd() for R6 should return 12 triples"
def test_cbd_example():
"""
Example from Concise Bounded Description definition at https://www.w3.org/Submission/CBD/#example
"""
g = Graph()
g.parse(EXAMPLE_GRAPH_FILE_PATH)
g_cbd = Graph()
g_cbd.parse(EXAMPLE_GRAPH_CBD_FILE_PATH)
query = "http://example.com/aReallyGreatBook"
GraphHelper.assert_isomorphic(g.cbd(URIRef(query)), g_cbd)
GraphHelper.assert_sets_equals(g.cbd(URIRef(query)), g_cbd, BNodeHandling.COLLAPSE)
assert len(g.cbd(URIRef(query))) == (
21
), "cbd() for aReallyGreatBook should return 21 triples"
def test_cbd_target(rdfs_graph: Graph):
"""
`Graph.cbd` places the Concise Bounded Description in the target graph.
"""
target = Graph()
result = rdfs_graph.cbd(RDFS.Literal, target_graph=target)
expected_result = {
(RDFS.Literal, RDFS.subClassOf, RDFS.Resource),
(RDFS.Literal, RDF.type, RDFS.Class),
(RDFS.Literal, RDFS.label, Literal("Literal")),
(
RDFS.Literal,
RDFS.comment,
Literal("The class of literal values, eg. textual strings and integers."),
),
(RDFS.Literal, RDFS.isDefinedBy, URIRef(f"{RDFS}")),
}
assert result is target
assert expected_result == set(result.triples((None, None, None)))
|
