HomeSort by relevance Sort by last modified time
    Searched full:test_insert_n (Results 1 - 9 of 9) sorted by null

  /external/stlport/test/eh/
test_deque.cpp 64 WeakCheck( testDeque, test_insert_n<TestDeque>(testDeque, random_number(random_base) ) );
65 StrongCheck( testDeque, test_insert_n<TestDeque>(testDeque, random_number(random_base), 0 ) );
66 StrongCheck( testDeque, test_insert_n<TestDeque>(testDeque, random_number(random_base), (int)testDeque.size() ) );
test_list.cpp 80 WeakCheck( testList, test_insert_n<TestList>(testList, random_number(random_base) ) );
81 WeakCheck( testList, test_insert_n<TestList>(testList, random_number(random_base), 0 ) );
82 WeakCheck( testList, test_insert_n<TestList>(testList, random_number(random_base), (int)testList.size() ) );
test_rope.cpp 64 WeakCheck( testRope, test_insert_n<TestRope>(testRope, random_number(random_base) ) );
65 WeakCheck( testRope, test_insert_n<TestRope>(testRope, random_number(random_base), 0 ) );
66 WeakCheck( testRope, test_insert_n<TestRope>(testRope, random_number(random_base), (int)testRope.size() ) );
test_slist.cpp 69 WeakCheck( testSList, test_insert_n<TestSList>(testSList, random_number(random_base) ) );
70 WeakCheck( testSList, test_insert_n<TestSList>(testSList, random_number(random_base), 0 ) );
71 WeakCheck( testSList, test_insert_n<TestSList>(testSList, random_number(random_base), (int)testSList.size() ) );
test_string.cpp 51 WeakCheck( testString, test_insert_n<TestString>(testString, random_number(random_base) ) );
52 WeakCheck( testString, test_insert_n<TestString>(testString, random_number(random_base), 0 ) );
53 WeakCheck( testString, test_insert_n<TestString>(testString, random_number(random_base), (int)testString.size() ) );
test_valarray.cpp 53 WeakCheck( testValarray, test_insert_n<TestValarray>(testValarray, random_number(random_base) ) );
54 WeakCheck( testValarray, test_insert_n<TestValarray>(testValarray, random_number(random_base), 0 ) );
55 WeakCheck( testValarray, test_insert_n<TestValarray>(testValarray, random_number(random_base), testValarray.size() ) );
test_bit_vector.cpp 97 StrongCheck(testVector, test_insert_n<BitVector>(testVector, random_number(random_base) ) );
98 StrongCheck(testVector, test_insert_n<BitVector>(testVector, random_number(random_base),0 ) );
99 StrongCheck(testVector, test_insert_n<BitVector>(testVector, random_number(random_base), (int)testVector.size()) );
test_vector.cpp 105 WeakCheck( testVector, test_insert_n<TestVector>(testVector, random_number(random_base) ) );
106 WeakCheck( testVector, test_insert_n<TestVector>(testVector, random_number(random_base), 0 ) );
107 WeakCheck( testVector, test_insert_n<TestVector>(testVector, random_number(random_base), (int)testVector.size() ) );
test_insert.h 365 struct test_insert_n struct
367 test_insert_n( const C& orig, size_t insCnt, int pos =-1 ) function in struct:test_insert_n

Completed in 503 milliseconds