On Mon, 2004-10-18 at 11:21 +1000, torquemada wrote: > understanding structures and a knowledge beforehand of what > each element is, is essential. dereferencing any pointers > might be needed to determine if the structures are identical or not. > > refer to the data-dictionary for the structure or documentation in that > case. > > one could even hypothetically have a pointer embedded in a structure > that points back to the original structure and one might end up in a > infinite loop when comparing. but that would > be an extreme case. take care and have fun.
Thats not particularly extreme or hypothetical. A circular buffer for example, implemented as a list of buffers, is an immediate example. So are any trees with uplinks. Rob -- GPG key available at: <http://www.robertcollins.net/keys.txt>.
signature.asc
Description: This is a digitally signed message part
-- SLUG - Sydney Linux User's Group Mailing List - http://slug.org.au/ Subscription info and FAQs: http://slug.org.au/faq/mailinglists.html
