zoukankan      html  css  js  c++  java
  • c# 是如何对一个可遍历对象实现遍历的

     public class Persons:IEnumerable
        {
            public Persons(string[] people)
            {
                this.people = people;
            }
    
            public string[] people { set; get; }
            public IEnumerator GetEnumerator()
            {
                return new PersonEnumable(people);
            }
        }
        public class PersonEnumable : IEnumerator
        {
            public PersonEnumable(string[] people)
            {
                this.people = people;
            }
            private string[] people { set; get; }
            private int index { set; get; } = -1;
            /// <summary>
            /// 当前对象
            /// </summary>
            public object Current {
                get {
                    if (index < 0 || index > people.Length-1)
                        return null;
                    else
                        return people[index];
                }
            }
            /// <summary>
            /// 
            /// </summary>
            /// <returns></returns>
            public bool MoveNext()
            {
                if (index < people.Length-1)
                {
                    index++;
                    return true;
                }
                return false;
            }
    
            /// <summary>
            /// 
            /// </summary>
            public void Reset()
            {
                index = -1;
            }
        }
    var strArr = new string[] { "科比", "詹姆斯", "杜兰特", "诺维茨基", "东契奇", "卢比奥" };
                var persons = new Persons(strArr);
                foreach (var t in persons)
                {
                    Console.WriteLine(t);
                }
                //foreachq其实大概就是执行了这段代码,只是不知道是什么时候执行的Reset()
                PersonEnumable personEnumable = new PersonEnumable(strArr);
                while (personEnumable.MoveNext())
                {
                    Console.WriteLine(personEnumable.Current);
                }

    运行结果如下

    可以看出两次输出结果是一样的。

  • 相关阅读:
    桶排序
    Ultra-QuickSort
    Merge Sort
    Max Sum
    快排
    Oil Deposits
    1009: josephus问题
    A+B Again(在某个数中找大于m的最小约数)
    luogu4181 [USACO18JAN]Rental Service (贪心)
    luogu4185 [USACO18JAN]MooTube (并查集)
  • 原文地址:https://www.cnblogs.com/yuchenghao/p/10415200.html
Copyright © 2011-2022 走看看