Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!snorkelwacker.mit.edu!hsdndev!cmcl2!adm!smoke!gwyn
From: gwyn@smoke.brl.mil (Doug Gwyn)
Newsgroups: comp.lang.c
Subject: Re: Efficient STRing CoMPares?
Message-ID: <15525@smoke.brl.mil>
Date: 20 Mar 91 21:27:30 GMT
References: <1991Mar18.174207.7377@bingvaxu.cc.binghamton.edu> <15510@smoke.brl.mil> <11111@dog.ee.lbl.gov>
Organization: U.S. Army Ballistic Research Laboratory, APG, MD.
Lines: 8

In article <11111@dog.ee.lbl.gov> torek@elf.ee.lbl.gov (Chris Torek) writes:
-Of course, you can build yourself a `string pool' system, in which each
-distinct string appears exactly once, and then two strings match iff their
-pointers match . . . but this merely offloads the `compare for truly
-equal' into the string pool system.
-If you need to do many compares, this is probably worthwhile anyway.

Gee, great minds think alike!