/*
    This file is a part of libcds - Concurrent Data Structures library

    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017

    Source code repo: http://github.com/khizmax/libcds/
    Download: http://sourceforge.net/projects/libcds/files/

    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions are met:

    * Redistributions of source code must retain the above copyright notice, this
      list of conditions and the following disclaimer.

    * Redistributions in binary form must reproduce the above copyright notice,
      this list of conditions and the following disclaimer in the documentation
      and/or other materials provided with the distribution.

    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

#ifndef CDSLIB_CONTAINER_STRIPED_MAP_BOOST_SLIST_ADAPTER_H
#define CDSLIB_CONTAINER_STRIPED_MAP_BOOST_SLIST_ADAPTER_H

#include <boost/version.hpp>
#if BOOST_VERSION < 104800
#   error "For boost::container::slist you must use boost 1.48 or above"
#endif

#include <functional>   // ref
#include <utility>      // std::pair
#include <cds/container/striped_set/adapter.h>
#include <boost/container/slist.hpp>

//@cond
namespace cds { namespace container {
    namespace striped_set {

        // Copy policy for map
        template <typename K, typename T, typename Alloc>
        struct copy_item_policy< boost::container::slist< std::pair< K const, T >, Alloc > >
        {
            typedef std::pair< K const, T>  pair_type;
            typedef boost::container::slist< pair_type, Alloc > list_type;
            typedef typename list_type::iterator iterator;

            void operator()( list_type& list, iterator itInsert, iterator itWhat )
            {
                itInsert = list.insert_after( itInsert, *itWhat );
            }
        };

        // Swap policy for map
        template <typename K, typename T, typename Alloc>
        struct swap_item_policy< boost::container::slist< std::pair< K const, T >, Alloc > >
        {
            typedef std::pair< K const, T>  pair_type;
            typedef boost::container::slist< pair_type, Alloc > list_type;
            typedef typename list_type::iterator iterator;

            void operator()( list_type& list, iterator itInsert, iterator itWhat )
            {
                pair_type newVal( itWhat->first, typename pair_type::mapped_type());
                itInsert = list.insert_after( itInsert, newVal );
                std::swap( itInsert->second, itWhat->second );
            }
        };

        // Move policy for map
        template <typename K, typename T, typename Alloc>
        struct move_item_policy< boost::container::slist< std::pair< K const, T >, Alloc > >
        {
            typedef std::pair< K const, T>  pair_type;
            typedef boost::container::slist< pair_type, Alloc > list_type;
            typedef typename list_type::iterator iterator;

            void operator()( list_type& list, iterator itInsert, iterator itWhat )
            {
                list.insert_after( itInsert, std::move( *itWhat ));
            }
        };
    } // namespace striped_set
}} // namespace cds:container

namespace cds { namespace intrusive { namespace striped_set {

    /// boost::container::slist adapter for hash map bucket
    template <typename Key, typename T, class Alloc, typename... Options>
    class adapt< boost::container::slist< std::pair<Key const, T>, Alloc>, Options... >
    {
    public:
        typedef boost::container::slist< std::pair<Key const, T>, Alloc>     container_type          ;   ///< underlying container type

    private:
        /// Adapted container type
        class adapted_container: public cds::container::striped_set::adapted_sequential_container
        {
        public:
            typedef typename container_type::value_type     value_type  ;   ///< value type stored in the container
            typedef typename value_type::first_type         key_type;
            typedef typename value_type::second_type        mapped_type;
            typedef typename container_type::iterator       iterator ;   ///< container iterator
            typedef typename container_type::const_iterator const_iterator ;    ///< container const iterator

            static bool const has_find_with = true;
            static bool const has_erase_with = true;

        private:
            //@cond
            typedef typename cds::opt::details::make_comparator_from_option_list< value_type, Options... >::type key_comparator;

            typedef typename cds::opt::select<
                typename cds::opt::value<
                    typename cds::opt::find_option<
                        cds::opt::copy_policy< cds::container::striped_set::move_item >
                        , Options...
                    >::type
                >::copy_policy
                , cds::container::striped_set::copy_item, cds::container::striped_set::copy_item_policy<container_type>
                , cds::container::striped_set::swap_item, cds::container::striped_set::swap_item_policy<container_type>
                , cds::container::striped_set::move_item, cds::container::striped_set::move_item_policy<container_type>
            >::type copy_item;

            template <typename Q>
            std::pair< iterator, bool > find_prev_item( Q const& key )
            {
                iterator itPrev = m_List.before_begin();
                iterator itEnd = m_List.end();
                for ( iterator it = m_List.begin(); it != itEnd; ++it ) {
                    int nCmp = key_comparator()( key, it->first );
                    if ( nCmp < 0 )
                        itPrev = it;
                    else if ( nCmp > 0 )
                        break;
                    else
                        return std::make_pair( itPrev, true );
                }
                return std::make_pair( itPrev, false );
            }

            template <typename Q, typename Less>
            std::pair< iterator, bool > find_prev_item( Q const& key, Less pred )
            {
                iterator itPrev = m_List.before_begin();
                iterator itEnd = m_List.end();
                for ( iterator it = m_List.begin(); it != itEnd; ++it ) {
                    if ( pred( key, it->first ))
                        itPrev = it;
                    else if ( pred(it->first, key))
                        break;
                    else
                        return std::make_pair( itPrev, true );
                }
                return std::make_pair( itPrev, false );
            }
            //@endcond

        private:
            //@cond
            container_type  m_List;
            //@endcond

        public:
            adapted_container()
            {}

            template <typename Q, typename Func>
            bool insert( const Q& key, Func f )
            {
                std::pair< iterator, bool > pos = find_prev_item( key );
                if ( !pos.second ) {
                    pos.first = m_List.insert_after( pos.first, value_type( key_type( key ), mapped_type()));
                    f( *pos.first );
                    return true;
                }

                // key already exists
                return false;
            }

            template <typename K, typename... Args>
            bool emplace( K&& key, Args&&... args )
            {
                std::pair< iterator, bool > pos = find_prev_item( key );
                if ( !pos.second ) {
                    m_List.emplace_after( pos.first, key_type( std::forward<K>( key )), mapped_type( std::forward<Args>( args )... ));
                    return true;
                }
                return false;
            }

            template <typename Q, typename Func>
            std::pair<bool, bool> update( const Q& key, Func func, bool bAllowInsert )
            {
                std::pair< iterator, bool > pos = find_prev_item( key );
                if ( !pos.second ) {
                    // insert new
                    if ( !bAllowInsert )
                        return std::make_pair( false, false );

                    pos.first = m_List.insert_after( pos.first, value_type( key_type( key ), mapped_type()));
                    func( true, *pos.first );
                    return std::make_pair( true, true );
                }
                else {
                    // already exists
                    func( false, *(++pos.first));
                    return std::make_pair( true, false );
                }
            }

            template <typename Q, typename Func>
            bool erase( Q const& key, Func f )
            {
                std::pair< iterator, bool > pos = find_prev_item( key );
                if ( !pos.second )
                    return false;

                // key exists
                iterator it = pos.first;
                f( *(++it));
                m_List.erase_after( pos.first );

                return true;
            }

            template <typename Q, typename Less, typename Func>
            bool erase( Q const& key, Less pred, Func f )
            {
                std::pair< iterator, bool > pos = find_prev_item( key, pred );
                if ( !pos.second )
                    return false;

                // key exists
                iterator it = pos.first;
                f( *(++it));
                m_List.erase_after( pos.first );

                return true;
            }

            template <typename Q, typename Func>
            bool find( Q& val, Func f )
            {
                std::pair< iterator, bool > pos = find_prev_item( val );
                if ( !pos.second )
                    return false;

                // key exists
                f( *(++pos.first), val );
                return true;
            }

            template <typename Q, typename Less, typename Func>
            bool find( Q& val, Less pred, Func f )
            {
                std::pair< iterator, bool > pos = find_prev_item( val, pred );
                if ( !pos.second )
                    return false;

                // key exists
                f( *(++pos.first), val );
                return true;
            }

            void clear()
            {
                m_List.clear();
            }

            iterator begin()                { return m_List.begin(); }
            const_iterator begin() const    { return m_List.begin(); }
            iterator end()                  { return m_List.end(); }
            const_iterator end() const      { return m_List.end(); }

            void move_item( adapted_container& /*from*/, iterator itWhat )
            {
                std::pair< iterator, bool > pos = find_prev_item( itWhat->first );
                assert( !pos.second );

                copy_item()( m_List, pos.first, itWhat );
            }

            size_t size() const
            {
                return m_List.size();
            }
        };

    public:
        typedef adapted_container type ; ///< Result of \p adapt metafunction

    };
}}} // namespace cds::intrusive::striped_set


//@endcond

#endif // #ifndef CDSLIB_CONTAINER_STRIPED_MAP_BOOST_SLIST_ADAPTER_H
