* TRIE_WANT_FIND_BUF node *find_buf(byte *ptr, uns len)
* TRIE_WANT_ADD add(*node)
* TRIE_WANT_REPLACE node *replace(*node)
- * TRIE_WANT_DELETE delete(char *str)
- * TRIE_WANT_DELETE_BUF delete_buf(byte *ptr, uns len)
- * TRIE_WANT_REMOVE remove(*node)
+ * TRIE_WANT_DELETE delete(char *str)
+ * TRIE_WANT_DELETE_BUF delete_buf(byte *ptr, uns len)
+ * TRIE_WANT_REMOVE remove(*node)
*
* TRIE_WANT_AUDIT audit()
* TRIE_WANT_STATS
+ *
+ * Be warned that the implementation uses alloca() in several macros,
+ * so if you use automatic variable-length arrays in the same function,
+ * all the hell may be unleashed.
*/
/*** Define once ***/
#ifndef _SHERLOCK_UCW_TRIE_H
#define _SHERLOCK_UCW_TRIE_H
-#include "ucw/eltpool.h"
-#include "ucw/hashfunc.h"
+#include <ucw/eltpool.h>
+#include <ucw/hashfunc.h>
#include <string.h>