80 lines
2.1 KiB
C#
80 lines
2.1 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using System.Text;
|
|
using System.Threading.Tasks;
|
|
using ContainerShip.Exceptions;
|
|
|
|
namespace ContainerShip.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 ship)
|
|
{
|
|
return Insert(ship, 0);
|
|
}
|
|
public int Insert(T ship, int position)
|
|
{
|
|
if (Count >= _maxCount)
|
|
{
|
|
throw new StorageOverflowException(_maxCount);
|
|
}
|
|
if (position < 0 || position >= _maxCount)
|
|
{
|
|
throw new IndexOutOfRangeException("Индекс вне границ коллекции");
|
|
}
|
|
_places.Insert(position, ship);
|
|
return 0;
|
|
}
|
|
public bool Remove(int position)
|
|
{
|
|
if (position < 0 || position >= Count)
|
|
{
|
|
throw new ShipNotFoundException(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?> GetShip(int? maxShip = null)
|
|
{
|
|
for (int i = 0; i < _places.Count; ++i)
|
|
{
|
|
yield return _places[i];
|
|
if (maxShip.HasValue && i == maxShip.Value)
|
|
{
|
|
yield break;
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|