#nullable disable

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

namespace BizHawk.Common.CollectionExtensions
{
	public static class CollectionExtensions
	{
		public static int LowerBoundBinarySearch<T, TKey>(this IList<T> list, Func<T, TKey> keySelector, TKey key) where TKey : IComparable<TKey>
		{
			int min = 0;
			int max = list.Count;
			int mid;
			TKey midKey;
			while (min < max)
			{
				mid = (max + min) / 2;
				T midItem = list[mid];
				midKey = keySelector(midItem);
				int comp = midKey.CompareTo(key);
				if (comp < 0)
				{
					min = mid + 1;
				}
				else if (comp > 0)
				{
					max = mid - 1;
				}
				else
				{
					return mid;
				}
			}

			// did we find it exactly?
			if (min == max && keySelector(list[min]).CompareTo(key) == 0)
			{
				return min;
			}

			mid = min;

			// we didnt find it. return something corresponding to lower_bound semantics
			if (mid == list.Count)
			{
				return max; // had to go all the way to max before giving up; lower bound is max
			}

			if (mid == 0)
			{
				return -1; // had to go all the way to min before giving up; lower bound is min
			}

			midKey = keySelector(list[mid]);
			if (midKey.CompareTo(key) >= 0)
			{
				return mid - 1;
			}

			return mid;
		}

		/// <exception cref="InvalidOperationException"><paramref name="key"/> not found after mapping <paramref name="keySelector"/> over <paramref name="list"/></exception>
		/// <remarks>implementation from https://stackoverflow.com/a/1766369/7467292</remarks>
		public static T BinarySearch<T, TKey>(this IList<T> list, Func<T, TKey> keySelector, TKey key)
		where TKey : IComparable<TKey>
		{
			int min = 0;
			int max = list.Count;
			while (min < max)
			{
				int mid = (max + min) / 2;
				T midItem = list[mid];
				TKey midKey = keySelector(midItem);
				int comp = midKey.CompareTo(key);
				if (comp < 0)
				{
					min = mid + 1;
				}
				else if (comp > 0)
				{
					max = mid - 1;
				}
				else
				{
					return midItem;
				}
			}

			if (min == max &&
				keySelector(list[min]).CompareTo(key) == 0)
			{
				return list[min];
			}

			throw new InvalidOperationException("Item not found");
		}

#if true
		public static Dictionary<TKey, TValue> SimpleCopy<TKey, TValue>(this IEnumerable<KeyValuePair<TKey, TValue>> dict)
		{
			var entryList = dict.ToList();
			var copy = new Dictionary<TKey, TValue>();
			for (int i = 0, l = entryList.Count; i != l; i++)
			{
				var entry = entryList[i];
				copy.Add(entry.Key, entry.Value);
			}
			return copy;
		}
#else // faster?
		public static Dictionary<TKey, TValue> SimpleCopy<TKey, TValue>(this IEnumerable<KeyValuePair<TKey, TValue>> dict)
		{
			var copy = new Dictionary<TKey, TValue>();
			using var @enum = dict.GetEnumerator();
			@enum.Reset();
			KeyValuePair<TKey, TValue> entry;
			while (@enum.MoveNext())
			{
				entry = @enum.Current;
				copy.Add(entry.Key, entry.Value);
			}
			return copy;
		}
#endif

		public static List<T> SimpleCopy<T>(this IList<T> list)
		{
			var copy = new List<T>();
			for (int i = 0, l = list.Count; i != l; i++) copy[i] = list[i];
			return copy;
		}
	}
}