/*
* raptor_abbrev_node_lookup:
* @nodes: Sequence of nodes to search
* @node_type: Raptor identifier type
* @node_value: Node value to search with (using raptor_abbrev_node_matches).
* @datatype: Literal datatype or NULL
* @language: Literal language or NULL
*
* Return value: non-zero if @node matches the node described by the rest of
* the parameters or NULL on failure.
*/
raptor_abbrev_node*
raptor_abbrev_node_lookup(raptor_avltree* nodes,
raptor_identifier_type node_type,
const void *node_value, raptor_uri *datatype,
const unsigned char *language)
{
raptor_abbrev_node *lookup_node;
raptor_abbrev_node *rv_node;
/* Create a temporary node for search comparison. */
lookup_node = raptor_new_abbrev_node(node_type, node_value, datatype, language);
if(!lookup_node)
return NULL;
rv_node=(raptor_abbrev_node*)raptor_avltree_search(nodes, lookup_node);
/* If not found, insert/return a new one */
if(!rv_node) {
if(raptor_avltree_add(nodes, lookup_node)) {
/* Insert failed */
raptor_free_abbrev_node(lookup_node);
return NULL;
} else {
return lookup_node;
}
/* Found */
} else {
raptor_free_abbrev_node(lookup_node);
return rv_node;
}
}
/**
* raptor_subject_add_property:
* @subject: subject node to add to
* @predicate: predicate node
* @object: object node
*
* INTERNAL - Add predicate/object pair into properties array of a subject node.
*
* The subject node takes ownership of the predicate/object nodes.
* On error, predicate/object are freed immediately.
*
* Return value: <0 on failure, >0 if pair is a duplicate and it was not added
**/
int
raptor_abbrev_subject_add_property(raptor_abbrev_subject* subject,
raptor_abbrev_node* predicate,
raptor_abbrev_node* object)
{
int err;
raptor_abbrev_node** nodes;
nodes=raptor_new_abbrev_po(predicate, object);
if(!nodes)
return -1;
predicate->ref_count++;
object->ref_count++;
if(raptor_avltree_search(subject->properties, nodes)) {
/* Already present - do not add a duplicate triple (s->[p o]) */
raptor_free_abbrev_po(nodes);
return 1;
}
#if 0
fprintf(stderr, "Adding P,O ");
raptor_print_abbrev_po(stderr, nodes);
raptor_avltree_dump(subject->properties, stderr);
#endif
err = raptor_avltree_add(subject->properties, nodes);
if(err) {
raptor_free_abbrev_po(nodes);
return -1;
}
#if 0
fprintf(stderr, "Result ");
raptor_avltree_print(subject->properties, stderr);
raptor_avltree_dump(subject->properties, stderr);
raptor_avltree_check(subject->properties);
fprintf(stderr, "\n\n");
#endif
return 0;
}
/**
* raptor_id_set_add:
* @set: #raptor_id_set
* @base_uri: base #raptor_uri of identifier
* @id: identifier name
* @id_len: length of identifier
*
* INTERNAL - Add an item to the set.
*
* Return value: <0 on failure, 0 on success, 1 if already present
**/
int
raptor_id_set_add(raptor_id_set* set, raptor_uri *base_uri,
const unsigned char *id, size_t id_len)
{
raptor_base_id_set *base;
char* item;
if(!base_uri || !id || !id_len)
return -1;
base = set->first;
while(base) {
if(raptor_uri_equals(base->uri, base_uri))
break;
base = base->next;
}
if(!base) {
/* a set for this base_uri not found */
base = (raptor_base_id_set*)RAPTOR_CALLOC(raptor_base_id_set, 1,
sizeof(*base));
if(!base)
return -1;
base->world = set->world;
base->uri = raptor_uri_copy(base_uri);
base->tree = raptor_new_avltree((raptor_data_compare_handler)strcmp,
free, 0);
/* Add to the start of the list */
if(set->first)
set->first->prev = base;
/* base->prev = NULL; */
base->next = set->first;
set->first = base;
} else {
/* If not at the start of the list, move there */
if(base != set->first) {
/* remove from the list */
base->prev->next = base->next;
if(base->next)
base->next->prev = base->prev;
/* add at the start of the list */
set->first->prev = base;
base->prev = NULL;
base->next = set->first;
}
}
item = (char*)raptor_avltree_search(base->tree, id);
/* if already there, error */
if(item) {
#if RAPTOR_DEBUG > 1
set->misses++;
#endif
return 1;
}
#if RAPTOR_DEBUG > 1
set->hits++;
#endif
item = (char*)RAPTOR_MALLOC(cstring, id_len+1);
if(!item)
return 1;
memcpy(item, id, id_len + 1);
return raptor_avltree_add(base->tree, item);
}
static int
rasqal_groupby_rowsource_process(rasqal_rowsource* rowsource,
rasqal_groupby_rowsource_context* con)
{
/* already processed */
if(con->processed)
return 0;
con->processed = 1;
/* Empty expression list - no need to read rows */
if(!con->expr_seq || !con->expr_seq_size) {
con->group_id++;
return 0;
}
con->tree = raptor_new_avltree(rasqal_rowsource_groupby_literal_sequence_compare,
(raptor_data_free_handler)rasqal_free_groupby_tree_node,
/* flags */ 0);
if(!con->tree)
return 1;
raptor_avltree_set_print_handler(con->tree,
rasqal_rowsource_groupby_tree_print_node);
while(1) {
rasqal_row* row;
row = rasqal_rowsource_read_row(con->rowsource);
if(!row)
break;
rasqal_row_bind_variables(row, rowsource->query->vars_table);
if(con->expr_seq) {
raptor_sequence* literal_seq;
rasqal_groupby_tree_node key;
rasqal_groupby_tree_node* node;
literal_seq = rasqal_expression_sequence_evaluate(rowsource->query,
con->expr_seq,
/* ignore_errors */ 0,
/* literal_seq */ NULL,
/* error_p */ NULL);
if(!literal_seq) {
/* FIXME - what to do on errors? */
continue;
}
memset(&key, '\0', sizeof(key));
key.con = con;
key.literals = literal_seq;
node = (rasqal_groupby_tree_node*)raptor_avltree_search(con->tree, &key);
if(!node) {
/* New Group */
node = (rasqal_groupby_tree_node*)RASQAL_CALLOC(rasqal_groupby_tree_node, sizeof(*node), 1);
if(!node) {
raptor_free_sequence(literal_seq);
return 1;
}
node->con = con;
node->group_id = ++con->group_id;
/* node now owns literal_seq */
node->literals = literal_seq;
#ifdef HAVE_RAPTOR2_API
node->rows = raptor_new_sequence((raptor_data_free_handler)rasqal_free_row, (raptor_data_print_handler)rasqal_row_print);
#else
node->rows = raptor_new_sequence((raptor_sequence_free_handler*)rasqal_free_row, (raptor_sequence_print_handler*)rasqal_row_print);
#endif
if(!node->rows) {
rasqal_free_groupby_tree_node(node);
return 1;
}
/* after this, node is owned by con->tree */
raptor_avltree_add(con->tree, node);
} else
raptor_free_sequence(literal_seq);
row->group_id = node->group_id;
/* after this, node owns the row */
raptor_sequence_push(node->rows, row);
}
}
#ifdef RASQAL_DEBUG
if(con->tree) {
fputs("Grouping ", DEBUG_FH);
raptor_avltree_print(con->tree, DEBUG_FH);
fputs("\n", DEBUG_FH);
}
#endif
con->group_iterator = raptor_new_avltree_iterator(con->tree,
NULL, NULL,
1);
con->group_row_index = 0;
con->offset = 0;
return 0;
}
int
main(int argc, char *argv[])
{
raptor_world *world;
const char *program = raptor_basename(argv[0]);
#define ITEM_COUNT 8
const char *items[ITEM_COUNT+1] = { "ron", "amy", "jen", "bij", "jib", "daj", "jim", "def", NULL };
#define DELETE_COUNT 2
const char *delete_items[DELETE_COUNT+1] = { "jen", "jim", NULL };
#define RESULT_COUNT (ITEM_COUNT-DELETE_COUNT)
const char *results[RESULT_COUNT+1] = { "amy", "bij", "daj", "def", "jib", "ron", NULL};
raptor_avltree* tree;
raptor_avltree_iterator* iter;
visit_state vs;
int i;
world = raptor_new_world();
if(!world || raptor_world_open(world))
exit(1);
tree = raptor_new_avltree(compare_strings,
NULL, /* no free as they are static pointers above */
0);
if(!tree) {
fprintf(stderr, "%s: Failed to create tree\n", program);
exit(1);
}
for(i = 0; items[i]; i++) {
int rc;
void* node;
#if RAPTOR_DEBUG > 1
fprintf(stderr, "%s: Adding tree item '%s'\n", program, items[i]);
#endif
rc = raptor_avltree_add(tree, (void*)items[i]);
if(rc) {
fprintf(stderr,
"%s: Adding tree item %d '%s' failed, returning error %d\n",
program, i, items[i], rc);
exit(1);
}
#ifdef RAPTOR_DEBUG
raptor_avltree_check(tree);
#endif
node = raptor_avltree_search(tree, (void*)items[i]);
if(!node) {
fprintf(stderr,
"%s: Tree did NOT contain item %d '%s' as expected\n",
program, i, items[i]);
exit(1);
}
}
#if RAPTOR_DEBUG > 1
fprintf(stderr, "%s: Printing tree\n", program);
vs.fh = stderr;
vs.count = 0;
raptor_avltree_visit(tree, print_string, &vs);
fprintf(stderr, "%s: Dumping tree\n", program);
raptor_avltree_dump(tree, stderr);
#endif
for(i = 0; delete_items[i]; i++) {
int rc;
#if RAPTOR_DEBUG > 1
fprintf(stderr, "%s: Deleting tree item '%s'\n", program, delete_items[i]);
#endif
rc = raptor_avltree_delete(tree, (void*)delete_items[i]);
if(!rc) {
fprintf(stderr,
"%s: Deleting tree item %d '%s' failed, returning error %d\n",
program, i, delete_items[i], rc);
exit(1);
}
#ifdef RAPTOR_DEBUG
raptor_avltree_check(tree);
#endif
}
#if RAPTOR_DEBUG > 1
fprintf(stderr, "%s: Walking tree forwards via iterator\n", program);
#endif
iter = raptor_new_avltree_iterator(tree, NULL, NULL, 1);
for(i = 0; 1; i++) {
const char* data = (const char*)raptor_avltree_iterator_get(iter);
const char* result = results[i];
if((!data && data != result) || (data && strcmp(data, result))) {
fprintf(stderr, "%3d: Forwards iterator expected '%s' but found '%s'\n",
i, result, data);
exit(1);
}
#if RAPTOR_DEBUG > 1
fprintf(stderr, "%3d: Got '%s'\n", i, data);
#endif
if(raptor_avltree_iterator_next(iter))
break;
if(i > RESULT_COUNT) {
fprintf(stderr, "Forward iterator did not end on result %i as expected\n", i);
exit(1);
}
}
raptor_free_avltree_iterator(iter);
#if RAPTOR_DEBUG > 1
fprintf(stderr, "%s: Checking tree\n", program);
#endif
vs.count = 0;
vs.results = results;
vs.failed = 0;
raptor_avltree_visit(tree, check_string, &vs);
if(vs.failed) {
fprintf(stderr, "%s: Checking tree failed\n", program);
exit(1);
}
for(i = 0; results[i]; i++) {
const char* result = results[i];
char* data = (char*)raptor_avltree_remove(tree, (void*)result);
if(!data) {
fprintf(stderr, "%s: remove %i failed at item '%s'\n", program, i,
result);
exit(1);
}
if(strcmp(data, result)) {
fprintf(stderr, "%s: remove %i returned %s not %s as expected\n", program,
i, data, result);
exit(1);
}
}
#if RAPTOR_DEBUG > 1
fprintf(stderr, "%s: Freeing tree\n", program);
#endif
raptor_free_avltree(tree);
raptor_free_world(world);
/* keep gcc -Wall happy */
return(0);
}