Re: sort list base on another list

[Tem]

Thanks for all your responses. I see why c# is such a powerful language and
starting to like it more and more.

I also need help sorting this nested list. It is a little tricky. not sure
where to start.
I was thinking about creating a mapper for the nested lists.

List<stringstringList = new List<string>();
List<List<int>intLists = new List<List<int>>();

stringList.Add("c");
stringList.Add("b");
stringList.Add("a");

intLists.Add(new List<int>());
intLists.Add(new List<int>());
intLists.Add(new List<int>());

intLists[0].Add(3);
intLists[0].Add(1);
intLists[0].Add(2);

intLists[1].Add(7);
intLists[1].Add(8);
intLists[1].Add(2);

intLists[2].Add(0);
intLists[2].Add(9);
intLists[2].Add(9);

Output would be-
a,b,c
2,1,3
2,8,7
9,9,0

Any suggestions?

Tem

[Peter Duniho]

On Sat, 03 May 2008 23:43:17 -0700, Tem <te*****@yahoo.comwrote:

[...]
I also need help sorting this nested list. It is a little tricky. not
sure where to start.
[...]
Any suggestions?

Yes. Stop making these parallel data structures. :)

Seriously though...

The approach I suggested earlier about having a separate integer list
that's used as an index is probably the most straight-forward approach,
barring fixing the data structure so it's not so clumsy. I wasn't aware
of the Array.Sort() overload Arne mentioned, and that seemed like the
perfect solution to your specific problem as stated earlier. But if you
have more than two correlated lists, that's not going to do it. A sorted
index list would, however.

Pete

[Tem]

Im not sure how to build such sorted index list.

SortedList<string, intlist = new SortedList<string, int>();

is this what you are referring?

"Peter Duniho" <Np*********@nnowslpianmk.comwrote in message
news:op***************@petes-computer.local...

On Sat, 03 May 2008 23:43:17 -0700, Tem <te*****@yahoo.comwrote:

>[...]
I also need help sorting this nested list. It is a little tricky. not
sure where to start.
[...]
Any suggestions?

Yes. Stop making these parallel data structures. :)

Seriously though...

The approach I suggested earlier about having a separate integer list
that's used as an index is probably the most straight-forward approach,
barring fixing the data structure so it's not so clumsy. I wasn't aware
of the Array.Sort() overload Arne mentioned, and that seemed like the
perfect solution to your specific problem as stated earlier. But if you
have more than two correlated lists, that's not going to do it. A sorted
index list would, however.

Pete

[=?ISO-8859-1?Q?Arne_Vajh=F8j?=]

Tem wrote:

Thanks for all your responses. I see why c# is such a powerful language
and starting to like it more and more.

I also need help sorting this nested list. It is a little tricky. not
sure where to start.
I was thinking about creating a mapper for the nested lists.

List<stringstringList = new List<string>();
List<List<int>intLists = new List<List<int>>();

stringList.Add("c");
stringList.Add("b");
stringList.Add("a");

intLists.Add(new List<int>());
intLists.Add(new List<int>());
intLists.Add(new List<int>());

intLists[0].Add(3);
intLists[0].Add(1);
intLists[0].Add(2);

intLists[1].Add(7);
intLists[1].Add(8);
intLists[1].Add(2);

intLists[2].Add(0);
intLists[2].Add(9);
intLists[2].Add(9);

Output would be-
a,b,c
2,1,3
2,8,7
9,9,0

This basicly the same problem. You sort the string list and you
similar sort 3 int lists (intLists[0], intLists[1] and intLists[2]).

You can do it.

But you should seriously consider restructuring the data.

Arne

[Tem]

Do you have any suggestions on how I can better structure the data?
It needs to have a flexible list size where lists can be added or removed.

"Arne Vajhøj" <ar**@vajhoej.dkwrote in message
news:48***********************@news.sunsite.dk...

Tem wrote:

>Thanks for all your responses. I see why c# is such a powerful language
and starting to like it more and more.

I also need help sorting this nested list. It is a little tricky. not
sure where to start.
I was thinking about creating a mapper for the nested lists.

List<stringstringList = new List<string>();
List<List<int>intLists = new List<List<int>>();

stringList.Add("c");
stringList.Add("b");
stringList.Add("a");

intLists.Add(new List<int>());
intLists.Add(new List<int>());
intLists.Add(new List<int>());

intLists[0].Add(3);
intLists[0].Add(1);
intLists[0].Add(2);

intLists[1].Add(7);
intLists[1].Add(8);
intLists[1].Add(2);

intLists[2].Add(0);
intLists[2].Add(9);
intLists[2].Add(9);

Output would be-
a,b,c
2,1,3
2,8,7
9,9,0

This basicly the same problem. You sort the string list and you
similar sort 3 int lists (intLists[0], intLists[1] and intLists[2]).

You can do it.

But you should seriously consider restructuring the data.

Arne

[=?ISO-8859-1?Q?Arne_Vajh=F8j?=]

Tem wrote:

Do you have any suggestions on how I can better structure the data?
It needs to have a flexible list size where lists can be added or removed.

I think you need a class that contains a string and a List<int>.

Private fields and public properties ofcourse.

And implementing the IComparer<stringinterface that allows
for natural sorting.

Arne

[Peter Duniho]

On Sun, 04 May 2008 20:16:26 -0700, Tem <te*****@yahoo.comwrote:

Do you have any suggestions on how I can better structure the data?
It needs to have a flexible list size where lists can be added or
removed.

I don't really understand what you mean by "where lists can be added or
removed". That's too vague a statement to be meaningful.

However, looking at your most recent example, you could define a class
like this:

class A
{
string str;
List<intlistInts;
}

Where the field "str" contains the element that would have been in your
stringList, and the listInts list contains the respective elements that
would have been in each of your intLists at the appropriate position for
the string.

As Arne says, the actual class would be declared more appropriately, with
private fields, public properties, etc.

Pete