From 667b9d5d5316c05955adf96132117cd276b58020 Mon Sep 17 00:00:00 2001
From: Robert James Kaes <rjkaes@users.sourceforge.net>
Date: Tue, 4 Sep 2001 17:53:41 +0000
Subject: Switched to a case insensitive search method.

---
 src/ternary.c | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

(limited to 'src')

diff --git a/src/ternary.c b/src/ternary.c
index 0a4ee09..2917149 100644
--- a/src/ternary.c
+++ b/src/ternary.c
@@ -1,4 +1,4 @@
-/* $Id: ternary.c,v 1.6 2001-08-30 16:52:09 rjkaes Exp $
+/* $Id: ternary.c,v 1.7 2001-09-04 17:53:41 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
@@ -29,6 +29,7 @@
 #  include 	<sys/types.h>
 #endif
 
+#include        <ctype.h>
 #include 	<stdio.h>
 #include 	<stdlib.h>
 #include	<string.h>
@@ -386,9 +387,9 @@ int ternary_search(TERNARY tno, const char *s, void **data)
 	p = trees[cur]->tree_root;
 
 	while (p) {
-		if (*s < p->splitchar)
+		if (toupper(*s) < toupper(p->splitchar))
 			p = p->lokid;
-		else if (*s == p->splitchar) {
+		else if (toupper(*s) == toupper(p->splitchar)) {
 			if (*s++ == 0) {
 				if (data)
 					*data = (void *)p->eqkid;
-- 
cgit v1.2.3