use automerge as am;
use std::collections::BTreeMap;
use std::ffi::c_void;
use std::mem::size_of;

use crate::sync::have::AMsyncHave;

#[repr(C)]
struct Detail {
    len: usize,
    offset: isize,
    ptr: *const c_void,
    storage: *mut c_void,
}

/// \note cbindgen won't propagate the value of a `std::mem::size_of<T>()` call
///       (https://github.com/eqrion/cbindgen/issues/252) but it will
///       propagate the name of a constant initialized from it so if the
///       constant's name is a symbolic representation of the value it can be
///       converted into a number by post-processing the header it generated.
pub const USIZE_USIZE_USIZE_USIZE_: usize = size_of::<Detail>();

impl Detail {
    fn new(
        haves: &[am::sync::Have],
        offset: isize,
        storage: &mut BTreeMap<usize, AMsyncHave>,
    ) -> Self {
        let storage: *mut BTreeMap<usize, AMsyncHave> = storage;
        Self {
            len: haves.len(),
            offset,
            ptr: haves.as_ptr() as *const c_void,
            storage: storage as *mut c_void,
        }
    }

    pub fn advance(&mut self, n: isize) {
        if n == 0 {
            return;
        }
        let len = self.len as isize;
        self.offset = if self.offset < 0 {
            // It's reversed.
            let unclipped = self.offset.checked_sub(n).unwrap_or(isize::MIN);
            if unclipped >= 0 {
                // Clip it to the forward stop.
                len
            } else {
                std::cmp::min(std::cmp::max(-(len + 1), unclipped), -1)
            }
        } else {
            let unclipped = self.offset.checked_add(n).unwrap_or(isize::MAX);
            if unclipped < 0 {
                // Clip it to the reverse stop.
                -(len + 1)
            } else {
                std::cmp::max(0, std::cmp::min(unclipped, len))
            }
        }
    }

    pub fn get_index(&self) -> usize {
        (self.offset
            + if self.offset < 0 {
                self.len as isize
            } else {
                0
            }) as usize
    }

    pub fn next(&mut self, n: isize) -> Option<*const AMsyncHave> {
        if self.is_stopped() {
            return None;
        }
        let slice: &[am::sync::Have] =
            unsafe { std::slice::from_raw_parts(self.ptr as *const am::sync::Have, self.len) };
        let storage = unsafe { &mut *(self.storage as *mut BTreeMap<usize, AMsyncHave>) };
        let index = self.get_index();
        let value = match storage.get_mut(&index) {
            Some(value) => value,
            None => {
                storage.insert(index, AMsyncHave::new(&slice[index]));
                storage.get_mut(&index).unwrap()
            }
        };
        self.advance(n);
        Some(value)
    }

    pub fn is_stopped(&self) -> bool {
        let len = self.len as isize;
        self.offset < -len || self.offset == len
    }

    pub fn prev(&mut self, n: isize) -> Option<*const AMsyncHave> {
        self.advance(-n);
        if self.is_stopped() {
            return None;
        }
        let slice: &[am::sync::Have] =
            unsafe { std::slice::from_raw_parts(self.ptr as *const am::sync::Have, self.len) };
        let storage = unsafe { &mut *(self.storage as *mut BTreeMap<usize, AMsyncHave>) };
        let index = self.get_index();
        Some(match storage.get_mut(&index) {
            Some(value) => value,
            None => {
                storage.insert(index, AMsyncHave::new(&slice[index]));
                storage.get_mut(&index).unwrap()
            }
        })
    }

    pub fn reversed(&self) -> Self {
        Self {
            len: self.len,
            offset: -(self.offset + 1),
            ptr: self.ptr,
            storage: self.storage,
        }
    }

    pub fn rewound(&self) -> Self {
        Self {
            len: self.len,
            offset: if self.offset < 0 { -1 } else { 0 },
            ptr: self.ptr,
            storage: self.storage,
        }
    }
}

impl From<Detail> for [u8; USIZE_USIZE_USIZE_USIZE_] {
    fn from(detail: Detail) -> Self {
        unsafe {
            std::slice::from_raw_parts(
                (&detail as *const Detail) as *const u8,
                USIZE_USIZE_USIZE_USIZE_,
            )
            .try_into()
            .unwrap()
        }
    }
}

/// \struct AMsyncHaves
/// \installed_headerfile
/// \brief A random-access iterator over a sequence of synchronization haves.
#[repr(C)]
#[derive(Eq, PartialEq)]
pub struct AMsyncHaves {
    /// An implementation detail that is intentionally opaque.
    /// \warning Modifying \p detail will cause undefined behavior.
    /// \note The actual size of \p detail will vary by platform, this is just
    ///       the one for the platform this documentation was built on.
    detail: [u8; USIZE_USIZE_USIZE_USIZE_],
}

impl AMsyncHaves {
    pub fn new(haves: &[am::sync::Have], storage: &mut BTreeMap<usize, AMsyncHave>) -> Self {
        Self {
            detail: Detail::new(haves, 0, storage).into(),
        }
    }

    pub fn advance(&mut self, n: isize) {
        let detail = unsafe { &mut *(self.detail.as_mut_ptr() as *mut Detail) };
        detail.advance(n);
    }

    pub fn len(&self) -> usize {
        let detail = unsafe { &*(self.detail.as_ptr() as *const Detail) };
        detail.len
    }

    pub fn next(&mut self, n: isize) -> Option<*const AMsyncHave> {
        let detail = unsafe { &mut *(self.detail.as_mut_ptr() as *mut Detail) };
        detail.next(n)
    }

    pub fn prev(&mut self, n: isize) -> Option<*const AMsyncHave> {
        let detail = unsafe { &mut *(self.detail.as_mut_ptr() as *mut Detail) };
        detail.prev(n)
    }

    pub fn reversed(&self) -> Self {
        let detail = unsafe { &*(self.detail.as_ptr() as *const Detail) };
        Self {
            detail: detail.reversed().into(),
        }
    }

    pub fn rewound(&self) -> Self {
        let detail = unsafe { &*(self.detail.as_ptr() as *const Detail) };
        Self {
            detail: detail.rewound().into(),
        }
    }
}

impl AsRef<[am::sync::Have]> for AMsyncHaves {
    fn as_ref(&self) -> &[am::sync::Have] {
        let detail = unsafe { &*(self.detail.as_ptr() as *const Detail) };
        unsafe { std::slice::from_raw_parts(detail.ptr as *const am::sync::Have, detail.len) }
    }
}

impl Default for AMsyncHaves {
    fn default() -> Self {
        Self {
            detail: [0; USIZE_USIZE_USIZE_USIZE_],
        }
    }
}

/// \memberof AMsyncHaves
/// \brief Advances an iterator over a sequence of synchronization haves by at
///        most \p |n| positions where the sign of \p n is relative to the
///        iterator's direction.
///
/// \param[in,out] sync_haves A pointer to an `AMsyncHaves` struct.
/// \param[in] n The direction (\p -n -> opposite, \p n -> same) and maximum
///              number of positions to advance.
/// \pre \p sync_haves `!= NULL`.
/// \internal
///
/// #Safety
/// sync_haves must be a valid pointer to an AMsyncHaves
#[no_mangle]
pub unsafe extern "C" fn AMsyncHavesAdvance(sync_haves: *mut AMsyncHaves, n: isize) {
    if let Some(sync_haves) = sync_haves.as_mut() {
        sync_haves.advance(n);
    };
}

/// \memberof AMsyncHaves
/// \brief Tests the equality of two sequences of synchronization haves
///        underlying a pair of iterators.
///
/// \param[in] sync_haves1 A pointer to an `AMsyncHaves` struct.
/// \param[in] sync_haves2 A pointer to an `AMsyncHaves` struct.
/// \return `true` if \p sync_haves1 `==` \p sync_haves2 and `false` otherwise.
/// \pre \p sync_haves1 `!= NULL`.
/// \pre \p sync_haves2 `!= NULL`.
/// \internal
///
/// #Safety
/// sync_haves1 must be a valid pointer to an AMsyncHaves
/// sync_haves2 must be a valid pointer to an AMsyncHaves
#[no_mangle]
pub unsafe extern "C" fn AMsyncHavesEqual(
    sync_haves1: *const AMsyncHaves,
    sync_haves2: *const AMsyncHaves,
) -> bool {
    match (sync_haves1.as_ref(), sync_haves2.as_ref()) {
        (Some(sync_haves1), Some(sync_haves2)) => sync_haves1.as_ref() == sync_haves2.as_ref(),
        (None, Some(_)) | (Some(_), None) | (None, None) => false,
    }
}

/// \memberof AMsyncHaves
/// \brief Gets the synchronization have at the current position of an iterator
///        over a sequence of synchronization haves and then advances it by at
///        most \p |n| positions where the sign of \p n is relative to the
///        iterator's direction.
///
/// \param[in,out] sync_haves A pointer to an `AMsyncHaves` struct.
/// \param[in] n The direction (\p -n -> opposite, \p n -> same) and maximum
///              number of positions to advance.
/// \return A pointer to an `AMsyncHave` struct that's `NULL` when
///         \p sync_haves was previously advanced past its forward/reverse
///         limit.
/// \pre \p sync_haves `!= NULL`.
/// \internal
///
/// #Safety
/// sync_haves must be a valid pointer to an AMsyncHaves
#[no_mangle]
pub unsafe extern "C" fn AMsyncHavesNext(
    sync_haves: *mut AMsyncHaves,
    n: isize,
) -> *const AMsyncHave {
    if let Some(sync_haves) = sync_haves.as_mut() {
        if let Some(sync_have) = sync_haves.next(n) {
            return sync_have;
        }
    }
    std::ptr::null()
}

/// \memberof AMsyncHaves
/// \brief Advances an iterator over a sequence of synchronization haves by at
///        most \p |n| positions where the sign of \p n is relative to the
///        iterator's direction and then gets the synchronization have at its
///        new position.
///
/// \param[in,out] sync_haves A pointer to an `AMsyncHaves` struct.
/// \param[in] n The direction (\p -n -> opposite, \p n -> same) and maximum
///              number of positions to advance.
/// \return A pointer to an `AMsyncHave` struct that's `NULL` when
///         \p sync_haves is presently advanced past its forward/reverse limit.
/// \pre \p sync_haves `!= NULL`.
/// \internal
///
/// #Safety
/// sync_haves must be a valid pointer to an AMsyncHaves
#[no_mangle]
pub unsafe extern "C" fn AMsyncHavesPrev(
    sync_haves: *mut AMsyncHaves,
    n: isize,
) -> *const AMsyncHave {
    if let Some(sync_haves) = sync_haves.as_mut() {
        if let Some(sync_have) = sync_haves.prev(n) {
            return sync_have;
        }
    }
    std::ptr::null()
}

/// \memberof AMsyncHaves
/// \brief Gets the size of the sequence of synchronization haves underlying an
///        iterator.
///
/// \param[in] sync_haves A pointer to an `AMsyncHaves` struct.
/// \return The count of values in \p sync_haves.
/// \pre \p sync_haves `!= NULL`.
/// \internal
///
/// #Safety
/// sync_haves must be a valid pointer to an AMsyncHaves
#[no_mangle]
pub unsafe extern "C" fn AMsyncHavesSize(sync_haves: *const AMsyncHaves) -> usize {
    if let Some(sync_haves) = sync_haves.as_ref() {
        sync_haves.len()
    } else {
        0
    }
}

/// \memberof AMsyncHaves
/// \brief Creates an iterator over the same sequence of synchronization haves
///        as the given one but with the opposite position and direction.
///
/// \param[in] sync_haves A pointer to an `AMsyncHaves` struct.
/// \return An `AMsyncHaves` struct
/// \pre \p sync_haves `!= NULL`.
/// \internal
///
/// #Safety
/// sync_haves must be a valid pointer to an AMsyncHaves
#[no_mangle]
pub unsafe extern "C" fn AMsyncHavesReversed(sync_haves: *const AMsyncHaves) -> AMsyncHaves {
    if let Some(sync_haves) = sync_haves.as_ref() {
        sync_haves.reversed()
    } else {
        AMsyncHaves::default()
    }
}

/// \memberof AMsyncHaves
/// \brief Creates an iterator at the starting position over the same sequence
///        of synchronization haves as the given one.
///
/// \param[in] sync_haves A pointer to an `AMsyncHaves` struct.
/// \return An `AMsyncHaves` struct
/// \pre \p sync_haves `!= NULL`.
/// \internal
///
/// #Safety
/// sync_haves must be a valid pointer to an AMsyncHaves
#[no_mangle]
pub unsafe extern "C" fn AMsyncHavesRewound(sync_haves: *const AMsyncHaves) -> AMsyncHaves {
    if let Some(sync_haves) = sync_haves.as_ref() {
        sync_haves.rewound()
    } else {
        AMsyncHaves::default()
    }
}