// Copyright (c) 2006-2018 Maxim Khizhinsky
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)

#ifndef CDSUNIT_SET_TEST_SET_NOGC_H
#define CDSUNIT_SET_TEST_SET_NOGC_H

#include <cds_test/check_size.h>
#include <cds_test/fixture.h>

#include <cds/opt/hash.h>

// forward declaration
namespace cds { namespace container {}}

namespace cds_test {
    namespace co = cds::opt;

    class container_set_nogc : public fixture
    {
    public:
        static size_t const kSize = 100;

        struct stat
        {
            unsigned int nFindCount;
            unsigned int nUpdateNewCount;
            unsigned int nUpdateCount;

            stat()
            {
                clear_stat();
            }

            void clear_stat()
            {
                memset( this, 0, sizeof( *this ));
            }
        };

        struct other_item {
            int nKey;

            explicit other_item( int k )
                : nKey( k )
            {}

            int key() const
            {
                return nKey;
            }
        };

        struct int_item: public stat
        {
            int nKey;
            int nVal;
            std::string strVal;

            int_item()
                : nKey( 0 )
                , nVal( 0 )
            {}

            explicit int_item( int k )
                : nKey( k )
                , nVal( k * 2 )
            {}

            template <typename Q>
            explicit int_item( Q const& src )
                : nKey( src.key())
                , nVal( 0 )
            {}

            int_item( int_item const& src )
                : nKey( src.nKey )
                , nVal( src.nVal )
                , strVal( src.strVal )
            {}

            int_item( int_item&& src )
                : nKey( src.nKey )
                , nVal( src.nVal )
                , strVal( std::move( src.strVal ))
            {}

            int_item( int k, std::string&& s )
                : nKey( k )
                , nVal( k * 2 )
                , strVal( std::move( s ))
            {}

            explicit int_item( other_item const& s )
                : nKey( s.key())
                , nVal( s.key() * 2 )
            {}

            int key() const
            {
                return nKey;
            }
        };

        struct hash_int {
            size_t operator()( int i ) const
            {
                return co::v::hash<int>()(i);
            }
            template <typename Item>
            size_t operator()( const Item& i ) const
            {
                return (*this)(i.key());
            }
        };

        struct simple_item_counter {
            size_t  m_nCount;

            simple_item_counter()
                : m_nCount( 0 )
            {}

            size_t operator ++()
            {
                return ++m_nCount;
            }

            size_t operator --()
            {
                return --m_nCount;
            }

            void reset()
            {
                m_nCount = 0;
            }

            operator size_t() const
            {
                return m_nCount;
            }

        };

        struct less
        {
            bool operator ()( int_item const& v1, int_item const& v2 ) const
            {
                return v1.key() < v2.key();
            }

            template <typename Q>
            bool operator ()( int_item const& v1, const Q& v2 ) const
            {
                return v1.key() < v2;
            }

            template <typename Q>
            bool operator ()( const Q& v1, int_item const& v2 ) const
            {
                return v1 < v2.key();
            }
        };

        struct cmp {
            int operator ()( int_item const& v1, int_item const& v2 ) const
            {
                if ( v1.key() < v2.key())
                    return -1;
                return v1.key() > v2.key() ? 1 : 0;
            }

            template <typename T>
            int operator ()( T const& v1, int v2 ) const
            {
                if ( v1.key() < v2 )
                    return -1;
                return v1.key() > v2 ? 1 : 0;
            }

            template <typename T>
            int operator ()( int v1, T const& v2 ) const
            {
                if ( v1 < v2.key())
                    return -1;
                return v1 > v2.key() ? 1 : 0;
            }
        };

        struct other_less {
            template <typename Q, typename T>
            bool operator()( Q const& lhs, T const& rhs ) const
            {
                return lhs.key() < rhs.key();
            }
        };

    protected:
        template <typename Set>
        void test( Set& s )
        {
            // Precondition: set is empty
            // Postcondition: set is empty

            ASSERT_TRUE( s.empty());
            ASSERT_CONTAINER_SIZE( s, 0 );
            size_t const nSetSize = kSize;

            typedef typename Set::value_type value_type;

            std::vector< value_type > data;
            std::vector< size_t> indices;
            data.reserve( kSize );
            indices.reserve( kSize );
            for ( size_t key = 0; key < kSize; ++key ) {
                data.push_back( value_type( static_cast<int>(key)));
                indices.push_back( key );
            }
            shuffle( indices.begin(), indices.end());

            // insert/find
            for ( auto idx : indices ) {
                auto& i = data[idx];

                ASSERT_FALSE( s.contains( i.nKey ) != s.end());
                ASSERT_FALSE( s.contains( i ) != s.end());
                ASSERT_FALSE( s.contains( other_item( i.key()), other_less()) != s.end());

                std::pair<typename Set::iterator, bool> updResult;

                std::string str;
                updResult = s.update( i.key(), false );
                EXPECT_TRUE( updResult.first == s.end());
                EXPECT_FALSE( updResult.second );

                typename Set::iterator it;
                switch ( idx % 6 ) {
                case 0:
                    it = s.insert( i );
                    ASSERT_TRUE( it != s.end());
                    it->nFindCount = it->nKey;
                    ASSERT_TRUE( s.insert( i ) == s.end());
                    updResult = s.update( i, false );
                    EXPECT_TRUE( updResult.first == it );
                    EXPECT_FALSE( updResult.second );
                    break;
                case 1:
                    it = s.insert( i.key());
                    ASSERT_TRUE( it != s.end());
                    ASSERT_TRUE( s.insert( i.key()) == s.end());
                    it->nFindCount = it->nKey;
                    updResult = s.update( i.key(), false );
                    EXPECT_TRUE( updResult.first == it );
                    EXPECT_FALSE( updResult.second );
                    break;
                case 2:
                    updResult = s.update( i );
                    EXPECT_TRUE( updResult.first != s.end());
                    EXPECT_TRUE( updResult.second );
                    updResult.first->nFindCount = updResult.first->nKey;
                    break;
                case 3:
                    updResult = s.update( i.key());
                    EXPECT_TRUE( updResult.first != s.end());
                    EXPECT_TRUE( updResult.second );
                    updResult.first->nFindCount = updResult.first->nKey;
                    break;
                case 4:
                    it = s.emplace( i.key());
                    ASSERT_TRUE( it != s.end());
                    it->nFindCount = it->nKey;
                    ASSERT_FALSE( s.emplace( i.key()) != s.end());
                    break;
                case 5:
                    str = "Hello!";
                    it = s.emplace( i.key(), std::move( str ));
                    ASSERT_TRUE( it != s.end());
                    EXPECT_TRUE( str.empty());
                    it->nFindCount = it->nKey;
                    str = "Hello!";
                    ASSERT_TRUE( s.emplace( i.key(), std::move( str )) == s.end());
                    EXPECT_TRUE( str.empty()); // yes, that's is :(
                    break;
                default:
                    // forgot anything?..
                    ASSERT_TRUE( false );
                }

                it = s.contains( i.nKey );
                ASSERT_TRUE( it != s.end());
                EXPECT_EQ( it->nFindCount, static_cast<unsigned>( it->nKey ));
                ASSERT_TRUE( s.contains( i ) != s.end());
                ASSERT_TRUE( s.contains( other_item( i.key()), other_less()) != s.end());
            }

            ASSERT_FALSE( s.empty());
            ASSERT_CONTAINER_SIZE( s, nSetSize );

            // iterators
            for ( auto it = s.begin(); it != s.end(); ++it ) {
                it->nFindCount = it->key() * 3;
            }

            for ( auto it = s.cbegin(); it != s.cend(); ++it ) {
                EXPECT_EQ( it->nFindCount, static_cast<unsigned>( it->key() * 3 ));
            }

            // clear

            s.clear();

            ASSERT_TRUE( s.empty());
            ASSERT_CONTAINER_SIZE( s, 0 );

            ASSERT_TRUE( s.begin() == s.end());
            ASSERT_TRUE( s.cbegin() == s.cend());
        }
    };

} // namespace cds_test

#endif // CDSUNIT_SET_TEST_SET_NOGC_H
