tyler-trie 0.1.1 → 0.1.2

data/ext/libdatrie/datrie/trie-private.h

@@ -1,31 +0,0 @@
-/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
-/*
- * trie-private.h - Private utilities for trie implementation
- * Created: 2007-08-25
- * Author:  Theppitak Karoonboonyanan <thep@linux.thai.net>
- */
-
-#ifndef __TRIE_PRIVATE_H
-#define __TRIE_PRIVATE_H
-
-#include <datrie/typedefs.h>
-
-/**
- * @file trie-private.h
- * @brief Private utilities for trie implementation
- */
-
-/**
- * @brief Minimum value macro
- */
-#define MIN_VAL(a,b)  ((a)<(b)?(a):(b))
-/**
- * @brief Maximum value macro
- */
-#define MAX_VAL(a,b)  ((a)>(b)?(a):(b))
-
-#endif  /* __TRIE_PRIVATE_H */
-
-/*
-vi:ts=4:ai:expandtab
-*/

data/ext/libdatrie/datrie/trie.c

@@ -1,413 +0,0 @@
-/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
-/*
- * trie.c - Trie data type and functions
- * Created: 2006-08-11
- * Author:  Theppitak Karoonboonyanan <thep@linux.thai.net>
- */
-
-#include <stdlib.h>
-#include <string.h>
-
-#include "trie.h"
-#include "darray.h"
-#include "tail.h"
-
-/**
- * @brief Trie structure
- */
-struct _Trie {
-    DArray  *da;
-    Tail    *tail;
-};
-
-/**
- * @brief TrieState structure
- */
-struct _TrieState {
-    Trie      *trie;        /**< the corresponding trie */
-    TrieIndex  index;       /**< index in double-array/tail structures */
-    short      suffix_idx;  /**< suffix character offset, if in suffix */
-    short      is_suffix;   /**< whether it is currently in suffix part */
-};
-
-/*------------------------*
- *   INTERNAL FUNCTIONS   *
- *------------------------*/
-
-#define trie_da_is_separate(da,s)      (da_get_base ((da), (s)) < 0)
-#define trie_da_get_tail_index(da,s)   (-da_get_base ((da), (s)))
-#define trie_da_set_tail_index(da,s,v) (da_set_base ((da), (s), -(v)))
-
-static TrieState * trie_state_new (Trie      *trie,
-                                   TrieIndex  index,
-                                   short      suffix_idx,
-                                   short      is_suffix);
-
-static Bool        trie_branch_in_branch (Trie           *trie,
-                                          TrieIndex       sep_node,
-                                          const TrieChar *suffix,
-                                          TrieData        data);
-
-static Bool        trie_branch_in_tail   (Trie           *trie,
-                                          TrieIndex       sep_node,
-                                          const TrieChar *suffix,
-                                          TrieData        data);
-
-/*-----------------------*
- *   GENERAL FUNCTIONS   *
- *-----------------------*/
-
-Trie *
-trie_open (const char *path, const char *name, TrieIOMode mode)
-{
-    Trie *trie;
-
-    trie = (Trie *) malloc (sizeof (Trie));
-    if (!trie)
-        return NULL;
-
-    if (NULL == (trie->da   = da_open (path, name, mode)))
-        goto exit1;
-    if (NULL == (trie->tail = tail_open (path, name, mode)))
-        goto exit2;
-
-    return trie;
-
-exit2:
-    da_close (trie->da);
-exit1:
-    free (trie);
-    return NULL;
-}
-
-int
-trie_close (Trie *trie)
-{
-    if (!trie)
-        return -1;
-
-    if (da_close (trie->da) != 0)
-        return -1;
-
-    if (tail_close (trie->tail) != 0)
-        return -1;
-
-    free (trie);
-
-    return 0;
-}
-
-int
-trie_save (Trie *trie)
-{
-    if (!trie)
-        return -1;
-
-    if (da_save (trie->da) != 0)
-        return -1;
-
-    if (tail_save (trie->tail) != 0)
-        return -1;
-
-    return 0;
-}
-
-
-/*------------------------------*
- *   GENERAL QUERY OPERATIONS   *
- *------------------------------*/
-
-Bool
-trie_retrieve (Trie *trie, const TrieChar *key, TrieData *o_data)
-{
-    TrieIndex        s;
-    short            suffix_idx;
-    const TrieChar  *p;
-    size_t           len;
-
-    /* walk through branches */
-    s = da_get_root (trie->da);
-    for (p = key; !trie_da_is_separate (trie->da, s); p++) {
-        if (!da_walk (trie->da, &s, *p))
-            return FALSE;
-        if ('\0' == *p)
-            break;
-    }
-
-    /* walk through tail */
-    s = trie_da_get_tail_index (trie->da, s);
-    suffix_idx = 0;
-    len = strlen ((const char *) p) + 1;    /* including null-terminator */
-    if (tail_walk_str (trie->tail, s, &suffix_idx, p, len) != len)
-        return FALSE;
-
-    /* found, set the val and return */
-    if (o_data)
-        *o_data = tail_get_data (trie->tail, s);
-    return TRUE;
-}
-
-Bool
-trie_store (Trie *trie, const TrieChar *key, TrieData data)
-{
-    TrieIndex        s, t;
-    short            suffix_idx;
-    const TrieChar  *p;
-    size_t           len;
-
-    /* walk through branches */
-    s = da_get_root (trie->da);
-    for (p = key; !trie_da_is_separate (trie->da, s); p++) {
-        if (!da_walk (trie->da, &s, *p))
-            return trie_branch_in_branch (trie, s, p, data);
-        if ('\0' == *p)
-            break;
-    }
-
-    /* walk through tail */
-    t = trie_da_get_tail_index (trie->da, s);
-    suffix_idx = 0;
-    len = strlen ((const char *) p) + 1;    /* including null-terminator */
-    if (tail_walk_str (trie->tail, t, &suffix_idx, p, len) != len)
-        return trie_branch_in_tail (trie, s, p, data);
-
-    /* duplicated key, overwrite val */
-    tail_set_data (trie->tail, t, data);
-    return TRUE;
-}
-
-static Bool
-trie_branch_in_branch (Trie           *trie,
-                       TrieIndex       sep_node,
-                       const TrieChar *suffix,
-                       TrieData        data)
-{
-    TrieIndex new_da, new_tail;
-
-    new_da = da_insert_branch (trie->da, sep_node, *suffix);
-    if (TRIE_INDEX_ERROR == new_da)
-        return FALSE;
-
-    if ('\0' != *suffix)
-        ++suffix;
-
-    new_tail = tail_add_suffix (trie->tail, suffix);
-    tail_set_data (trie->tail, new_tail, data);
-    trie_da_set_tail_index (trie->da, new_da, new_tail);
-
-    return TRUE;
-}
-
-static Bool
-trie_branch_in_tail   (Trie           *trie,
-                       TrieIndex       sep_node,
-                       const TrieChar *suffix,
-                       TrieData        data)
-{
-    TrieIndex       old_tail, old_da, s;
-    const TrieChar *old_suffix, *p;
-
-    /* adjust separate point in old path */
-    old_tail = trie_da_get_tail_index (trie->da, sep_node);
-    old_suffix = tail_get_suffix (trie->tail, old_tail);
-    if (!old_suffix)
-        return FALSE;
-
-    for (p = old_suffix, s = sep_node; *p == *suffix; p++, suffix++) {
-        TrieIndex t = da_insert_branch (trie->da, s, *p);
-        if (TRIE_INDEX_ERROR == t)
-            goto fail;
-        s = t;
-    }
-
-    old_da = da_insert_branch (trie->da, s, *p);
-    if (TRIE_INDEX_ERROR == old_da)
-        goto fail;
-
-    if ('\0' != *p)
-        ++p;
-    tail_set_suffix (trie->tail, old_tail, p);
-    trie_da_set_tail_index (trie->da, old_da, old_tail);
-
-    /* insert the new branch at the new separate point */
-    return trie_branch_in_branch (trie, s, suffix, data);
-
-fail:
-    /* failed, undo previous insertions and return error */
-    da_prune_upto (trie->da, sep_node, s);
-    trie_da_set_tail_index (trie->da, sep_node, old_tail);
-    return FALSE;
-}
-
-Bool
-trie_delete (Trie *trie, const TrieChar *key)
-{
-    TrieIndex        s, t;
-    short            suffix_idx;
-    const TrieChar  *p;
-    size_t           len;
-
-    /* walk through branches */
-    s = da_get_root (trie->da);
-    for (p = key; !trie_da_is_separate (trie->da, s); p++) {
-        if (!da_walk (trie->da, &s, *p))
-            return FALSE;
-        if ('\0' == *p)
-            break;
-    }
-
-    /* walk through tail */
-    t = trie_da_get_tail_index (trie->da, s);
-    suffix_idx = 0;
-    len = strlen ((const char *) p) + 1;    /* including null-terminator */
-    if (tail_walk_str (trie->tail, t, &suffix_idx, p, len) != len)
-        return FALSE;
-
-    tail_delete (trie->tail, t);
-    da_set_base (trie->da, s, TRIE_INDEX_ERROR);
-    da_prune (trie->da, s);
-
-    return TRUE;
-}
-
-typedef struct {
-    Trie           *trie;
-    TrieEnumFunc    enum_func;
-    void           *user_data;
-} _TrieEnumData;
-
-static Bool
-trie_da_enum_func (const TrieChar *key, TrieIndex sep_node, void *user_data)
-{
-    _TrieEnumData  *enum_data;
-    TrieIndex       t;
-    const TrieChar *suffix;
-    TrieChar       *full_key;
-    Bool            ret;
-
-    enum_data = (_TrieEnumData *) user_data;
-
-    t = trie_da_get_tail_index (enum_data->trie->da, sep_node);
-    suffix = tail_get_suffix (enum_data->trie->tail, t);
-
-    full_key = (TrieChar *) malloc (strlen ((const char *)key)
-                                    + strlen ((const char *)suffix) + 1);
-    strcat (strcpy ((char *)full_key, (const char *)key), (const char *)suffix);
-
-    ret = (*enum_data->enum_func) (full_key,
-                                   tail_get_data (enum_data->trie->tail, t),
-                                   enum_data->user_data);
-
-    free (full_key);
-    return ret;
-}
-
-Bool
-trie_enumerate (Trie *trie, TrieEnumFunc enum_func, void *user_data)
-{
-    _TrieEnumData   enum_data;
-
-    enum_data.trie      = trie;
-    enum_data.enum_func = enum_func;
-    enum_data.user_data = user_data;
-
-    return da_enumerate (trie->da, trie_da_enum_func, &enum_data);
-}
-
-
-/*-------------------------------*
- *   STEPWISE QUERY OPERATIONS   *
- *-------------------------------*/
-
-TrieState *
-trie_root (Trie *trie)
-{
-    return trie_state_new (trie, da_get_root (trie->da), 0, FALSE);
-}
-
-/*----------------*
- *   TRIE STATE   *
- *----------------*/
-
-static TrieState *
-trie_state_new (Trie *trie, TrieIndex index, short suffix_idx, short is_suffix)
-{
-    TrieState *s;
-
-    s = (TrieState *) malloc (sizeof (TrieState));
-    if (!s)
-        return NULL;
-
-    s->trie       = trie;
-    s->index      = index;
-    s->suffix_idx = suffix_idx;
-    s->is_suffix  = is_suffix;
-
-    return s;
-}
-
-TrieState *
-trie_state_clone (const TrieState *s)
-{
-    return trie_state_new (s->trie, s->index, s->suffix_idx, s->is_suffix);
-}
-
-void
-trie_state_free (TrieState *s)
-{
-    free (s);
-}
-
-void
-trie_state_rewind (TrieState *s)
-{
-    s->index      = da_get_root (s->trie->da);
-    s->is_suffix  = FALSE;
-}
-
-Bool
-trie_state_walk (TrieState *s, TrieChar c)
-{
-    if (!s->is_suffix) {
-        Bool ret;
-
-        ret = da_walk (s->trie->da, &s->index, c);
-
-        if (ret && trie_da_is_separate (s->trie->da, s->index)) {
-            s->index = trie_da_get_tail_index (s->trie->da, s->index);
-            s->suffix_idx = 0;
-            s->is_suffix = TRUE;
-        }
-
-        return ret;
-    } else {
-        return tail_walk_char (s->trie->tail, s->index, &s->suffix_idx, c);
-    }
-}
-
-Bool
-trie_state_is_walkable (const TrieState *s, TrieChar c)
-{
-    if (!s->is_suffix)
-        return da_is_walkable (s->trie->da, s->index, c);
-    else 
-        return tail_is_walkable_char (s->trie->tail, s->index, s->suffix_idx,
-                                      c);
-}
-
-Bool
-trie_state_is_leaf (const TrieState *s)
-{
-    return s->is_suffix && trie_state_is_terminal (s);
-}
-
-TrieData
-trie_state_get_data (const TrieState *s)
-{
-    return s->is_suffix ? tail_get_data (s->trie->tail, s->index)
-                        : TRIE_DATA_ERROR;
-}
-
-/*
-vi:ts=4:ai:expandtab
-*/

data/ext/libdatrie/datrie/trie.h

@@ -1,270 +0,0 @@
-/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
-/*
- * trie.h - Trie data type and functions
- * Created: 2006-08-11
- * Author:  Theppitak Karoonboonyanan <thep@linux.thai.net>
- */
-
-#ifndef __TRIE_H
-#define __TRIE_H
-
-#include <datrie/triedefs.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * @file trie.h
- * @brief Trie data type and functions
- */
-
-/**
- * @brief Trie data type
- */
-typedef struct _Trie   Trie;
-
-/**
- * @brief Trie enumeration function
- *
- * @param key  : the key of the entry
- * @param data : the data of the entry
- *
- * @return TRUE to continue enumeration, FALSE to stop
- */
-typedef Bool (*TrieEnumFunc) (const TrieChar   *key,
-                              TrieData          key_data,
-                              void             *user_data);
-
-/**
- * @brief Trie walking state
- */
-typedef struct _TrieState TrieState;
-
-/*-----------------------*
- *   GENERAL FUNCTIONS   *
- *-----------------------*/
-
-/**
- * @brief Open a trie
- *
- * @param path : the path that stores the trie files
- * @param name : the name of the trie (not actual file name)
- * @param mode : openning mode, read or write
- *
- * @return a pointer to the openned trie, NULL on failure
- *
- * Open a trie of given name. Note that @a name here does not mean the
- * actual file name. Rather, the file name will be inferred by the name.
- */
-Trie *  trie_open (const char *path, const char *name, TrieIOMode mode);
-
-/**
- * @brief Close a trie
- *
- * @param trie: the trie
- *
- * @return 0 on success, non-zero on failure
- *
- * Close the given trie. If @a trie was openned for writing, all pending
- * changes will be saved to file.
- */
-int     trie_close (Trie *trie);
-
-/**
- * @brief Save a trie
- *
- * @param trie: the trie
- *
- * @return 0 on success, non-zero on failure
- *
- * If @a trie was openned for writing, save all pending data to file.
- */
-int     trie_save (Trie *trie);
-
-
-/*------------------------------*
- *   GENERAL QUERY OPERATIONS   *
- *------------------------------*/
-
-/**
- * @brief Retrieve an entry from trie
- *
- * @param trie   : the trie
- * @param key    : the key for the entry to retrieve
- * @param o_data : the storage for storing the entry data on return
- *
- * @return boolean value indicating the existence of the entry.
- *
- * Retrieve an entry for the given @a key from @a trie. On return,
- * if @a key is found and @a o_val is not NULL, @a *o_val is set
- * to the data associated to @a key.
- */
-Bool    trie_retrieve (Trie *trie, const TrieChar *key, TrieData *o_data);
-
-/**
- * @brief Store a value for  an entry to trie
- *
- * @param trie  : the trie
- * @param key   : the key for the entry to retrieve
- * @param data  : the data associated to the entry
- *
- * @return boolean value indicating the success of the process
- *
- * Store a data @a data for the given @a key in @a trie. If @a key does not 
- * exist in @a trie, it will be appended.
- */
-Bool    trie_store (Trie *trie, const TrieChar *key, TrieData data);
-
-/**
- * @brief Delete an entry from trie
- *
- * @param trie  : the trie
- * @param key   : the key for the entry to delete
- *
- * @return boolean value indicating whether the key exists and is removed
- *
- * Delete an entry for the given @a key from @a trie.
- */
-Bool    trie_delete (Trie *trie, const TrieChar *key);
-
-/**
- * @brief Enumerate entries in trie
- *
- * @param trie       : the trie
- * @param enum_func  : the callback function to be called on each key
- * @param user_data  : user-supplied data to send as an argument to @a enum_func
- *
- * @return boolean value indicating whether all the keys are visited
- *
- * Enumerate all entries in trie. For each entry, the user-supplied 
- * @a enum_func callback function is called, with the entry key and data.
- * Returning FALSE from such callback will stop enumeration and return FALSE.
- */
-Bool    trie_enumerate (Trie *trie, TrieEnumFunc enum_func, void *user_data);
-
-
-/*-------------------------------*
- *   STEPWISE QUERY OPERATIONS   *
- *-------------------------------*/
-
-/**
- * @brief Get root state of a trie
- *
- * @param trie : the trie
- *
- * @return the root state of the trie
- *
- * Get root state of @a trie, for stepwise walking.
- *
- * The returned state is allocated and must be freed with trie_state_free()
- */
-TrieState * trie_root (Trie *trie);
-
-
-/*----------------*
- *   TRIE STATE   *
- *----------------*/
-
-/**
- * @brief Clone a trie state
- *
- * @param s    : the state to clone
- *
- * @return an duplicated instance of @a s
- *
- * Make a copy of trie state.
- *
- * The returned state is allocated and must be freed with trie_state_free()
- */
-TrieState * trie_state_clone (const TrieState *s);
-
-/**
- * @brief Free a trie state
- *
- * @param s    : the state to free
- *
- * Free the trie state.
- */
-void      trie_state_free (TrieState *s);
-
-/**
- * @brief Rewind a trie state
- *
- * @param s    : the state to rewind
- *
- * Put the state at root.
- */
-void      trie_state_rewind (TrieState *s);
-
-/**
- * @brief Walk the trie from the state
- *
- * @param s    : current state
- * @param c    : key character for walking
- *
- * @return boolean value indicating the success of the walk
- *
- * Walk the trie stepwise, using a given character @a c.
- * On return, the state @a s is updated to the new state if successfully walked.
- */
-Bool      trie_state_walk (TrieState *s, TrieChar c);
-
-/**
- * @brief Test walkability of character from state
- *
- * @param s    : the state to check
- * @param c    : the input character
- *
- * @return boolean indicating walkability
- *
- * Test if there is a transition from state @a s with input character @a c.
- */
-Bool      trie_state_is_walkable (const TrieState *s, TrieChar c);
-
-/**
- * @brief Check for terminal state
- *
- * @param s    : the state to check
- *
- * @return boolean value indicating whether it is a terminal state
- *
- * Check if the given state is a terminal state. A leaf state is a trie state 
- * that terminates a key, and stores a value associated with the key.
- */
-#define   trie_state_is_terminal(s) trie_state_is_walkable((s),TRIE_CHAR_TERM)
-
-/**
- * @brief Check for leaf state
- *
- * @param s    : the state to check
- *
- * @return boolean value indicating whether it is a leaf state
- *
- * Check if the given state is a leaf state. A leaf state is a terminal state 
- * that has no other branch.
- */
-Bool      trie_state_is_leaf (const TrieState *s);
-
-/**
- * @brief Get data from leaf state
- *
- * @param s    : the leaf state
- *
- * @return the data associated with the leaf state @a s,
- *         or TRIE_DATA_ERROR if @a s is not a leaf state
- *
- * Get value from a leaf state of trie. Getting the value from leaf state 
- * will result in TRIE_DATA_ERROR.
- */
-TrieData trie_state_get_data (const TrieState *s);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif  /* __TRIE_H */
-
-/*
-vi:ts=4:ai:expandtab
-*/