Newsgroups: comp.lang.c
Path: utzoo!news-server.csri.toronto.edu!rpi!sarah!bingnews!bingsuns.cc.binghamton.edu!consp06
From: consp06@bingsuns.cc.binghamton.edu (Robert Konigsberg)
Subject: Re: Efficient STRing CoMPares?
Message-ID: <1991Mar18.174207.7377@bingvaxu.cc.binghamton.edu>
Sender: usenet@bingvaxu.cc.binghamton.edu (Mr UseNet)
Nntp-Posting-Host: bingsunp.pod.binghamton.edu
Reply-To: consp06@bingsuns.cc.binghamton.edu (Robert Konigsberg)
Organization: SUNY Binghamton
References: <1991Mar15.142821@mars.mpr.ca> <15486@smoke.brl.mil> <1193@caslon.cs.arizona.edu> <15496@smoke.brl.mil>
Date: Mon, 18 Mar 1991 17:42:07 GMT

Somebody said part of the problem with string comparisons is that if
the most of the strings are equivelant, there will be alot of
processor time.  Wouldn't it be good then, to include in the macro,
something to compare the actual POINTERS?  If the pointers are the
same then the two strings have no CHOICE but to be equivelant.  This
would really cut down the time under certain situations.

			-Rob Konigsberg