Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!uwm.edu!linac!att!pacbell.com!ames!haven!umbc3!gmuvax2!xwang
From: xwang@gmuvax2.gmu.edu (Xiang-Min Wang)
Newsgroups: comp.lang.c
Subject: Re: Efficient STRing CoMPares?
Message-ID: <3887@gmuvax2.gmu.edu>
Date: 24 Mar 91 01:39:23 GMT
References: <1991Mar15.142821@mars.mpr.ca> <15486@smoke.brl.mil> <1193@caslon.cs.arizona.edu> <15496@smoke.brl.mil> <1991Mar18.174207.7377@bingvaxu.cc.binghamton.edu>
Reply-To: xwang@gmuvax2.UUCP (Xiang-Min Wang)
Organization: George Mason Univ. Fairfax, Va.
Lines: 15

In article <1991Mar18.174207.7377@bingvaxu.cc.binghamton.edu> consp06@bingsuns.cc.binghamton.edu (Robert Konigsberg) writes:
>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


This solution can only be used for a limited situation. This solution
could lead to the aliasing problem.

xwang