/* SPDX-License-Identifier: Apache-2.0
*
* The OpenSearch Contributors require contributions made to
* this file be licensed under the Apache-2.0 license or a
* compatible open source license.
*/
/*
* Modifications Copyright OpenSearch Contributors. See
* GitHub history for details.
*
*  Licensed to Elasticsearch B.V. under one or more contributor
*  license agreements. See the NOTICE file distributed with
*  this work for additional information regarding copyright
*  ownership. Elasticsearch B.V. licenses this file to you under
*  the Apache License, Version 2.0 (the "License"); you may
*  not use this file except in compliance with the License.
*  You may obtain a copy of the License at
*
* 	http://www.apache.org/licenses/LICENSE-2.0
*
*  Unless required by applicable law or agreed to in writing,
*  software distributed under the License is distributed on an
*  "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
*  KIND, either express or implied.  See the License for the
*  specific language governing permissions and limitations
*  under the License.
*/

#region Utf8Json License https://github.com/neuecc/Utf8Json/blob/master/LICENSE
// MIT License
//
// Copyright (c) 2017 Yoshifumi Kawai
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#endregion

using System;
using System.Collections;
using System.Collections.Generic;
using System.Runtime.CompilerServices;
using System.Text;

namespace OpenSearch.Net.Utf8Json.Internal
{
	// like ArraySegment<byte> hashtable.
	// Add is safe for construction phase only and requires capacity(does not do rehash)

	internal class ByteArrayStringHashTable<T> : IEnumerable<KeyValuePair<string, T>>
	{
		private readonly Entry[][] _buckets; // immutable array(faster than linkedlist)
		private readonly ulong _indexFor;

		public ByteArrayStringHashTable(int capacity)
			: this(capacity, 0.42f) // default: 0.75f -> 0.42f
		{
		}

		public ByteArrayStringHashTable(int capacity, float loadFactor)
		{
			var tableSize = CalculateCapacity(capacity, loadFactor);
			_buckets = new Entry[tableSize][];
			_indexFor = (ulong)_buckets.Length - 1;
		}

		public void Add(string key, T value)
		{
			if (!TryAddInternal(Encoding.UTF8.GetBytes(key), value))
				throw new ArgumentException("Key already exists. Key:" + key);
		}

		public void Add(byte[] key, T value)
		{
			if (!TryAddInternal(key, value))
				throw new ArgumentException("Key already exists. Key:" + Encoding.UTF8.GetString(key));
		}

		private bool TryAddInternal(byte[] key, T value)
		{
			var h = ByteArrayGetHashCode(key, 0, key.Length);
			var entry = new Entry { Key = key, Value = value };

			var array = _buckets[h & (_indexFor)];
			if (array == null)
			{
				_buckets[h & (_indexFor)] = new[] { entry };
			}
			else
			{
				// check duplicate
				for (var i = 0; i < array.Length; i++)
				{
					var e = array[i].Key;
					if (ByteArrayComparer.Equals(key, 0, key.Length, e))
						return false;
				}

				var newArray = new Entry[array.Length + 1];
				Array.Copy(array, newArray, array.Length);
				array = newArray;
				array[array.Length - 1] = entry;
				_buckets[h & (_indexFor)] = array;
			}

			return true;
		}

		public bool TryGetValue(ArraySegment<byte> key, out T value)
		{
			var table = _buckets;
			var hash = ByteArrayGetHashCode(key.Array, key.Offset, key.Count);
			var entry = table[hash & _indexFor];

			if (entry == null) goto NOT_FOUND;

			{
				var v = entry[0];
				if (ByteArrayComparer.Equals(key.Array, key.Offset, key.Count, v.Key))
				{
					value = v.Value;
					return true;
				}
			}

			for (var i = 1; i < entry.Length; i++)
			{
				var v = entry[i];
				if (ByteArrayComparer.Equals(key.Array, key.Offset, key.Count, v.Key))
				{
					value = v.Value;
					return true;
				}
			}

			NOT_FOUND:
			value = default;
			return false;
		}

		private static readonly bool Is32Bit = (IntPtr.Size == 4);

		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		private static ulong ByteArrayGetHashCode(byte[] x, int offset, int count)
		{
			// FarmHash https://github.com/google/farmhash
			if (x == null || x.Length == 0 || count == 0) return 0;

			return Is32Bit
				? FarmHash.Hash32(x, offset, count)
				: FarmHash.Hash64(x, offset, count);
		}

		private static int CalculateCapacity(int collectionSize, float loadFactor)
		{
			var initialCapacity = (int)(collectionSize / loadFactor);
			var capacity = 1;
			while (capacity < initialCapacity)
				capacity <<= 1;

			return capacity < 8 ? 8 : capacity;
		}

		// only for Debug use
		public IEnumerator<KeyValuePair<string, T>> GetEnumerator()
		{
			var b = _buckets;

			foreach (var item in b)
			{
				if (item == null) continue;
				foreach (var item2 in item)
					yield return new KeyValuePair<string, T>(Encoding.UTF8.GetString(item2.Key), item2.Value);
			}
		}

		IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();

		private struct Entry
		{
			public byte[] Key;
			public T Value;

			// for debugging
			public override string ToString() => "(" + Encoding.UTF8.GetString(Key) + ", " + Value + ")";
		}
	}
}