Skip to content

Use temp databases in HexastoreTest to avoid IO #628

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
fabianbs96 merged 1 commit into from
Jun 15, 2023
+4 −4
Merged

Use temp databases in HexastoreTest to avoid IO #628

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions unittests/DB/HexastoreTest.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ using namespace psr;
using namespace std;

TEST(HexastoreTest, QueryBlankFieldEntries) {
Hexastore H("QueryBlankFieldEntries.sqlite");
Hexastore H("");
H.put({{"one", "", ""}});
H.put({{"two", "", ""}});
H.put({{"", "three", ""}});
Expand All @@ -32,7 +32,7 @@ TEST(HexastoreTest, QueryBlankFieldEntries) {
}

TEST(HexastoreTest, AllQueryTypes) {
Hexastore H("AllQueryTypes.sqlite");
Hexastore H("");
H.put({{"mary", "likes", "hexastores"}});
H.put({{"mary", "likes", "apples"}});
H.put({{"mary", "hates", "oranges"}});
Expand Down Expand Up @@ -143,7 +143,7 @@ TEST(HexastoreTest, StoreGraphNoEdgeLabels) {
// llvm::outs() << "Graph G:" << std::endl;
// boost::print_graph(G, boost::get(&Vertex::name, G));

Hexastore HS("StoreGraphNoEdgeLabels.sqlite");
Hexastore HS("");

// serialize graph G
for (tie(EiStart, EEnd) = boost::edges(G); EiStart != EEnd; ++EiStart) {
Expand Down Expand Up @@ -230,7 +230,7 @@ TEST(HexastoreTest, StoreGraphWithEdgeLabels) {
// cout << boost::get(&Edge::edge_name, I, *ei_start) << endl;
// }

Hexastore HS("StoreGraphWithEdgeLabels.sqlite");
Hexastore HS("");

// serialize graph I
for (tie(EiStart, EEnd) = boost::edges(I); EiStart != EEnd; ++EiStart) {
Expand Down