@@ -20,8 +20,8 @@ TEST(HexastoreTest, QueryBlankFieldEntries) {
2020 H.put ({{" one" , " " , " four" }});
2121
2222 // query results
23- hs_result FirstRes (" one" , " " , " " );
24- hs_result SecondRes (" one" , " " , " four" );
23+ HSResult FirstRes (" one" , " " , " " );
24+ HSResult SecondRes (" one" , " " , " four" );
2525
2626 auto Result = H.get ({{" one" , " " , " " }});
2727 ASSERT_EQ (Result.size (), 1U );
@@ -42,13 +42,13 @@ TEST(HexastoreTest, AllQueryTypes) {
4242 H.put ({{" peter" , " hates" , " hexastores" }});
4343 H.put ({{" frank" , " admires" , " bananas" }});
4444
45- std::vector<hs_result > GroundTruth;
46- GroundTruth.emplace_back (hs_result (" mary" , " likes" , " hexastores" ));
47- GroundTruth.emplace_back (hs_result (" mary" , " likes" , " apples" ));
48- GroundTruth.emplace_back (hs_result (" mary" , " hates" , " oranges" ));
49- GroundTruth.emplace_back (hs_result (" peter" , " likes" , " apples" ));
50- GroundTruth.emplace_back (hs_result (" peter" , " hates" , " hexastores" ));
51- GroundTruth.emplace_back (hs_result (" frank" , " admires" , " bananas" ));
45+ std::vector<HSResult > GroundTruth;
46+ GroundTruth.emplace_back (HSResult (" mary" , " likes" , " hexastores" ));
47+ GroundTruth.emplace_back (HSResult (" mary" , " likes" , " apples" ));
48+ GroundTruth.emplace_back (HSResult (" mary" , " hates" , " oranges" ));
49+ GroundTruth.emplace_back (HSResult (" peter" , " likes" , " apples" ));
50+ GroundTruth.emplace_back (HSResult (" peter" , " hates" , " hexastores" ));
51+ GroundTruth.emplace_back (HSResult (" frank" , " admires" , " bananas" ));
5252
5353 // Does peter hate hexastores? (SPO query in 'spo' tables)
5454 auto Result = H.get ({{" peter" , " hates" , " hexastores" }});
@@ -159,20 +159,20 @@ TEST(HexastoreTest, StoreGraphNoEdgeLabels) {
159159 set<string> Recognized;
160160 map<string, vertex_t > Vertices;
161161
162- vector<hs_result > ResultSet = HS.get ({{" ?" , " no label" , " ?" }}, 20 );
162+ vector<HSResult > ResultSet = HS.get ({{" ?" , " no label" , " ?" }}, 20 );
163163
164164 for (const auto &Entry : ResultSet) {
165- if (Recognized.find (Entry.subject ) == Recognized.end ()) {
166- Vertices[Entry.subject ] = boost::add_vertex (H);
167- H[Vertices[Entry.subject ]].Name = Entry.subject ;
165+ if (Recognized.find (Entry.Subject ) == Recognized.end ()) {
166+ Vertices[Entry.Subject ] = boost::add_vertex (H);
167+ H[Vertices[Entry.Subject ]].Name = Entry.Subject ;
168168 }
169- if (Recognized.find (Entry.object ) == Recognized.end ()) {
170- Vertices[Entry.object ] = boost::add_vertex (H);
171- H[Vertices[Entry.object ]].Name = Entry.object ;
169+ if (Recognized.find (Entry.Object ) == Recognized.end ()) {
170+ Vertices[Entry.Object ] = boost::add_vertex (H);
171+ H[Vertices[Entry.Object ]].Name = Entry.Object ;
172172 }
173- boost::add_edge (Vertices[Entry.subject ], Vertices[Entry.object ], H);
174- Recognized.insert (Entry.subject );
175- Recognized.insert (Entry.object );
173+ boost::add_edge (Vertices[Entry.Subject ], Vertices[Entry.Object ], H);
174+ Recognized.insert (Entry.Subject );
175+ Recognized.insert (Entry.Object );
176176 }
177177
178178 // boost::print_graph(H, boost::get(&Vertex::name, H));
@@ -246,20 +246,20 @@ TEST(HexastoreTest, StoreGraphWithEdgeLabels) {
246246 graph_t J;
247247 set<string> RecognizedVertices;
248248 map<string, vertex_t > Vertices;
249- vector<hs_result > HsiRes = HS.get ({{" ?" , " ?" , " ?" }}, 10 );
249+ vector<HSResult > HsiRes = HS.get ({{" ?" , " ?" , " ?" }}, 10 );
250250 for (const auto &Entry : HsiRes) {
251- if (RecognizedVertices.find (Entry.subject ) == RecognizedVertices.end ()) {
252- Vertices[Entry.subject ] = boost::add_vertex (J);
253- J[Vertices[Entry.subject ]].Name = Entry.subject ;
251+ if (RecognizedVertices.find (Entry.Subject ) == RecognizedVertices.end ()) {
252+ Vertices[Entry.Subject ] = boost::add_vertex (J);
253+ J[Vertices[Entry.Subject ]].Name = Entry.Subject ;
254254 }
255- if (RecognizedVertices.find (Entry.object ) == RecognizedVertices.end ()) {
256- Vertices[Entry.object ] = boost::add_vertex (J);
257- J[Vertices[Entry.object ]].Name = Entry.object ;
255+ if (RecognizedVertices.find (Entry.Object ) == RecognizedVertices.end ()) {
256+ Vertices[Entry.Object ] = boost::add_vertex (J);
257+ J[Vertices[Entry.Object ]].Name = Entry.Object ;
258258 }
259- RecognizedVertices.insert (Entry.subject );
260- RecognizedVertices.insert (Entry.object );
261- boost::add_edge (Vertices[Entry.subject ], Vertices[Entry.object ],
262- Edge (Entry.predicate ), J);
259+ RecognizedVertices.insert (Entry.Subject );
260+ RecognizedVertices.insert (Entry.Object );
261+ boost::add_edge (Vertices[Entry.Subject ], Vertices[Entry.Object ],
262+ Edge (Entry.Predicate ), J);
263263 }
264264
265265 // boost::print_graph(J, boost::get(&Vertex::name, J));
0 commit comments