[prev in list] [next in list] [prev in thread] [next in thread]
List: xwt-dev
Subject: [xwt-dev] Sorting/comparing lists/arrays
From: Charles Goodwin <charles.goodwin () credit1 ! co ! uk>
Date: 2002-10-29 17:18:55
[Download RAW message or body]
If anybody has any ideas on this one, please, it's killing me! The context
is tables. So you have [ id, [ columns ] ] so having a list of {id, column}
is possible.
The problem is it's just not easy to efficiently sort a list. ECMAScript /
Javascript would rather lists didn't exist.
Sorting an array is easy, but an array is non-descriptive (data doesn't link
back to context). You sort an array and then you have to compare the sorted
array to the list so you're kinda defeating the point.
Anybody know a good algorithm for sorting lists?
[Attachment #3 (text/html)]
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<META NAME="Generator" CONTENT="MS Exchange Server version 5.5.2653.12">
<TITLE>Sorting/comparing lists/arrays</TITLE>
</HEAD>
<BODY>
<P><FONT SIZE=2>If anybody has any ideas on this one, please, it's killing me! \
The context is tables. So you have [ id, [ columns ] ] so having a list of {id, \
column} is possible.</FONT></P>
<P><FONT SIZE=2>The problem is it's just not easy to efficiently sort a list. \
ECMAScript / Javascript would rather lists didn't exist.</FONT> </P>
<P><FONT SIZE=2>Sorting an array is easy, but an array is non-descriptive (data \
doesn't link back to context). You sort an array and then you have to compare \
the sorted array to the list so you're kinda defeating the point.</FONT></P>
<P><FONT SIZE=2>Anybody know a good algorithm for sorting lists?</FONT>
</P>
</BODY>
</HTML>
[prev in list] [next in list] [prev in thread] [next in thread]
Configure |
About |
News |
Add a list |
Sponsored by KoreLogic