Chris Maunder wrote: even if an article is old, the techniques are often timeless. Well said.

Jonny Newman wrote: I get a mental picture of a kindergarten playground with all the kiddy servers running around screaming with you...the nervous wreck of a teacher attempting to round them up for class. Chris Maunder, cat herder. ;) Dave Goodman dgoodman@infoway.com www.dkgoodman.com "Actio sequitur esse."

Martin Cook wrote: Has anyone else had any experience working with Axapta? I don't touch anything I can't pronounce. Marc Microsoft MVP, Visual C#

I have a little friend, 7 years old, whose parents found her an ancient game console, pre-Nintendo. It plugs into a TV, has two little controls, and offers games like Pong, Brik-Brak, Space Invaders - all in block-graphics mode with at most 16 colors. She loves it, and every time I go to visit we have to play for an hour or so. Kids don't need the latest and greatest to be entertained, and it's refreshing to spend some quality time with a little one doing the simple things we used to enjoy.:-D "Welcome to Arizona! Drive Nice - We're Armed..." - Proposed Sign at CA/AZ Border

Martin C Cook wrote: I don't even want to think about how the cat would react!!! It sure would be interesting to watch it lick itself clean. ;) John

Good suggestion. I loaded the SDK and looked in the docs - still no help for the class I'm interested in. :( I'll keep looking.

lol.. I couldn't be bothered entering the :'s into it!! No idea why some1 voted it down. ah well. Regards, Brian Dela :-)

Hi, Martin. Most sort algorithms need stable comparison functions. Your function seems to be returning random results when the objects are different, so the .NET framework gets lost. Suppose you have created a function where A > B > C > D. Your IComparable should be stable and NEVER return B > A > D > C. Comparison is, too, a transitive function. So, if A > B and B > C, you can safelly assume that A > C. Your function does not guarantees that. My latest article: GBVB - Converting VB.NET code to C#