|
From: <sv...@va...> - 2006-01-12 12:29:45
|
Author: sewardj Date: 2006-01-12 12:29:42 +0000 (Thu, 12 Jan 2006) New Revision: 5519 Log: Comment-only change. Modified: trunk/include/pub_tool_oset.h Modified: trunk/include/pub_tool_oset.h =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D --- trunk/include/pub_tool_oset.h 2006-01-12 12:20:48 UTC (rev 5518) +++ trunk/include/pub_tool_oset.h 2006-01-12 12:29:42 UTC (rev 5519) @@ -47,7 +47,7 @@ // every comparison can be high during lookup. If no comparison functio= n is // provided, we assume that keys are (signed or unsigned) words, and tha= t // the key is the first word in each element. This fast comparison is -// suitable for an OSet of Ints, or an OSet containing structs where the +// suitable for an OSet of Words, or an OSet containing structs where th= e // first element is an Addr, for example. // // Each OSet also has an iterator, which makes it simple to traverse all= the |