support for tries
git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@727 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
This commit is contained in:
vsc
parent
910e50d980
commit
f7161d37c4
@ -39,6 +39,7 @@ PROGRAMS= $(srcdir)/apply_macros.yap \
|
||||
$(srcdir)/regexp.yap \
|
||||
$(srcdir)/system.yap \
|
||||
$(srcdir)/terms.yap \
|
||||
$(srcdir)/tries.yap \
|
||||
$(srcdir)/timeout.yap \
|
||||
$(srcdir)/trees.yap \
|
||||
$(srcdir)/ugraphs.yap
|
||||
|
||||
194
library/Tries/tries.h
Normal file
194
library/Tries/tries.h
Normal file
@ -0,0 +1,194 @@
|
||||
/******************************************
|
||||
* File: tries.h *
|
||||
* Author: Ricardo Rocha *
|
||||
* Comments: Tries module for yap *
|
||||
******************************************/
|
||||
|
||||
/* ----------------------------- */
|
||||
/* Structs and Defines */
|
||||
/* ----------------------------- */
|
||||
|
||||
struct trie_stats {
|
||||
long memory_in_use;
|
||||
long memory_max_used;
|
||||
long nodes_in_use;
|
||||
long nodes_max_used;
|
||||
long hashes_in_use;
|
||||
long hashes_max_used;
|
||||
long buckets_in_use;
|
||||
long buckets_max_used;
|
||||
} STATS;
|
||||
|
||||
typedef struct trie_node {
|
||||
YAP_Term entry;
|
||||
int hits;
|
||||
struct trie_node *parent;
|
||||
struct trie_node *child;
|
||||
struct trie_node *next;
|
||||
struct trie_node *previous;
|
||||
} *TrNode;
|
||||
|
||||
typedef struct trie_hash {
|
||||
YAP_Term entry; /* for compatibility with the trie_node data structure */
|
||||
int number_of_buckets;
|
||||
int number_of_nodes;
|
||||
struct trie_node **buckets;
|
||||
struct trie_hash *next;
|
||||
struct trie_hash *previous;
|
||||
} *TrHash;
|
||||
|
||||
#define MEMORY_IN_USE (STATS.memory_in_use)
|
||||
#define MEMORY_MAX_USED (STATS.memory_max_used)
|
||||
#define NODES_IN_USE (STATS.nodes_in_use)
|
||||
#define NODES_MAX_USED (STATS.nodes_max_used)
|
||||
#define HASHES_IN_USE (STATS.hashes_in_use)
|
||||
#define HASHES_MAX_USED (STATS.hashes_max_used)
|
||||
#define BUCKETS_IN_USE (STATS.buckets_in_use)
|
||||
#define BUCKETS_MAX_USED (STATS.buckets_max_used)
|
||||
|
||||
#define TrNode_entry(X) ((X)->entry)
|
||||
#define TrNode_hits(X) ((X)->hits)
|
||||
#define TrNode_parent(X) ((X)->parent)
|
||||
#define TrNode_child(X) ((X)->child)
|
||||
#define TrNode_next(X) ((X)->next)
|
||||
#define TrNode_previous(X) ((X)->previous)
|
||||
|
||||
#define TrHash_mark(X) ((X)->entry)
|
||||
#define TrHash_num_buckets(X) ((X)->number_of_buckets)
|
||||
#define TrHash_seed(X) ((X)->number_of_buckets - 1)
|
||||
#define TrHash_num_nodes(X) ((X)->number_of_nodes)
|
||||
#define TrHash_buckets(X) ((X)->buckets)
|
||||
#define TrHash_bucket(X,N) ((X)->buckets + N)
|
||||
#define TrHash_next(X) ((X)->next)
|
||||
#define TrHash_previous(X) ((X)->previous)
|
||||
|
||||
#define TYPE_TR_NODE struct trie_node
|
||||
#define TYPE_TR_HASH struct trie_hash
|
||||
#define SIZEOF_TR_NODE sizeof(TYPE_TR_NODE)
|
||||
#define SIZEOF_TR_HASH sizeof(TYPE_TR_HASH)
|
||||
#define SIZEOF_TR_BUCKET sizeof(TYPE_TR_NODE *)
|
||||
|
||||
#define AS_TR_NODE_NEXT(ADDRESS) (TrNode)((int)(ADDRESS) - sizeof(YAP_Term) - sizeof(int) - 2 * sizeof(struct trie_node *))
|
||||
#define AS_TR_HASH_NEXT(ADDRESS) (TrHash)((int)(ADDRESS) - sizeof(YAP_Term) - 2 * sizeof(int) - sizeof(struct trie_node **))
|
||||
|
||||
#define TERM_STACK_SIZE 1000
|
||||
|
||||
#define MkTrieVar(INDEX) ((INDEX) << 4)
|
||||
#define TrieVarIndex(TERM) ((TERM) >> 4)
|
||||
#define IsTrieVar(TERM) ((YAP_Term *)(TERM) > stack_vars && (YAP_Term *)(TERM) <= stack_vars_base)
|
||||
|
||||
#define HASH_MARK ((YAP_Term) MkTrieVar(TERM_STACK_SIZE))
|
||||
#define BASE_HASH_BUCKETS 64
|
||||
#define MAX_NODES_PER_TRIE_LEVEL 8
|
||||
#define MAX_NODES_PER_BUCKET (MAX_NODES_PER_TRIE_LEVEL / 2)
|
||||
#define IS_TRIE_HASH(NODE) (TrHash_mark(NODE) == HASH_MARK)
|
||||
#define HASH_TERM(TERM, SEED) (((TERM) >> 4) & (SEED))
|
||||
|
||||
#define STACK_NOT_EMPTY(STACK, STACK_BASE) STACK != STACK_BASE
|
||||
#define POP_UP(STACK) *--STACK
|
||||
#define POP_DOWN(STACK) *++STACK
|
||||
#define PUSH_DOWN(STACK, ITEM, STACK_TOP) \
|
||||
{ if (STACK > STACK_TOP) \
|
||||
fprintf(stderr, "\nTries module: TERM_STACK full"); \
|
||||
*STACK++ = (YAP_Term)(ITEM); \
|
||||
}
|
||||
#define PUSH_UP(STACK, ITEM, STACK_TOP) \
|
||||
{ if (STACK < STACK_TOP) \
|
||||
fprintf(stderr, "\nTries module: TERM_STACK full"); \
|
||||
*STACK-- = (YAP_Term)(ITEM); \
|
||||
}
|
||||
|
||||
|
||||
|
||||
#define new_struct(STR, STR_TYPE, STR_SIZE) \
|
||||
STR = (STR_TYPE *) YAP_AllocSpaceFromYap(STR_SIZE)
|
||||
#define free_struct(STR) \
|
||||
YAP_FreeSpaceFromYap((void *) (STR))
|
||||
#define free_trie_node(STR) \
|
||||
free_struct(STR); \
|
||||
STATS_node_dec()
|
||||
#define free_hash_buckets(STR, NUM_BUCKETS) \
|
||||
free_struct(STR); \
|
||||
STATS_buckets_dec(NUM_BUCKETS)
|
||||
#define free_trie_hash(STR) \
|
||||
free_struct(STR); \
|
||||
STATS_hash_dec()
|
||||
|
||||
#define new_trie_node(TR_NODE, ENTRY, PARENT, CHILD, NEXT, PREVIOUS) \
|
||||
new_struct(TR_NODE, TYPE_TR_NODE, SIZEOF_TR_NODE); \
|
||||
TrNode_entry(TR_NODE) = ENTRY; \
|
||||
TrNode_hits(TR_NODE) = 0; \
|
||||
TrNode_parent(TR_NODE) = PARENT; \
|
||||
TrNode_child(TR_NODE) = CHILD; \
|
||||
TrNode_next(TR_NODE) = NEXT; \
|
||||
TrNode_previous(TR_NODE) = PREVIOUS; \
|
||||
STATS_node_inc()
|
||||
#define new_hash_buckets(TR_HASH, NUM_BUCKETS) \
|
||||
{ int i; void **ptr; \
|
||||
new_struct(ptr, void *, NUM_BUCKETS * sizeof(void *)); \
|
||||
TrHash_buckets(TR_HASH) = (TYPE_TR_NODE **) ptr; \
|
||||
for (i = NUM_BUCKETS; i != 0; i--) \
|
||||
*ptr++ = NULL; \
|
||||
STATS_buckets_inc(NUM_BUCKETS); \
|
||||
}
|
||||
#define new_trie_hash(TR_HASH, NUM_NODES) \
|
||||
new_struct(TR_HASH, TYPE_TR_HASH, SIZEOF_TR_HASH); \
|
||||
TrHash_mark(TR_HASH) = HASH_MARK; \
|
||||
TrHash_num_buckets(TR_HASH) = BASE_HASH_BUCKETS; \
|
||||
new_hash_buckets(TR_HASH, BASE_HASH_BUCKETS); \
|
||||
TrHash_num_nodes(TR_HASH) = NUM_NODES; \
|
||||
TrHash_next(TR_HASH) = HASHES; \
|
||||
TrHash_previous(TR_HASH) = AS_TR_HASH_NEXT(&HASHES); \
|
||||
if (HASHES) \
|
||||
TrHash_previous(HASHES) = TR_HASH; \
|
||||
HASHES = TR_HASH; \
|
||||
STATS_hash_inc()
|
||||
|
||||
#define STATS_node_inc() \
|
||||
NODES_IN_USE++; \
|
||||
if (NODES_IN_USE > NODES_MAX_USED) \
|
||||
NODES_MAX_USED = NODES_IN_USE; \
|
||||
MEMORY_IN_USE += SIZEOF_TR_NODE; \
|
||||
if (MEMORY_IN_USE > MEMORY_MAX_USED) \
|
||||
MEMORY_MAX_USED = MEMORY_IN_USE
|
||||
#define STATS_node_dec() \
|
||||
NODES_IN_USE--; \
|
||||
MEMORY_IN_USE -= SIZEOF_TR_NODE
|
||||
#define STATS_hash_inc() \
|
||||
HASHES_IN_USE++; \
|
||||
if (HASHES_IN_USE > HASHES_MAX_USED) \
|
||||
HASHES_MAX_USED = HASHES_IN_USE; \
|
||||
MEMORY_IN_USE += SIZEOF_TR_HASH; \
|
||||
if (MEMORY_IN_USE > MEMORY_MAX_USED) \
|
||||
MEMORY_MAX_USED = MEMORY_IN_USE
|
||||
#define STATS_hash_dec() \
|
||||
HASHES_IN_USE--; \
|
||||
MEMORY_IN_USE -= SIZEOF_TR_HASH
|
||||
#define STATS_buckets_inc(N) \
|
||||
BUCKETS_IN_USE += N; \
|
||||
if (BUCKETS_IN_USE > BUCKETS_MAX_USED) \
|
||||
BUCKETS_MAX_USED = BUCKETS_IN_USE; \
|
||||
MEMORY_IN_USE += (N) * SIZEOF_TR_BUCKET; \
|
||||
if (MEMORY_IN_USE > MEMORY_MAX_USED) \
|
||||
MEMORY_MAX_USED = MEMORY_IN_USE
|
||||
#define STATS_buckets_dec(N) \
|
||||
BUCKETS_IN_USE -= N; \
|
||||
MEMORY_IN_USE -= (N) * SIZEOF_TR_BUCKET
|
||||
|
||||
|
||||
|
||||
/* ------------- */
|
||||
/* API */
|
||||
/* ------------- */
|
||||
|
||||
extern TrNode TRIES;
|
||||
extern TrHash HASHES;
|
||||
|
||||
TrNode open_trie(void);
|
||||
void close_trie(TrNode node);
|
||||
void close_all_tries(void);
|
||||
TrNode put_trie_entry(TrNode node, YAP_Term entry);
|
||||
YAP_Term get_trie_entry(TrNode node);
|
||||
void remove_trie_entry(TrNode node);
|
||||
void trie_stats(void);
|
||||
void print_trie(TrNode node);
|
||||
160
library/Tries/yap_tries.c
Normal file
160
library/Tries/yap_tries.c
Normal file
@ -0,0 +1,160 @@
|
||||
/******************************************
|
||||
* File: yap_tries.c *
|
||||
* Author: Ricardo Rocha *
|
||||
* Comments: Tries module for yap *
|
||||
******************************************/
|
||||
|
||||
#include "config.h"
|
||||
#include "YapInterface.h"
|
||||
|
||||
#include <stdio.h>
|
||||
#if HAVE_STRING_H
|
||||
#include <string.h>
|
||||
#endif
|
||||
#include "tries.h"
|
||||
|
||||
#include "tries.c"
|
||||
|
||||
void init_tries(void);
|
||||
static int p_open_trie(void);
|
||||
static int p_close_trie(void);
|
||||
static int p_close_all_tries(void);
|
||||
static int p_put_trie_entry(void);
|
||||
static int p_get_trie_entry(void);
|
||||
static int p_remove_trie_entry(void);
|
||||
static int p_trie_stats(void);
|
||||
static int p_print_trie(void);
|
||||
|
||||
|
||||
void init_tries(void) {
|
||||
TRIES = NULL;
|
||||
HASHES = NULL;
|
||||
MEMORY_IN_USE = 0;
|
||||
MEMORY_MAX_USED = 0;
|
||||
NODES_IN_USE = 0;
|
||||
NODES_MAX_USED = 0;
|
||||
HASHES_IN_USE = 0;
|
||||
HASHES_MAX_USED = 0;
|
||||
BUCKETS_IN_USE = 0;
|
||||
BUCKETS_MAX_USED = 0;
|
||||
|
||||
YAP_UserCPredicate("open_trie", p_open_trie, 1); /* -> Ref */
|
||||
YAP_UserCPredicate("close_trie", p_close_trie, 1); /* Ref -> */
|
||||
YAP_UserCPredicate("close_all_tries", p_close_all_tries, 0); /* -> */
|
||||
YAP_UserCPredicate("put_trie_entry", p_put_trie_entry, 3); /* Ref x Entry -> Ref */
|
||||
YAP_UserCPredicate("get_trie_entry", p_get_trie_entry, 2); /* Ref -> Entry */
|
||||
YAP_UserCPredicate("remove_trie_entry", p_remove_trie_entry, 1); /* Ref -> */
|
||||
YAP_UserCPredicate("trie_statistics", p_trie_stats, 0); /* -> */
|
||||
YAP_UserCPredicate("print_trie", p_print_trie, 1); /* Ref -> */
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
|
||||
/* open_trie(+Ref) */
|
||||
static int p_open_trie(void) {
|
||||
YAP_Term arg1 = YAP_ARG1;
|
||||
TrNode node;
|
||||
|
||||
/* check arg */
|
||||
if (!YAP_IsVarTerm(arg1))
|
||||
return FALSE;
|
||||
/* open trie */
|
||||
node = open_trie();
|
||||
/* return node reference */
|
||||
if (!YAP_Unify(arg1, YAP_MkIntTerm((int) node)))
|
||||
return FALSE;
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
/* close_trie(-Ref) */
|
||||
static int p_close_trie(void) {
|
||||
YAP_Term arg1 = YAP_ARG1;
|
||||
|
||||
/* check args */
|
||||
if (!YAP_IsIntTerm(arg1))
|
||||
return FALSE;
|
||||
/* free trie */
|
||||
close_trie((TrNode) YAP_IntOfTerm(arg1));
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
/* close_all_tries() */
|
||||
static int p_close_all_tries(void) {
|
||||
/* close all tries */
|
||||
close_all_tries();
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
/* put_trie_entry(-Ref,-Entry,+Ref) */
|
||||
static int p_put_trie_entry(void) {
|
||||
YAP_Term arg1 = YAP_ARG1;
|
||||
YAP_Term arg2 = YAP_ARG2;
|
||||
YAP_Term arg3 = YAP_ARG3;
|
||||
TrNode node;
|
||||
|
||||
/* check args */
|
||||
if (!YAP_IsIntTerm(arg1))
|
||||
return FALSE;
|
||||
/* put entry */
|
||||
node = put_trie_entry((TrNode) YAP_IntOfTerm(arg1), arg2);
|
||||
/* return node reference */
|
||||
if (!YAP_Unify(arg3, YAP_MkIntTerm((int) node)))
|
||||
return FALSE;
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
/* get_trie_entry(-Ref,+Entry) */
|
||||
static int p_get_trie_entry(void) {
|
||||
YAP_Term arg1 = YAP_ARG1;
|
||||
YAP_Term arg2 = YAP_ARG2;
|
||||
YAP_Term entry;
|
||||
|
||||
/* check args */
|
||||
if (!YAP_IsIntTerm(arg1))
|
||||
return FALSE;
|
||||
/* get entry */
|
||||
entry = get_trie_entry((TrNode) YAP_IntOfTerm(arg1));
|
||||
/* return entry reference */
|
||||
if (!YAP_Unify(arg2, entry))
|
||||
return FALSE;
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
/* remove_trie_entry(-Ref) */
|
||||
static int p_remove_trie_entry(void) {
|
||||
YAP_Term arg1 = YAP_ARG1;
|
||||
|
||||
/* check arg */
|
||||
if (!YAP_IsIntTerm(arg1))
|
||||
return FALSE;
|
||||
/* remove trie entry */
|
||||
remove_trie_entry((TrNode) YAP_IntOfTerm(arg1));
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
/* trie_statistics() */
|
||||
static int p_trie_stats(void) {
|
||||
/* print trie statistics */
|
||||
trie_stats();
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
/* print_trie(-Ref) */
|
||||
static int p_print_trie(void) {
|
||||
YAP_Term arg1 = YAP_ARG1;
|
||||
|
||||
/* check arg */
|
||||
if (!YAP_IsIntTerm(arg1))
|
||||
return FALSE;
|
||||
/* print trie */
|
||||
print_trie((TrNode) YAP_IntOfTerm(arg1));
|
||||
return TRUE;
|
||||
}
|
||||
30
library/tries.yap
Normal file
30
library/tries.yap
Normal file
@ -0,0 +1,30 @@
|
||||
/*************************************************************************
|
||||
* *
|
||||
* YAP Prolog *
|
||||
* *
|
||||
* Yap Prolog was developed at NCCUP - Universidade do Porto *
|
||||
* *
|
||||
* Copyright L.Damas, V.S.Costa and Universidade do Porto 1985-1997 *
|
||||
* *
|
||||
**************************************************************************
|
||||
* *
|
||||
* File: tries.yap *
|
||||
* Last rev: *
|
||||
* mods: *
|
||||
* comments: Tries manipulation routines *
|
||||
* *
|
||||
*************************************************************************/
|
||||
|
||||
:- module(tries, [
|
||||
open_trie/1,
|
||||
close_trie/1,
|
||||
close_all_tries/0,
|
||||
put_trie_entry/3,
|
||||
get_trie_entry/2,
|
||||
remove_trie_entry/1,
|
||||
trie_statistics/0,
|
||||
print_trie/1
|
||||
]).
|
||||
|
||||
:- load_foreign_files([yap_tries], [], init_tries).
|
||||
|
||||
Reference in New Issue
Block a user