diff options
| author | Robert James Kaes <rjkaes@users.sourceforge.net> | 2000-11-23 04:49:26 +0000 |
|---|---|---|
| committer | Robert James Kaes <rjkaes@users.sourceforge.net> | 2000-11-23 04:49:26 +0000 |
| commit | 068b0337c5d68e26206438951334993dbf2393bf (patch) | |
| tree | e44a37a1d6b3d4fe6aa9c9efdc293c2eb85a37fb | |
| parent | c01af94a1c149b42684347b54c30385e4cd4d571 (diff) | |
| download | tinyproxy-068b0337c5d68e26206438951334993dbf2393bf.tar.gz tinyproxy-068b0337c5d68e26206438951334993dbf2393bf.zip | |
Fixed MACRO error.
| -rw-r--r-- | src/ternary.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/ternary.c b/src/ternary.c index e9bf351..f45a8bf 100644 --- a/src/ternary.c +++ b/src/ternary.c @@ -1,4 +1,4 @@ -/* $Id: ternary.c,v 1.3 2000-10-23 21:46:38 rjkaes Exp $ +/* $Id: ternary.c,v 1.4 2000-11-23 04:49:26 rjkaes Exp $ * * This module creates a Ternary Search Tree which can store both string * keys, and arbitrary data for each key. It works similar to a hash, and @@ -314,7 +314,7 @@ int ternary_insert(TERNARY tno, const char *s, void *data) while ((pp = *p)) { if ((d = *s - pp->splitchar) == 0) { if (*s++ == 0) { - DEBUG2("Key exists"); + DEBUG1("Key exists"); return TE_EXISTS; } p = &(pp->eqkid); |