I was just concerned about this record, as names get added individually -- I thought about doing an UPCASE on a memory version of the MultiValue list, but once that list gets to having 100 or 200 names on it, would the 'hit' for doing an UPCASE on an in-memory version be 'less than' the disk-access time for the larger item...
Falls into the 'is there a better way' category of thinking. Like I said -- D3 has sorting WAY better than U2 in this area. (*Just* this one area, but in this case, it's all I'm talking about! <g>) > -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of jjuser ud2 > Sent: Friday, August 24, 2007 2:47 PM > To: [email protected] > Subject: Re: [U2] [ud] Question on Alpha Sorting... > > Hmm...doing it programmatically...multi-dimensional array? > > DAVINCI,LEONARDO > Doe,John > Jesse,Sally > > becomes > [1] [2] > DAVINCI,LEONARDO DAVINCI,LEONARDO > Doe,John DOE,JOHN > Raphael,Sally RAPHAEL,SALLY > > And then you can sort by [2], but display [1]? That way it > just stays in memory and the data stored in the database > remains the same? ------- u2-users mailing list [email protected] To unsubscribe please visit http://listserver.u2ug.org/
