2 This file is part of GNUnet.
3 (C) 2001, 2002, 2003, 2004, 2005, 2006, 2008, 2009 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 2, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file include/gnunet_container_lib.h
23 * @brief container classes for GNUnet
25 * @author Christian Grothoff
29 #ifndef GNUNET_CONTAINER_LIB_H
30 #define GNUNET_CONTAINER_LIB_H
32 /* add error and config prototypes */
33 #include "gnunet_crypto_lib.h"
34 #include <extractor.h>
39 #if 0 /* keep Emacsens' auto-indent happy */
45 #define GNUNET_MEM_DISP_TRANSIENT 0
46 #define GNUNET_MEM_DISP_STATIC 2
47 #define GNUNET_MEM_DISP_DYNAMIC 4
49 /* ******************* bloomfilter ***************** */
52 * @brief bloomfilter representation (opaque)
54 struct GNUNET_CONTAINER_BloomFilter;
57 * Iterator over HashCodes.
60 * @param next set to the next hash code
61 * @return GNUNET_YES if next was updated
62 * GNUNET_NO if there are no more entries
64 typedef int (*GNUNET_HashCodeIterator) (void *cls,
65 GNUNET_HashCode * next);
68 * Load a bloom-filter from a file.
70 * @param filename the name of the file (or the prefix)
71 * @param size the size of the bloom-filter (number of
72 * bytes of storage space to use)
73 * @param k the number of GNUNET_CRYPTO_hash-functions to apply per
74 * element (number of bits set per element in the set)
75 * @return the bloomfilter
77 struct GNUNET_CONTAINER_BloomFilter *
78 GNUNET_CONTAINER_bloomfilter_load (const
88 * Create a bloom filter from raw bits.
90 * @param data the raw bits in memory (maybe NULL,
91 * in which case all bits should be considered
93 * @param size the size of the bloom-filter (number of
94 * bytes of storage space to use); also size of data
95 * -- unless data is NULL. Must be a power of 2.
96 * @param k the number of GNUNET_CRYPTO_hash-functions to apply per
97 * element (number of bits set per element in the set)
98 * @return the bloomfilter
100 struct GNUNET_CONTAINER_BloomFilter *
101 GNUNET_CONTAINER_bloomfilter_init (const
111 * Copy the raw data of this bloomfilter into
112 * the given data array.
114 * @param data where to write the data
115 * @param size the size of the given data array
116 * @return GNUNET_SYSERR if the data array of the wrong size
118 int GNUNET_CONTAINER_bloomfilter_get_raw_data (struct
119 GNUNET_CONTAINER_BloomFilter
124 * Test if an element is in the filter.
125 * @param e the element
126 * @param bf the filter
127 * @return GNUNET_YES if the element is in the filter, GNUNET_NO if not
129 int GNUNET_CONTAINER_bloomfilter_test (struct GNUNET_CONTAINER_BloomFilter
130 *bf, const GNUNET_HashCode * e);
133 * Add an element to the filter
134 * @param bf the filter
135 * @param e the element
137 void GNUNET_CONTAINER_bloomfilter_add (struct GNUNET_CONTAINER_BloomFilter
138 *bf, const GNUNET_HashCode * e);
141 * Remove an element from the filter.
142 * @param bf the filter
143 * @param e the element to remove
145 void GNUNET_CONTAINER_bloomfilter_remove (struct GNUNET_CONTAINER_BloomFilter
146 *bf, const GNUNET_HashCode * e);
149 * Free the space associcated with a filter
150 * in memory, flush to drive if needed (do not
151 * free the space on the drive)
152 * @param bf the filter
154 void GNUNET_CONTAINER_bloomfilter_free (struct GNUNET_CONTAINER_BloomFilter
158 * Reset a bloom filter to empty.
159 * @param bf the filter
161 void GNUNET_CONTAINER_bloomfilter_clear (struct GNUNET_CONTAINER_BloomFilter
165 * Or the entries of the given raw data array with the
166 * data of the given bloom filter. Assumes that
167 * the size of the data array and the current filter
170 * @param bf the filter
171 * @param data data to OR-in
172 * @param size size of data
173 * @return GNUNET_OK on success
175 int GNUNET_CONTAINER_bloomfilter_or (struct GNUNET_CONTAINER_BloomFilter *bf,
176 const char *data, size_t size);
179 * Resize a bloom filter. Note that this operation
180 * is pretty costly. Essentially, the bloom filter
181 * needs to be completely re-build.
183 * @param bf the filter
184 * @param iterator an iterator over all elements stored in the BF
185 * @param iterator_cls closure for iterator
186 * @param size the new size for the filter
187 * @param k the new number of GNUNET_CRYPTO_hash-function to apply per element
189 void GNUNET_CONTAINER_bloomfilter_resize (struct GNUNET_CONTAINER_BloomFilter
191 GNUNET_HashCodeIterator iterator,
193 size_t size, unsigned int k);
195 /* ****************** metadata ******************* */
198 * Meta data to associate with a file, directory or namespace.
200 struct GNUNET_CONTAINER_MetaData;
203 * Iterator over meta data.
206 * @param type type of the meta data
207 * @param data value of the meta data
208 * @return GNUNET_OK to continue to iterate, GNUNET_SYSERR to abort
210 typedef int (*GNUNET_CONTAINER_MetaDataProcessor) (void *cls,
211 EXTRACTOR_KeywordType type,
215 * Create a fresh MetaData token.
217 * @return empty meta-data container
219 struct GNUNET_CONTAINER_MetaData *GNUNET_CONTAINER_meta_data_create (void);
222 * Duplicate a MetaData token.
224 * @param meta what to duplicate
225 * @return duplicate meta-data container
227 struct GNUNET_CONTAINER_MetaData *GNUNET_CONTAINER_meta_data_duplicate (const
229 GNUNET_CONTAINER_MetaData
235 * @param md what to free
237 void GNUNET_CONTAINER_meta_data_destroy (struct GNUNET_CONTAINER_MetaData
241 * Test if two MDs are equal.
243 * @param md1 first value to check
244 * @param md2 other value to check
245 * @return GNUNET_YES if they are equal
247 int GNUNET_CONTAINER_meta_data_test_equal (const struct
248 GNUNET_CONTAINER_MetaData *md1,
250 GNUNET_CONTAINER_MetaData *md2);
256 * @param md metadata to extend
257 * @param type type of the new entry
258 * @param data value for the entry
259 * @return GNUNET_OK on success, GNUNET_SYSERR if this entry already exists
261 int GNUNET_CONTAINER_meta_data_insert (struct GNUNET_CONTAINER_MetaData *md,
262 EXTRACTOR_KeywordType type,
268 * @param type type of the item to remove
269 * @param data specific value to remove, NULL to remove all
270 * entries of the given type
271 * @return GNUNET_OK on success, GNUNET_SYSERR if the item does not exist in md
273 int GNUNET_CONTAINER_meta_data_delete (struct GNUNET_CONTAINER_MetaData *md,
274 EXTRACTOR_KeywordType type,
278 * Add the current time as the publication date
281 * @param md metadata to modify
283 void GNUNET_CONTAINER_meta_data_add_publication_date (struct
284 GNUNET_CONTAINER_MetaData
288 * Iterate over MD entries, excluding thumbnails.
290 * @param md metadata to inspect
291 * @param iter function to call on each entry
292 * @param iter_cls closure for iterator
293 * @return number of entries
295 int GNUNET_CONTAINER_meta_data_get_contents (const struct
296 GNUNET_CONTAINER_MetaData *md,
297 GNUNET_CONTAINER_MetaDataProcessor
298 iter, void *iter_cls);
301 * Get the first MD entry of the given type.
303 * @param md metadata to inspect
304 * @param type type to look for
305 * @return NULL if we do not have any such entry,
306 * otherwise client is responsible for freeing the value!
308 char *GNUNET_CONTAINER_meta_data_get_by_type (const struct
309 GNUNET_CONTAINER_MetaData *md,
310 EXTRACTOR_KeywordType type);
313 * Get the first matching MD entry of the given types.
315 * @param md metadata to inspect
316 * @param ... -1-terminated list of types
317 * @return NULL if we do not have any such entry,
318 * otherwise client is responsible for freeing the value!
320 char *GNUNET_CONTAINER_meta_data_get_first_by_types (const struct
321 GNUNET_CONTAINER_MetaData
325 * Get a thumbnail from the meta-data (if present).
327 * @param md metadata to inspect
328 * @param thumb will be set to the thumbnail data. Must be
329 * freed by the caller!
330 * @return number of bytes in thumbnail, 0 if not available
332 size_t GNUNET_CONTAINER_meta_data_get_thumbnail (const struct
333 GNUNET_CONTAINER_MetaData
334 *md, unsigned char **thumb);
337 * Extract meta-data from a file.
339 * @param md metadata to set
340 * @param filename name of file to inspect
341 * @param extractors plugins to use
342 * @return GNUNET_SYSERR on error, otherwise the number
343 * of meta-data items obtained
345 int GNUNET_CONTAINER_meta_data_extract_from_file (struct
346 GNUNET_CONTAINER_MetaData
347 *md, const char *filename,
348 EXTRACTOR_ExtractorList *
353 * Options for metadata serialization.
355 enum GNUNET_CONTAINER_MetaDataSerializationOptions
358 * Serialize all of the data.
360 GNUNET_CONTAINER_META_DATA_SERIALIZE_FULL = 0,
363 * If not enough space is available, it is acceptable
364 * to only serialize some of the metadata.
366 GNUNET_CONTAINER_META_DATA_SERIALIZE_PART = 1,
369 * Speed is of the essence, do not allow compression.
371 GNUNET_CONTAINER_META_DATA_SERIALIZE_NO_COMPRESS = 2
376 * Serialize meta-data to target.
378 * @param md metadata to serialize
379 * @param size maximum number of bytes available
380 * @param opt is it ok to just write SOME of the
381 * meta-data to match the size constraint,
382 * possibly discarding some data?
383 * @return number of bytes written on success,
384 * -1 on error (typically: not enough
387 ssize_t GNUNET_CONTAINER_meta_data_serialize (const struct
388 GNUNET_CONTAINER_MetaData *md,
392 GNUNET_CONTAINER_MetaDataSerializationOptions
396 * Compute size of the meta-data in
399 * @param md metadata to inspect
400 * @param opt is it ok to just write SOME of the
401 * meta-data to match the size constraint,
402 * possibly discarding some data?
403 * @return number of bytes needed for serialization, -1 on error
405 ssize_t GNUNET_CONTAINER_meta_data_get_serialized_size (const struct
406 GNUNET_CONTAINER_MetaData
409 GNUNET_CONTAINER_MetaDataSerializationOptions
413 * Deserialize meta-data. Initializes md.
415 * @param input serialized meta-data.
416 * @param size number of bytes available
417 * @return MD on success, NULL on error (i.e.
420 struct GNUNET_CONTAINER_MetaData
421 *GNUNET_CONTAINER_meta_data_deserialize (const char *input,
425 * Does the meta-data claim that this is a directory?
426 * Checks if the mime-type is that of a GNUnet directory.
428 * @param md metadata to inspect
429 * @return GNUNET_YES if it is, GNUNET_NO if it is not, GNUNET_SYSERR if
430 * we have no mime-type information (treat as 'GNUNET_NO')
432 int GNUNET_CONTAINER_meta_data_test_for_directory (const struct
433 GNUNET_CONTAINER_MetaData
437 /* ******************************* HashMap **************************** */
440 * Opaque handle for a HashMap.
442 struct GNUNET_CONTAINER_MultiHashMap;
445 * Options for storing values in the HashMap.
447 enum GNUNET_CONTAINER_MultiHashMapOption
450 * If a value with the given key exists, replace it.
451 * Note that the old value would NOT be freed
452 * by replace (the application has to make sure that
453 * this happens if required).
455 GNUNET_CONTAINER_MULTIHASHMAPOPTION_REPLACE,
458 * Allow multiple values with the same key.
460 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE,
463 * There must only be one value per key; storing
464 * a value should fail if a value under the same
465 * key already exists.
467 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY,
470 * There must only be one value per key, but don't
471 * bother checking if a value already exists
472 * (faster than UNIQUE_ONLY; implemented just like
473 * MULTIPLE but this option documents better what
474 * is intended if UNIQUE is what is desired).
476 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST
481 * Iterator over HashCodes.
484 * @param key current key code
485 * @param value value in the hash map
486 * @return GNUNET_YES if we should continue to
490 typedef int (*GNUNET_CONTAINER_HashMapIterator) (void *cls,
491 const GNUNET_HashCode * key,
496 * Create a multi hash map.
498 * @param len initial size (map will grow as needed)
499 * @return NULL on error
501 struct GNUNET_CONTAINER_MultiHashMap
502 *GNUNET_CONTAINER_multihashmap_create (unsigned int len);
505 * Destroy a hash map. Will not free any values
506 * stored in the hash map!
510 void GNUNET_CONTAINER_multihashmap_destroy (struct
511 GNUNET_CONTAINER_MultiHashMap
515 * Given a key find a value in the
516 * map matching the key.
519 * @param key what to look for
520 * @return NULL if no value was found; note that
521 * this is indistinguishable from values that just
522 * happen to be NULL; use "contains" to test for
523 * key-value pairs with value NULL
525 void *GNUNET_CONTAINER_multihashmap_get (const struct
526 GNUNET_CONTAINER_MultiHashMap *map,
527 const GNUNET_HashCode * key);
530 * Remove the given key-value pair from the map.
531 * Note that if the key-value pair is in the map
532 * multiple times, only one of the pairs will be
536 * @param key key of the key-value pair
537 * @param value value of the key-value pair
538 * @return GNUNET_YES on success, GNUNET_NO if the key-value pair
541 int GNUNET_CONTAINER_multihashmap_remove (struct GNUNET_CONTAINER_MultiHashMap
542 *map, const GNUNET_HashCode * key,
546 * Remove all entries for the given key from the map.
547 * Note that the values would not be "freed".
550 * @param key identifies values to be removed
551 * @return number of values removed
553 int GNUNET_CONTAINER_multihashmap_remove_all (struct
554 GNUNET_CONTAINER_MultiHashMap
556 const GNUNET_HashCode * key);
559 * Check if the map contains any value under the given
560 * key (including values that are NULL).
563 * @param key the key to test if a value exists for it
564 * @return GNUNET_YES if such a value exists,
567 int GNUNET_CONTAINER_multihashmap_contains (const struct
568 GNUNET_CONTAINER_MultiHashMap
570 const GNUNET_HashCode * key);
573 * Store a key-value pair in the map.
576 * @param key key to use
577 * @param value value to use
578 * @param opt options for put
579 * @return GNUNET_OK on success,
580 * GNUNET_NO if a value was replaced (with REPLACE)
581 * GNUNET_SYSERR if UNIQUE_ONLY was the option and the
582 * value already exists
584 int GNUNET_CONTAINER_multihashmap_put (struct GNUNET_CONTAINER_MultiHashMap
585 *map, const GNUNET_HashCode * key,
588 GNUNET_CONTAINER_MultiHashMapOption
592 * Get the number of key-value pairs in the map.
595 * @return the number of key value pairs
597 unsigned int GNUNET_CONTAINER_multihashmap_size (const struct
598 GNUNET_CONTAINER_MultiHashMap
603 * Iterate over all entries in the map.
606 * @param iterator function to call on each entry
607 * @param cls extra argument to it
608 * @return the number of key value pairs processed,
609 * GNUNET_SYSERR if it aborted iteration
611 int GNUNET_CONTAINER_multihashmap_iterate (const struct
612 GNUNET_CONTAINER_MultiHashMap *map,
613 GNUNET_CONTAINER_HashMapIterator
614 iterator, void *cls);
617 * Iterate over all entries in the map
618 * that match a particular key.
621 * @param key key that the entries must correspond to
622 * @param iterator function to call on each entry
623 * @param cls extra argument to it
624 * @return the number of key value pairs processed,
625 * GNUNET_SYSERR if it aborted iteration
627 int GNUNET_CONTAINER_multihashmap_get_multiple (const struct
628 GNUNET_CONTAINER_MultiHashMap
630 const GNUNET_HashCode * key,
631 GNUNET_CONTAINER_HashMapIterator
632 iterator, void *cls);
634 * Returns the stored value of a random non-null entry
635 * in the hash table. Returns only the first value, does
636 * not go inside bucket linked list (yet). Runs with a
637 * worst case time of N, so it's not efficient in any way
640 void *GNUNET_CONTAINER_multihashmap_get_random (const struct
641 GNUNET_CONTAINER_MultiHashMap
647 /* ******************** doubly-linked list *************** */
650 * Insert an element into a DLL. Assumes
651 * that head, tail and element are structs
652 * with prev and next fields.
654 * @param head pointer to the head of the DLL
655 * @param tail pointer to the tail of the DLL
656 * @param element element to insert
658 #define GNUNET_CONTAINER_DLL_insert(head,tail,element) \
659 (element)->next = (head); \
660 (element)->prev = NULL; \
661 if ((tail) == NULL) \
664 (head)->prev = element; \
668 * Insert an element into a DLL after the given other
669 * element. Insert at the head if the other
672 * @param head pointer to the head of the DLL
673 * @param tail pointer to the tail of the DLL
674 * @param other prior element, NULL for insertion at head of DLL
675 * @param element element to insert
677 #define GNUNET_CONTAINER_DLL_insert_after(head,tail,other,element) \
678 (element)->prev = (other); \
681 (element)->next = (head); \
682 (head) = (element); \
686 (element)->next = (other)->next; \
687 (other)->next = (element); \
689 if (NULL == (element)->next) \
690 (tail) = (element); \
692 (element)->next->prev = (element);
698 * Remove an element from a DLL. Assumes
699 * that head, tail and element are structs
700 * with prev and next fields.
702 * @param head pointer to the head of the DLL
703 * @param tail pointer to the tail of the DLL
704 * @param element element to remove
706 #define GNUNET_CONTAINER_DLL_remove(head,tail,element) \
707 if ((element)->prev == NULL) \
708 (head) = (element)->next; \
710 (element)->prev->next = (element)->next; \
711 if ((element)->next == NULL) \
712 (tail) = (element)->prev; \
714 (element)->next->prev = (element)->prev;
718 /* ******************** Heap *************** */
722 * Cost by which elements in a heap can be ordered.
724 typedef uint64_t GNUNET_CONTAINER_HeapCost;
728 * Heap type, either max or min. Hopefully makes the
729 * implementation more useful.
731 enum GNUNET_CONTAINER_HeapOrder
734 * Heap with the maximum cost at the root.
736 GNUNET_CONTAINER_HEAP_ORDER_MAX,
739 * Heap with the minimum cost at the root.
741 GNUNET_CONTAINER_HEAP_ORDER_MIN
748 struct GNUNET_CONTAINER_Heap;
753 * @param type should the minimum or the maximum element be the root
754 * @return NULL on error, otherwise a fresh heap
756 struct GNUNET_CONTAINER_Heap *GNUNET_CONTAINER_heap_create (enum
757 GNUNET_CONTAINER_HeapOrder
764 * @param h heap to free.
766 void GNUNET_CONTAINER_heap_destroy (struct GNUNET_CONTAINER_Heap *h);
770 * Function called on elements of a heap.
773 * @param element obj stored in heap
774 * @param cost cost of the element
775 * @return GNUNET_YES if we should continue to iterate,
778 typedef int (*GNUNET_CONTAINER_HeapIterator) (void *cls,
780 GNUNET_CONTAINER_HeapCost cost);
784 * Iterate over all entries in the map.
786 * @param heap the heap
787 * @param iterator function to call on each entry
788 * @param iterator_cls closure for iterator
789 * @return number of items handled
790 * GNUNET_SYSERR if iteration was aborted by iterator
792 int GNUNET_CONTAINER_heap_iterate (struct GNUNET_CONTAINER_Heap *heap,
793 GNUNET_CONTAINER_HeapIterator iterator,
799 * Inserts a new item into the heap, item is always neighbor now.
800 * @param heap the heap
801 * @param element element to insert
802 * @param cost cost of the element
806 GNUNET_CONTAINER_heap_insert (struct GNUNET_CONTAINER_Heap *heap,
807 void *element, GNUNET_CONTAINER_HeapCost cost);
811 * Removes root of the tree, is remove max if a max heap and remove min
812 * if a min heap, returns the data stored at the node.
814 * @param heap the heap
815 * @return NULL if the heap is empty
817 void *GNUNET_CONTAINER_heap_remove_root (struct GNUNET_CONTAINER_Heap *heap);
821 * Returns element stored at root of tree, doesn't effect anything
823 * @param heap the heap
824 * @return NULL if the heap is empty
826 void *GNUNET_CONTAINER_heap_peek (struct GNUNET_CONTAINER_Heap *heap);
830 * Removes any node from the tree based on the neighbor given, does
831 * not traverse the tree (backpointers) but may take more time due to
832 * percolation of nodes.
834 * @param heap the heap
835 * @param element the element to remove
836 * @return NULL if "element" was not found in the heap, otherwise element
838 void *GNUNET_CONTAINER_heap_remove_node (struct GNUNET_CONTAINER_Heap *heap,
843 * Updates the cost of any node in the tree
845 * @param heap the heap
846 * @param element the element for which the cost is updated
847 * @param new_cost new cost for the element
851 GNUNET_CONTAINER_heap_update_cost (struct GNUNET_CONTAINER_Heap *heap,
853 GNUNET_CONTAINER_HeapCost new_cost);
857 * Random walk of the tree, returns the data stored at the next random node
858 * in the walk. Calls callee with the data, or NULL if the tree is empty
859 * or some other problem crops up.
861 * @param heap the heap
862 * @return the next element from the random walk
864 void *GNUNET_CONTAINER_heap_walk_get_next (struct GNUNET_CONTAINER_Heap
869 * Returns the current size of the heap
871 * @param heap the heap to get the size of
872 * @return number of elements in the heap
875 GNUNET_CONTAINER_heap_get_size (struct GNUNET_CONTAINER_Heap *heap);
877 /* ******************** Singly linked list *************** */
880 * Handle to a singly linked list
882 struct GNUNET_CONTAINER_SList;
885 * Handle to a singly linked list iterator
887 struct GNUNET_CONTAINER_SList_Iterator;
891 * Add a new element to the list
893 * @param disp memory disposition
894 * @param buf payload buffer
895 * @param len length of the buffer
897 void GNUNET_CONTAINER_slist_add (struct GNUNET_CONTAINER_SList *l, int disp, const void *buf, size_t len);
901 * Create a new singly linked list
902 * @return the new list
904 struct GNUNET_CONTAINER_SList *GNUNET_CONTAINER_slist_create (void);
908 * Destroy a singly linked list
909 * @param l the list to be destroyed
911 void GNUNET_CONTAINER_slist_destroy (struct GNUNET_CONTAINER_SList *l);
915 * Return the beginning of a list
918 * @return iterator pointing to the beginning, free using "GNUNET_free"
920 struct GNUNET_CONTAINER_SList_Iterator *
921 GNUNET_CONTAINER_slist_begin(struct GNUNET_CONTAINER_SList *l);
929 void GNUNET_CONTAINER_slist_clear (struct GNUNET_CONTAINER_SList *l);
933 * Check if a list contains a certain element
935 * @param buf payload buffer to find
936 * @param lenght of the payload
938 int GNUNET_CONTAINER_slist_contains (const struct GNUNET_CONTAINER_SList *l, const void *buf, size_t len);
942 * Count the elements of a list
944 * @return number of elements in the list
946 int GNUNET_CONTAINER_slist_count (const struct GNUNET_CONTAINER_SList *l);
950 * Remove an element from the list
951 * @param i iterator that points to the element to be removed
953 void GNUNET_CONTAINER_slist_erase (struct GNUNET_CONTAINER_SList_Iterator *i);
957 * Insert an element into a list at a specific position
958 * @param before where to insert the new element
959 * @param disp memory disposition
960 * @param buf payload buffer
961 * @param len length of the payload
963 void GNUNET_CONTAINER_slist_insert (struct GNUNET_CONTAINER_SList_Iterator *before, int disp, const void *buf, size_t len);
967 * Advance an iterator to the next element
969 * @return GNUNET_YES on success, GNUNET_NO if the end has been reached
971 int GNUNET_CONTAINER_slist_next (struct GNUNET_CONTAINER_SList_Iterator *i);
975 * Check if an iterator points beyond the end of a list
977 * @return GNUNET_YES if the end has been reached, GNUNET_NO if the iterator
978 * points to a valid element
980 int GNUNET_CONTAINER_slist_end (struct GNUNET_CONTAINER_SList_Iterator *i);
984 * Retrieve the element at a specific position in a list
987 * @param len set to the payload length
991 GNUNET_CONTAINER_slist_get (const struct GNUNET_CONTAINER_SList_Iterator *i,
995 #if 0 /* keep Emacsens' auto-indent happy */
1003 /* ifndef GNUNET_CONTAINER_LIB_H */
1005 /* end of gnunet_container_lib.h */