通用排序类
代码
/// <summary>
///
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="list"></param>
/// <param name="order">排序字段</param>
/// <param name="asc">是否升序</param>
public static void Sort<T>(List<T> list, string order, bool asc)
{
Type type = typeof(T);
PropertyInfo[] pros = type.GetProperties();
PropertyInfo pro = pros[0];
order = order.ToLower();
for (int i = 0; i < pros.Length; i++)
{
if (pros[i].Name.ToLower().Equals(order))
{
pro = pros[i];
break;
}
}
T obj;
int j, k = 1;
bool done = false;
int len = list.Count;
while (k < len && !done)
{
done = true;
for (j = 0; j < len - k; j++)
{
int b = pro.GetValue(list[j], null).ToString().CompareTo(pro.GetValue(list[j + 1], null).ToString());
if ((asc && b > 0) || (!asc && b < 0))
{
done = false;
obj = list[j];
list[j] = list[j + 1];
list[j + 1] = obj;
}
}
k++;
}
}
///
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="list"></param>
/// <param name="order">排序字段</param>
/// <param name="asc">是否升序</param>
public static void Sort<T>(List<T> list, string order, bool asc)
{
Type type = typeof(T);
PropertyInfo[] pros = type.GetProperties();
PropertyInfo pro = pros[0];
order = order.ToLower();
for (int i = 0; i < pros.Length; i++)
{
if (pros[i].Name.ToLower().Equals(order))
{
pro = pros[i];
break;
}
}
T obj;
int j, k = 1;
bool done = false;
int len = list.Count;
while (k < len && !done)
{
done = true;
for (j = 0; j < len - k; j++)
{
int b = pro.GetValue(list[j], null).ToString().CompareTo(pro.GetValue(list[j + 1], null).ToString());
if ((asc && b > 0) || (!asc && b < 0))
{
done = false;
obj = list[j];
list[j] = list[j + 1];
list[j + 1] = obj;
}
}
k++;
}
}