I think SETS are stored as bitmaps, in which case the only valid count is the number of items in the base type. Myles. -----Original Message----- From: Jim Zheng [SMTP:[EMAIL PROTECTED]] Sent: Friday, February 19, 1999 4:29 PM To: Multiple recipients of list delphi Subject: RE: [DUG]: about SET So that means, there is not faster way than looping through whole set to check each one from base type appears in the set. But is there any faster way to know the count of a set, or looping is the only way?
- [DUG]: about SET Jim Zheng
- RE: [DUG]: about SET Myles Penlington
- RE: [DUG]: about SET Peter Hyde
- RE: [DUG]: about SET Jim Zheng
- RE: [DUG]: about SET Peter Hyde
- RE: [DUG]: about SET Cooke, Andrew
- RE: [DUG]: about SET Jim Zheng
- RE: [DUG]: about SET Cory Shanks
- RE: [DUG]: about SET Jim Zheng
- Re: [DUG]: about SET Myles Penlington
- Re: [DUG]: about SET Aaron Scott-Boddendijk
- Re: [DUG]: about SET Rohit Gupta
- Re: [DUG]: about SET Rohit Gupta
- Re: [DUG]: about SET Aaron Scott-Boddendijk
- RE: [DUG]: about SET Paul Heinz
- Re: [DUG]: about SET Aaron Scott-Boddendijk
- RE: [DUG]: about SET Paul Heinz