@@ -87,9 +87,9 @@ void cstl_vector_test2(void) {
8787void cstl_vector_test3 (void ) {
8888 DECORATE ("opencstl{vector/qsort} test begin" );
8989 VECTOR (int ) vec = new_vector (int );
90- const size_t N = 100 ;
90+ const size_type N = 100 ;
9191 for (int i = 0 ; i < N ; i ++ ) {
92- int val = random .randint (- N , N );
92+ int val = mt19937 .randint (- N , N );
9393 push_back (vec , val );
9494 }
9595
@@ -115,11 +115,11 @@ void cstl_list_test02(void) {
115115
116116 pop_back (list );
117117 ///[0] [1] [2] [3] [4] [5] [6] [7] [8]
118- insert (list , cstl_begin (list ), 777 );
118+ insert (list , begin (list ), 777 );
119119 ///[777] [0] [1] [2] [3] [4] [5] [6] [7] [8]
120- insert (list , cstl_find (list , 4 ), 5 , 999 );
120+ insert (list , find (list , 4 ), 5 , 999 );
121121 ///[777] [0] [1] [2] [3] [999] [999] [999] [999] [999] [4] [5] [6] [7] [8]
122- erase (list , cstl_find (list , 2 ), cstl_find (list , 999 ));
122+ erase (list , find (list , 2 ), find (list , 999 ));
123123 ///[777] [0] [1] [999] [999] [999] [999] [999] [4] [5] [6] [7] [8]
124124 for (int * it = begin (list ); it != end (list ); it = next (it )) {
125125 printf ("[%d] " , * it );
@@ -321,7 +321,7 @@ void cstl_priority_queue_test2(void) {
321321 DECORATE ("OPENCSTL{priority_queue/dijkstra} test begin" );
322322 Edge * * vec = new_vector (Edge * );
323323 assign (vec , 7 );
324- for (int i = 0 ; i < cstl_size (vec ); i ++ ) {
324+ for (int i = 0 ; i < size (vec ); i ++ ) {
325325 vec [i ] = new_vector (Edge );
326326 }
327327 push_back (vec [1 ], make_edge (10 , 2 ));
@@ -500,6 +500,7 @@ void test_sort(void) {
500500// };
501501
502502int main (void ) {
503+
503504 // printf("%d\n",numeric_limits(int).max);
504505 // return 0;
505506
@@ -523,5 +524,10 @@ int main(void) {
523524 logging .info ("message" );
524525
525526
527+ puts (mt19937 .uuid ());
528+
529+ // float a = 0;
530+ // __auto_type b = 1;
531+
526532 return 0 ;
527533}
0 commit comments