qse/ase/stx/hash.c

94 lines
2.1 KiB
C
Raw Normal View History

2005-05-08 15:54:44 +00:00
/*
2005-05-22 04:34:22 +00:00
* $Id: hash.c,v 1.16 2005-05-22 04:34:22 bacon Exp $
2005-05-08 15:54:44 +00:00
*/
#include <xp/stx/hash.h>
2005-05-10 06:08:57 +00:00
#include <xp/stx/object.h>
2005-05-15 18:37:00 +00:00
#include <xp/stx/misc.h>
2005-05-08 15:54:44 +00:00
2005-05-18 04:01:51 +00:00
xp_stx_word_t xp_stx_new_pairlink (
2005-05-10 06:02:19 +00:00
xp_stx_t* stx, xp_stx_word_t key, xp_stx_word_t value)
2005-05-08 15:54:44 +00:00
{
xp_stx_word_t x;
2005-05-22 04:34:22 +00:00
x = xp_stx_alloc_word_object (stx, XP_STX_PAIRLINK_SIZE);
2005-05-18 04:01:51 +00:00
XP_STX_CLASS(stx,x) = stx->class_pairlink;
2005-05-22 04:34:22 +00:00
XP_STX_AT(stx,x,XP_STX_PAIRLINK_LINK) = stx->nil;
2005-05-18 04:01:51 +00:00
XP_STX_AT(stx,x,XP_STX_PAIRLINK_KEY) = key;
XP_STX_AT(stx,x,XP_STX_PAIRLINK_VALUE) = value;
2005-05-08 15:54:44 +00:00
return x;
}
2005-05-10 06:02:19 +00:00
/* returns the entire link */
xp_stx_word_t xp_stx_hash_lookup (
xp_stx_t* stx, xp_stx_word_t table,
xp_stx_word_t hash, xp_stx_word_t key)
2005-05-08 15:54:44 +00:00
{
2005-05-10 08:21:10 +00:00
xp_stx_word_t link;
2005-05-08 15:54:44 +00:00
2005-05-22 04:34:22 +00:00
xp_stx_assert (XP_STX_TYPE(stx,table) == XP_STX_WORD_INDEXED);
2005-05-08 15:54:44 +00:00
2005-05-10 06:08:57 +00:00
hash = hash % XP_STX_SIZE(stx,table);
2005-05-10 08:21:10 +00:00
link = XP_STX_AT(stx,table,hash);
2005-05-09 15:55:04 +00:00
2005-05-10 06:02:19 +00:00
while (link != stx->nil) {
2005-05-18 04:01:51 +00:00
if (XP_STX_AT(stx,link,XP_STX_PAIRLINK_KEY) == key) return link;
link = XP_STX_AT(stx,link,XP_STX_PAIRLINK_LINK);
2005-05-15 18:37:00 +00:00
}
return stx->nil; /* not found */
}
2005-05-10 06:02:19 +00:00
void xp_stx_hash_insert (
xp_stx_t* stx, xp_stx_word_t table,
xp_stx_word_t hash, xp_stx_word_t key, xp_stx_word_t value)
{
2005-05-10 08:21:10 +00:00
xp_stx_word_t link, next;
2005-05-08 15:54:44 +00:00
2005-05-22 04:34:22 +00:00
xp_stx_assert (XP_STX_TYPE(stx,table) == XP_STX_WORD_INDEXED);
2005-05-10 06:02:19 +00:00
2005-05-10 06:08:57 +00:00
hash = hash % XP_STX_SIZE(stx,table);
2005-05-10 08:21:10 +00:00
link = XP_STX_AT(stx,table,hash);
2005-05-10 06:02:19 +00:00
if (link == stx->nil) {
2005-05-19 15:08:04 +00:00
XP_STX_AT(stx,table,hash) =
2005-05-18 04:01:51 +00:00
xp_stx_new_pairlink (stx, key, value);
2005-05-10 06:02:19 +00:00
}
else {
for (;;) {
2005-05-12 15:25:06 +00:00
if (XP_STX_AT(stx,link,1) == key) {
2005-05-18 04:01:51 +00:00
XP_STX_AT(stx,link,XP_STX_PAIRLINK_VALUE) = value;
2005-05-10 06:02:19 +00:00
break;
}
2005-05-18 04:01:51 +00:00
next = XP_STX_AT(stx,link,XP_STX_PAIRLINK_LINK);
2005-05-10 06:02:19 +00:00
if (next == stx->nil) {
2005-05-18 04:01:51 +00:00
XP_STX_AT(stx,link,XP_STX_PAIRLINK_LINK) =
xp_stx_new_pairlink (stx, key, value);
2005-05-10 06:02:19 +00:00
break;
}
2005-05-08 15:54:44 +00:00
2005-05-10 06:02:19 +00:00
link = next;
}
2005-05-08 15:54:44 +00:00
}
}
2005-05-12 15:25:06 +00:00
void xp_stx_hash_traverse (
xp_stx_t* stx, xp_stx_word_t table,
void (*func) (xp_stx_t*,xp_stx_word_t))
{
xp_stx_word_t link;
xp_stx_word_t size = XP_STX_SIZE(stx,table);
while (size-- > 0) {
link = XP_STX_AT(stx,table,size);
while (link != stx->nil) {
func (stx,link);
2005-05-18 04:01:51 +00:00
link = XP_STX_AT(stx,link,XP_STX_PAIRLINK_LINK);
2005-05-12 15:25:06 +00:00
}
}
}
2005-05-15 18:37:00 +00:00