Sort specific items in a bindinglist of keyvaluepairs

Question

5.00/5 (1 vote)

See more:

I have a bindinglist of keyvaluepairs that is filled dynamicaly.

C#

BindingList<KeyValuePair<int, string>> Homelist = new BindingList<KeyValuePair<int, string>>();
  foreach (ListItem item in listBox2.Items)
    {
     Homelist.Add(new KeyValuePair<int, string>(item.Id, item.Name));
    }

The list has key(id) and value(name). I want to sort the first 5 items asc and then the rest items also asc.the sorting must be by value and not by key. example: if I have the values : 4,5,8,7,6,10,9,3,2,1,22 the sorting result must be 4,5,6,7,8 ,1,2,3,9,10,22.Any suggestions?

I use this to split in two lists

C#

List<BindingList<KeyValuePair<int, string>>> listOfLists = new List<BindingList<KeyValuePair<int, string>>>();
                for (int i = 0; i < Homelist.Count(); i += 5)
                {
                    listOfLists.Add(Homelist.Skip(i).Take(5));
                }

but I take the error:
cannot convert from 'System.Collections.Generic.IEnumerable<system.collections.generic.keyvaluepair><int,string>>' to 'System.ComponentModel.BindingList<system.collections.generic.keyvaluepair><int,string>>'

Posted 8-Apr-14 3:40am

iratus7

Updated 11-Apr-14 21:21pm

v3

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CHill60 · Accepted Answer · 2014-04-08T06:46:00

For sorting the list on value rather than key just provide an appropriate compare method ... have a look at this example http://www.dotnetperls.com/sort-keyvaluepair[^]

If you want to treat the first 5 items differently to the rest then you could split the list into two separate ones before the sorting process ... examples of splitting lists[^]

You would want to join them back together I presume ... http://www.dotnetperls.com/list-concat[^]

[EDIT in response to edit of question]
I'm not overly familiar with linq however when I go to the Definition of Skip or Take then I can see that they return an IEnumerable keyvaluepair. I tried casting, but that produced a run-time exception. Finally came across this ...

XML

static class MyClass
{
    static public BindingList<T> ToBindingList<T>(this IEnumerable<T> source)
    {
        BindingList<T> bindingList = new BindingList<T>();

        foreach (T o in source.ToList())
        {
            bindingList.Add(o);
        }
        return bindingList;
    }
}

From here http://svanbinst.blogspot.co.uk/2010/01/blog-post.html[^]
That will get you over the compile errors and runtime exceptions

iratus7 · Accepted Answer · 2014-04-11T23:36:00

C#

public int Compare(KeyValuePair<int,string> a, KeyValuePair<int,string> b)
        {
            return a.Value.CompareTo(b.Value);
        }
 List<keyvaluepair><int,>> Playinglist = new List<keyvaluepair><int,>>();
                for (int i = 0; i < 5; i ++)
                {
                    Playinglist.Add(Homelist[i]);
                }
                Playinglist.Sort(Compare);
                
                List<keyvaluepair><int,>> Benchlist = new List<keyvaluepair><int,>>();
                for (int i = 5; i < Homelist.Count(); i++)
                {
                    Benchlist.Add(Homelist[i]);
                }
                Benchlist.Sort(Compare);

                //union 2 lists
                var unionedList = new List<keyvaluepair><int,>>();
                unionedList.AddRange(Playinglist.Union(Benchlist));

                Homelist.Clear();
                for (int i = 0; i < unionedList.Count(); i++)
                {
                    Homelist.Insert(i, unionedList[i]);
                }
                game.GetHomelist = Homelist;

as CHill60 told

Sort specific items in a bindinglist of keyvaluepairs

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0