zoukankan      html  css  js  c++  java
  • EF 排序扩展

    public static class LinqOrderEx
        {
            private static IOrderedQueryable<T> OrderingHelper<T>(IQueryable<T> source, string propertyName, bool descending, bool anotherLevel)
            {
                ParameterExpression param = Expression.Parameter(typeof(T), string.Empty); // I don't care about some naming
                MemberExpression property = Expression.PropertyOrField(param, propertyName);
                LambdaExpression sort = Expression.Lambda(property, param);
    
                MethodCallExpression call = Expression.Call(
                    typeof(Queryable),
                    (!anotherLevel ? "OrderBy" : "ThenBy") + (descending ? "Descending" : string.Empty),
                    new[] { typeof(T), property.Type },
                    source.Expression,
                    Expression.Quote(sort));
    
                return (IOrderedQueryable<T>)source.Provider.CreateQuery<T>(call);
            }
            public static IOrderedQueryable<T> OrderBy<T>(this IQueryable<T> source, string propertyName)
            {
                return OrderingHelper(source, propertyName, false, false);
            }
            public static IOrderedQueryable<T> OrderBy<T>(this IQueryable<T> source, string propertyName, string order)
            {
                if (order.ToLower() == "desc")
                    return OrderingHelper(source, propertyName, true, false);
                else
                    return OrderingHelper(source, propertyName, false, false);
            }
    
            public static IOrderedQueryable<T> OrderByDescending<T>(this IQueryable<T> source, string propertyName)
            {
                return OrderingHelper(source, propertyName, true, false);
            }
    
            public static IOrderedQueryable<T> ThenBy<T>(this IOrderedQueryable<T> source, string propertyName)
            {
                return OrderingHelper(source, propertyName, false, true);
            }
    
            public static IOrderedQueryable<T> ThenByDescending<T>(this IOrderedQueryable<T> source, string propertyName)
            {
                return OrderingHelper(source, propertyName, true, true);
            }
    
            public static IQueryable<T> OrderByName<T>(this IQueryable<T> q, string SortField, bool Ascending = true)
            {
                if (SortField.IndexOf("DESC") > 0)
                {
                    SortField = SortField.Split(new char[] { ' ' })[0];
                    Ascending = false;
                }
                var param = Expression.Parameter(typeof(T), "p");
                var prop = Expression.Property(param, SortField);
                var exp = Expression.Lambda(prop, param);
                string method = Ascending ? "OrderBy" : "OrderByDescending";
                Type[] types = new Type[] { q.ElementType, exp.Body.Type };
                var mce = Expression.Call(typeof(Queryable), method, types, q.Expression, exp);
                return q.Provider.CreateQuery<T>(mce);
            }
            public static IQueryable<T> OrderByName<T>(this IQueryable<T> q, string SortField, string order = "desc")
            {
                if (string.IsNullOrWhiteSpace(SortField) || string.IsNullOrWhiteSpace(order))
                {
                    return q;
                }
                if (order.ToLower() == "desc")
                {
                    return OrderByName(q, SortField, false);
                }
                else
                {
                    return OrderByName(q, SortField, true);
                }
            }
    
        }
  • 相关阅读:
    Topcoder SRM656div1 250 ( 期望DP )
    SCAU 2015 GDCPC team_training1
    第五次群赛暨清明节专场
    HDU 2783 You’ll be Working on the Railroad(最短路)
    HDU 4013 Distinct Subtrees(树的最小表示)
    HDU 4014 Jimmy’s travel plan(图计数)
    SCAU 2015 GDCPC team_training0
    HDU 1024 Max Sum Plus Plus (递推)
    UVA 12849 Mother’s Jam Puzzle( 高斯消元 )
    HDU 4285 circuits( 插头dp , k回路 )
  • 原文地址:https://www.cnblogs.com/tangchun/p/7831855.html
Copyright © 2011-2022 走看看