emileclarkb/hammer
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

format tsearch

Browse source
This commit is contained in:
Emile Clark-Boman 2025-09-27 18:39:44 +10:00
parent 81e34dc630
commit 58be2d1ee8
2 changed files with 92 additions and 104 deletions
Download patch file Download diff file Expand all files Collapse all files

190
src/tsearch.c
View file

@ -11,131 +11,119 @@
* Totally public domain. * Totally public domain.
*/ */
#include <stdlib.h>
#include "tsearch.h" #include "tsearch.h"
#include <stdlib.h>
typedef struct node_t { typedef struct node_t {
char *key; char *key;
struct node_t *left, *right; struct node_t *left, *right;
} node; } node;
/* find or insert datum into search tree */ /* find or insert datum into search tree */
void * void *tsearch(const void *vkey, void **vrootp,
tsearch(const void *vkey, void **vrootp, int (*compar)(const void *, const void *)) {
int (*compar)(const void *, const void *)) node *q;
{ char *key = (char *)vkey;
node *q; node **rootp = (node **)vrootp;
char *key = (char *)vkey;
node **rootp = (node **)vrootp;
if (rootp == (struct node_t **)0) if (rootp == (struct node_t **)0)
return ((void *)0); return ((void *)0);
while (*rootp != (struct node_t *)0) { /* Knuth's T1: */ while (*rootp != (struct node_t *)0) { /* Knuth's T1: */
int r; int r;
if ((r = (*compar)(key, (*rootp)->key)) == 0) /* T2: */ if ((r = (*compar)(key, (*rootp)->key)) == 0) /* T2: */
return ((void *)*rootp); /* we found it! */ return ((void *)*rootp); /* we found it! */
rootp = (r < 0) ? rootp = (r < 0) ? &(*rootp)->left : /* T3: follow left branch */
&(*rootp)->left : /* T3: follow left branch */ &(*rootp)->right; /* T4: follow right branch */
&(*rootp)->right; /* T4: follow right branch */ }
} q = malloc(sizeof(node)); /* T5: key not found */
q = malloc(sizeof(node)); /* T5: key not found */ if (q != (struct node_t *)0) { /* make new node */
if (q != (struct node_t *)0) { /* make new node */ *rootp = q; /* link new node to old */
*rootp = q; /* link new node to old */ q->key = key; /* initialize new node */
q->key = key; /* initialize new node */ q->left = q->right = (struct node_t *)0;
q->left = q->right = (struct node_t *)0; }
} return ((void *)q);
return ((void *)q);
} }
/* delete node with given key */ /* delete node with given key */
void * void *tdelete(const void *vkey, void **vrootp,
tdelete(const void *vkey, void **vrootp, int (*compar)(const void *, const void *)) {
int (*compar)(const void *, const void *)) node **rootp = (node **)vrootp;
{ char *key = (char *)vkey;
node **rootp = (node **)vrootp; node *p = (node *)1;
char *key = (char *)vkey; node *q;
node *p = (node *)1; node *r;
node *q; int cmp;
node *r;
int cmp;
if (rootp == (struct node_t **)0 || *rootp == (struct node_t *)0) if (rootp == (struct node_t **)0 || *rootp == (struct node_t *)0)
return ((struct node_t *)0); return ((struct node_t *)0);
while ((cmp = (*compar)(key, (*rootp)->key)) != 0) { while ((cmp = (*compar)(key, (*rootp)->key)) != 0) {
p = *rootp; p = *rootp;
rootp = (cmp < 0) ? rootp = (cmp < 0) ? &(*rootp)->left : /* follow left branch */
&(*rootp)->left : /* follow left branch */ &(*rootp)->right; /* follow right branch */
&(*rootp)->right; /* follow right branch */ if (*rootp == (struct node_t *)0)
if (*rootp == (struct node_t *)0) return ((void *)0); /* key not found */
return ((void *)0); /* key not found */ }
r = (*rootp)->right; /* D1: */
if ((q = (*rootp)->left) == (struct node_t *)0) /* Left (struct node_t *)0? */
q = r;
else if (r != (struct node_t *)0) { /* Right link is null? */
if (r->left == (struct node_t *)0) { /* D2: Find successor */
r->left = q;
q = r;
} else { /* D3: Find (struct node_t *)0 link */
for (q = r->left; q->left != (struct node_t *)0; q = r->left)
r = q;
r->left = q->right;
q->left = (*rootp)->left;
q->right = (*rootp)->right;
} }
r = (*rootp)->right; /* D1: */ }
if ((q = (*rootp)->left) == (struct node_t *)0) /* Left (struct node_t *)0? */ free((struct node_t *)*rootp); /* D4: Free node */
q = r; *rootp = q; /* link parent to new node */
else if (r != (struct node_t *)0) { /* Right link is null? */ return (p);
if (r->left == (struct node_t *)0) { /* D2: Find successor */
r->left = q;
q = r;
} else { /* D3: Find (struct node_t *)0 link */
for (q = r->left; q->left != (struct node_t *)0; q = r->left)
r = q;
r->left = q->right;
q->left = (*rootp)->left;
q->right = (*rootp)->right;
}
}
free((struct node_t *) *rootp); /* D4: Free node */
*rootp = q; /* link parent to new node */
return(p);
} }
/* Walk the nodes of a tree */ /* Walk the nodes of a tree */
static void static void trecurse(node *root, void (*action)(const void *, VISIT, int),
trecurse(node *root, void (*action)(const void *, VISIT, int), int level) int level) {
{ if (root->left == (struct node_t *)0 && root->right == (struct node_t *)0)
if (root->left == (struct node_t *)0 && root->right == (struct node_t *)0) (*action)(root, leaf, level);
(*action)(root, leaf, level); else {
else { (*action)(root, preorder, level);
(*action)(root, preorder, level); if (root->left != (struct node_t *)0)
if (root->left != (struct node_t *)0) trecurse(root->left, action, level + 1);
trecurse(root->left, action, level + 1); (*action)(root, postorder, level);
(*action)(root, postorder, level); if (root->right != (struct node_t *)0)
if (root->right != (struct node_t *)0) trecurse(root->right, action, level + 1);
trecurse(root->right, action, level + 1); (*action)(root, endorder, level);
(*action)(root, endorder, level); }
}
} }
/* Walk the nodes of a tree */ /* Walk the nodes of a tree */
void void twalk(const void *vroot, void (*action)(const void *, VISIT, int)) {
twalk(const void *vroot, void (*action)(const void *, VISIT, int)) node *root = (node *)vroot;
{
node *root = (node *)vroot;
if (root != (node *)0 && action != (void (*)(const void *, VISIT, int))0) if (root != (node *)0 && action != (void (*)(const void *, VISIT, int))0)
trecurse(root, action, 0); trecurse(root, action, 0);
} }
/* $OpenBSD: tfind.c,v 1.6 2014/03/16 18:38:30 guenther Exp $ */ /* $OpenBSD: tfind.c,v 1.6 2014/03/16 18:38:30 guenther Exp $ */
/* find a node, or return 0 */ /* find a node, or return 0 */
void * void *tfind(const void *vkey, void *const *vrootp,
tfind(const void *vkey, void * const *vrootp, int (*compar)(const void *, const void *)) {
int (*compar)(const void *, const void *)) char *key = (char *)vkey;
{ node **rootp = (node **)vrootp;
char *key = (char *)vkey;
node **rootp = (node **)vrootp;
if (rootp == (struct node_t **)0) if (rootp == (struct node_t **)0)
return ((struct node_t *)0); return ((struct node_t *)0);
while (*rootp != (struct node_t *)0) { /* T1: */ while (*rootp != (struct node_t *)0) { /* T1: */
int r; int r;
if ((r = (*compar)(key, (*rootp)->key)) == 0) /* T2: */ if ((r = (*compar)(key, (*rootp)->key)) == 0) /* T2: */
return (*rootp); /* key found */ return (*rootp); /* key found */
rootp = (r < 0) ? rootp = (r < 0) ? &(*rootp)->left : /* T3: follow left branch */
&(*rootp)->left : /* T3: follow left branch */ &(*rootp)->right; /* T4: follow right branch */
&(*rootp)->right; /* T4: follow right branch */ }
} return (node *)0;
return (node *)0;
} }

6
src/tsearch.h
View file

@ -9,14 +9,14 @@ void *tsearch(const void *vkey, void **vrootp,
int (*compar)(const void *, const void *)); int (*compar)(const void *, const void *));
/* delete node with given key */ /* delete node with given key */
void * tdelete(const void *vkey, void **vrootp, void *tdelete(const void *vkey, void **vrootp,
int (*compar)(const void *, const void *)); int (*compar)(const void *, const void *));
/* Walk the nodes of a tree */ /* Walk the nodes of a tree */
void twalk(const void *vroot, void (*action)(const void *, VISIT, int)); void twalk(const void *vroot, void (*action)(const void *, VISIT, int));
/* find a node, or return 0 */ /* find a node, or return 0 */
void *tfind(const void *vkey, void * const *vrootp, void *tfind(const void *vkey, void *const *vrootp,
int (*compar)(const void *, const void *)); int (*compar)(const void *, const void *));
#else #else