changeset 22 | ddc455616bd6 |
parent 0 | e4d67989cc36 |
child 45 | 4b03adbd26ca |
child 57 | 2efc27d87e1c |
18:47c74d1534e1 | 22:ddc455616bd6 |
---|---|
742 TInt Ctstl_3::Stack( CStifItemParser& aItem ) |
742 TInt Ctstl_3::Stack( CStifItemParser& aItem ) |
743 { |
743 { |
744 |
744 |
745 |
745 |
746 //__UHEAP_MARK; |
746 //__UHEAP_MARK; |
747 int failures=0,i=0; |
747 int failures=0; |
748 try |
748 try |
749 { |
749 { |
750 |
750 |
751 int arr[3]; |
751 int arr[3]; |
752 // cout<<""; |
752 // cout<<""; |
1330 vector<int>::iterator VIter1, VIterend; |
1330 vector<int>::iterator VIter1, VIterend; |
1331 |
1331 |
1332 int sum =1; |
1332 int sum =1; |
1333 int i=2 ; |
1333 int i=2 ; |
1334 list <int> L1; |
1334 list <int> L1; |
1335 list <int>::iterator LIter1, LIterend; |
1335 // list <int>::iterator LIter1, LIterend; |
1336 |
1336 |
1337 int t; |
1337 int t; |
1338 for ( t = 1 ; t <= 10 ; t++ ) |
1338 for ( t = 1 ; t <= 10 ; t++ ) |
1339 { |
1339 { |
1340 L1.push_back( t ); |
1340 L1.push_back( t ); |
1497 i++; |
1497 i++; |
1498 } |
1498 } |
1499 |
1499 |
1500 /* |
1500 /* |
1501 if(output[0]==26500) |
1501 if(output[0]==26500) |
1502 if(output[1]==19169) |
1502 if(output[1]==19169) |
1503 if(output[2]== 18467) |
1503 if(output[2]== 18467) |
1504 if(output[3]== 6334) |
1504 if(output[3]== 6334) |
1505 if(output[4]== 6262) |
1505 if(output[4]== 6262) |
1506 if(output[5]== 6262) |
1506 if(output[5]== 6262) |
1507 if(output[6]== 41) |
1507 if(output[6]== 41) |
1554 TInt Ctstl_3::GettemporarybufferL(CStifItemParser& aItem) |
1554 TInt Ctstl_3::GettemporarybufferL(CStifItemParser& aItem) |
1555 { |
1555 { |
1556 int failures=0; |
1556 int failures=0; |
1557 //__UHEAP_MARK; |
1557 //__UHEAP_MARK; |
1558 try{ |
1558 try{ |
1559 |
|
1559 // Create an array of ints |
1560 // Create an array of ints |
1560 int intArray [ ] = { 10, 20, 30, 40, 100, 200, 300, 1000, 2000 }; |
1561 // int intArray [ ] = { 10, 20, 30, 40, 100, 200, 300, 1000, 2000 }; |
1561 int count = sizeof ( intArray ) / sizeof ( int ); |
1562 |
1562 |
1563 |
1563 |
1564 int count = 9; //sizeof ( intArray ) / sizeof ( int ); |
1565 |
|
1564 pair<int *, ptrdiff_t> resultPair; |
1566 pair<int *, ptrdiff_t> resultPair; |
1565 // cout<<""; |
1567 // cout<<""; |
1566 #if STDCPP_OOM |
1568 #if STDCPP_OOM |
1567 User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1); |
1569 User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1); |
1568 #endif |
1570 #endif |
1701 try |
1703 try |
1702 { |
1704 { |
1703 |
1705 |
1704 vector <int> v1, v2; |
1706 vector <int> v1, v2; |
1705 list <int> L1; |
1707 list <int> L1; |
1706 vector <int>::iterator Iter1, Iter2; |
1708 // vector <int>::iterator Iter1, Iter2; |
1707 list <int>::iterator L1_Iter, L1_inIter; |
1709 // list <int>::iterator L1_Iter, L1_inIter; |
1708 |
1710 |
1709 int i; |
1711 int i; |
1710 for ( i = 0 ; i <= 5 ; i++ ) |
1712 for ( i = 0 ; i <= 5 ; i++ ) |
1711 { |
1713 { |
1712 v1.push_back( 5 * i ); |
1714 v1.push_back( 5 * i ); |
2195 int failures = 0; |
2197 int failures = 0; |
2196 |
2198 |
2197 // __UHEAP_MARK; |
2199 // __UHEAP_MARK; |
2198 try{ |
2200 try{ |
2199 vector <int> v1; |
2201 vector <int> v1; |
2200 vector <int>::iterator v1Iter; |
2202 // vector <int>::iterator v1Iter; |
2201 vector <int>:: allocator_type v1Alloc; |
2203 vector <int>:: allocator_type v1Alloc; |
2202 |
2204 |
2203 int i; |
2205 int i; |
2204 for ( i = 1 ; i <= 7 ; i++ ) |
2206 for ( i = 1 ; i <= 7 ; i++ ) |
2205 { |
2207 { |
2475 {int failures=0; |
2477 {int failures=0; |
2476 |
2478 |
2477 |
2479 |
2478 try{ |
2480 try{ |
2479 vector <int> v1; |
2481 vector <int> v1; |
2480 vector <int>::iterator v1Iter; |
2482 // vector <int>::iterator v1Iter; |
2481 vector <int>:: allocator_type v1Alloc; |
2483 vector <int>:: allocator_type v1Alloc; |
2482 |
2484 |
2483 |
2485 |
2484 |
2486 |
2485 |
2487 |