Efficient STRing CoMPares?

[Xiang-Min Wang]

In article <1991Mar18.174207.7377 at bingvaxu.cc.binghamton.edu> consp06 at 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