//! Extensions
use std::{
    marker::PhantomData,
    fmt,
    ops,
};
use smallvec::SmallVec;

/// Wrapper to derive debug for types that don't implement it.
#[repr(transparent)]
#[derive(Clone, PartialEq, Eq, Ord,PartialOrd, Hash)]
pub struct OpaqueDebug<T>(T);

impl<T> OpaqueDebug<T>
{
    /// Create a new wrapper
    #[inline]  pub const fn new(value: T) -> Self
    {
	Self(value)
    }

    /// Consume into the value
    #[inline] pub fn into_inner(self) -> T
    {
	self.0
    }
}

impl<T> AsRef<T> for OpaqueDebug<T>
{
    #[inline] fn as_ref(&self) -> &T
    {
	&self.0
    }
}

impl<T> AsMut<T> for OpaqueDebug<T>
{
    #[inline] fn as_mut(&mut self) -> &mut T
    {
	&mut self.0
    }
}

impl<T> ops::Deref for OpaqueDebug<T>
{
    type Target = T;
    #[inline] fn deref(&self) -> &Self::Target
    {
	&self.0
    }
}

impl<T> ops::DerefMut for OpaqueDebug<T>
{
    #[inline] fn deref_mut(&mut self) -> &mut Self::Target
    {
	&mut self.0
    }
}

impl<T> fmt::Debug for OpaqueDebug<T>
{
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result
    {
	write!(f, "<opaque value>")
    }
}


/// A trait for types that can insert objects at their end.
pub trait BackInserter<T>
{
    /// Insert an object at the end of this container
    fn push_back(&mut self, value: T);
}

impl<T> BackInserter<T> for Vec<T>
{
    #[inline] 
    fn push_back(&mut self, value: T)
    {
	self.push(value)
    }
}

impl<T> BackInserter<T> for SmallVec<T>
where T: smallvec::Array<Item = T>
{
    #[inline] fn push_back(&mut self, value: T)
    {
	self.push(value)
    }
}

/// Absracts a closure for `BackInserter<T>`.
pub struct BackInsertPass<T,F>(F, PhantomData<T>)
where F: FnMut(T);

impl<T,F: FnMut(T)> BackInsertPass<T,F>
{
    /// Create a new instance with this closure
    #[inline] pub fn new(func: F) -> Self
    {
	Self(func, PhantomData)
    }
}

impl<T, F: FnMut(T)> BackInserter<T> for BackInsertPass<T,F>
{
    #[inline] fn push_back(&mut self, value: T)
    {
	self.0(value)
    }
}

/// A `BackInserter<T>` that will only add a max capacity of items before it starts dropping input to its `push_back` function.
pub struct CappedBackInserter<'a, T>(&'a mut T, usize, usize)
where T: BackInserter<T>;

impl<'a, T> CappedBackInserter<'a, T>
where T: BackInserter<T>
{
    /// Create a new instance with this max capacity
    #[inline] pub fn new(from: &'a mut T, cap: usize) -> Self
    {
	Self(from, 0, cap)
    }

    /// The number of elements pushed so far
    #[inline] pub fn len(&self) -> usize {
	self.1
    }

    /// The max number of elemnts allowed to be pushed
    #[inline] pub fn cap(&self) -> usize {
	self.2
    }
}

impl<'a, T> BackInserter<T> for CappedBackInserter<'a, T>
where T: BackInserter<T>
{
    #[inline] fn push_back(&mut self, value: T)
    {
	if self.1 < self.2 {
	    self.0.push_back(value);
	    self.1+=1;
	}
    }
}

impl<T> BackInserter<T> for Option<T>
{
    fn push_back(&mut self, value: T)
    {
	*self = Some(value);
    }
}

pub trait VecExt<T>
{
    /// Insert many elements with exact size iterator
    fn insert_exact<Ex, I: IntoIterator<Item = T, IntoIter = Ex>>(&mut self, location: usize, slice: I)
    where Ex: ExactSizeIterator<Item = T>;

    /// Insert many elements
    fn insert_many<I: IntoIterator<Item =T>>(&mut self, location: usize, slice: I);
}


impl<T> VecExt<T> for Vec<T>
{
    #[cfg(not(feature="experimental_inserter"))]
    #[inline(always)]
    fn insert_exact<Ex, I: IntoIterator<Item = T, IntoIter = Ex>>(&mut self, location: usize, slice: I)
    where Ex: ExactSizeIterator<Item = T>
    {
	self.insert_many(location, slice)
    }
    #[cfg(feature="experimental_inserter")]
    fn insert_exact<Ex, I: IntoIterator<Item = T, IntoIter = Ex>>(&mut self, location: usize, slice: I)
    where Ex: ExactSizeIterator<Item = T>,
    {
	#[inline(never)]
	#[cold]
	fn panic_len(l1: usize, l2: usize) -> !
	{
	    panic!("Location must be in range 0..{}, got {}", l1,l2)
	}

	#[inline(never)]
	#[cold]
	fn inv_sz() -> !
	{
	    panic!("ExactSizeIterator returned invalid size");
	}

	if location >= self.len() {
	    panic_len(self.len(), location);
	}
	let mut slice = slice.into_iter();

	let slen = slice.len();
	match slen {
	    0 => return,
	    1 => {
		self.insert(location, slice.next().unwrap());
		return
	    },
	    _ => (),
	};
	self.reserve(slice.len());

	unsafe {
	    let this = self.as_mut_ptr().add(location);
	    let len = self.len();
	    let rest = std::mem::size_of::<T>() * (location..len).len();
	    
	    libc::memmove(this.add(slen) as *mut libc::c_void, this as *mut libc::c_void, rest);
	    let mut sent=0;
	    match std::panic::catch_unwind(std::panic::AssertUnwindSafe(|| {
		let mut this = this;
		for item in slice {
		    if sent >= slen {
			inv_sz();
		    }
		    
		    this.write(item);
		    this = this.add(1);
		    sent+=1;
		}
		if sent != slen {
		    inv_sz();
		}
	    })) {
		Err(e) => {
		    // memory at (location+sent)..slen is now invalid, move the old one back before allowing unwind to contine
		    libc::memmove(this.add(sent) as *mut libc::c_void, this.add(slen) as *mut libc::c_void, rest);
		    self.set_len(len + sent);
		    std::panic::resume_unwind(e)
		},
		_ => (),
	    }
	    self.set_len(len + sent);
	}
    }
    #[inline]
    fn insert_many<I: IntoIterator<Item =T>>(&mut self, location: usize, slice: I)
    {
	let slice = slice.into_iter();
	match slice.size_hint() {
	    (0, Some(0)) | (0, None) => (),
	    (_, Some(bound)) | (bound, _) => self.reserve(bound),
	};

	self.splice(location..location, slice);
	
	//let splice = self.split_off(location);
	//self.extend(slice.chain(splice.into_iter()));
	
	/*
	// shift everything across, replacing with the new values
	let splice: Vec<_> = self.splice(location.., slice).collect();
	//            ^ -- this allocation bugs me, but we violate aliasing rules if we don't somehow collect it before adding it back in so...
	// add tail back
	self.extend(splice);*/
    }
}

#[cfg(test)]
mod tests
{
    use super::*;
    #[test]
    fn vec_insert_exact()
    {
	let mut vec = vec![0,1,2,8,9,10];
	vec.insert_exact(3, [3,4,5,6, 7].iter().copied());

	assert_eq!(&vec[..],
		   &[0,1,2,3,4,5,6,7,8,9,10]
	);
    }
    #[test]
    fn vec_insert_exact_nt()
    {
	macro_rules! string {
	    ($str:literal) => (String::from($str));
	}
	let mut vec = vec![
	    string!("Hello"),
	    string!("world"),
	    string!("foo"),
	    string!("uhh"),
	];
	let vec2 = vec![
	    string!("Hello"),
	    string!("world"),
	    string!("hi"),
	    string!("hello"),
	    string!("foo"),
	    string!("uhh"),
	];

	vec.insert_exact(2, vec![string!("hi"), string!("hello")]);

	assert_eq!(&vec[..], &vec2[..]);
    }
    
    #[cfg(feature="nightly")]
    mod benchmatks
    {
	use super::super::*;
	use test::{
	    Bencher, black_box,
	};
	#[cfg(not(feature="experimental_inserter"))]
	#[bench]
	fn move_exact(b: &mut Bencher)
	{
	    let mut vec = vec![0,10,11,12];
	    let span = [0,1,2,3];
	    b.iter(|| {
		black_box(vec.insert_exact(vec.len()/2, span.iter().copied()));
	    });   
	}
	#[bench]
	fn move_via_splice(b: &mut Bencher)
	{
	    let mut vec = vec![0,10,11,12];
	    let span = [0,1,2,3];

	    b.iter(|| {
		black_box(vec.insert_many(vec.len()/2, span.iter().copied()));
	    });
	}
	
	#[cfg(feature="experimental_inserter")]
	#[bench]
	fn move_via_unsafe(b: &mut Bencher)
	{
	    let mut vec = vec![0,10,11,12];
	    let span = [0,1,2,3];
	    b.iter(|| {
		black_box(vec.insert_exact(vec.len()/2, span.iter().copied()));
	    });
	}
    }
}

#[macro_export] macro_rules! id_type {
    ($name:ident $(; $doc:literal)?) => {
	$(#[doc(comment=$doc)])?
	    #[derive(Debug, Clone, PartialEq, Eq, Ord, PartialOrd, Hash, ::serde::Serialize, ::serde::Deserialize)]
	pub struct $name(uuid::Uuid);

	impl $name
	{
	    /// Create a random new unique ID
	    #[inline] fn id_new() -> Self
	    {
		Self(::uuid::Uuid::new_v4())
	    }
	    /// Create from a UUID
	    #[inline] fn id_from(from: ::uuid::Uuid) -> Self
	    {
		Self(from)
	    }
	}

    };
}

mod global_counter
{
    use std::sync::atomic::{
	Ordering, AtomicU64,
    };

    #[derive(Debug)]
    pub struct GlobalCounter(AtomicU64);

    impl GlobalCounter
    {
	/// Get and increment the counter
	pub fn get(&self) -> u64
	{
	    self.0.fetch_add(1, Ordering::SeqCst)
	}
	/// Check if this `u64` is valid to have come from this counter.
	pub fn valid(&self, val: u64) -> bool
	{
	    val <= self.0.load(Ordering::Acquire)
	}
	/// Create a new global counter.
	pub const fn new() -> Self
	{
	    Self(AtomicU64::new(0))
	}
    }
}
pub use global_counter::GlobalCounter;

const GLOBAL_SALT_SIZE: usize = 16;
lazy_static! {
    pub static ref GLOBAL_SALT: &'static [u8] = {
	let mut this = Box::new([0u8; GLOBAL_SALT_SIZE]);
	getrandom::getrandom(&mut this[..]).expect("Failed to populate global salt");
	&Box::leak(this)[..]
    };
}

/// A wrapper for hashing with a specific salt.
#[derive(Debug, Hash)]
pub struct Salted<'a, T: ?Sized + std::hash::Hash>(&'a T, &'a [u8]);

impl<'a, T> Salted<'a, T>
where T: std::hash::Hash + ?Sized
{
    /// Create a new wrapper.
    pub fn new(val: &'a T, salt: &'a [u8]) -> Self
    {
	Self(val, &salt)
    }
}
/// A wrapper for hashing with the global salt.
#[derive(Debug, Hash)]
pub struct GloballySalted<'a, T: ?Sized + std::hash::Hash>(&'a T, &'static [u8]);

impl<'a, T> GloballySalted<'a, T>
where T: std::hash::Hash + ?Sized
{
    /// Create a new wrapper.
    pub fn new(val: &'a T) -> Self
    {
	Self(val, &GLOBAL_SALT[..])
    }
}

pub trait HashWithSaltExt: std::hash::Hash
{
    /// Create a hash wrapper around this instance that hashes with a specific salt.
    fn hash_with_salt<'a>(&'a self, salt: &'a [u8]) -> Salted<'a, Self>;
    /// Create a hash wrapper around this instance that hashes with the global salt.
    #[inline] fn hash_with_global_salt(&self) -> GloballySalted<'_, Self>
    {
	GloballySalted::new(self)
    }
}

impl<T> HashWithSaltExt for T where T: ?Sized + std::hash::Hash
{
    #[inline] fn hash_with_salt<'a>(&'a self, salt: &'a [u8]) -> Salted<'a, Self> {
	Salted::new(self, salt)
    }
}

mod sha256_hasher {
    use std::mem::size_of;
    use sha2::{
	Digest, Sha256,
    };
    use std::hash::{
	Hasher, Hash,
    };
    use cryptohelpers::sha256::Sha256Hash;
    struct Sha256Hasher(Sha256);
    impl Sha256Hasher
    {
	pub fn new() -> Self
	{
	    Self(Sha256::new())
	}
    }
    impl Hasher for Sha256Hasher
    {
	fn write(&mut self, bytes: &[u8])
	{
	    self.0.update(bytes);
	}
	fn finish(&self) -> u64
	{
	    let ar = self.0.clone().finalize();
	    let mut rest = [0u8; size_of::<u64>()];
	    crate::bytes::move_slice(&mut rest[..], &ar[..]);
	    u64::from_le_bytes(rest)
	}
    }
    
    pub trait Sha256HashExt
    {
	fn compute_sha256_hash(&self) -> Sha256Hash;
    }

    impl<T> Sha256HashExt for T
    where T: Hash
    {
	fn compute_sha256_hash(&self) -> Sha256Hash {
	    let mut hasher = Sha256Hasher::new();
	    self.hash(&mut hasher);
	    hasher.0.into()
	}
    }
}
pub use sha256_hasher::Sha256HashExt;

/// Value may hold one in place or allocate on the heap to hold many.
pub type MaybeVec<T> = smallvec::SmallVec<[T; 1]>;

#[macro_export] macro_rules! impl_deref {
    (for $($(frag:tt)*;)? $name:ident impl $to:ident as $expr:expr $(; mut $mut_expr:expr)?) => {
	impl $($($frag)*)? ::std::ops::Deref for $name
	{
	    type Target = $to;
	    fn deref(&self) -> &Self::Target
	    {
		$expr
	    }
	}
	$(
	    impl $($($frag)*)? ::std::ops::DerefMut for $name
	    {
		fn deref_mut(&mut self) -> &mut <Self as ::std::ops::Deref>::Target
		{
		    $mut_expr
		}
	    })?
    };
}

/// Ignore the value of this expression, returning unit `()` value.
#[macro_export] macro_rules! ignore {
    ($expr:expr) => ({let _ = $expr;});
}

use std::any::Any;
/// A trait for `Any` that is both `Send`, `Sync`, `'static`, and implements `Clone`.
pub trait AnyCloneable: mopa::Any
{
    fn clone_dyn(&self) -> Box<dyn AnyCloneable + Send + Sync + 'static>;
    fn clone_dyn_any(&self) -> Box<dyn Any + Send + 'static>;
    fn clone_dyn_any_sync(&self) -> Box<dyn Any + Send + Sync  + 'static>;
}
mopafy!(AnyCloneable);

impl<T: ?Sized + Clone + Any + Send + Sync + 'static> AnyCloneable for T
{
    #[inline] fn clone_dyn(&self) -> Box<dyn AnyCloneable + Send + Sync + 'static> {
	Box::new(self.clone())
    }
    #[inline] fn clone_dyn_any(&self) -> Box<dyn Any + Send + 'static> {
	Box::new(self.clone())
    }
    fn clone_dyn_any_sync(&self) -> Box<dyn Any + Send + Sync  + 'static> {
	Box::new(self.clone())
    }
}

/// A dynamically clonable heap allocated polymorphic `Any` object.
pub type DynCloneable = Box<dyn AnyCloneable + Send + Sync + 'static>;
impl Clone for DynCloneable
{
    #[inline] fn clone(&self) -> Self {
	self.clone_dyn()
    }
}

#[macro_export] macro_rules! shim_debug {
    ($name:ident; $msg:literal $($tt:tt)*) => {
	impl ::std::fmt::Debug for $name
	{
	    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result
	    {
		write!(f, $msg $($tt)*)
	    }
	}
    };
    ($name:ident) => {
	shim_debug!($name; "<opaque debug for type {:?}>", std::any::type_name::<$name>());
    }

}

mod maybe_iter
{
    use std::iter::{once, Once, Chain};

    #[derive(Debug, Clone)]
    enum Inner<I, T>
    {
	Some(I),
	One(std::iter::Once<T>),
	None,
    }
    /// An iterator that may yield 0, 1, or more values.
    #[derive(Debug, Clone)]
    #[repr(transparent)]
    pub struct MaybeIter<I, T>(Inner<I, T>);

    impl<I, T> MaybeIter<I, T>
    where I: Iterator<Item=T>
    {
	/// Create a single element iterator
	pub fn one<U: Into<T>>(from: U) -> Self
	{
	    Self(Inner::One(once(from.into())))
	}
	/// Create a new instance from an iterator
	pub fn many<U: IntoIterator<IntoIter = I, Item=T>>(from: U) -> Self
	{
	    Self(Inner::Some(from.into_iter()))
	}
	/// Create a new instance that yields 0 items
	#[inline(always)] pub fn none() -> Self
	{
	    Self(Inner::None)
	}

	/// Create a new instance from an iterator.
	///
	/// # Not using `FromIterator`.
	/// 0, 1, many.. will be respected, with no unneeded heap allocations. This is not currently possible with the `FromIterator` trait.
	pub fn from_iter<I2: IntoIterator<Item = T>>(from: I2) -> MaybeIter<Chain<Chain<Once<T>, Once<T>>, I2::IntoIter>, T>
	{
	    let mut iter = from.into_iter();
	    MaybeIter(match (iter.next(), iter.next()) {
		(Some(first), None) => Inner::One(once(first)),
		(Some(first), Some(second)) => {
		    Inner::Some(once(first)
				.chain(once(second))
				.chain(iter))
		},
		_ => Inner::None,
	    })
	}
    }


    impl<I, T, U> From<Option<U>> for MaybeIter<I, T>
    where I: Iterator<Item=T>,
	  U: IntoIterator<IntoIter=I, Item=T>
    {
	fn from(from: Option<U>) -> Self
	{
	    match from {
		Some(many) => Self::many(many),
		_ => Self::none()
	    }
	}
    }

    
    impl<I, T> Iterator for MaybeIter<I, T>
    where I: Iterator<Item=T>
    {
	type Item = T;
	fn next(&mut self) -> Option<Self::Item>
	{
	    match &mut self.0 {
		Inner::Some(x) => x.next(),
		Inner::One(x) => x.next(),
		Inner::None => None,
	    }
	}

	#[inline] fn size_hint(&self) -> (usize, Option<usize>) {
	    match &self.0
	    {
		Inner::One(c) => c.size_hint(),
		Inner::Some(x) => x.size_hint(),
		Inner::None => (0, Some(0))
	    }
	}
    }

    impl<T, I: Iterator<Item=T>> std::iter::DoubleEndedIterator for MaybeIter<I, T>
    where I: std::iter::DoubleEndedIterator
    {
	fn next_back(&mut self) -> Option<Self::Item> {   
	    match &mut self.0 {
		Inner::Some(x) => x.next_back(),
		Inner::One(x) => x.next_back(),
		Inner::None => None,
	    }
	}
    }
    impl<T, I: Iterator<Item=T>> std::iter::FusedIterator for MaybeIter<I, T>
    where I: std::iter::FusedIterator{}
    impl<T, I: Iterator<Item=T>> ExactSizeIterator for MaybeIter<I, T>
    where I: ExactSizeIterator{}
}
pub use maybe_iter::MaybeIter;