// 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_MAP_TEST_MICHAEL_ITERABLE_MAP_HP_H
#define CDSUNIT_MAP_TEST_MICHAEL_ITERABLE_MAP_HP_H

#include "test_michael_iterable.h"

namespace cds_test {

    class michael_iterable_hp: public michael_iterable_map
    {
        typedef michael_iterable_map base_class;

    protected:
        template <class Map>
        void test( Map& m )
        {
            // Precondition: map is empty
            // Postcondition: map is empty

            base_class::test( m );

            EXPECT_TRUE( m.empty());
            EXPECT_CONTAINER_SIZE( m, 0 );

            size_t const kkSize = base_class::kSize;

            std::vector<key_type> arrKeys;
            for ( int i = 0; i < static_cast<int>(kkSize); ++i )
                arrKeys.push_back( key_type( i ));
            shuffle( arrKeys.begin(), arrKeys.end());

            std::vector< value_type > arrVals;
            for ( size_t i = 0; i < kkSize; ++i ) {
                value_type val;
                val.nVal = static_cast<int>( i );
                val.strVal = std::to_string( i );
                arrVals.push_back( val );
            }

            for ( auto const& i : arrKeys )
                EXPECT_TRUE( m.insert( i ));
            EXPECT_FALSE( m.empty());
            EXPECT_CONTAINER_SIZE( m, kkSize );

            // iterators
            size_t nCount = 0;
            for ( auto it = m.begin(); it != m.end(); ++it ) {
                EXPECT_EQ( it->second.nVal, 0 );
                it->second.nVal = it->first.nKey * 2;
                ++nCount;
            }
            EXPECT_EQ( nCount, kkSize );

            nCount = 0;
            for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
                EXPECT_EQ( it->second.nVal, it->first.nKey * 2 );
                ++nCount;
            }
            EXPECT_EQ( nCount, kkSize );

            // get/extract
            typedef typename Map::guarded_ptr guarded_ptr;
            guarded_ptr gp;

            for ( auto const& i : arrKeys ) {
                value_type const& val = arrVals.at( i.nKey );

                gp = m.get( i.nKey );
                ASSERT_FALSE( !gp );
                EXPECT_EQ( gp->first.nKey, i.nKey );
                gp.release();
                gp = m.get( i );
                ASSERT_FALSE( !gp );
                EXPECT_EQ( gp->first.nKey, i.nKey );
                gp.release();
                gp = m.get_with( other_item( i.nKey ), other_less());
                ASSERT_FALSE( !gp );
                EXPECT_EQ( gp->first.nKey, i.nKey );

                switch ( i.nKey % 4 ) {
                case 0:
                    gp = m.extract( i.nKey );
                    break;
                case 1:
                    gp = m.extract( i );
                    break;
                case 2:
                    gp = m.extract( val.strVal );
                    break;
                case 3:
                    gp = m.extract_with( other_item( i.nKey ), other_less());
                    break;
                }
                ASSERT_FALSE( !gp );
                EXPECT_EQ( gp->first.nKey, i.nKey );
                gp.release();

                gp = m.get( i.nKey );
                ASSERT_TRUE( !gp );
                gp = m.get( i );
                ASSERT_TRUE( !gp );
                gp = m.get_with( other_item( i.nKey ), other_less());
                ASSERT_TRUE( !gp );
            }
            EXPECT_TRUE( m.empty());
            EXPECT_CONTAINER_SIZE( m, 0u );

            // erase_at()
            for ( auto const& i : arrKeys )
                EXPECT_TRUE( m.insert( i ));
            EXPECT_FALSE( m.empty());
            EXPECT_CONTAINER_SIZE( m, kkSize );

            for ( auto it = m.begin(); it != m.end(); ++it ) {
                EXPECT_TRUE( m.erase_at( it ));
                EXPECT_FALSE( m.erase_at( it ));
            }
            EXPECT_TRUE( m.empty());
            EXPECT_CONTAINER_SIZE( m, 0u );
        }
    };

} // namespace cds_test

#endif // #ifndef CDSUNIT_MAP_TEST_MICHAEL_ITERABLE_MAP_HP_H
