END_TEST
START_TEST (check_fs_rid_vector_sort)
{
fs_rid_vector *v = fs_rid_vector_new(0);
fail_unless(v != NULL, "fs_rid_vector is NULL");
int i=0;
for (i=100; i < 1e4; i++) {
if (i % 2) {
fs_rid_vector_append(v, i);
fs_rid_vector_append(v, i+3);
fs_rid_vector_append(v, i-10);
} else {
fs_rid_vector_append(v, i-1);
fs_rid_vector_append(v, i+5);
fs_rid_vector_append(v, i);
}
}
fs_rid_vector_sort(v);
fail_if(fs_rid_vector_length(v) != ((1e4 - 100) *3), "Length fail after sort");
for (i=100; i < 1e4; i++) {
fail_if ( !fs_rid_vector_contains(v, i), "Contain failed after sort");
}
for (i=0;i<fs_rid_vector_length(v) -1; i++) {
fail_if (v->data[i] > v->data[i+1], "Sort does not match.");
}
fs_rid_vector_free(v);
}
static int delete_rasqal_triple(struct update_context *uc, fs_rid_vector *vec[], rasqal_triple *triple, int row)
{
fs_rid m, s, p, o;
if (triple->origin) {
m = fs_hash_rasqal_literal(uc, triple->origin, row);
if (m == FS_RID_NULL) return 1;
} else if (uc->op->graph_uri) {
m = fs_hash_uri((char *)raptor_uri_as_string(uc->op->graph_uri));
} else {
/* m can be wildcard in the absence of GRAPH, WITH etc. */
m = FS_RID_NULL;
}
s = fs_hash_rasqal_literal(uc, triple->subject, row);
if (s == FS_RID_NULL) return 1;
p = fs_hash_rasqal_literal(uc, triple->predicate, row);
if (p == FS_RID_NULL) return 1;
o = fs_hash_rasqal_literal(uc, triple->object, row);
if (o == FS_RID_NULL) return 1;
/* as long as s, p, and o are bound, we can add this quad */
fs_rid_vector_append(vec[0], m);
fs_rid_vector_append(vec[1], s);
fs_rid_vector_append(vec[2], p);
fs_rid_vector_append(vec[3], o);
if (fs_rid_vector_contains(vec[0], fs_c.system_config))
fsp_reload_acl_system(uc->link);
if (fs_rid_vector_length(vec[0]) > 999) {
fsp_delete_quads_all(uc->link, vec);
for (int s=0; s<4; s++) {
fs_rid_vector_truncate(vec[s], 0);
}
}
return 0;
}
