HomeSort by relevance Sort by last modified time
    Searched refs:random_number (Results 1 - 25 of 64) sorted by null

1 2 3

  /external/stlport/test/eh/
random_number.h 2 random_number.h
22 unsigned random_number( size_t range );
test_bit_vector.cpp 79 size_t BitVectorSize = random_number( random_base );
81 if ( random_number(2) )
88 testVector.push_back(random_number(2) != 0);
89 testVector2.push_back(random_number(2) != 0);
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()) );
102 size_t insCnt = 1 + random_number(random_base);
105 insFirst[n] = random_number(2);
117 StrongCheck(testVector, test_BitVector_reserve( testVector.capacity() + random_number(50)))
    [all...]
test_valarray.cpp 41 size_t ropeSize = random_number(random_base);
45 TestValarray::value_type x = random_number(random_base) ; // initialize before use
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() ) );
57 size_t insCnt = random_number(random_base);
73 ConstCheck( 0, test_construct_n<TestValarray>( random_number(random_base) ) );
74 ConstCheck( 0, test_construct_n_instance<TestValarray>( random_number(random_base) ) );
test_rope.cpp 52 size_t ropeSize = random_number(random_base);
56 TestRope::value_type x = TestRope::value_type(random_number(random_base)); // initialize before use
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() ) );
68 size_t insCnt = random_number(random_base);
89 // ConstCheck( 0, test_construct_n<TestRope>( random_number(random_base) ) );
91 ConstCheck( 0, test_construct_n_instance<TestRope>( random_number(random_base) ) );
test_string.cpp 40 size_t ropeSize = random_number(random_base);
43 TestString::value_type x = TestString::value_type(random_number(random_base)) ; // initialize before use
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() ) );
55 size_t insCnt = random_number(random_base);
71 // requires _Reserve_t ConstCheck( 0, test_construct_n<TestString>( random_number(random_base) ) );
72 ConstCheck( 0, test_construct_n_instance<TestString>( random_number(random_base) ) );
random_number.cpp 2 random_number.cpp
16 #include "random_number.h"
26 unsigned random_number( size_t range ) function
test_deque.cpp 49 size_t dequeSize = random_number(random_base);
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() ) );
68 size_t insCnt = random_number(random_base);
87 ConstCheck( 0, test_construct_n<TestDeque>( random_number(random_base) ) );
88 ConstCheck( 0, test_construct_n_instance<TestDeque>( random_number(random_base) ) );
test_list.cpp 67 size_t listSize = random_number(random_base);
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() ) );
84 size_t insCnt = random_number(random_base);
102 ConstCheck( 0, test_construct_n<TestList>( random_number(random_base) ) );
103 ConstCheck( 0, test_construct_n_instance<TestList>( random_number(random_base) ) );
test_slist.cpp 57 size_t slistSize = random_number(random_base);
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() ) );
73 size_t insCnt = random_number(random_base);
84 ConstCheck( 0, test_construct_n<TestSList>( random_number(random_base) ) );
85 ConstCheck( 0, test_construct_n_instance<TestSList>( random_number(random_base) ) );
test_vector.cpp 46 if ( random_number(2) )
66 if ( random_number(2) )
77 ConstCheck( 0, test_construct_n<TestVector>( random_number(random_base) ) );
81 size_t vectorSize = random_number(random_base);
91 size_t insCnt = random_number(random_base);
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() ) );
112 StrongCheck( testVector, test_reserve( testVector.capacity() + random_number(random_base) ) );
117 ConstCheck( 0, test_construct_n_instance<TestVector>( random_number(random_base) ) )
    [all...]
test_hash_resize.h 19 #include "random_number.h"
32 t.resize( 1+random_number(random_base) + t.bucket_count() );
test_hash_map.cpp 50 const size_t hash_mapSize = random_number(random_base);
66 size_t insCnt = random_number(random_base);
98 const size_t hash_mapSize = random_number(random_base);
113 size_t insCnt = random_number(random_base);
test_hash_set.cpp 46 const size_t hash_setSize = random_number(random_base);
62 size_t insCnt = random_number(random_base);
93 const size_t hash_setSize = random_number(random_base);
109 size_t insCnt = random_number(random_base);
test_map.cpp 54 const size_t mapSize = random_number(random_base);
65 size_t insCnt = 1 + random_number(random_base);
102 const size_t mapSize = random_number(random_base);
113 size_t insCnt = random_number(random_base);
test_set.cpp 44 const size_t setSize = random_number(random_base);
54 size_t insCnt = random_number(random_base);
78 const size_t setSize = random_number(random_base);
87 size_t insCnt = random_number(random_base);
cray.mak 9 AUX_LIST=TestClass.o main.o nc_alloc.o random_number.o
bcb.mak 21 random_number.obj \
como.mak 11 AUX_LIST=TestClass.cpp main.cpp nc_alloc.cpp random_number.cpp
deccxx.mak 16 AUX_LIST=TestClass.o main.o nc_alloc.o random_number.o
intel.mak 27 random_number.obj test_algo.obj test_algobase.obj test_bit_vector.obj test_deque.obj \
sgi_mipspro.mak 15 AUX_LIST=TestClass.o main.o nc_alloc.o random_number.o
TestClass.h 29 #include "random_number.h"
156 return random_number( range );
  /external/chromium_org/chrome/browser/sync/glue/
chrome_report_unrecoverable_error.cc 25 double random_number = base::RandDouble(); local
26 if (random_number > kErrorUploadRatio)
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
random_number.h 25 /** @file parallel/random_number.h
41 class random_number class in namespace:__gnu_parallel
73 random_number() function in class:__gnu_parallel::random_number
84 random_number(uint32 seed, uint64 supremum = 0x100000000ULL) function in class:__gnu_parallel::random_number
random_shuffle.h 38 #include <parallel/random_number.h>
145 random_number rng(d->seed);
325 DRSSorterPU<RandomAccessIterator, random_number >* pus;
333 pus = new DRSSorterPU<RandomAccessIterator, random_number>
460 random_number bitrng(rng(0xFFFFFFFF));
509 RandomNumberGenerator rng = random_number())

Completed in 798 milliseconds

1 2 3