diff options
| author | Robert James Kaes <rjkaes@users.sourceforge.net> | 2001-05-23 17:59:53 +0000 |
|---|---|---|
| committer | Robert James Kaes <rjkaes@users.sourceforge.net> | 2001-05-23 17:59:53 +0000 |
| commit | b1d942c22a8fafa0ad023d7ddf05f8e83b75aebb (patch) | |
| tree | 4d96defc8a4501ae104071d176dbb66125ca91db | |
| parent | 3f8b219210a53a59d8850f023d294bb92fbc9953 (diff) | |
| download | tinyproxy-b1d942c22a8fafa0ad023d7ddf05f8e83b75aebb.tar.gz tinyproxy-b1d942c22a8fafa0ad023d7ddf05f8e83b75aebb.zip | |
Removed a debugging aid.
| -rw-r--r-- | src/ternary.c | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/src/ternary.c b/src/ternary.c index f45a8bf..df93ead 100644 --- a/src/ternary.c +++ b/src/ternary.c @@ -1,4 +1,4 @@ -/* $Id: ternary.c,v 1.4 2000-11-23 04:49:26 rjkaes Exp $ +/* $Id: ternary.c,v 1.5 2001-05-23 17:59:53 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,6 @@ int ternary_insert(TERNARY tno, const char *s, void *data) while ((pp = *p)) { if ((d = *s - pp->splitchar) == 0) { if (*s++ == 0) { - DEBUG1("Key exists"); return TE_EXISTS; } p = &(pp->eqkid); |