PIbd22_Kamcharova_K.A._DoubleDeckerBus_Base/DoubleDeckerBus/Generic/SetGeneric.cs

using DoubleDeckerbus.Exceptions;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;


namespace DoubleDeckerbus.Generic
{
    internal class SetGeneric<T>
        where T : class
    {
        private readonly List<T?> _places;
        public int Count => _places.Count;
        private readonly int _maxCount;
        public SetGeneric(int count)
        {
            _maxCount = count;
            _places = new List<T?>(count);
        }
        public int Insert(T bus, IEqualityComparer<T?>? equal = null)
        {
            return Insert(bus, 0, equal);
        }

        public void SortSet(IComparer<T?> comparer) => _places.Sort(comparer);
        public int Insert(T bus, int position, IEqualityComparer<T?>? equal = null)
        {
            if (Count >= _maxCount)
            {
                throw new StorageOverflowException(_maxCount);
            }
            if (position < 0 || position >= _maxCount)
            {
                throw new IndexOutOfRangeException("Индекс вне границ коллекции");
            }
            if (equal != null && _places.Contains(bus, equal))
            {
                throw new ArgumentException("Данный объект уже есть в коллекции");
            }
            _places.Insert(position, bus);
            return 0;
        }
        public bool Remove(int position)
        {
            if (position < 0 || position >= Count)
            {
                throw new BusNotFoundException(position);
            }
            _places.RemoveAt(position);
            return true;
        }
        public T? this[int position]
        {
            get
            {
                if (position < 0 || position >= Count)
                {
                    return null;
                }
                return _places[position];
            }
            set
            {
                if (position < 0 || position > Count || Count >= _maxCount)
                {
                    return;
                }
                _places.Insert(position, value);
            }
        }
        public IEnumerable<T?> GetBus(int? maxBus = null)
        {
            for (int i = 0; i < _places.Count; ++i)
            {
                yield return _places[i];
                if (maxBus.HasValue && i == maxBus.Value)
                {
                    yield break;
                }
            }
        }
    }
}