Unique Set

new topic     » topic index » view thread      » older message » newer message 

Okay, I want to prevent a set of six numbers from being a duplicate in a
sequence of sets of six numbers...

For example:

a = { 1, 2, 3, 4, 5, 6 }

b = { { 1, 2, 3, 4, 5 ,7 } , { 1, 2, 3, 4, 5, 8 } , { 1, 2, 3, 4, 5, 6} ,
... }

What's the fastest IsAinB( a, b ) function? I'm not sure if find() or
match() would work here, but I'll check. Otherwise, I'm sure some of our
resident speed experts can come up with a speedy solution.

Thanks!

<\<



__________________________________________________
Do You Yahoo!?
Talk to your friends online with Yahoo! Messenger.
http://im.yahoo.com

new topic     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu