#include <test_insert.h>

Collaboration diagram for test_insert_n< C >:

Public Member Functions
	test_insert_n (const C &orig, size_t insCnt, int pos=-1)

void	operator() (C &c) const

Private Attributes
C::value_type	fInsVal

const C &	original

size_t	fPos

size_t	fInsCnt

Detailed Description

template<class C>
struct test_insert_n< C >

Definition at line 365 of file test_insert.h.

Constructor & Destructor Documentation

◆ test_insert_n()

template<class C >

test_insert_n< C >::test_insert_n	(	const C &	orig,
		size_t	insCnt,
		int	pos = `-1`
	)

inline

Definition at line 367 of file test_insert.h.

        : original( orig ), fPos( random_number( orig.size() )), fInsCnt(insCnt)
    {
        MakeRandomValue( fInsVal );
        if (pos!=-1)
        {
            fPos=size_t(pos);
            if (pos==0)
                gTestController.SetCurrentTestName("n-ary insertion at begin()");
            else
                gTestController.SetCurrentTestName("n-ary insertion at end()");
        }
        else
            gTestController.SetCurrentTestName("n-ary insertion at random position");
    }

Member Function Documentation

◆ operator()()

template<class C >

void test_insert_n< C >::operator() ( C & c ) const

inline

Definition at line 383 of file test_insert.h.

    {
        prepare_insert_n( c, fInsCnt );
        typename C::iterator pos = c.begin();
        EH_STD::advance( pos, fPos );
        c.insert( pos, fInsCnt, fInsVal );
 
        // Prevent simulated failures during verification
        gTestController.CancelFailureCountdown();
        // Success. Check results.
        VerifyInsertN( original, c, fInsCnt, fInsVal, fPos );
    }