C# 列表IList, 集合ICollection, 可迭代容器IEnumerable 扩展

csharp 复制代码
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;

using UnityEngine;

/// <summary>迭代器扩展方法</summary>
[DebuggerStepThrough]
public static class EnumerableExtension
{
    /// <summary> 遍历操作 </summary>
    public static void ForEach<T>(this IEnumerable<T> values, Action<T> action)
    {
        foreach (T ele in values) 
            action(ele);
    }
    /// <summary> 遍历操作 </summary>
    public static void ForEach(this IEnumerable values, Action<object> action)
    {
        foreach (object ele in values)
            action(ele);
    }
    /// <summary> 计数</summary>
    public static int CountOf<T>(this IEnumerable<T> values, Predicate<T> match)
    {
        int ret = 0;
        foreach (T ele in values)
            ret += match(ele) ? 1 : 0;
        return ret;
    }
    /// <summary> 计数</summary>
    public static int CountOf(this IEnumerable values, Predicate<object> match)
    {
        int ret = 0;
        foreach (object ele in values)
            ret += match(ele) ? 1 : 0;
        return ret;
    }

    /// <summary> 查找</summary>
    public static T Find<T>(this IEnumerable<T> values, Predicate<T> match)
    {
        foreach (var ele in values)
        {
            if (match(ele)) return ele;
        }
        return default;
    }
    /// <summary> 查找</summary>
    public static object Find(this IEnumerable values, Predicate<object> match)
    {
        foreach (object ele in values)
        {
            if (match(ele)) return ele;
        }
        return default;
    }

    /// <summary> 查找</summary>
    public static T Find<T>(this IEnumerable<T> values, int index)
    {
        foreach(var ele in values)
        {
            if (index-- == 0)
                return ele;
        }
        return default;
    }

    /// <summary> 查找下标</summary>
    public static int FindIndex<T>(this IEnumerable<T> values, T data)
    {
        int i = 0;
        foreach (var ele in values)
        {
            if (ele.Equals(data))
                return i;
            ++i;
        }
        return -1;
    }
    /// <summary> 查找下标</summary>
    public static int FindIndex<T>(this IEnumerable<T> values, Predicate<T> match)
    {
        int i = 0;
        foreach (T ele in values)
        {
            if (match(ele))
                return i;
            ++i;
        }
        return -1;
    }
    /// <summary> 查找下标</summary>
    public static int FindIndex(this IEnumerable values, Predicate<object> match)
    {
        int i = 0;
        foreach (object ele in values)
        {
            if (match(ele))
                return i;
            ++i;
        }
        return -1;
    }
    /// <summary>查找全部</summary>
    public static List<T> FindAll<T>(this IEnumerable<T> values, Predicate<T> match)
    {
        List<T> ret = new List<T>();
        foreach (T ele in values)
            if (match(ele))
                ret.Add(ele);
        return ret;
    }

    /// <summary>是否存在</summary>
    public static bool Exist<T>(this IEnumerable<T> values, Predicate<T> match)
    {
        return values.FindIndex(match) != -1;
    }

    /// <summary> 是否为空</summary>
    public static bool Empty(this IEnumerable values) => !values.GetEnumerator().MoveNext();

    /// <summary> 转化为目标数组</summary>
    public static List<object[]> ToObjectArr(this IEnumerable values)
    {
        List<object[]> ret = new List<object[]>(values is ICollection c ? c.Count : 4);
        foreach (object ele in values)
            ret.Add(new object[] { ele });
        return ret;
    }

    /// <summary> 转化为目标数组</summary>
    public static List<object[]> ToObjectArr<T, TOut>(this IEnumerable<T> values, Func<T, TOut> func)
    {
        List<object[]> ret = new List<object[]>(values is ICollection c ? c.Count : 4);
        foreach (T ele in values)
            ret.Add(new object[] { ele, func.Invoke(ele) });
        return ret;
    }
}
相关推荐
Lost of 程序猿2 分钟前
船岸数据同步链路实战:SendFlag、单调版本号与断网三天后的续传
后端·c#·asp.net
路径规划6661 小时前
(MATLAB代码) 船舶轨迹聚类:K-means 算法(260912)
算法·matlab·kmeans
wzdark7 小时前
基于堆的优先队列实现原理与复杂度分析4
算法
老王熬夜敲代码9 小时前
BLAKE3:最快的密码学哈希函数
算法·密码学·哈希算法
hansang_IR9 小时前
【题解】P4460 [CQOI2018] 解锁屏幕
c++·算法
见闻小天地9 小时前
简博斯JG-C系列彩色激光同轴位移计:摄像头模组对位与行程测量的技术价值观察
人工智能·算法
葫三生10 小时前
《论三生原理》神话学构想与“神话历史”理论、《古史中的神话》思路异同?
大数据·人工智能·科技·深度学习·算法
liliangcsdn11 小时前
因子分析指标概念与示例
算法·机器学习
SupL!12 小时前
LoftQ原理
算法
Navigator_Z13 小时前
LeetCode //C - 1240. Tiling a Rectangle with the Fewest Squares
c语言·算法·leetcode