数据排序的问题

Question

  向listview中插入数据，根据第二列的数据大小升序插入到相应的位置，private void Add(string St,string PlanCoil,string Coil,string Dt,string Row,string Out,string Level)//插入数据
{
for(int i=0;i<=this.lVw .Items .Count -2;i++)
{
if(Coil.ToString ()!=this.lVw .Items [i].SubItems [1].Text )
{
if(this.lVw .Items [i].SubItems [0].Text .CompareTo (this.lVw .Items [i+1].SubItems [0].Text )<0)
{
this.lVw .Items .Insert (i+1,new ListViewItem(new string[]{St.ToString (),PlanCoil.ToString (),Coil.ToString (),Dt.ToString (),Row.ToString (),Out.ToString (),Level.ToString ()}));
//break;
}
else
{
this.lVw .Items .Insert (i,new ListViewItem(new string[]{St.ToString (),PlanCoil.ToString (),Coil.ToString (),Dt.ToString (),Row.ToString (),Out.ToString (),Level.ToString ()}));
//break;
}
}
else
{
MessageBox.Show ("  ","");
}
}
这样写，是个死循环，而且
if(this.lVw .Items [i].SubItems [0].Text .CompareTo (this.lVw .Items [i+1].SubItems [0].Text )<0
这个也不对，因为这样只要<0就插入数据了，况且 ，写在for里面，虚幻插入了，大家给我个思路就行

Answer 1

你在插入数据之前数据源应该已经是排序好的了吧？？
如果是的话参考如下代码
bool isInsert = false;
for (int i = 0; i < lVw.Items.Count - 1; i++)
{
    if (lVw.Items[i].SubItems[2].Text.CompareTo(Coil) > 0)//判断第二列，如果找到比他大的则插在前面
    {
        this.lVw.Items.Insert(i,new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));
        isInsert = true;
        break;
    }
}
if (!isInsert)
{
    //如果没找到则添加到最后
    this.lVw.Items.Add(i,new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));
}

Answer 2

上面Add错了
this.lVw.Items.Add(new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));

Answer 3

数据源按第二列数据排序.排序完后直接绑定到ListView就行了吧?

Answer 4

for (int i = 0; i < this.lVw.Items.Count - 1; i++)
{
if (lVw.Items[i].SubItems[2].Text.CompareTo(Coil) > 0)//判断第二列，如果找到比他大的则插在前面
{
this.lVw.Items.Insert(i,new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));
isInsert = true;
break;
}
else
{
this.lVw.Items.Insert(i,new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));
break;
}
}这样对不

Answer 5

不对
bool isInsert = false;
for (int i = 0; i < lVw.Items.Count - 1; i++)
{
    if (lVw.Items[i].SubItems[2].Text.CompareTo(Coil) > 0)//判断第二列，如果找到比他大的则插在前面
    {
        this.lVw.Items.Insert(i,new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));
        isInsert = true;
        break;
    }
}
if (!isInsert)
{
    //如果没找到则添加到最后
    this.lVw.Items.Add(new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));
}在for里面为什么要else？？

Answer 6

private void Add(string St,string PlanCoil,string Coil,string Dt,string Row,string Out,string Level)//插入数据
{
for (int i = 0; i < this.lVw.Items.Count - 1; i++)
{
if (lVw.Items[i].SubItems[1].Text.CompareTo(Coil) > 0)//判断第二列，如果找到比他大的则插在前面
{
this.lVw.Items.Insert(i,new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level}));
break;
}
else
{
this.lVw.Items.Add(new ListViewItem(new string[]{St,PlanCoil,Coil,Dt,Row,Out,Level})); 
break;
}
}
}
private void Form1_Load(object sender, System.EventArgs e)
{
//测试用数据 this.lVw .Items .Add (new ListViewItem(new string[] {"0","AH0000T008", "00100T", "01","1" ,"2" ,"2"}));
this.lVw .Items .Add (new ListViewItem(new string[] {"2","AH0000T004", "00200T", "02","2" ,"2" ,"2"}));
Add("0","AH0000T001", "00500T", "01","1" ,"2" ,"2");
Add("2","AH0000T005", "00300T", "02","2" ,"2" ,"2");
结果不对

Answer 7

private void Form1_Load(object sender, System.EventArgs e)
{
//测试用数据 this.lVw .Items .Add (new ListViewItem(new string[] {"0","AH0000T008", "00100T", "01","1" ,"2" ,"2"}));
this.lVw .Items .Add (new ListViewItem(new string[] {"2","AH0000T004", "00200T", "02","2" ,"2" ,"2"}));
this.lVw .Items .Add (new ListViewItem(new string[] {"2","CH0000T005", "00300T", "02","2" ,"2" ,"2"}));
// this.lVw .Items .Add (new ListViewItem(new string[] {"1","DH0000T007", "00400T", "02","1" ,"2" ,"2"}));
// this.lVw .Items .Add (new ListViewItem(new string[] {"0","AH0000T000", "00500T", "01","2" ,"2" ,"2"}));
// this.lVw .Items .Add (new ListViewItem(new string[] {"2","FH0000T001", "00600T", "01","1" ,"2" ,"2"}));
// this.lVw .Items .Add (new ListViewItem(new string[] {"1","GH0000T002", "00700T", "02","1" ,"2" ,"2"}));
Add("0","AH0000T001", "00500T", "01","1" ,"2" ,"2");
Add("2","AH0000T005", "00300T", "02","2" ,"2" ,"2");
Add("1","GH0000T002", "00700T", "02","1" ,"2" ,"2");
Add("1","DH0000T007", "00400T", "02","1" ,"2" ,"2");测试下看看

Answer 8

晕你看看你的代码跟我给你的一样么？？？
我的for里面有else？？？
你就直接把我的代码拷贝就可以了
为什么要改我的代码？？

Answer 9

......
listview有排序功能。
为什么要自己算 public class ListViewColumnSorter : IComparer
        {            int index;
            /// </summary>
            public ListViewColumnSorter(int x)
            {
                index = x;
            }            /// <summary>
            /// This method is inherited from the IComparer interface.  It compares the two objects passed using a case insensitive comparison.
            /// </summary>
            /// <param name="x">First object to be compared</param>
            /// <param name="y">Second object to be compared</param>
            /// <returns>The result of the comparison. "0" if equal, negative if 'x' is less than 'y' and positive if 'x' is greater than 'y'</returns>
            public int Compare(object x, object y)
            {
                int compareResult;
                ListViewItem listviewX, listviewY;                // Cast the objects to be compared to ListViewItem objects
                listviewX = (ListViewItem)x;
                listviewY = (ListViewItem)y;                // Compare the two items
                return compareResult = -string.Compare(listviewX.SubItems[index].Text, listviewY.SubItems[index].Text);
            } ListViewColumnSorter sor = new ListViewColumnSorter(e.Column);
            listView1.ListViewItemSorter = sor;
            listView1.Sorting = listView1.Sorting == SortOrder.Descending ? SortOrder.Ascending : SortOrder.Descending;
            listView1.Sort();

Answer 10

......
listview有排序功能。
为什么要自己算 public class ListViewColumnSorter : IComparer
        {            int index;
            /// </summary>
            public ListViewColumnSorter(int x)
            {
                index = x;
            }            /// <summary>
            /// This method is inherited from the IComparer interface.  It compares the two objects passed using a case insensitive comparison.
            /// </summary>
            /// <param name="x">First object to be compared</param>
            /// <param name="y">Second object to be compared</param>
            /// <returns>The result of the comparison. "0" if equal, negative if 'x' is less than 'y' and positive if 'x' is greater than 'y'</returns>
            public int Compare(object x, object y)
            {
                int compareResult;
                ListViewItem listviewX, listviewY;                // Cast the objects to be compared to ListViewItem objects
                listviewX = (ListViewItem)x;
                listviewY = (ListViewItem)y;                // Compare the two items
                return compareResult = -string.Compare(listviewX.SubItems[index].Text, listviewY.SubItems[index].Text);
            } ListViewColumnSorter sor = new ListViewColumnSorter(e.Column);
            listView1.ListViewItemSorter = sor;
            listView1.Sorting = listView1.Sorting == SortOrder.Descending ? SortOrder.Ascending : SortOrder.Descending;
            listView1.Sort();

Answer 11

我知道有排序功能 ，我是要进行双重排序，也就是我用了listview进行排序后还要进行次排序

Answer 12

另外根据第二列    应该是
 
if (lVw.Items[i].SubItems[1].Text.CompareTo(Coil) > 0)//判断第二列，如果找到比他大的则插在前面

Answer 13

你看看你的Coil到底是第几列~~~~~~