File: rdf_list_internal.h

package info (click to toggle)
redland 1.0.7-1
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 27,592 kB
  • ctags: 12,328
  • sloc: ansic: 79,017; xml: 25,115; sh: 10,162; yacc: 5,985; lex: 3,682; makefile: 3,260; perl: 2,814; cpp: 59
file content (79 lines) | stat: -rw-r--r-- 2,043 bytes parent folder | download
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
/* -*- Mode: c; c-basic-offset: 2 -*-
 *
 * rdf_list_internal.h - Internal RDF List Interface definitions
 *
 * $Id: rdf_list_internal.h 11465 2006-10-08 20:51:35Z dajobe $
 *
 * Copyright (C) 2000-2006, David Beckett http://purl.org/net/dajobe/
 * Copyright (C) 2000-2005, University of Bristol, UK http://www.bristol.ac.uk/
 * 
 * This package is Free Software and part of Redland http://librdf.org/
 * 
 * It is licensed under the following three licenses as alternatives:
 *   1. GNU Lesser General Public License (LGPL) V2.1 or any newer version
 *   2. GNU General Public License (GPL) V2 or any newer version
 *   3. Apache License, V2.0 or any newer version
 * 
 * You may not use this file except in compliance with at least one of
 * the above three licenses.
 * 
 * See LICENSE.html or LICENSE.txt at the top of this package for the
 * complete terms and further detail along with the license texts for
 * the licenses in COPYING.LIB, COPYING and LICENSE-2.0.txt respectively.
 * 
 * 
 */



#ifndef LIBRDF_LIST_INTERNAL_H
#define LIBRDF_LIST_INTERNAL_H

#ifndef LIBRDF_OBJC_FRAMEWORK
#include <rdf_iterator.h>
#else
#include <Redland/rdf_iterator.h>
#endif

#ifdef __cplusplus
extern "C" {
#endif

/* private structure */
struct librdf_list_node_s
{
  struct librdf_list_node_s* next;
  struct librdf_list_node_s* prev;
  void *data;
};
typedef struct librdf_list_node_s librdf_list_node;


struct librdf_list_iterator_context_s {
  librdf_iterator* iterator;
  librdf_list* list;
  librdf_list_node *current;
  librdf_list_node *next;
  struct librdf_list_iterator_context_s* next_ic;
  struct librdf_list_iterator_context_s* prev_ic;
};

typedef struct librdf_list_iterator_context_s librdf_list_iterator_context;

struct librdf_list_s
{
  librdf_world *world;
  librdf_list_node* first;
  librdf_list_node* last;
  int length;
  int (*equals) (void* data1, void *data2);
  int iterator_count;
  librdf_list_iterator_context* first_iterator;
  librdf_list_iterator_context* last_iterator;
};

#ifdef __cplusplus
}
#endif

#endif