File: TestImportOptions.h

package info (click to toggle)
dataquay 0.9.1-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster, sid, stretch
  • size: 852 kB
  • sloc: cpp: 8,808; sh: 26; ansic: 13; makefile: 10
file content (177 lines) | stat: -rw-r--r-- 5,215 bytes parent folder | download | duplicates (4)
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */

/*
    Dataquay

    A C++/Qt library for simple RDF datastore management.
    Copyright 2009-2012 Chris Cannam.
  
    Permission is hereby granted, free of charge, to any person
    obtaining a copy of this software and associated documentation
    files (the "Software"), to deal in the Software without
    restriction, including without limitation the rights to use, copy,
    modify, merge, publish, distribute, sublicense, and/or sell copies
    of the Software, and to permit persons to whom the Software is
    furnished to do so, subject to the following conditions:

    The above copyright notice and this permission notice shall be
    included in all copies or substantial portions of the Software.

    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
    EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
    NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
    ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
    CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
    WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

    Except as contained in this notice, the name of Chris Cannam
    shall not be used in advertising or otherwise to promote the sale,
    use or other dealings in this Software without prior written
    authorization.
*/

#ifndef _TEST_IMPORT_OPTIONS_H_
#define _TEST_IMPORT_OPTIONS_H_

#include <QObject>
#include <QtTest>

#include <dataquay/Node.h>
#include <dataquay/BasicStore.h>
#include <dataquay/RDFException.h>
#include <dataquay/TransactionalStore.h>
#include <dataquay/Connection.h>

namespace Dataquay {

class TestImportOptions : public QObject
{
    Q_OBJECT

private slots:
    void initTestCase() {

	count = 0;
	store.setBaseUri(Uri("http://breakfastquay.com/rdf/dataquay/tests#"));

	// If TestBasicStore has passed, these should be no problem

	QVERIFY(store.add
		(Triple(store.expand(":fred"),
			Uri("http://xmlns.com/foaf/0.1/name"),
			Node("Fred Jenkins"))));
	++count;

	QVERIFY(store.add
		(Triple(store.expand(":fred"),
			store.expand(":age"),
			Node::fromVariant(QVariant(42)))));
	++count;

	QVERIFY(store.add
		(Triple(store.expand(":fred"),
			store.expand(":has_some_uri"),
			Node::fromVariant(QVariant::fromValue
					  (Uri("http://breakfastquay.com/rdf/person/fred"))))));
	++count;

	QVERIFY(store.add
		(Triple(store.expand(":fred"),
			store.expand(":has_some_local_uri"),
			Node::fromVariant(QVariant::fromValue
					  (store.expand(":pootle"))))));
	++count;

	QVERIFY(store.add
		(Triple(store.expand(":fred"),
			store.expand(":likes_to_think_his_age_is"),
			Node::fromVariant(QVariant(21.9)))));
	++count;

	filename = "import-test.ttl";
	fileUrl = QUrl("file:" + filename);
	store.save(filename);
    }

    void normal() {
	store.clear();
	store.import(fileUrl, BasicStore::ImportIgnoreDuplicates);
	Triples tt = store.match(Triple());
	QCOMPARE(tt.size(), count);
    }

    void duplicatesFail() {
	store.clear();
	store.import(fileUrl, BasicStore::ImportFailOnDuplicates);
	bool caught = false;
	try {
	    store.import(fileUrl, BasicStore::ImportFailOnDuplicates);
	} catch (RDFDuplicateImportException) {
	    caught = true;
	}
	QVERIFY2(caught, "Failed to catch RDFDuplicateImportException when importing duplicate graph with ImportFailOnDuplicates");
	Triples tt = store.match(Triple());
	QCOMPARE(tt.size(), count);
    }

    void duplicatesIgnored() {
	store.clear();
	store.import(fileUrl, BasicStore::ImportFailOnDuplicates);
	store.import(fileUrl, BasicStore::ImportIgnoreDuplicates);
	// note -- the number of triples after import is only the same
	// as count because there are no blank nodes involved, so all
	// nodes are duplicates. Blank nodes synthesised during import
	// can't be identified as identical to existing blank nodes,
	// so they would load multiple times successfully leaving us
	// with semantically identical triples in the store
	Triples tt = store.match(Triple());
	QCOMPARE(tt.size(), count);
    }
	
    void duplicatesPermitted() {
	store.clear();
	store.import(fileUrl, BasicStore::ImportFailOnDuplicates);
	store.import(fileUrl, BasicStore::ImportPermitDuplicates);
	// we can say nothing about the number of triples in store
	// here as it all depends on the back end (this is not a
	// useful mode if the store already has something in it, it's
	// just the fastest)
    }
    
    void transactionalIsolation() {

	// testing only isolation during import, there is a separate
	// TransactionalStore test suite

	TransactionalStore ts(&store);
	Connection c(&ts);
	c.remove(Triple());
	c.commit();

	c.import(fileUrl, BasicStore::ImportIgnoreDuplicates);

        {
            Connection c2(&ts);
	    // unrelated connection, should be isolated
            QCOMPARE(c2.match(Triple()).size(), 0);
        }

        c.commit();

        {
            Connection c2(&ts);
            QCOMPARE(c2.match(Triple()).size(), count);
        }
    }        

private:
    BasicStore store;
    QString filename;
    QUrl fileUrl;
    int count;
};

}

#endif