using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;

#nullable enable
namespace LibationUiBase
{
	public enum QueuePosition
	{
		First,
		OneUp,
		OneDown,
		Last,
	}

	/*
	 * This data structure is like lifting a metal chain one link at a time.
	 * Each time you grab and lift a new link (MoveNext call):
	 * 
	 *   1) you're holding a new link in your hand (Current)
	 *   2) the remaining chain to be lifted shortens by 1 link (Queued)
	 *   3) the pile of chain at your feet grows by 1 link (Completed)
	 *   
	 * The index is the link position from the first link you lifted to the
	 * last one in the chain. 
	 */
	public class TrackedQueue<T> : IReadOnlyCollection<T>, IList, INotifyCollectionChanged where T : class
	{
		public event EventHandler<int>? CompletedCountChanged;
		public event EventHandler<int>? QueuedCountChanged;
		public event NotifyCollectionChangedEventHandler? CollectionChanged;

		public T? Current { get; private set; }
		public IReadOnlyList<T> Completed => _completed;
		private List<T> Queued { get; } = new();

		private readonly List<T> _completed = new();
		private readonly object lockObject = new();
		private int QueueStartIndex => Completed.Count + (Current is null ? 0 : 1);

		public T this[int index]
		{
			get
			{
				lock (lockObject)
				{
					return index < Completed.Count ? Completed[index]
						: index == Completed.Count && Current is not null ? Current
						: index < Count ? Queued[index - QueueStartIndex]
						: throw new IndexOutOfRangeException();
				}
			}
		}

		public int Count
		{
			get
			{
				lock (lockObject)
				{
					return QueueStartIndex + Queued.Count;
				}
			}
		}

		public int IndexOf(T item)
		{
			lock (lockObject)
			{
				int index = _completed.IndexOf(item);
				if (index < 0 && item == Current)
					index = Completed.Count;
				if (index < 0)
				{
					index = Queued.IndexOf(item);
					if (index >= 0)
						index += QueueStartIndex;
				}
				return index;
			}
		}

		public bool RemoveQueued(T item)
		{
			int queuedCount, queueIndex;

			lock (lockObject)
			{
				queueIndex = Queued.IndexOf(item);
				if (queueIndex >= 0)
					Queued.RemoveAt(queueIndex);
				queuedCount = Queued.Count;
			}

			if (queueIndex >= 0)
			{
				QueuedCountChanged?.Invoke(this, queuedCount);
				CollectionChanged?.Invoke(this, new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Remove, item, QueueStartIndex + queueIndex));
				return true;
			}
			return false;
		}

		public bool RemoveCompleted(T item)
		{
			int completedCount, completedIndex;

			lock (lockObject)
			{
				completedIndex = _completed.IndexOf(item);
				if (completedIndex >= 0)
					_completed.RemoveAt(completedIndex);
				completedCount = _completed.Count;
			}

			if (completedIndex >= 0)
			{
				CompletedCountChanged?.Invoke(this, completedCount);
				CollectionChanged?.Invoke(this, new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Remove, item, completedIndex));
				return true;
			}
			return false;
		}

		public void ClearCurrent()
		{
			T? current;
			lock (lockObject)
			{
				current = Current;
				Current = null;
			}
			CollectionChanged?.Invoke(this, new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Remove, current, _completed.Count));
		}

		public void ClearQueue()
		{
			List<T> queuedItems;
			lock (lockObject)
			{
				queuedItems = Queued.ToList();
				Queued.Clear();
			}
			QueuedCountChanged?.Invoke(this, 0);
			CollectionChanged?.Invoke(this, new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Remove, queuedItems, QueueStartIndex));
		}

		public void ClearCompleted()
		{
			List<T> completedItems;
			lock (lockObject)
			{
				completedItems = _completed.ToList();
				_completed.Clear();
			}
			CompletedCountChanged?.Invoke(this, 0);
			CollectionChanged?.Invoke(this, new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Remove, completedItems, 0));
		}

		public void MoveQueuePosition(T item, QueuePosition requestedPosition)
		{
			int oldIndex, newIndex;
			lock (lockObject)
			{
				oldIndex = Queued.IndexOf(item);
				newIndex = requestedPosition switch
				{
					QueuePosition.First => 0,
					QueuePosition.OneUp => oldIndex - 1,
					QueuePosition.OneDown => oldIndex + 1,
					QueuePosition.Last or _ => Queued.Count - 1
				};

				if (oldIndex < 0 || newIndex < 0 || newIndex >= Queued.Count || newIndex == oldIndex)
					return;

				Queued.RemoveAt(oldIndex);
				Queued.Insert(newIndex, item);
			}
			CollectionChanged?.Invoke(this, new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Move, item, QueueStartIndex + newIndex, QueueStartIndex + oldIndex));
		}

		public bool MoveNext()
		{
			int completedCount = 0, queuedCount = 0;
			bool completedChanged = false;
			try
			{
				lock (lockObject)
				{
					if (Current != null)
					{
						_completed.Add(Current);
						completedCount = _completed.Count;
						completedChanged = true;
					}
					if (Queued.Count == 0)
					{
						Current = null;
						return false;
					}
					Current = Queued[0];
					Queued.RemoveAt(0);

					queuedCount = Queued.Count;
					return true;
				}
			}
			finally
			{
				if (completedChanged)
					CompletedCountChanged?.Invoke(this, completedCount);
				QueuedCountChanged?.Invoke(this, queuedCount);
			}
		}

		public void Enqueue(IList<T> item)
		{
			int queueCount;
			lock (lockObject)
			{
				Queued.AddRange(item);
				queueCount = Queued.Count;
			}
			QueuedCountChanged?.Invoke(this, queueCount);
			CollectionChanged?.Invoke(this, new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Add, item, QueueStartIndex + Queued.Count));
		}

		public IEnumerable<T> GetAllItems()
		{
			lock (lockObject)
			{
				if (Current is null) return Completed.Concat(Queued);
				return Completed.Concat([Current]).Concat(Queued);
			}
		}

		public IEnumerator<T> GetEnumerator() => GetAllItems().GetEnumerator();
		IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();

		#region IList interface implementation
		object? IList.this[int index] { get => this[index]; set => throw new NotSupportedException(); }
		public bool IsReadOnly => true;
		public bool IsFixedSize => false;
		public bool IsSynchronized => false;
		public object SyncRoot => this;
		public int IndexOf(object? value) => value is T t ? IndexOf(t) : -1;
		public bool Contains(object? value) => IndexOf(value) >= 0;
		//These aren't used by anything, but they are IList interface members and this class needs to be an IList for Avalonia
		public int Add(object? value) => throw new NotSupportedException();
		public void Clear() => throw new NotSupportedException();
		public void Insert(int index, object? value) => throw new NotSupportedException();
		public void Remove(object? value) => throw new NotSupportedException();
		public void RemoveAt(int index) => throw new NotSupportedException();
		public void CopyTo(Array array, int index) => throw new NotSupportedException();
		#endregion
	}
}