/*
    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_INTRUSIVE_STRIPED_SET_BOOST_LIST_ADAPTER_H
#define CDSLIB_INTRUSIVE_STRIPED_SET_BOOST_LIST_ADAPTER_H

#include <boost/intrusive/list.hpp>
#include <cds/intrusive/striped_set/adapter.h>

//@cond
namespace cds { namespace intrusive { namespace striped_set {

    namespace details {
        template <typename List, typename... Options >
        class adapt_boost_list
        {
        public:
            typedef List container_type;   ///< underlying intrusive container type

        private:
            /// Adapted intrusive container
            class adapted_container : public cds::intrusive::striped_set::adapted_sequential_container
            {
            public:
                typedef typename container_type::value_type     value_type;   ///< value type stored in the container
                typedef typename container_type::iterator       iterator;   ///< container iterator
                typedef typename container_type::const_iterator const_iterator;    ///< container const iterator
                typedef typename cds::opt::details::make_comparator_from_option_list< value_type, Options... >::type key_comparator;

            private:
                struct find_predicate
                {
                    bool operator()( value_type const& i1, value_type const& i2 ) const
                    {
                        return key_comparator()(i1, i2) < 0;
                    }

                    template <typename Q>
                    bool operator()( Q const& i1, value_type const& i2 ) const
                    {
                        return key_comparator()(i1, i2) < 0;
                    }

                    template <typename Q>
                    bool operator()( value_type const& i1, Q const& i2 ) const
                    {
                        return key_comparator()(i1, i2) < 0;
                    }
                };

                template <typename Q, typename Pred>
                iterator find_key( Q const& key, Pred pred )
                {
                    iterator itEnd = m_List.end();
                    iterator it;
                    for ( it = m_List.begin(); it != itEnd; ++it ) {
                        if ( !pred( *it, key ))
                            break;
                    }
                    return it;
                }

            private:
                container_type  m_List;

            public:
                adapted_container()
                {}

                container_type& base_container()
                {
                    return m_List;
                }

                template <typename Func>
                bool insert( value_type& val, Func f )
                {
                    iterator it = find_key( val, find_predicate());
                    if ( it == m_List.end() || key_comparator()(val, *it) != 0 ) {
                        m_List.insert( it, val );
                        f( val );

                        return true;
                    }

                    // key already exists
                    return false;
                }

                template <typename Func>
                std::pair<bool, bool> update( value_type& val, Func f, bool bAllowInsert )
                {
                    iterator it = find_key( val, find_predicate());
                    if ( it == m_List.end() || key_comparator()(val, *it) != 0 ) {
                        // insert new
                        if ( !bAllowInsert )
                            return std::make_pair( false, false );

                        m_List.insert( it, val );
                        f( true, val, val );
                        return std::make_pair( true, true );
                    }
                    else {
                        // already exists
                        f( false, *it, val );
                        return std::make_pair( true, false );
                    }
                }

                bool unlink( value_type& val )
                {
                    iterator it = find_key( val, find_predicate());
                    if ( it == m_List.end() || &(*it) != &val )
                        return false;

                    m_List.erase( it );
                    return true;
                }

                template <typename Q, typename Func>
                value_type * erase( Q const& key, Func f )
                {
                    iterator it = find_key( key, find_predicate());
                    if ( it == m_List.end() || key_comparator()(key, *it) != 0 )
                        return nullptr;

                    // key exists
                    value_type& val = *it;
                    f( val );
                    m_List.erase( it );

                    return &val;
                }

                template <typename Q, typename Less, typename Func>
                value_type * erase( Q const& key, Less pred, Func f )
                {
                    iterator it = find_key( key, pred );
                    if ( it == m_List.end() || pred( key, *it ) || pred( *it, key ))
                        return nullptr;

                    // key exists
                    value_type& val = *it;
                    f( val );
                    m_List.erase( it );

                    return &val;
                }

                template <typename Q, typename Func>
                bool find( Q& key, Func f )
                {
                    return find( key, find_predicate(), f );
                }

                template <typename Q, typename Less, typename Func>
                bool find( Q& key, Less pred, Func f )
                {
                    iterator it = find_key( key, pred );
                    if ( it == m_List.end() || pred( key, *it ) || pred( *it, key ))
                        return false;

                    // key exists
                    f( *it, key );
                    return true;
                }

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

                template <typename Disposer>
                void clear( Disposer disposer )
                {
                    m_List.clear_and_dispose( disposer );
                }

                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(); }

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

                void move_item( adapted_container& from, iterator itWhat )
                {
                    value_type& val = *itWhat;
                    from.base_container().erase( itWhat );
                    insert( val, []( value_type& ) {} );
                }

            };
        public:
            typedef adapted_container   type;  ///< Result of the metafunction
        };
    } // namespace details

#if CDS_COMPILER == CDS_COMPILER_INTEL && CDS_COMPILER_VERSION <= 1500
    template <typename T, typename P1, typename P2, typename P3, typename P4, typename... Options>
    class adapt< boost::intrusive::list< T, P1, P2, P3, P4 >, Options... >
        : public details::adapt_boost_list< boost::intrusive::list< T, P1, P2, P3, P4 >, Options... >
    {};
#else
    template <typename T, typename... BIOptions, typename... Options>
    class adapt< boost::intrusive::list< T, BIOptions... >, Options... >
        : public details::adapt_boost_list< boost::intrusive::list< T, BIOptions... >, Options... >
    {};
#endif

}}} // namespace cds::intrusive::striped_set
//@endcond

#endif // #ifndef CDSLIB_INTRUSIVE_STRIPED_SET_BOOST_LIST_ADAPTER_H
