zoukankan      html  css  js  c++  java
  • 自定义泛型N维空间数组

    class Space<T> : IEnumerable<Space<T>> {
        public T Filler {
            get {
                if (!ed) {
                    ed = true;
                    return (filler = Top.create());
                }
                return filler;
            }
        }
        public Space<T> Upper { get; private set; }
        public Space<T> Top => Upper?.Top ?? this;
    
        private bool ed;
        private Func<T> create;
        private T filler;
        public int[] Chain { get; set; }
        public int[] Dementions { get; }
        Space<T>[] all;
    
        public Space(Func<T> create, int i, params int[] indexes) : this(new int[0], new[] { i }.Concat(indexes).ToArray()) {
            this.create = create;
        }
    
        private Space(int[] chain, params int[] indexes) {
            Chain = chain;
            Dementions = indexes;
            var i = indexes[0];
            all = new Space<T>[i];
            var chains = Enumerable.Range(0, i).Select(e => chain.Concat(new int[] { e }).ToArray()).ToArray();
            if (indexes.Length == 1) {
                while (i-- > 0) {
                    all[i] = new Space<T>(chains[i]);
                    all[i].Upper = this;
                }
            } else {
                var _indexes = indexes.Skip(1).ToArray();
                while (i-- > 0) {
                    all[i] = new Space<T>(chains[i], _indexes);
                    all[i].Upper = this;
                }
            }
        }
    
        private Space(int[] chain) {
            Chain = chain;
        }
    
        public Space<T> this[int i, params int[] indexes] {
            get {
                if (all == null) {
                    return (Filler as Space<T>)?[i, indexes];
                }
                if (indexes.Length == 0) {
                    return all[i];
                }
                if (indexes.Length == 1) {
                    return all[i][indexes[0]];
                }
                return all[i][indexes[0], indexes.Skip(1).ToArray()];
            }
        }
    
        public override string ToString() {
            return all?.Aggregate(string.Empty, (a, s) => a + s + ',').Trim(',') ?? Filler.ToString();
        }
    
        public override bool Equals(object obj) {
            if (GetType() != obj?.GetType()) {
                return false;
            }
            return GetHashCode() == obj.GetHashCode();
        }
    
        public override int GetHashCode() {
            if (Upper == null) {
                return base.GetHashCode();
            }
            return Top.GetHashCode() - Chain.GetHashCode();
        }
    
        public IEnumerator<Space<T>> GetEnumerator() {
            return ((IEnumerable<Space<T>>)all).GetEnumerator();
        }
    
        IEnumerator IEnumerable.GetEnumerator() {
            return ((IEnumerable<Space<T>>)all).GetEnumerator();
        }
    }
  • 相关阅读:
    new的实现原理
    call, apply, bind的内部实现原理
    redux基础第二讲——react-redux
    redux基础第一讲
    React组件的数据
    ES6中的super
    ES5和ES6中实现对象和继承的方法对比
    react组件的生命周期
    浅谈js继承的几种方法
    LeetCode 5274. Number of Ways to Stay in the Same Place After Some Steps
  • 原文地址:https://www.cnblogs.com/ly45/p/6083491.html
Copyright © 2011-2022 走看看