31
|
1 |
/*
|
|
2 |
* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
3 |
* All rights reserved.
|
|
4 |
* This component and the accompanying materials are made available
|
|
5 |
* under the terms of "Eclipse Public License v1.0"
|
|
6 |
* which accompanies this distribution, and is available
|
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
8 |
*
|
|
9 |
* Initial Contributors:
|
|
10 |
* Nokia Corporation - initial contribution.
|
|
11 |
*
|
|
12 |
* Contributors:
|
|
13 |
*
|
|
14 |
* Description:
|
|
15 |
*
|
|
16 |
*/
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
// INCLUDE FILES
|
|
21 |
#include <e32svr.h>
|
|
22 |
#include <StifParser.h>
|
|
23 |
#include <Stiftestinterface.h>
|
|
24 |
#include <locale>
|
|
25 |
#include <iostream>
|
|
26 |
#include<algorithm>
|
|
27 |
#include<set>
|
|
28 |
#include<functional>
|
|
29 |
#include <vector>
|
|
30 |
#include <numeric>
|
|
31 |
#include<list>
|
|
32 |
#include<exception>
|
|
33 |
#include <valarray>
|
|
34 |
#include<memory>
|
|
35 |
#include<fstream>
|
|
36 |
#include<ios>
|
|
37 |
#include<exception>
|
|
38 |
|
|
39 |
#include "tstl_1.h"
|
|
40 |
|
|
41 |
using namespace std;
|
|
42 |
|
|
43 |
#define STDCPP_OOM FALSE// TRUE for OOM testing
|
|
44 |
|
|
45 |
// ============================ MEMBER FUNCTIONS ===============================
|
|
46 |
|
|
47 |
// -----------------------------------------------------------------------------
|
|
48 |
// Ctstl_1::Delete
|
|
49 |
// Delete here all resources allocated and opened from test methods.
|
|
50 |
// Called from destructor.
|
|
51 |
// -----------------------------------------------------------------------------
|
|
52 |
//
|
|
53 |
void Ctstl_1::Delete()
|
|
54 |
{
|
|
55 |
|
|
56 |
}
|
|
57 |
|
|
58 |
// -----------------------------------------------------------------------------
|
|
59 |
// Ctstl_1::RunMethodL
|
|
60 |
// Run specified method. Contains also table of test mothods and their names.
|
|
61 |
// -----------------------------------------------------------------------------
|
|
62 |
//
|
|
63 |
TInt Ctstl_1::RunMethodL(
|
|
64 |
CStifItemParser& aItem )
|
|
65 |
{
|
|
66 |
|
|
67 |
static TStifFunctionInfo const KFunctions[] =
|
|
68 |
{
|
|
69 |
// Copy this line for every implemented function.
|
|
70 |
// First string is the function name used in TestScripter script file.
|
|
71 |
// Second is the actual implementation member function.
|
|
72 |
ENTRY( "ToUpper", Ctstl_1::ToUpper ),
|
|
73 |
ENTRY( "ToLower", Ctstl_1::ToLower ),
|
|
74 |
ENTRY( "Islower", Ctstl_1::Islower ),
|
|
75 |
ENTRY( "Isupper", Ctstl_1::Isupper ),
|
|
76 |
ENTRY( "Maxof", Ctstl_1::Maxof ),
|
|
77 |
ENTRY( "Minof", Ctstl_1::Minof ),
|
|
78 |
ENTRY( "Maxelement", Ctstl_1::Maxelement ),
|
|
79 |
ENTRY( "Minelement", Ctstl_1::Minelement ),
|
|
80 |
ENTRY( "Lowerbound", Ctstl_1::Lowerbound ),
|
|
81 |
ENTRY( "Upperbound", Ctstl_1::Upperbound ),
|
|
82 |
ENTRY( "Swapof", Ctstl_1::Swapof ),
|
|
83 |
ENTRY( "Accumulate", Ctstl_1::Accumulate ),
|
|
84 |
ENTRY( "Adjacent_difference", Ctstl_1::Adjacent_difference),
|
|
85 |
ENTRY( "Adjacent_find", Ctstl_1::Adjacent_find),
|
|
86 |
ENTRY( "Logical_or", Ctstl_1::Logical_or ),
|
|
87 |
ENTRY( "Logical_and", Ctstl_1::Logical_and ),
|
|
88 |
ENTRY( "Logical_not", Ctstl_1::Logical_not ),
|
|
89 |
ENTRY( "count_fun", Ctstl_1::count_fun),
|
|
90 |
ENTRY( "countif_fun", Ctstl_1::countif_fun),
|
|
91 |
ENTRY( "equal_fun", Ctstl_1::equal_fun),
|
|
92 |
ENTRY( "equalto", Ctstl_1::equalto),
|
|
93 |
ENTRY( "notequalto", Ctstl_1::notequalto),
|
|
94 |
ENTRY( "sort_fun", Ctstl_1::sort_fun),
|
|
95 |
ENTRY( "less_equal_fun", Ctstl_1::less_equal_fun),
|
|
96 |
ENTRY( "greater_equal_fun", Ctstl_1::greater_equal_fun),
|
|
97 |
ENTRY( "greater_fun", Ctstl_1::greater_fun),
|
|
98 |
ENTRY( "less_fun", Ctstl_1::less_fun),
|
|
99 |
ENTRY( "find_fun", Ctstl_1::find_fun),
|
|
100 |
ENTRY( "findif_fun", Ctstl_1::findif_fun),
|
|
101 |
ENTRY( "findend_fun", Ctstl_1::findend_fun),
|
|
102 |
ENTRY( "findfirstof_fun", Ctstl_1::findfirstof_fun),
|
|
103 |
ENTRY( "Minus", Ctstl_1::Minus),
|
|
104 |
ENTRY( "Plus", Ctstl_1::Plus),
|
|
105 |
ENTRY( "Divides", Ctstl_1::Divides),
|
|
106 |
ENTRY( "Modulus", Ctstl_1::Modulus),
|
|
107 |
ENTRY( "Negate", Ctstl_1::Negate),
|
|
108 |
ENTRY( "Logicalnot", Ctstl_1::Logicalnot),
|
|
109 |
ENTRY( "Logicaland", Ctstl_1::Logicaland),
|
|
110 |
ENTRY( "Logicalor", Ctstl_1::Logicalor),
|
|
111 |
ENTRY( "Remove", Ctstl_1::Remove),
|
|
112 |
ENTRY( "Removeif", Ctstl_1::Removeif),
|
|
113 |
ENTRY( "Removecopy", Ctstl_1::Removecopy),
|
|
114 |
ENTRY( "Removecopy_if", Ctstl_1::Removecopy_if),
|
|
115 |
ENTRY( "Replace_fun", Ctstl_1::Replace_fun),
|
|
116 |
ENTRY( "Replacecopy_fun", Ctstl_1::Replacecopy_fun),
|
|
117 |
ENTRY( "Replacecopyif_fun", Ctstl_1::Replacecopyif_fun),
|
|
118 |
ENTRY( "Replaceif_fun", Ctstl_1::Replaceif_fun),
|
|
119 |
ENTRY( "Reverse_fun", Ctstl_1::Reverse_fun),
|
|
120 |
ENTRY( "Reversecopy_fun", Ctstl_1::Reversecopy_fun),
|
|
121 |
ENTRY( "Rotate_fun", Ctstl_1::Rotate_fun),
|
|
122 |
ENTRY( "Rotatecopy_fun", Ctstl_1::Rotatecopy_fun),
|
|
123 |
ENTRY( "equalrange", Ctstl_1::equalrange),
|
|
124 |
ENTRY( "exceptionL", Ctstl_1::exceptionL),
|
|
125 |
ENTRY( "foreach", Ctstl_1::foreach),
|
|
126 |
ENTRY( "gsliceL", Ctstl_1::gsliceL),
|
|
127 |
ENTRY( "sliceL", Ctstl_1::sliceL),
|
|
128 |
ENTRY( "unaryfunc", Ctstl_1::unaryfunc),
|
|
129 |
ENTRY( "uni_fill", Ctstl_1::uni_fill),
|
|
130 |
ENTRY( "uni_fill_n", Ctstl_1::uni_fill_n),
|
|
131 |
ENTRY( "uni_copy", Ctstl_1::uni_copy),
|
|
132 |
ENTRY( "maskarray", Ctstl_1::maskarray),
|
|
133 |
ENTRY( "autoptr", Ctstl_1::autoptr),
|
|
134 |
ENTRY( "randshuf", Ctstl_1::randshuf),
|
|
135 |
ENTRY( "randstoriter", Ctstl_1::randstoriter),
|
|
136 |
ENTRY( "iterswap", Ctstl_1::iterswap),
|
|
137 |
ENTRY( "ios1", Ctstl_1::ios1),
|
|
138 |
ENTRY( "ios2", Ctstl_1::ios2),
|
|
139 |
ENTRY( "ios3", Ctstl_1::ios3),
|
|
140 |
ENTRY( "nthelement", Ctstl_1::nthelement),
|
|
141 |
ENTRY( "hasfacet", Ctstl_1::hasfacet),
|
|
142 |
|
|
143 |
|
|
144 |
};
|
|
145 |
|
|
146 |
const TInt count = sizeof( KFunctions ) /
|
|
147 |
sizeof( TStifFunctionInfo );
|
|
148 |
|
|
149 |
return RunInternalL( KFunctions, count, aItem );
|
|
150 |
|
|
151 |
}
|
|
152 |
|
|
153 |
// -----------------------------------------------------------------------------
|
|
154 |
// Ctstl_1::ToUpper
|
|
155 |
// -----------------------------------------------------------------------------
|
|
156 |
//
|
|
157 |
TInt Ctstl_1::ToUpper( CStifItemParser& aItem )
|
|
158 |
{
|
|
159 |
|
|
160 |
int failures=0 ;
|
|
161 |
|
|
162 |
//__UHEAP_MARK;
|
|
163 |
|
|
164 |
|
|
165 |
try
|
|
166 |
{
|
|
167 |
//testcase starts
|
|
168 |
char lower_char ;
|
|
169 |
|
|
170 |
|
|
171 |
for(lower_char='a';lower_char<='z';lower_char++)
|
|
172 |
|
|
173 |
{
|
|
174 |
|
|
175 |
#if STDCPP_OOM
|
|
176 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
177 |
#endif
|
|
178 |
|
|
179 |
char upper_char = toupper(lower_char);
|
|
180 |
|
|
181 |
#if STDCPP_OOM
|
|
182 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
183 |
#endif
|
|
184 |
|
|
185 |
|
|
186 |
if ((lower_char - 32) != upper_char )
|
|
187 |
|
|
188 |
failures++;
|
|
189 |
}
|
|
190 |
|
|
191 |
|
|
192 |
|
|
193 |
for(char lower_char=0x00;lower_char<=0x60;lower_char++)
|
|
194 |
{
|
|
195 |
#if STDCPP_OOM
|
|
196 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
197 |
#endif
|
|
198 |
char upper_char = toupper(lower_char);
|
|
199 |
#if STDCPP_OOM
|
|
200 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
201 |
|
|
202 |
#endif
|
|
203 |
|
|
204 |
if(lower_char!=upper_char)
|
|
205 |
failures++;
|
|
206 |
|
|
207 |
}
|
|
208 |
|
|
209 |
for(char lower_char=0x7B;lower_char<=0x7E;lower_char++)
|
|
210 |
{
|
|
211 |
#if STDCPP_OOM
|
|
212 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
213 |
#endif
|
|
214 |
char upper_char = toupper(lower_char);
|
|
215 |
#if STDCPP_OOM
|
|
216 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
217 |
|
|
218 |
#endif
|
|
219 |
|
|
220 |
if(lower_char!=upper_char)
|
|
221 |
failures++;
|
|
222 |
|
|
223 |
|
|
224 |
|
|
225 |
}
|
|
226 |
|
|
227 |
|
|
228 |
//testcase ends
|
|
229 |
|
|
230 |
|
|
231 |
//#if STDCPP_OOM
|
|
232 |
//failures++;
|
|
233 |
//#endif
|
|
234 |
|
|
235 |
}
|
|
236 |
|
|
237 |
//catching bad alloc exception
|
|
238 |
catch(bad_alloc&)
|
|
239 |
{
|
|
240 |
//do nothing
|
|
241 |
}
|
|
242 |
|
|
243 |
//catching any other exception
|
|
244 |
|
|
245 |
catch(...)
|
|
246 |
{
|
|
247 |
failures++;
|
|
248 |
|
|
249 |
}
|
|
250 |
|
|
251 |
|
|
252 |
|
|
253 |
|
|
254 |
//__UHEAP_MARKEND;
|
|
255 |
if(failures)
|
|
256 |
return KErrGeneral;
|
|
257 |
return KErrNone;
|
|
258 |
|
|
259 |
|
|
260 |
}
|
|
261 |
|
|
262 |
// -----------------------------------------------------------------------------
|
|
263 |
// Ctstl_1::ToLower
|
|
264 |
// -----------------------------------------------------------------------------
|
|
265 |
//
|
|
266 |
|
|
267 |
|
|
268 |
|
|
269 |
|
|
270 |
TInt Ctstl_1::ToLower( CStifItemParser& aItem )
|
|
271 |
{
|
|
272 |
|
|
273 |
//__UHEAP_MARK;
|
|
274 |
char upper_char ;
|
|
275 |
int failures = 0;
|
|
276 |
|
|
277 |
|
|
278 |
try
|
|
279 |
{
|
|
280 |
#if STDCPP_OOM
|
|
281 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
282 |
|
|
283 |
#endif
|
|
284 |
for(upper_char='A';upper_char<='Z';upper_char++)
|
|
285 |
{
|
|
286 |
|
|
287 |
|
|
288 |
char lower_char = tolower(upper_char);
|
|
289 |
|
|
290 |
if (lower_char != (upper_char + 32 ))
|
|
291 |
|
|
292 |
failures++;
|
|
293 |
}
|
|
294 |
|
|
295 |
|
|
296 |
for(char upper_char=0x00;upper_char<=0x40;upper_char++)
|
|
297 |
{
|
|
298 |
|
|
299 |
char lower_char = tolower(upper_char);
|
|
300 |
if(lower_char!=upper_char)
|
|
301 |
failures++;
|
|
302 |
|
|
303 |
}
|
|
304 |
for(char upper_char=0x5B;upper_char<=0x7E;upper_char++)
|
|
305 |
{
|
|
306 |
|
|
307 |
char lower_char = tolower(upper_char);
|
|
308 |
if(lower_char!=upper_char)
|
|
309 |
failures++;
|
|
310 |
|
|
311 |
|
|
312 |
|
|
313 |
}
|
|
314 |
|
|
315 |
#if STDCPP_OOM
|
|
316 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
317 |
|
|
318 |
#endif
|
|
319 |
|
|
320 |
//#if STDCPP_OOM
|
|
321 |
//failures++;
|
|
322 |
//#endif
|
|
323 |
|
|
324 |
}
|
|
325 |
|
|
326 |
catch(bad_alloc&)
|
|
327 |
{
|
|
328 |
//do nothing
|
|
329 |
}
|
|
330 |
|
|
331 |
catch(...)
|
|
332 |
{
|
|
333 |
failures++;
|
|
334 |
|
|
335 |
}
|
|
336 |
|
|
337 |
// __UHEAP_MARKEND;
|
|
338 |
if(failures)
|
|
339 |
return KErrGeneral;
|
|
340 |
return KErrNone;
|
|
341 |
|
|
342 |
}
|
|
343 |
|
|
344 |
|
|
345 |
// -----------------------------------------------------------------------------
|
|
346 |
// Ctstl_1::Islower
|
|
347 |
// -----------------------------------------------------------------------------
|
|
348 |
//
|
|
349 |
|
|
350 |
TInt Ctstl_1::Islower( CStifItemParser& aItem )
|
|
351 |
{
|
|
352 |
|
|
353 |
// __UHEAP_MARK;
|
|
354 |
|
|
355 |
char lower_char;
|
|
356 |
int failures =0;
|
|
357 |
|
|
358 |
|
|
359 |
try
|
|
360 |
{
|
|
361 |
#if STDCPP_OOM
|
|
362 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
363 |
|
|
364 |
#endif
|
|
365 |
for(lower_char = 'a' ;lower_char<='z';lower_char++)
|
|
366 |
{
|
|
367 |
|
|
368 |
if(!islower(lower_char))
|
|
369 |
failures++;
|
|
370 |
|
|
371 |
}
|
|
372 |
|
|
373 |
#if STDCPP_OOM
|
|
374 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
375 |
|
|
376 |
|
|
377 |
#endif
|
|
378 |
//#if STDCPP_OOM
|
|
379 |
//failures++;
|
|
380 |
//#endif
|
|
381 |
|
|
382 |
}
|
|
383 |
catch(bad_alloc&)
|
|
384 |
{
|
|
385 |
|
|
386 |
}
|
|
387 |
catch(...)
|
|
388 |
{
|
|
389 |
failures++;
|
|
390 |
|
|
391 |
}
|
|
392 |
|
|
393 |
// __UHEAP_MARKEND;
|
|
394 |
|
|
395 |
if(failures)
|
|
396 |
return KErrGeneral;
|
|
397 |
return KErrNone;
|
|
398 |
}
|
|
399 |
|
|
400 |
// -----------------------------------------------------------------------------
|
|
401 |
// Ctstl_1::Isupper
|
|
402 |
// -----------------------------------------------------------------------------
|
|
403 |
//
|
|
404 |
|
|
405 |
|
|
406 |
TInt Ctstl_1::Isupper( CStifItemParser& aItem )
|
|
407 |
{
|
|
408 |
|
|
409 |
//__UHEAP_MARK;
|
|
410 |
|
|
411 |
char upper_char;
|
|
412 |
|
|
413 |
int failures =0;
|
|
414 |
|
|
415 |
|
|
416 |
try
|
|
417 |
{
|
|
418 |
|
|
419 |
for(upper_char = 'A' ;upper_char<='Z';upper_char++)
|
|
420 |
{
|
|
421 |
|
|
422 |
#if STDCPP_OOM
|
|
423 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
424 |
|
|
425 |
#endif
|
|
426 |
if(!isupper(upper_char))
|
|
427 |
failures++;
|
|
428 |
|
|
429 |
#if STDCPP_OOM
|
|
430 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
431 |
|
|
432 |
|
|
433 |
#endif
|
|
434 |
}
|
|
435 |
|
|
436 |
//#if STDCPP_OOM
|
|
437 |
//failures++;
|
|
438 |
//#endif
|
|
439 |
}
|
|
440 |
catch(bad_alloc&)
|
|
441 |
{
|
|
442 |
|
|
443 |
}
|
|
444 |
catch(...)
|
|
445 |
{
|
|
446 |
failures++;
|
|
447 |
|
|
448 |
}
|
|
449 |
|
|
450 |
|
|
451 |
if(failures)
|
|
452 |
return KErrGeneral;
|
|
453 |
return KErrNone;
|
|
454 |
}
|
|
455 |
|
|
456 |
|
|
457 |
// Ctstl_1::Maxof
|
|
458 |
|
|
459 |
|
|
460 |
TInt Ctstl_1::Maxof( CStifItemParser& aItem )
|
|
461 |
{
|
|
462 |
int failures =0;
|
|
463 |
|
|
464 |
|
|
465 |
try
|
|
466 |
{
|
|
467 |
int result_int1;
|
|
468 |
int result_int2;
|
|
469 |
char result_char;
|
|
470 |
// float result_float;
|
|
471 |
#if STDCPP_OOM
|
|
472 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
473 |
|
|
474 |
#endif
|
|
475 |
result_int1 = max(2,1);
|
|
476 |
result_int2 = max(-2,-25);
|
|
477 |
result_char = max('a','z');
|
|
478 |
#if STDCPP_OOM
|
|
479 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
480 |
|
|
481 |
|
|
482 |
#endif
|
|
483 |
|
|
484 |
/*
|
|
485 |
if (result_int1 == 2)
|
|
486 |
if(result_int2 == -2)
|
|
487 |
if (result_char == 'z')
|
|
488 |
if(max(2.23,2.24) == 2.24)
|
|
489 |
// __UHEAP_MARKEND;
|
|
490 |
return KErrNone;
|
|
491 |
return KErrGeneral;*/
|
|
492 |
if (result_int1 != 2)
|
|
493 |
failures++;
|
|
494 |
if(result_int2 != -2)
|
|
495 |
failures++;
|
|
496 |
if (result_char != 'z')
|
|
497 |
failures++;
|
|
498 |
if(max(2.23,2.24) != 2.24)
|
|
499 |
failures++;
|
|
500 |
|
|
501 |
//#if STDCPP_OOM //failures++; //#endif
|
|
502 |
|
|
503 |
|
|
504 |
}
|
|
505 |
catch(bad_alloc&)
|
|
506 |
{
|
|
507 |
//do nothing
|
|
508 |
}
|
|
509 |
catch(...)
|
|
510 |
{
|
|
511 |
failures++;
|
|
512 |
|
|
513 |
}
|
|
514 |
|
|
515 |
|
|
516 |
if(failures)
|
|
517 |
return KErrGeneral;
|
|
518 |
return KErrNone;
|
|
519 |
|
|
520 |
|
|
521 |
}
|
|
522 |
|
|
523 |
|
|
524 |
// Ctstl_1::Minof
|
|
525 |
|
|
526 |
|
|
527 |
TInt Ctstl_1::Minof( CStifItemParser& aItem )
|
|
528 |
{
|
|
529 |
|
|
530 |
int failures =0;
|
|
531 |
|
|
532 |
|
|
533 |
try
|
|
534 |
{
|
|
535 |
int result_int1;
|
|
536 |
int result_int2;
|
|
537 |
char result_char;
|
|
538 |
#if STDCPP_OOM
|
|
539 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
540 |
|
|
541 |
#endif
|
|
542 |
result_int1 = min(2,1);
|
|
543 |
result_int2 = min(-2,-25);
|
|
544 |
result_char = min('a','z');
|
|
545 |
|
|
546 |
#if STDCPP_OOM
|
|
547 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
548 |
|
|
549 |
|
|
550 |
#endif
|
|
551 |
|
|
552 |
/* if (result_int1 == 1)
|
|
553 |
if(result_int2 == -25)
|
|
554 |
if (result_char == 'a')
|
|
555 |
if(min(2.23,2.24) == 2.23)
|
|
556 |
|
|
557 |
|
|
558 |
return KErrNone;
|
|
559 |
return KErrGeneral;
|
|
560 |
*/
|
|
561 |
if (result_int1 != 1)
|
|
562 |
failures++;
|
|
563 |
|
|
564 |
if(result_int2 != -25)
|
|
565 |
failures++;
|
|
566 |
if (result_char != 'a')
|
|
567 |
failures++;
|
|
568 |
if(min(2.23,2.24) != 2.23)
|
|
569 |
failures++;
|
|
570 |
|
|
571 |
}
|
|
572 |
catch(bad_alloc&)
|
|
573 |
{
|
|
574 |
//do nothing
|
|
575 |
}
|
|
576 |
catch(...)
|
|
577 |
{
|
|
578 |
failures++;
|
|
579 |
|
|
580 |
}
|
|
581 |
|
|
582 |
|
|
583 |
if(failures)
|
|
584 |
return KErrGeneral;
|
|
585 |
return KErrNone;
|
|
586 |
|
|
587 |
|
|
588 |
|
|
589 |
}
|
|
590 |
|
|
591 |
|
|
592 |
|
|
593 |
TInt Ctstl_1::Maxelement(CStifItemParser& aItem)
|
|
594 |
{
|
|
595 |
|
|
596 |
|
|
597 |
|
|
598 |
|
|
599 |
int failures =0;
|
|
600 |
|
|
601 |
|
|
602 |
try
|
|
603 |
{
|
|
604 |
|
|
605 |
int test_array1[] = { 0,-2,-3333,1,23,3333,234,989};
|
|
606 |
char test_array2[] = {'c','d','z','e','w'};
|
|
607 |
|
|
608 |
int test_variable1;
|
|
609 |
char test_variable2;
|
|
610 |
|
|
611 |
#if STDCPP_OOM
|
|
612 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
613 |
|
|
614 |
#endif
|
|
615 |
test_variable1 = *max_element(test_array1,test_array1 + 8);
|
|
616 |
test_variable2 = *max_element(test_array2,test_array2+5);
|
|
617 |
int test_variable3 =*max_element(test_array1,test_array1 + 7);
|
|
618 |
|
|
619 |
#if STDCPP_OOM
|
|
620 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
621 |
|
|
622 |
|
|
623 |
#endif
|
|
624 |
/*if((test_variable1 == 3333)&&(test_variable2 == 'z'))
|
|
625 |
if(test_variable3!=3333)
|
|
626 |
|
|
627 |
return KErrNone;
|
|
628 |
return KErrGeneral;
|
|
629 |
*/
|
|
630 |
|
|
631 |
if((test_variable1 != 3333)&&(test_variable2 != 'z'))
|
|
632 |
failures++;
|
|
633 |
if(test_variable3!=3333)
|
|
634 |
failures++;
|
|
635 |
|
|
636 |
|
|
637 |
}
|
|
638 |
catch(bad_alloc&)
|
|
639 |
{
|
|
640 |
//do nothing
|
|
641 |
}
|
|
642 |
catch(...)
|
|
643 |
{
|
|
644 |
failures++;
|
|
645 |
|
|
646 |
}
|
|
647 |
|
|
648 |
|
|
649 |
|
|
650 |
if(failures)
|
|
651 |
return KErrGeneral;
|
|
652 |
return KErrNone;
|
|
653 |
|
|
654 |
|
|
655 |
}
|
|
656 |
|
|
657 |
|
|
658 |
|
|
659 |
|
|
660 |
|
|
661 |
TInt Ctstl_1::Minelement(CStifItemParser& aItem)
|
|
662 |
{
|
|
663 |
|
|
664 |
|
|
665 |
int failures =0;
|
|
666 |
|
|
667 |
try
|
|
668 |
{
|
|
669 |
|
|
670 |
int test_array1[] = { 0,-2,-3333,1,23,3333,234,989};
|
|
671 |
char test_array2[] = {'c','d','z','e','w'};
|
|
672 |
|
|
673 |
int test_variable1;
|
|
674 |
char test_variable2;
|
|
675 |
|
|
676 |
|
|
677 |
#if STDCPP_OOM
|
|
678 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
679 |
|
|
680 |
#endif
|
|
681 |
test_variable1 = *min_element(test_array1,test_array1 + 8);
|
|
682 |
test_variable2 = *min_element(test_array2,test_array2 + 5);
|
|
683 |
|
|
684 |
#if STDCPP_OOM
|
|
685 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
686 |
|
|
687 |
|
|
688 |
#endif
|
|
689 |
|
|
690 |
/* if((test_variable1 == -3333)&&(test_variable2 == 'c'))
|
|
691 |
|
|
692 |
|
|
693 |
return KErrNone;
|
|
694 |
return KErrGeneral;*/
|
|
695 |
|
|
696 |
if(test_variable1 != -3333)failures++;
|
|
697 |
if(test_variable2 != 'c') failures++;
|
|
698 |
}
|
|
699 |
catch(bad_alloc&)
|
|
700 |
{
|
|
701 |
return KErrNone;
|
|
702 |
}
|
|
703 |
catch(...)
|
|
704 |
{
|
|
705 |
failures++;
|
|
706 |
|
|
707 |
}
|
|
708 |
|
|
709 |
|
|
710 |
|
|
711 |
if(failures)
|
|
712 |
return KErrGeneral;
|
|
713 |
return KErrNone;
|
|
714 |
|
|
715 |
|
|
716 |
}
|
|
717 |
|
|
718 |
|
|
719 |
//lowerbound
|
|
720 |
|
|
721 |
TInt Ctstl_1::Lowerbound(CStifItemParser& aItem)
|
|
722 |
{
|
|
723 |
|
|
724 |
|
|
725 |
//__UHEAP_MARK;
|
|
726 |
|
|
727 |
int failures =0;
|
|
728 |
|
|
729 |
|
|
730 |
try
|
|
731 |
{
|
|
732 |
|
|
733 |
|
|
734 |
|
|
735 |
set<int> myset;
|
|
736 |
|
|
737 |
set<int>::iterator it,itlow;
|
|
738 |
|
|
739 |
int array[2];
|
|
740 |
|
|
741 |
for (int i=1; i<10; i++)
|
|
742 |
myset.insert(i*10); // 10 20 30 40 50 60 70 80 90
|
|
743 |
#if STDCPP_OOM
|
|
744 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
745 |
|
|
746 |
#endif
|
|
747 |
itlow=myset.lower_bound(30);
|
|
748 |
#if STDCPP_OOM
|
|
749 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
750 |
|
|
751 |
|
|
752 |
#endif
|
|
753 |
|
|
754 |
|
|
755 |
for (it=myset.begin(); it!=itlow; it++)
|
|
756 |
{
|
|
757 |
|
|
758 |
static int j =0;
|
|
759 |
|
|
760 |
array[j] = (*it);
|
|
761 |
j++;
|
|
762 |
}
|
|
763 |
|
|
764 |
|
|
765 |
|
|
766 |
|
|
767 |
myset.erase(myset.begin(),myset.end());
|
|
768 |
|
|
769 |
/*
|
|
770 |
if(array[0] == 10 && array[1] == 20 )
|
|
771 |
|
|
772 |
// __UHEAP_MARKEND;
|
|
773 |
return KErrNone;
|
|
774 |
return KErrGeneral;*/
|
|
775 |
|
|
776 |
if(array[0] != 10)
|
|
777 |
failures++;
|
|
778 |
if( array[1] != 20)
|
|
779 |
failures++;
|
|
780 |
|
|
781 |
|
|
782 |
|
|
783 |
|
|
784 |
// #if STDCPP_OOM
|
|
785 |
// failures++;
|
|
786 |
//#endif
|
|
787 |
}
|
|
788 |
catch(bad_alloc&)
|
|
789 |
{
|
|
790 |
}
|
|
791 |
catch(...)
|
|
792 |
{
|
|
793 |
failures++;
|
|
794 |
|
|
795 |
}
|
|
796 |
|
|
797 |
// __UHEAP_MARKEND;
|
|
798 |
|
|
799 |
if(failures)
|
|
800 |
return KErrGeneral;
|
|
801 |
return KErrNone;
|
|
802 |
|
|
803 |
|
|
804 |
}
|
|
805 |
|
|
806 |
|
|
807 |
//upperbound
|
|
808 |
|
|
809 |
TInt Ctstl_1::Upperbound(CStifItemParser& aItem)
|
|
810 |
{
|
|
811 |
|
|
812 |
|
|
813 |
// __UHEAP_MARK;
|
|
814 |
int failures =0;
|
|
815 |
|
|
816 |
|
|
817 |
try
|
|
818 |
{
|
|
819 |
|
|
820 |
set<int> myset;
|
|
821 |
set<int>::iterator it,itlow,itup;
|
|
822 |
|
|
823 |
|
|
824 |
|
|
825 |
|
|
826 |
int array[6];
|
|
827 |
|
|
828 |
for (int i=1; i<10; i++)
|
|
829 |
|
|
830 |
myset.insert(i*10);
|
|
831 |
#if STDCPP_OOM
|
|
832 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
833 |
|
|
834 |
#endif
|
|
835 |
itup=myset.upper_bound (30);
|
|
836 |
|
|
837 |
#if STDCPP_OOM
|
|
838 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
839 |
|
|
840 |
|
|
841 |
#endif
|
|
842 |
for (it=itup; it!=myset.end(); it++)
|
|
843 |
{
|
|
844 |
|
|
845 |
|
|
846 |
static int j =0;
|
|
847 |
array[j] = (*it);
|
|
848 |
j++;
|
|
849 |
}
|
|
850 |
|
|
851 |
|
|
852 |
/*
|
|
853 |
if(array[0] == 40 )
|
|
854 |
if(array[1] == 50 )
|
|
855 |
if(array[2] == 60 )
|
|
856 |
if(array[3] ==70 )
|
|
857 |
if(array[4] == 80 )
|
|
858 |
if(array[5] == 90 )
|
|
859 |
|
|
860 |
|
|
861 |
// __UHEAP_MARKEND;
|
|
862 |
|
|
863 |
return KErrNone;
|
|
864 |
return KErrGeneral;*/
|
|
865 |
|
|
866 |
if(array[0] != 40 )
|
|
867 |
failures++;
|
|
868 |
if(array[1] != 50 )
|
|
869 |
failures++;
|
|
870 |
if(array[2] != 60 )
|
|
871 |
failures++;
|
|
872 |
if(array[3] !=70 )
|
|
873 |
failures++;
|
|
874 |
if(array[4] != 80 )
|
|
875 |
failures++;
|
|
876 |
if(array[5] != 90 )
|
|
877 |
failures++;
|
|
878 |
|
|
879 |
|
|
880 |
//#if STDCPP_OOM //failures++; //#endif
|
|
881 |
}
|
|
882 |
|
|
883 |
catch(exception&)
|
|
884 |
{
|
|
885 |
|
|
886 |
}
|
|
887 |
|
|
888 |
catch(...)
|
|
889 |
{
|
|
890 |
failures++;
|
|
891 |
|
|
892 |
}
|
|
893 |
|
|
894 |
// __UHEAP_MARKEND;
|
|
895 |
|
|
896 |
if(failures)
|
|
897 |
return KErrGeneral;
|
|
898 |
return KErrNone;
|
|
899 |
}
|
|
900 |
|
|
901 |
|
|
902 |
|
|
903 |
|
|
904 |
|
|
905 |
//swap
|
|
906 |
|
|
907 |
TInt Ctstl_1::Swapof(CStifItemParser& aItem)
|
|
908 |
{
|
|
909 |
int x= 10,y=20;
|
|
910 |
|
|
911 |
//__UHEAP_MARK;
|
|
912 |
int failures =0;
|
|
913 |
|
|
914 |
|
|
915 |
try
|
|
916 |
{ // cout<<"";
|
|
917 |
#if STDCPP_OOM
|
|
918 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
919 |
|
|
920 |
#endif
|
|
921 |
swap(x,y);
|
|
922 |
#if STDCPP_OOM
|
|
923 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
924 |
|
|
925 |
|
|
926 |
#endif
|
|
927 |
/*if (x==20 && y==10)
|
|
928 |
|
|
929 |
|
|
930 |
//__UHEAP_MARKEND;
|
|
931 |
|
|
932 |
return KErrNone;
|
|
933 |
return KErrGeneral;*/
|
|
934 |
if(x!=20)
|
|
935 |
failures++;
|
|
936 |
if(y!=10)
|
|
937 |
failures++;
|
|
938 |
|
|
939 |
//#if STDCPP_OOM
|
|
940 |
// failures++;
|
|
941 |
// #endif
|
|
942 |
}
|
|
943 |
catch(bad_alloc&)
|
|
944 |
{
|
|
945 |
}
|
|
946 |
catch(...)
|
|
947 |
{
|
|
948 |
failures++;
|
|
949 |
|
|
950 |
}
|
|
951 |
|
|
952 |
|
|
953 |
if(failures)
|
|
954 |
return KErrGeneral;
|
|
955 |
return KErrNone;
|
|
956 |
}
|
|
957 |
|
|
958 |
|
|
959 |
//accumulate
|
|
960 |
int mult(int x,int y)
|
|
961 |
{
|
|
962 |
return x*y;
|
|
963 |
}
|
|
964 |
|
|
965 |
|
|
966 |
|
|
967 |
TInt Ctstl_1::Accumulate(CStifItemParser& aItem)
|
|
968 |
{
|
|
969 |
|
|
970 |
int failures =0;
|
|
971 |
|
|
972 |
// __UHEAP_MARK;
|
|
973 |
|
|
974 |
try
|
|
975 |
{
|
|
976 |
|
|
977 |
|
|
978 |
int test_array[10] = {1,2,3,4,5,6,7,8,9,10};
|
|
979 |
vector<int> v1(test_array, test_array+10);
|
|
980 |
// cout<<"";
|
|
981 |
#if STDCPP_OOM
|
|
982 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
983 |
|
|
984 |
#endif
|
|
985 |
int sum = accumulate(v1.begin(), v1.end(),0);
|
|
986 |
|
|
987 |
int prod = accumulate(v1.begin(), v1.end(),1,mult);
|
|
988 |
#if STDCPP_OOM
|
|
989 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
990 |
|
|
991 |
|
|
992 |
#endif
|
|
993 |
v1.erase(v1.begin(),v1.end());
|
|
994 |
|
|
995 |
/* if(sum == 55 && prod == 3628800)
|
|
996 |
// __UHEAP_MARKEND;
|
|
997 |
|
|
998 |
return KErrNone;
|
|
999 |
return KErrGeneral;*/
|
|
1000 |
if(sum!=55)
|
|
1001 |
failures++;
|
|
1002 |
if(prod!=3628800)
|
|
1003 |
failures++;
|
|
1004 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1005 |
|
|
1006 |
}
|
|
1007 |
catch(bad_alloc&)
|
|
1008 |
{
|
|
1009 |
}
|
|
1010 |
catch(...)
|
|
1011 |
{
|
|
1012 |
failures++;
|
|
1013 |
|
|
1014 |
}
|
|
1015 |
|
|
1016 |
|
|
1017 |
if(failures)
|
|
1018 |
return KErrGeneral;
|
|
1019 |
return KErrNone;
|
|
1020 |
}
|
|
1021 |
|
|
1022 |
|
|
1023 |
|
|
1024 |
|
|
1025 |
|
|
1026 |
TInt Ctstl_1::Adjacent_difference(CStifItemParser& aItem)
|
|
1027 |
{
|
|
1028 |
|
|
1029 |
|
|
1030 |
//__UHEAP_MARK;
|
|
1031 |
|
|
1032 |
|
|
1033 |
int failures =0;
|
|
1034 |
|
|
1035 |
|
|
1036 |
try
|
|
1037 |
{
|
|
1038 |
vector<int> V1( 10 ), V2( 10 );
|
|
1039 |
vector<int>::iterator VIter1, VIter2, VIterend, VIterend2;
|
|
1040 |
|
|
1041 |
|
|
1042 |
int array1[10];
|
|
1043 |
int array2[10];
|
|
1044 |
list <int> L1;
|
|
1045 |
// list <int>::iterator LIter1, LIterend, LIterend2;
|
|
1046 |
|
|
1047 |
int t;
|
|
1048 |
for ( t = 1 ; t <= 10 ; t++ )
|
|
1049 |
{
|
|
1050 |
L1.push_back( t * t );
|
|
1051 |
}
|
|
1052 |
// cout<<"";
|
|
1053 |
#if STDCPP_OOM
|
|
1054 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1055 |
|
|
1056 |
#endif
|
|
1057 |
// The first member function for the adjacent_differences of
|
|
1058 |
// elements in a list output to a vector
|
|
1059 |
VIterend = adjacent_difference ( L1.begin (),L1.end (),V1.begin () );
|
|
1060 |
#if STDCPP_OOM
|
|
1061 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1062 |
|
|
1063 |
|
|
1064 |
#endif
|
|
1065 |
for ( VIter1 = V1.begin( ) ; VIter1 != VIterend ; VIter1++ )
|
|
1066 |
|
|
1067 |
|
|
1068 |
{
|
|
1069 |
static int i;
|
|
1070 |
|
|
1071 |
array1[i] = *VIter1;
|
|
1072 |
i++;
|
|
1073 |
}
|
|
1074 |
|
|
1075 |
#if STDCPP_OOM
|
|
1076 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1077 |
|
|
1078 |
#endif
|
|
1079 |
// The second member function used to compute
|
|
1080 |
// the adjacent products of the elements in a list
|
|
1081 |
VIterend2 = adjacent_difference ( L1.begin (),L1.end ( ),V2.begin ( ),multiplies<int>( ) );
|
|
1082 |
#if STDCPP_OOM
|
|
1083 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1084 |
|
|
1085 |
|
|
1086 |
#endif
|
|
1087 |
for ( VIter2 = V2.begin( ) ; VIter2 != VIterend2 ; VIter2++ )
|
|
1088 |
{
|
|
1089 |
|
|
1090 |
static int i;
|
|
1091 |
array2[i] = *VIter2;
|
|
1092 |
i++;
|
|
1093 |
}
|
|
1094 |
|
|
1095 |
/*
|
|
1096 |
if(array1[0] == 1)
|
|
1097 |
if(array1[1] == 3)
|
|
1098 |
if(array1[2] == 5)
|
|
1099 |
if(array1[3] == 7)
|
|
1100 |
if(array1[4] == 9)
|
|
1101 |
if(array1[5] == 11)
|
|
1102 |
if(array1[6] == 13)
|
|
1103 |
if(array1[7] == 15)
|
|
1104 |
if(array1[8] == 17)
|
|
1105 |
if(array1[9] == 19)
|
|
1106 |
|
|
1107 |
if(array2[0] == 1)
|
|
1108 |
if(array2[1] == 4)
|
|
1109 |
if(array2[2] == 36)
|
|
1110 |
if(array2[3] == 144)
|
|
1111 |
if(array2[4] == 400)
|
|
1112 |
if(array2[5] == 900)
|
|
1113 |
if(array2[6] == 1764)
|
|
1114 |
if(array2[7] == 3136)
|
|
1115 |
if(array2[8] == 5184)
|
|
1116 |
if(array2[9] == 8100)
|
|
1117 |
|
|
1118 |
//__UHEAP_MARKEND;
|
|
1119 |
return KErrNone;
|
|
1120 |
return KErrGeneral;*/
|
|
1121 |
if(array1[0] != 1)
|
|
1122 |
failures++;
|
|
1123 |
if(array1[1] != 3)
|
|
1124 |
failures++;
|
|
1125 |
if(array1[2] != 5)
|
|
1126 |
failures++;
|
|
1127 |
if(array1[3] != 7)
|
|
1128 |
failures++;
|
|
1129 |
if(array1[4] != 9)
|
|
1130 |
failures++;
|
|
1131 |
if(array1[5] != 11)
|
|
1132 |
failures++;
|
|
1133 |
if(array1[6] != 13)
|
|
1134 |
failures++;
|
|
1135 |
if(array1[7] != 15)
|
|
1136 |
failures++;
|
|
1137 |
if(array1[8] != 17)
|
|
1138 |
failures++;
|
|
1139 |
if(array1[9] != 19)
|
|
1140 |
failures++;
|
|
1141 |
|
|
1142 |
if(array2[0] != 1)
|
|
1143 |
failures++;
|
|
1144 |
if(array2[1] != 4)
|
|
1145 |
failures++;
|
|
1146 |
if(array2[2] != 36)
|
|
1147 |
failures++;
|
|
1148 |
if(array2[3] != 144)
|
|
1149 |
failures++;
|
|
1150 |
if(array2[4] != 400)
|
|
1151 |
failures++;
|
|
1152 |
if(array2[5] != 900)
|
|
1153 |
failures++;
|
|
1154 |
if(array2[6] != 1764)
|
|
1155 |
failures++;
|
|
1156 |
if(array2[7] != 3136)
|
|
1157 |
failures++;
|
|
1158 |
if(array2[8] != 5184)
|
|
1159 |
failures++;
|
|
1160 |
if(array2[9] != 8100)
|
|
1161 |
failures++;
|
|
1162 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1163 |
|
|
1164 |
|
|
1165 |
}
|
|
1166 |
catch(bad_alloc&)
|
|
1167 |
{
|
|
1168 |
}
|
|
1169 |
catch(...)
|
|
1170 |
{
|
|
1171 |
failures++;
|
|
1172 |
|
|
1173 |
}
|
|
1174 |
|
|
1175 |
// __UHEAP_MARKEND;
|
|
1176 |
|
|
1177 |
if(failures)
|
|
1178 |
return KErrGeneral;
|
|
1179 |
return KErrNone;
|
|
1180 |
|
|
1181 |
|
|
1182 |
|
|
1183 |
}
|
|
1184 |
|
|
1185 |
|
|
1186 |
|
|
1187 |
TInt Ctstl_1::Adjacent_find(CStifItemParser& aItem)
|
|
1188 |
{
|
|
1189 |
|
|
1190 |
|
|
1191 |
//__UHEAP_MARK;
|
|
1192 |
|
|
1193 |
int failures =0;
|
|
1194 |
|
|
1195 |
|
|
1196 |
try
|
|
1197 |
{
|
|
1198 |
int myints[] = {10,20,30,30,20,10,50,60};
|
|
1199 |
int myints1[]=
|
|
1200 |
{
|
|
1201 |
10,20,30,40,50,60,70
|
|
1202 |
};
|
|
1203 |
vector<int> myvector (myints,myints+8) ,myvector1(myints1,myints1+7);
|
|
1204 |
vector<int>::iterator it; // cout<<"";
|
|
1205 |
#if STDCPP_OOM
|
|
1206 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1207 |
|
|
1208 |
#endif
|
|
1209 |
it = adjacent_find (myvector.begin(), myvector.end());
|
|
1210 |
#if STDCPP_OOM
|
|
1211 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1212 |
|
|
1213 |
|
|
1214 |
#endif
|
|
1215 |
/*
|
|
1216 |
if(*it == 30)
|
|
1217 |
|
|
1218 |
|
|
1219 |
// __UHEAP_MARKEND;
|
|
1220 |
return KErrNone;
|
|
1221 |
return KErrGeneral;
|
|
1222 |
|
|
1223 |
*/
|
|
1224 |
if(*it!=30)
|
|
1225 |
failures++;
|
|
1226 |
|
|
1227 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1228 |
}
|
|
1229 |
catch(bad_alloc&)
|
|
1230 |
{
|
|
1231 |
|
|
1232 |
}
|
|
1233 |
catch(...)
|
|
1234 |
{
|
|
1235 |
failures++;
|
|
1236 |
|
|
1237 |
}
|
|
1238 |
|
|
1239 |
// __UHEAP_MARKEND;
|
|
1240 |
|
|
1241 |
if(failures)
|
|
1242 |
return KErrGeneral;
|
|
1243 |
return KErrNone;
|
|
1244 |
|
|
1245 |
|
|
1246 |
|
|
1247 |
|
|
1248 |
|
|
1249 |
}
|
|
1250 |
|
|
1251 |
|
|
1252 |
|
|
1253 |
|
|
1254 |
|
|
1255 |
|
|
1256 |
|
|
1257 |
|
|
1258 |
|
|
1259 |
|
|
1260 |
// logical or
|
|
1261 |
TInt Ctstl_1::Logical_or(CStifItemParser& aItem)
|
|
1262 |
{
|
|
1263 |
|
|
1264 |
|
|
1265 |
//__UHEAP_MARK;
|
|
1266 |
int failures =0;
|
|
1267 |
|
|
1268 |
|
|
1269 |
try
|
|
1270 |
{
|
|
1271 |
int input1 [4] = { 1, 1, 0, 1 };
|
|
1272 |
int input2 [4] = { 0, 1, 0, 0 };
|
|
1273 |
int output [4];
|
|
1274 |
#if STDCPP_OOM
|
|
1275 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1276 |
|
|
1277 |
#endif
|
|
1278 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, logical_or<bool>());
|
|
1279 |
|
|
1280 |
#if STDCPP_OOM
|
|
1281 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1282 |
|
|
1283 |
|
|
1284 |
#endif
|
|
1285 |
/* if(output[0] == 1 && output[1] == 1 && output[2] ==0 && output[3] == 1)
|
|
1286 |
|
|
1287 |
// __UHEAP_MARKEND;
|
|
1288 |
return KErrNone;
|
|
1289 |
return KErrGeneral; */
|
|
1290 |
if(output[0] != 1)
|
|
1291 |
failures++;
|
|
1292 |
if(output[1] != 1 )
|
|
1293 |
failures++;
|
|
1294 |
if(output[2] !=0)
|
|
1295 |
failures++;
|
|
1296 |
if( output[3] != 1)
|
|
1297 |
failures++;
|
|
1298 |
|
|
1299 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1300 |
}
|
|
1301 |
catch(bad_alloc&)
|
|
1302 |
{
|
|
1303 |
}
|
|
1304 |
catch(...)
|
|
1305 |
{
|
|
1306 |
failures++;
|
|
1307 |
|
|
1308 |
}
|
|
1309 |
|
|
1310 |
// __UHEAP_MARKEND;
|
|
1311 |
|
|
1312 |
if(failures)
|
|
1313 |
return KErrGeneral;
|
|
1314 |
return KErrNone;
|
|
1315 |
|
|
1316 |
}
|
|
1317 |
|
|
1318 |
|
|
1319 |
//logical and
|
|
1320 |
|
|
1321 |
TInt Ctstl_1::Logical_and(CStifItemParser& aItem)
|
|
1322 |
{
|
|
1323 |
|
|
1324 |
|
|
1325 |
//__UHEAP_MARK;
|
|
1326 |
int failures =0;
|
|
1327 |
|
|
1328 |
|
|
1329 |
try
|
|
1330 |
{
|
|
1331 |
int input1 [4] = { 1, 1, 0, 1 };
|
|
1332 |
int input2 [4] = { 0, 1, 0, 0 };
|
|
1333 |
int output [4];
|
|
1334 |
#if STDCPP_OOM
|
|
1335 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1336 |
|
|
1337 |
#endif
|
|
1338 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, logical_and<bool>());
|
|
1339 |
|
|
1340 |
#if STDCPP_OOM
|
|
1341 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1342 |
|
|
1343 |
|
|
1344 |
#endif
|
|
1345 |
|
|
1346 |
/* if(output[0] == 0 && output[1] == 1 && output[2] ==0 && output[3] == 0)
|
|
1347 |
|
|
1348 |
//__UHEAP_MARKEND;
|
|
1349 |
|
|
1350 |
return KErrNone;
|
|
1351 |
return KErrGeneral; */
|
|
1352 |
if(output[0] != 0)
|
|
1353 |
failures++;
|
|
1354 |
if(output[1] != 1 )
|
|
1355 |
failures++;
|
|
1356 |
if(output[2] !=0)
|
|
1357 |
failures++;
|
|
1358 |
if( output[3] != 0)
|
|
1359 |
failures++;
|
|
1360 |
|
|
1361 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1362 |
}
|
|
1363 |
catch(bad_alloc&)
|
|
1364 |
{
|
|
1365 |
}
|
|
1366 |
catch(...)
|
|
1367 |
{
|
|
1368 |
failures++;
|
|
1369 |
}
|
|
1370 |
|
|
1371 |
// __UHEAP_MARKEND;
|
|
1372 |
|
|
1373 |
if(failures)
|
|
1374 |
return KErrGeneral;
|
|
1375 |
return KErrNone;
|
|
1376 |
|
|
1377 |
|
|
1378 |
}
|
|
1379 |
|
|
1380 |
|
|
1381 |
//LOGICAL NOT
|
|
1382 |
|
|
1383 |
|
|
1384 |
TInt Ctstl_1::Logical_not(CStifItemParser& aItem)
|
|
1385 |
{
|
|
1386 |
|
|
1387 |
//__UHEAP_MARK;
|
|
1388 |
int failures =0;
|
|
1389 |
|
|
1390 |
|
|
1391 |
try
|
|
1392 |
{
|
|
1393 |
int input1 [4] = { 1, 1, 0, 1 };
|
|
1394 |
|
|
1395 |
int output [4];
|
|
1396 |
#if STDCPP_OOM
|
|
1397 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1398 |
|
|
1399 |
#endif
|
|
1400 |
transform((int*)input1, (int*)input1 + 4, (int*)output, logical_not<bool>());
|
|
1401 |
|
|
1402 |
|
|
1403 |
#if STDCPP_OOM
|
|
1404 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1405 |
|
|
1406 |
|
|
1407 |
#endif
|
|
1408 |
/*
|
|
1409 |
if(output[0] == 0 && output[1] == 0 && output[2] ==1 && output[3] == 0)
|
|
1410 |
|
|
1411 |
//__UHEAP_MARKEND;
|
|
1412 |
|
|
1413 |
return KErrNone;
|
|
1414 |
return KErrGeneral; */
|
|
1415 |
if(output[0] != 0)
|
|
1416 |
failures++;
|
|
1417 |
if(output[1] != 0 )
|
|
1418 |
failures++;
|
|
1419 |
if(output[2] !=1)
|
|
1420 |
failures++;
|
|
1421 |
if( output[3] != 0)
|
|
1422 |
failures++;
|
|
1423 |
|
|
1424 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1425 |
}
|
|
1426 |
catch(bad_alloc&)
|
|
1427 |
{
|
|
1428 |
}
|
|
1429 |
catch(...)
|
|
1430 |
{
|
|
1431 |
failures++;
|
|
1432 |
}
|
|
1433 |
|
|
1434 |
|
|
1435 |
// __UHEAP_MARKEND;
|
|
1436 |
|
|
1437 |
if(failures)
|
|
1438 |
return KErrGeneral;
|
|
1439 |
return KErrNone;
|
|
1440 |
|
|
1441 |
|
|
1442 |
}
|
|
1443 |
|
|
1444 |
|
|
1445 |
//COUNT
|
|
1446 |
|
|
1447 |
|
|
1448 |
|
|
1449 |
TInt Ctstl_1::count_fun(CStifItemParser& aItem)
|
|
1450 |
{
|
|
1451 |
|
|
1452 |
|
|
1453 |
int failures =0;
|
|
1454 |
|
|
1455 |
|
|
1456 |
try
|
|
1457 |
{ // __UHEAP_MARK;
|
|
1458 |
|
|
1459 |
int sequence[10] = {1,2,3,4,5,5,7,8,9,10};
|
|
1460 |
int i=0,j=0,k=0;
|
|
1461 |
vector<int> v(sequence,sequence + 10); // cout<<"";
|
|
1462 |
#if STDCPP_OOM
|
|
1463 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1464 |
|
|
1465 |
#endif
|
|
1466 |
count(v.begin(),v.end(),5,i);
|
|
1467 |
count(v.begin(),v.end(),6,j);
|
|
1468 |
count(v.begin(),v.end(),10,k);
|
|
1469 |
|
|
1470 |
#if STDCPP_OOM
|
|
1471 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1472 |
|
|
1473 |
|
|
1474 |
#endif
|
|
1475 |
/*
|
|
1476 |
if(i==2 && j==0 && k ==1)
|
|
1477 |
|
|
1478 |
//__UHEAP_MARKEND;
|
|
1479 |
return KErrNone;
|
|
1480 |
return KErrGeneral;*/
|
|
1481 |
if(i!=2)
|
|
1482 |
failures++;
|
|
1483 |
if(j!=0)
|
|
1484 |
failures++;
|
|
1485 |
if(k!=1)
|
|
1486 |
failures++;
|
|
1487 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1488 |
|
|
1489 |
}
|
|
1490 |
catch(bad_alloc&)
|
|
1491 |
{
|
|
1492 |
}
|
|
1493 |
catch(...)
|
|
1494 |
{
|
|
1495 |
failures++;
|
|
1496 |
|
|
1497 |
}
|
|
1498 |
|
|
1499 |
// __UHEAP_MARKEND;
|
|
1500 |
|
|
1501 |
if(failures)
|
|
1502 |
return KErrGeneral;
|
|
1503 |
return KErrNone;
|
|
1504 |
|
|
1505 |
}
|
|
1506 |
|
|
1507 |
|
|
1508 |
|
|
1509 |
|
|
1510 |
//COUNTIF
|
|
1511 |
TInt Ctstl_1::countif_fun(CStifItemParser& aItem)
|
|
1512 |
{
|
|
1513 |
|
|
1514 |
//__UHEAP_MARK;
|
|
1515 |
int failures =0;
|
|
1516 |
|
|
1517 |
try
|
|
1518 |
{
|
|
1519 |
int sequence[10] = {1,2,3,4,5,5,7,8,9,10};
|
|
1520 |
int i=0 ,j=0;
|
|
1521 |
vector<int> v(sequence,sequence + 10); // cout<<"";
|
|
1522 |
#if STDCPP_OOM
|
|
1523 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1524 |
|
|
1525 |
#endif
|
|
1526 |
|
|
1527 |
count_if(v.begin(),v.end(),bind2nd(less<int>(),8),i);
|
|
1528 |
count_if(v.begin(),v.end(),bind2nd(less<int>(),1),j);
|
|
1529 |
#if STDCPP_OOM
|
|
1530 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1531 |
|
|
1532 |
|
|
1533 |
#endif
|
|
1534 |
|
|
1535 |
/*
|
|
1536 |
if(i==7 && j==0)
|
|
1537 |
|
|
1538 |
//__UHEAP_MARKEND ;
|
|
1539 |
return KErrNone;
|
|
1540 |
return KErrGeneral;*/
|
|
1541 |
if(i!=7)
|
|
1542 |
failures++;
|
|
1543 |
if(j!=0)
|
|
1544 |
failures++;
|
|
1545 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1546 |
}
|
|
1547 |
catch(bad_alloc&)
|
|
1548 |
{
|
|
1549 |
}
|
|
1550 |
catch(...)
|
|
1551 |
{
|
|
1552 |
failures++;
|
|
1553 |
|
|
1554 |
}
|
|
1555 |
|
|
1556 |
// __UHEAP_MARKEND;
|
|
1557 |
|
|
1558 |
if(failures)
|
|
1559 |
return KErrGeneral;
|
|
1560 |
return KErrNone;
|
|
1561 |
|
|
1562 |
}
|
|
1563 |
|
|
1564 |
|
|
1565 |
//equal
|
|
1566 |
|
|
1567 |
|
|
1568 |
TInt Ctstl_1::equal_fun(CStifItemParser& aItem)
|
|
1569 |
{
|
|
1570 |
|
|
1571 |
|
|
1572 |
//__UHEAP_MARK;
|
|
1573 |
int failures =0;
|
|
1574 |
|
|
1575 |
|
|
1576 |
try
|
|
1577 |
{
|
|
1578 |
int input1 [4] = { 0, 4, 6, -7 };
|
|
1579 |
int input2 [4] = { -0, 34, 6, -7 };
|
|
1580 |
|
|
1581 |
vector<int> v1(input1+0, input1 + 3), v2(input2+0, input2 + 3);
|
|
1582 |
#if STDCPP_OOM
|
|
1583 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1584 |
|
|
1585 |
#endif
|
|
1586 |
// Check for equality
|
|
1587 |
if(equal(v1.begin(),v1.end(),v2.begin()))
|
|
1588 |
failures++;
|
|
1589 |
//__UHEAP_MARKEND;
|
|
1590 |
//return KErrNone;
|
|
1591 |
//return KErrGeneral;
|
|
1592 |
|
|
1593 |
#if STDCPP_OOM
|
|
1594 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1595 |
|
|
1596 |
|
|
1597 |
#endif
|
|
1598 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1599 |
}
|
|
1600 |
catch(bad_alloc&)
|
|
1601 |
{
|
|
1602 |
}
|
|
1603 |
catch(...)
|
|
1604 |
{
|
|
1605 |
failures++;
|
|
1606 |
|
|
1607 |
}
|
|
1608 |
|
|
1609 |
// __UHEAP_MARKEND;
|
|
1610 |
|
|
1611 |
if(failures)
|
|
1612 |
return KErrGeneral;
|
|
1613 |
return KErrNone;
|
|
1614 |
|
|
1615 |
|
|
1616 |
|
|
1617 |
|
|
1618 |
}
|
|
1619 |
|
|
1620 |
|
|
1621 |
|
|
1622 |
|
|
1623 |
|
|
1624 |
|
|
1625 |
//equalto
|
|
1626 |
|
|
1627 |
TInt Ctstl_1::equalto(CStifItemParser& aItem)
|
|
1628 |
{
|
|
1629 |
|
|
1630 |
|
|
1631 |
// __UHEAP_MARK;
|
|
1632 |
int failures =0;
|
|
1633 |
|
|
1634 |
try
|
|
1635 |
{
|
|
1636 |
int input1 [4] = { 0, 4, 6, -7 };
|
|
1637 |
int input2 [4] = { -0, 34, 6, -7 };
|
|
1638 |
int output [4];
|
|
1639 |
#if STDCPP_OOM
|
|
1640 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1641 |
|
|
1642 |
#endif
|
|
1643 |
|
|
1644 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, equal_to<int>());
|
|
1645 |
#if STDCPP_OOM
|
|
1646 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1647 |
|
|
1648 |
|
|
1649 |
#endif
|
|
1650 |
/*
|
|
1651 |
if(output[0] == 1 && output[1] == 0 && output[2] ==1 && output[3] == 1)
|
|
1652 |
|
|
1653 |
//__UHEAP_MARKEND;
|
|
1654 |
|
|
1655 |
return KErrNone;
|
|
1656 |
return KErrGeneral;*/
|
|
1657 |
if(output[0] != 1)
|
|
1658 |
failures++;
|
|
1659 |
if(output[1] != 0 )
|
|
1660 |
failures++;
|
|
1661 |
if(output[2] !=1)
|
|
1662 |
failures++;
|
|
1663 |
if( output[3] != 1)
|
|
1664 |
failures++;
|
|
1665 |
|
|
1666 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1667 |
}
|
|
1668 |
catch(bad_alloc&)
|
|
1669 |
{
|
|
1670 |
}
|
|
1671 |
catch(...)
|
|
1672 |
{
|
|
1673 |
failures++;
|
|
1674 |
|
|
1675 |
}
|
|
1676 |
|
|
1677 |
// __UHEAP_MARKEND;
|
|
1678 |
|
|
1679 |
if(failures)
|
|
1680 |
return KErrGeneral;
|
|
1681 |
return KErrNone;
|
|
1682 |
}
|
|
1683 |
|
|
1684 |
|
|
1685 |
//NOTEQUAL TO
|
|
1686 |
|
|
1687 |
TInt Ctstl_1::notequalto(CStifItemParser& aItem)
|
|
1688 |
{
|
|
1689 |
int failures =0;
|
|
1690 |
|
|
1691 |
|
|
1692 |
try
|
|
1693 |
{
|
|
1694 |
|
|
1695 |
//__UHEAP_MARK;
|
|
1696 |
int input1 [4] = { 0, 4, 6, -7 };
|
|
1697 |
int input2 [4] = { -0, 34, 6, -7 };
|
|
1698 |
int output [4];
|
|
1699 |
#if STDCPP_OOM
|
|
1700 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1701 |
|
|
1702 |
#endif
|
|
1703 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, not_equal_to<int>());
|
|
1704 |
|
|
1705 |
#if STDCPP_OOM
|
|
1706 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1707 |
|
|
1708 |
|
|
1709 |
#endif
|
|
1710 |
/*
|
|
1711 |
if(output[0] == 0 && output[1] == 1 && output[2] ==0 && output[3] == 0)
|
|
1712 |
|
|
1713 |
//__UHEAP_MARKEND;
|
|
1714 |
|
|
1715 |
return KErrNone;
|
|
1716 |
return KErrGeneral;*/
|
|
1717 |
if(output[0] != 0)
|
|
1718 |
failures++;
|
|
1719 |
if(output[1] != 1)
|
|
1720 |
failures++;
|
|
1721 |
if(output[2] !=0)
|
|
1722 |
failures++;
|
|
1723 |
if( output[3] != 0)
|
|
1724 |
failures++;
|
|
1725 |
|
|
1726 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1727 |
|
|
1728 |
|
|
1729 |
}
|
|
1730 |
catch(bad_alloc&)
|
|
1731 |
{
|
|
1732 |
}
|
|
1733 |
catch(...)
|
|
1734 |
{
|
|
1735 |
failures++;
|
|
1736 |
|
|
1737 |
}
|
|
1738 |
|
|
1739 |
// __UHEAP_MARKEND;
|
|
1740 |
|
|
1741 |
if(failures)
|
|
1742 |
return KErrGeneral;
|
|
1743 |
return KErrNone;
|
|
1744 |
}
|
|
1745 |
|
|
1746 |
|
|
1747 |
|
|
1748 |
|
|
1749 |
//sort
|
|
1750 |
|
|
1751 |
TInt Ctstl_1::sort_fun(CStifItemParser& aItem)
|
|
1752 |
{
|
|
1753 |
|
|
1754 |
int failures =0;
|
|
1755 |
|
|
1756 |
|
|
1757 |
try
|
|
1758 |
{
|
|
1759 |
// __UHEAP_MARK;
|
|
1760 |
int sequence[7] = {6262, 6262, 41 ,18467, 6334, 26500, 19169 };
|
|
1761 |
vector <int>::iterator Iter1;
|
|
1762 |
|
|
1763 |
int output[7];
|
|
1764 |
|
|
1765 |
vector<int> v1(sequence,sequence + 7); // cout<<"";
|
|
1766 |
#if STDCPP_OOM
|
|
1767 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1768 |
|
|
1769 |
#endif
|
|
1770 |
sort( v1.begin( ), v1.end( ) );
|
|
1771 |
#if STDCPP_OOM
|
|
1772 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1773 |
|
|
1774 |
|
|
1775 |
#endif
|
|
1776 |
for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )
|
|
1777 |
|
|
1778 |
{
|
|
1779 |
static int i = 0;
|
|
1780 |
|
|
1781 |
output[i] = *Iter1;
|
|
1782 |
i++;
|
|
1783 |
|
|
1784 |
}
|
|
1785 |
|
|
1786 |
/*(output[0] == 41 && output[1] == 6262 && output[2] == 6262 && output[3] == 6334 && output[4] == 18467 && output[5] == 19169 && output[6] == 26500)
|
|
1787 |
|
|
1788 |
// __UHEAP_MARKEND;
|
|
1789 |
|
|
1790 |
return KErrNone ;
|
|
1791 |
return KErrGeneral;*/
|
|
1792 |
if(output[0] != 41)
|
|
1793 |
failures++;
|
|
1794 |
if(output[1] != 6262)
|
|
1795 |
failures++;
|
|
1796 |
if(output[2] !=6262)
|
|
1797 |
failures++;
|
|
1798 |
if( output[3] != 6334)
|
|
1799 |
failures++;
|
|
1800 |
if(output[4] != 18467)
|
|
1801 |
failures++;
|
|
1802 |
if(output[5] !=19169)
|
|
1803 |
failures++;
|
|
1804 |
if( output[6] != 26500)
|
|
1805 |
failures++;
|
|
1806 |
|
|
1807 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1808 |
}
|
|
1809 |
catch(bad_alloc&)
|
|
1810 |
{
|
|
1811 |
}
|
|
1812 |
catch(...)
|
|
1813 |
{
|
|
1814 |
failures++;
|
|
1815 |
|
|
1816 |
}
|
|
1817 |
|
|
1818 |
// __UHEAP_MARKEND;
|
|
1819 |
|
|
1820 |
if(failures)
|
|
1821 |
return KErrGeneral;
|
|
1822 |
return KErrNone;
|
|
1823 |
|
|
1824 |
}
|
|
1825 |
|
|
1826 |
|
|
1827 |
|
|
1828 |
|
|
1829 |
//less_equal
|
|
1830 |
|
|
1831 |
TInt Ctstl_1::less_equal_fun(CStifItemParser& aItem)
|
|
1832 |
{
|
|
1833 |
|
|
1834 |
|
|
1835 |
// __UHEAP_MARK;
|
|
1836 |
int failures =0;
|
|
1837 |
|
|
1838 |
|
|
1839 |
try
|
|
1840 |
{
|
|
1841 |
int sequence[7] = {6262, 6262, 41 ,18467, 6334, 26500, 19169 };
|
|
1842 |
vector <int>::iterator Iter1;
|
|
1843 |
|
|
1844 |
int output[7];
|
|
1845 |
|
|
1846 |
vector<int> v1(sequence,sequence + 7);
|
|
1847 |
#if STDCPP_OOM
|
|
1848 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1849 |
|
|
1850 |
#endif
|
|
1851 |
sort( v1.begin( ), v1.end( ),less_equal<int>( ) );
|
|
1852 |
#if STDCPP_OOM
|
|
1853 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1854 |
|
|
1855 |
|
|
1856 |
#endif
|
|
1857 |
for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )
|
|
1858 |
|
|
1859 |
{
|
|
1860 |
static int i = 0;
|
|
1861 |
|
|
1862 |
output[i] = *Iter1;
|
|
1863 |
i++;
|
|
1864 |
|
|
1865 |
}
|
|
1866 |
|
|
1867 |
/* if(output[0] == 41 && output[1] == 6262 && output[2] == 6262 && output[3] == 6334 && output[4] == 18467 && output[5] == 19169 && output[6] == 26500)
|
|
1868 |
|
|
1869 |
// __UHEAP_MARKEND;
|
|
1870 |
|
|
1871 |
|
|
1872 |
return KErrNone ;
|
|
1873 |
return KErrGeneral;*/
|
|
1874 |
if(output[0] != 41)
|
|
1875 |
failures++;
|
|
1876 |
if(output[1] != 6262)
|
|
1877 |
failures++;
|
|
1878 |
if(output[2] !=6262)
|
|
1879 |
failures++;
|
|
1880 |
if( output[3] != 6334)
|
|
1881 |
failures++;
|
|
1882 |
if(output[4] != 18467)
|
|
1883 |
failures++;
|
|
1884 |
if(output[5] !=19169)
|
|
1885 |
failures++;
|
|
1886 |
if( output[6] != 26500)
|
|
1887 |
failures++;
|
|
1888 |
|
|
1889 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1890 |
|
|
1891 |
}
|
|
1892 |
catch(bad_alloc&)
|
|
1893 |
{
|
|
1894 |
}
|
|
1895 |
catch(...)
|
|
1896 |
{
|
|
1897 |
failures++;
|
|
1898 |
|
|
1899 |
}
|
|
1900 |
|
|
1901 |
// __UHEAP_MARKEND;
|
|
1902 |
|
|
1903 |
if(failures)
|
|
1904 |
return KErrGeneral;
|
|
1905 |
return KErrNone;
|
|
1906 |
}
|
|
1907 |
|
|
1908 |
|
|
1909 |
|
|
1910 |
|
|
1911 |
|
|
1912 |
//greater_equal
|
|
1913 |
|
|
1914 |
TInt Ctstl_1::greater_equal_fun(CStifItemParser& aItem)
|
|
1915 |
{
|
|
1916 |
|
|
1917 |
|
|
1918 |
// __UHEAP_MARK;
|
|
1919 |
int failures =0;
|
|
1920 |
|
|
1921 |
|
|
1922 |
try
|
|
1923 |
{
|
|
1924 |
int sequence[7] = {6262, 6262, 41 ,18467, 6334, 26500, 19169 };
|
|
1925 |
vector <int>::iterator Iter1;
|
|
1926 |
|
|
1927 |
int output[7];
|
|
1928 |
|
|
1929 |
vector<int> v1(sequence,sequence + 7);
|
|
1930 |
#if STDCPP_OOM
|
|
1931 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
1932 |
|
|
1933 |
#endif
|
|
1934 |
sort( v1.begin( ), v1.end( ) ,greater_equal<int>( ) );
|
|
1935 |
#if STDCPP_OOM
|
|
1936 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
1937 |
|
|
1938 |
|
|
1939 |
#endif
|
|
1940 |
for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )
|
|
1941 |
|
|
1942 |
{
|
|
1943 |
static int i = 0;
|
|
1944 |
|
|
1945 |
output[i] = *Iter1;
|
|
1946 |
i++;
|
|
1947 |
|
|
1948 |
}
|
|
1949 |
|
|
1950 |
/* if(output[6] == 41 && output[5] == 6262 && output[4] == 6262 && output[3] == 6334 && output[2] == 18467 && output[1] == 19169 && output[0] == 26500)
|
|
1951 |
|
|
1952 |
// __UHEAP_MARKEND;
|
|
1953 |
|
|
1954 |
return KErrNone ;
|
|
1955 |
return KErrGeneral;*/
|
|
1956 |
if(output[6] != 41)
|
|
1957 |
failures++;
|
|
1958 |
if(output[5] != 6262)
|
|
1959 |
failures++;
|
|
1960 |
if(output[4] !=6262)
|
|
1961 |
failures++;
|
|
1962 |
if( output[3] != 6334)
|
|
1963 |
failures++;
|
|
1964 |
if(output[2] != 18467)
|
|
1965 |
failures++;
|
|
1966 |
if(output[1] !=19169)
|
|
1967 |
failures++;
|
|
1968 |
if( output[0] != 26500)
|
|
1969 |
failures++;
|
|
1970 |
|
|
1971 |
//#if STDCPP_OOM //failures++; //#endif
|
|
1972 |
}
|
|
1973 |
catch(bad_alloc&)
|
|
1974 |
{
|
|
1975 |
}
|
|
1976 |
catch(...)
|
|
1977 |
{
|
|
1978 |
failures++;
|
|
1979 |
|
|
1980 |
}
|
|
1981 |
|
|
1982 |
// __UHEAP_MARKEND;
|
|
1983 |
|
|
1984 |
if(failures)
|
|
1985 |
return KErrGeneral;
|
|
1986 |
return KErrNone;
|
|
1987 |
}
|
|
1988 |
|
|
1989 |
|
|
1990 |
|
|
1991 |
//greater
|
|
1992 |
|
|
1993 |
TInt Ctstl_1::greater_fun(CStifItemParser& aItem)
|
|
1994 |
{
|
|
1995 |
|
|
1996 |
int failures =0;
|
|
1997 |
|
|
1998 |
|
|
1999 |
try
|
|
2000 |
{
|
|
2001 |
//__UHEAP_MARK;
|
|
2002 |
int input1 [4] = { 0, 4, 6, 8 };
|
|
2003 |
int input2 [4] = { -0, 34, 6, -7 };
|
|
2004 |
int output [4];
|
|
2005 |
#if STDCPP_OOM
|
|
2006 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2007 |
|
|
2008 |
#endif
|
|
2009 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, greater<int>());
|
|
2010 |
#if STDCPP_OOM
|
|
2011 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2012 |
|
|
2013 |
|
|
2014 |
#endif
|
|
2015 |
// After this call to transform, output will contain a "1" if input1
|
|
2016 |
//was greater than input2 or a "0" if input1 was less than or equal to
|
|
2017 |
//input2.
|
|
2018 |
/*
|
|
2019 |
if(output[0] == 0 && output[1] == 0 && output[2] == 0 && output[3] == 1)
|
|
2020 |
// __UHEAP_MARKEND;
|
|
2021 |
return KErrNone;
|
|
2022 |
return KErrGeneral;*/
|
|
2023 |
if(output[0] != 0)
|
|
2024 |
failures++;
|
|
2025 |
if(output[1] != 0)
|
|
2026 |
failures++;
|
|
2027 |
if(output[2] !=0)
|
|
2028 |
failures++;
|
|
2029 |
if( output[3] != 1)
|
|
2030 |
failures++;
|
|
2031 |
|
|
2032 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2033 |
}
|
|
2034 |
catch(bad_alloc&)
|
|
2035 |
{
|
|
2036 |
}
|
|
2037 |
catch(...)
|
|
2038 |
{
|
|
2039 |
failures++;
|
|
2040 |
|
|
2041 |
}
|
|
2042 |
|
|
2043 |
// __UHEAP_MARKEND;
|
|
2044 |
|
|
2045 |
if(failures)
|
|
2046 |
return KErrGeneral;
|
|
2047 |
return KErrNone;
|
|
2048 |
|
|
2049 |
|
|
2050 |
|
|
2051 |
|
|
2052 |
}
|
|
2053 |
|
|
2054 |
|
|
2055 |
//LESS
|
|
2056 |
|
|
2057 |
TInt Ctstl_1::less_fun(CStifItemParser& aItem)
|
|
2058 |
{
|
|
2059 |
// __UHEAP_MARK;
|
|
2060 |
int failures =0;
|
|
2061 |
|
|
2062 |
|
|
2063 |
try
|
|
2064 |
{ int input1 [4] = { 0, 4, 6, 8 };
|
|
2065 |
int input2 [4] = { -0, 34, 6, -7 };
|
|
2066 |
int output [4];
|
|
2067 |
#if STDCPP_OOM
|
|
2068 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2069 |
|
|
2070 |
#endif
|
|
2071 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, less<int>());
|
|
2072 |
#if STDCPP_OOM
|
|
2073 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2074 |
|
|
2075 |
|
|
2076 |
#endif
|
|
2077 |
//After this call to transform, output will contain a "1" if intput1
|
|
2078 |
//was less than input2 or a "0" if intput1 was greater than or equal to
|
|
2079 |
//input2.
|
|
2080 |
|
|
2081 |
/* if(output[0] == 0 && output[1] == 1 && output[2] == 0 && output[3] == 0)
|
|
2082 |
// __UHEAP_MARKEND;
|
|
2083 |
return KErrNone;
|
|
2084 |
return KErrGeneral;*/
|
|
2085 |
if(output[0] != 0)
|
|
2086 |
failures++;
|
|
2087 |
if(output[1] != 1)
|
|
2088 |
failures++;
|
|
2089 |
if(output[2] !=0)
|
|
2090 |
failures++;
|
|
2091 |
if( output[3] != 0)
|
|
2092 |
failures++;
|
|
2093 |
|
|
2094 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2095 |
|
|
2096 |
}
|
|
2097 |
catch(bad_alloc&)
|
|
2098 |
{
|
|
2099 |
}
|
|
2100 |
catch(...)
|
|
2101 |
{
|
|
2102 |
failures++;
|
|
2103 |
|
|
2104 |
}
|
|
2105 |
|
|
2106 |
// __UHEAP_MARKEND;
|
|
2107 |
|
|
2108 |
if(failures)
|
|
2109 |
return KErrGeneral;
|
|
2110 |
return KErrNone;
|
|
2111 |
}
|
|
2112 |
|
|
2113 |
|
|
2114 |
|
|
2115 |
// find code check
|
|
2116 |
//---------------------
|
|
2117 |
|
|
2118 |
TInt Ctstl_1::find_fun(CStifItemParser& aItem)
|
|
2119 |
{
|
|
2120 |
// __UHEAP_MARK;
|
|
2121 |
int failures =0;
|
|
2122 |
|
|
2123 |
try
|
|
2124 |
{ typedef vector<int>::iterator iterator;
|
|
2125 |
int d1[10] = {0,1,2,2,3,4,2,2,6,7};
|
|
2126 |
|
|
2127 |
vector<int> v1(d1,d1 + 10); // cout<<"";
|
|
2128 |
#if STDCPP_OOM
|
|
2129 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2130 |
|
|
2131 |
#endif
|
|
2132 |
|
|
2133 |
iterator it1 = find(v1.begin(),v1.end(),3);
|
|
2134 |
#if STDCPP_OOM
|
|
2135 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2136 |
|
|
2137 |
|
|
2138 |
#endif
|
|
2139 |
//last iterator is returned if unfound
|
|
2140 |
|
|
2141 |
/* if((it1) && ((*it1) == 3) )
|
|
2142 |
|
|
2143 |
|
|
2144 |
|
|
2145 |
// __UHEAP_MARKEND;
|
|
2146 |
return KErrNone;
|
|
2147 |
return KErrGeneral; */
|
|
2148 |
|
|
2149 |
if((it1) && ((*it1) != 3) )
|
|
2150 |
failures++;
|
|
2151 |
//#if STDCPP_OOM
|
|
2152 |
// failures++;
|
|
2153 |
// #endif
|
|
2154 |
}
|
|
2155 |
catch(bad_alloc&)
|
|
2156 |
{
|
|
2157 |
}
|
|
2158 |
catch(...)
|
|
2159 |
{
|
|
2160 |
failures++;
|
|
2161 |
|
|
2162 |
}
|
|
2163 |
|
|
2164 |
// __UHEAP_MARKEND;
|
|
2165 |
|
|
2166 |
if(failures)
|
|
2167 |
return KErrGeneral;
|
|
2168 |
return KErrNone;
|
|
2169 |
|
|
2170 |
|
|
2171 |
}
|
|
2172 |
|
|
2173 |
|
|
2174 |
|
|
2175 |
// find_if
|
|
2176 |
//----------------------
|
|
2177 |
|
|
2178 |
|
|
2179 |
TInt Ctstl_1::findif_fun(CStifItemParser& aItem)
|
|
2180 |
{
|
|
2181 |
|
|
2182 |
//__UHEAP_MARK;
|
|
2183 |
|
|
2184 |
int failures =0;
|
|
2185 |
|
|
2186 |
|
|
2187 |
try
|
|
2188 |
{ typedef vector<int>::iterator iterator;
|
|
2189 |
int d1[10] = {0,1,2,2,3,4,2,2,6,7};
|
|
2190 |
|
|
2191 |
vector<int> v1(d1,d1 + 10); // cout<<"";
|
|
2192 |
#if STDCPP_OOM
|
|
2193 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2194 |
|
|
2195 |
#endif
|
|
2196 |
iterator it1 = find_if(v1.begin(),v1.end(),bind1st(equal_to<int>(),7));
|
|
2197 |
|
|
2198 |
#if STDCPP_OOM
|
|
2199 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2200 |
|
|
2201 |
|
|
2202 |
#endif
|
|
2203 |
//last iterator is returned if unfound
|
|
2204 |
/* if((it1) && ((*it1) == 7) )
|
|
2205 |
|
|
2206 |
//__UHEAP_MARKEND;
|
|
2207 |
return KErrNone;
|
|
2208 |
return KErrGeneral;*/
|
|
2209 |
if((it1) && ((*it1) != 7) )
|
|
2210 |
failures++;
|
|
2211 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2212 |
|
|
2213 |
}
|
|
2214 |
catch(bad_alloc&)
|
|
2215 |
{
|
|
2216 |
}
|
|
2217 |
catch(...)
|
|
2218 |
{
|
|
2219 |
failures++;
|
|
2220 |
|
|
2221 |
}
|
|
2222 |
|
|
2223 |
// __UHEAP_MARKEND;
|
|
2224 |
|
|
2225 |
if(failures)
|
|
2226 |
return KErrGeneral;
|
|
2227 |
return KErrNone;
|
|
2228 |
|
|
2229 |
|
|
2230 |
|
|
2231 |
}
|
|
2232 |
|
|
2233 |
|
|
2234 |
|
|
2235 |
//find_end
|
|
2236 |
|
|
2237 |
TInt Ctstl_1::findend_fun(CStifItemParser& aItem)
|
|
2238 |
{
|
|
2239 |
|
|
2240 |
|
|
2241 |
//__UHEAP_MARK;
|
|
2242 |
int failures =0;
|
|
2243 |
|
|
2244 |
|
|
2245 |
try
|
|
2246 |
{
|
|
2247 |
int array1[12] = {0,5,10,15,20,25,0,5,10,15,20,25};
|
|
2248 |
int array2[3] = {20,30,40 };
|
|
2249 |
int array3[4]= {5,10,15,20 };
|
|
2250 |
int array4[4] ={30,40,50,60 }; //not found iterator
|
|
2251 |
|
|
2252 |
|
|
2253 |
vector <int> v1(array1,array1+12), v2(array2,array2+3),v3(array3,array3+4);
|
|
2254 |
vector<int> v4(array4,array4+4);
|
|
2255 |
// vector <int>::iterator Iter1, Iter2,Iter3 ,Iter4;
|
|
2256 |
|
|
2257 |
|
|
2258 |
|
|
2259 |
|
|
2260 |
vector <int>::iterator result1;
|
|
2261 |
|
|
2262 |
|
|
2263 |
#if STDCPP_OOM
|
|
2264 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2265 |
|
|
2266 |
#endif
|
|
2267 |
result1 = find_end( v1.begin( ), v1.end( ), v3.begin( ), v3.end( ) );
|
|
2268 |
|
|
2269 |
// result2 = find_end ( v1.begin( ), v1.end( ), v4.begin( ), v4.end( ) );
|
|
2270 |
#if STDCPP_OOM
|
|
2271 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2272 |
|
|
2273 |
#endif
|
|
2274 |
|
|
2275 |
/* if((result1 - v1.begin() == 7) && (result1 - v1.begin( ) != 1))
|
|
2276 |
|
|
2277 |
if(result2 == v1.end()) // if not found
|
|
2278 |
|
|
2279 |
// __UHEAP_MARKEND;
|
|
2280 |
return KErrNone;
|
|
2281 |
return KErrGeneral;*/
|
|
2282 |
if((result1 - v1.begin() != 7) && (result1 - v1.begin( ) == 1))
|
|
2283 |
failures++;
|
|
2284 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2285 |
}
|
|
2286 |
catch(bad_alloc&)
|
|
2287 |
{
|
|
2288 |
}
|
|
2289 |
catch(...)
|
|
2290 |
{
|
|
2291 |
failures++;
|
|
2292 |
|
|
2293 |
}
|
|
2294 |
|
|
2295 |
// __UHEAP_MARKEND;
|
|
2296 |
|
|
2297 |
if(failures)
|
|
2298 |
return KErrGeneral;
|
|
2299 |
return KErrNone;
|
|
2300 |
|
|
2301 |
|
|
2302 |
|
|
2303 |
}
|
|
2304 |
|
|
2305 |
|
|
2306 |
//find_first_of
|
|
2307 |
|
|
2308 |
TInt Ctstl_1::findfirstof_fun(CStifItemParser& aItem)
|
|
2309 |
{
|
|
2310 |
|
|
2311 |
int failures =0;
|
|
2312 |
|
|
2313 |
|
|
2314 |
try
|
|
2315 |
{
|
|
2316 |
// __UHEAP_MARK;
|
|
2317 |
int array1[12] = {0,5,10,15,20,25,0,5,10,15,20,25};
|
|
2318 |
int array2[3] = {20,30,40 };
|
|
2319 |
int array3[4]= {5,10,15,20 };
|
|
2320 |
int array4[4] ={30,40,50,60 }; //not found iterator
|
|
2321 |
|
|
2322 |
|
|
2323 |
vector <int> v1(array1,array1+12), v2(array2,array2+3),v3(array3,array3+4);
|
|
2324 |
vector<int> v4(array4,array4+4);
|
|
2325 |
// vector <int>::iterator Iter1, Iter2,Iter3 ,Iter4;
|
|
2326 |
|
|
2327 |
|
|
2328 |
|
|
2329 |
|
|
2330 |
|
|
2331 |
vector <int>::iterator result1,result2;
|
|
2332 |
#if STDCPP_OOM
|
|
2333 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2334 |
|
|
2335 |
#endif
|
|
2336 |
result1 = find_first_of( v1.begin( ), v1.end( ), v3.begin( ), v3.end( ) );
|
|
2337 |
|
|
2338 |
result2 = find_first_of( v1.begin( ), v1.end( ), v4.begin( ), v4.end( ) );
|
|
2339 |
#if STDCPP_OOM
|
|
2340 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2341 |
|
|
2342 |
|
|
2343 |
#endif
|
|
2344 |
if((result1 - v1.begin() == 1) && (result1 - v1.begin( ) != 7))
|
|
2345 |
|
|
2346 |
|
|
2347 |
|
|
2348 |
/* if(result2 == v1.end()) // if not found
|
|
2349 |
// __UHEAP_MARKEND;
|
|
2350 |
|
|
2351 |
return KErrNone;
|
|
2352 |
return KErrGeneral;*/
|
|
2353 |
|
|
2354 |
if(result2 != v1.end())
|
|
2355 |
failures++;
|
|
2356 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2357 |
|
|
2358 |
}
|
|
2359 |
catch(bad_alloc&)
|
|
2360 |
{
|
|
2361 |
}
|
|
2362 |
catch(...)
|
|
2363 |
{
|
|
2364 |
failures++;
|
|
2365 |
|
|
2366 |
}
|
|
2367 |
|
|
2368 |
// __UHEAP_MARKEND;
|
|
2369 |
|
|
2370 |
if(failures)
|
|
2371 |
return KErrGeneral;
|
|
2372 |
return KErrNone;
|
|
2373 |
|
|
2374 |
|
|
2375 |
}
|
|
2376 |
|
|
2377 |
|
|
2378 |
|
|
2379 |
|
|
2380 |
TInt Ctstl_1::Minus(CStifItemParser& aItem)
|
|
2381 |
{
|
|
2382 |
|
|
2383 |
int failures =0;
|
|
2384 |
|
|
2385 |
try
|
|
2386 |
{
|
|
2387 |
//__UHEAP_MARK;
|
|
2388 |
int input1 [4] = { 10, 20, 30, 40 };
|
|
2389 |
int input2 [4] = { 40, 30, 20, 10 };
|
|
2390 |
int output [4];
|
|
2391 |
#if STDCPP_OOM
|
|
2392 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2393 |
|
|
2394 |
#endif
|
|
2395 |
|
|
2396 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, minus<int>());
|
|
2397 |
#if STDCPP_OOM
|
|
2398 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2399 |
|
|
2400 |
|
|
2401 |
#endif
|
|
2402 |
|
|
2403 |
/* if(output[0] == -30 && output[1] == -10 && output[2] ==10 && output[3] == 30)
|
|
2404 |
|
|
2405 |
// __UHEAP_MARKEND;
|
|
2406 |
return KErrNone;
|
|
2407 |
return KErrGeneral; */
|
|
2408 |
if(output[0] != -30)
|
|
2409 |
failures++;
|
|
2410 |
if(output[1] != -10)
|
|
2411 |
failures++;
|
|
2412 |
if(output[2] != 10)
|
|
2413 |
failures++;
|
|
2414 |
if( output[3] != 30)
|
|
2415 |
failures++;
|
|
2416 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2417 |
|
|
2418 |
}
|
|
2419 |
catch(bad_alloc&)
|
|
2420 |
{
|
|
2421 |
}
|
|
2422 |
catch(...)
|
|
2423 |
{
|
|
2424 |
failures++;
|
|
2425 |
|
|
2426 |
}
|
|
2427 |
|
|
2428 |
// __UHEAP_MARKEND;
|
|
2429 |
|
|
2430 |
if(failures)
|
|
2431 |
return KErrGeneral;
|
|
2432 |
return KErrNone;
|
|
2433 |
}
|
|
2434 |
|
|
2435 |
|
|
2436 |
TInt Ctstl_1::Plus(CStifItemParser& aItem)
|
|
2437 |
{
|
|
2438 |
|
|
2439 |
int failures =0;
|
|
2440 |
|
|
2441 |
|
|
2442 |
try
|
|
2443 |
{
|
|
2444 |
//__UHEAP_MARK;
|
|
2445 |
int input1 [4] = { -10, 20, 30, 40 };
|
|
2446 |
int input2 [4] = { 40, 30, 20, -10 };
|
|
2447 |
int output [4];
|
|
2448 |
#if STDCPP_OOM
|
|
2449 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2450 |
|
|
2451 |
#endif
|
|
2452 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, plus<int>());
|
|
2453 |
|
|
2454 |
#if STDCPP_OOM
|
|
2455 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2456 |
|
|
2457 |
|
|
2458 |
#endif
|
|
2459 |
/* if(output[0] == 30 && output[1] == 50 && output[2] ==50 && output[3] == 30)
|
|
2460 |
|
|
2461 |
// __UHEAP_MARKEND;
|
|
2462 |
return KErrNone;
|
|
2463 |
return KErrGeneral;
|
|
2464 |
*/
|
|
2465 |
if(output[0] != 30)
|
|
2466 |
failures++;
|
|
2467 |
if(output[1] != 50)
|
|
2468 |
failures++;
|
|
2469 |
if(output[2] != 50)
|
|
2470 |
failures++;
|
|
2471 |
if( output[3] != 30)
|
|
2472 |
failures++;
|
|
2473 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2474 |
}
|
|
2475 |
catch(bad_alloc&)
|
|
2476 |
{
|
|
2477 |
}
|
|
2478 |
catch(...)
|
|
2479 |
{
|
|
2480 |
failures++;
|
|
2481 |
|
|
2482 |
}
|
|
2483 |
|
|
2484 |
// __UHEAP_MARKEND;
|
|
2485 |
|
|
2486 |
if(failures)
|
|
2487 |
return KErrGeneral;
|
|
2488 |
return KErrNone;
|
|
2489 |
}
|
|
2490 |
|
|
2491 |
|
|
2492 |
|
|
2493 |
TInt Ctstl_1::Divides(CStifItemParser& aItem)
|
|
2494 |
{
|
|
2495 |
|
|
2496 |
int input1 [4] = { -10, 20, 30,40 };
|
|
2497 |
int input2 [4] = { 40, 30, 20,4 };
|
|
2498 |
int output [4];
|
|
2499 |
|
|
2500 |
|
|
2501 |
|
|
2502 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, divides<int>());
|
|
2503 |
|
|
2504 |
|
|
2505 |
if(output[0] == (-10/40) && output[1] == (20/30) && output[2] ==(30/20))
|
|
2506 |
return KErrNone;
|
|
2507 |
return KErrGeneral;
|
|
2508 |
|
|
2509 |
|
|
2510 |
|
|
2511 |
|
|
2512 |
|
|
2513 |
|
|
2514 |
}
|
|
2515 |
|
|
2516 |
|
|
2517 |
|
|
2518 |
TInt Ctstl_1::Modulus(CStifItemParser& aItem)
|
|
2519 |
{
|
|
2520 |
|
|
2521 |
int failures =0;
|
|
2522 |
|
|
2523 |
|
|
2524 |
try
|
|
2525 |
{
|
|
2526 |
//__UHEAP_MARK;
|
|
2527 |
int input1 [4] = { -10, 20, 30, 40 };
|
|
2528 |
int input2 [4] = { 40, 30, 20, -10 };
|
|
2529 |
int output [4];
|
|
2530 |
#if STDCPP_OOM
|
|
2531 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2532 |
|
|
2533 |
#endif
|
|
2534 |
transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, modulus<int>());
|
|
2535 |
|
|
2536 |
#if STDCPP_OOM
|
|
2537 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2538 |
|
|
2539 |
|
|
2540 |
#endif
|
|
2541 |
/*if(output[0] == (-10%40) && output[1] == (20%30) && output[2] ==(30%20) && output[3] == (40%-10))
|
|
2542 |
|
|
2543 |
//__UHEAP_MARKEND;
|
|
2544 |
return KErrNone;
|
|
2545 |
return KErrGeneral; */
|
|
2546 |
|
|
2547 |
if(output[0] != (-10%40))
|
|
2548 |
failures++;
|
|
2549 |
if(output[1] != (20%30))
|
|
2550 |
failures++;
|
|
2551 |
if(output[2] != (30%20))
|
|
2552 |
failures++;
|
|
2553 |
if( output[3] != (40%-10))
|
|
2554 |
failures++;
|
|
2555 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2556 |
|
|
2557 |
}
|
|
2558 |
catch(bad_alloc&)
|
|
2559 |
{
|
|
2560 |
}
|
|
2561 |
catch(...)
|
|
2562 |
{
|
|
2563 |
failures++;
|
|
2564 |
|
|
2565 |
}
|
|
2566 |
|
|
2567 |
// __UHEAP_MARKEND;
|
|
2568 |
|
|
2569 |
if(failures)
|
|
2570 |
return KErrGeneral;
|
|
2571 |
return KErrNone;
|
|
2572 |
|
|
2573 |
}
|
|
2574 |
|
|
2575 |
|
|
2576 |
TInt Ctstl_1::Negate(CStifItemParser& aItem)
|
|
2577 |
{
|
|
2578 |
|
|
2579 |
int failures =0;
|
|
2580 |
|
|
2581 |
|
|
2582 |
try
|
|
2583 |
{
|
|
2584 |
//__UHEAP_MARK;
|
|
2585 |
int input1 [4] = { 10, 20, 30, 40 };
|
|
2586 |
int output[4];
|
|
2587 |
#if STDCPP_OOM
|
|
2588 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2589 |
|
|
2590 |
#endif
|
|
2591 |
transform((int*)input1, (int*)input1 + 4 , (int*)output, negate<int>());
|
|
2592 |
|
|
2593 |
#if STDCPP_OOM
|
|
2594 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2595 |
|
|
2596 |
|
|
2597 |
#endif
|
|
2598 |
/* if(output[0] == -10 && output[1] == (-20) && output[2] ==(-30) && output[3] == (-40))
|
|
2599 |
|
|
2600 |
|
|
2601 |
//__UHEAP_MARKEND;
|
|
2602 |
|
|
2603 |
return KErrNone;
|
|
2604 |
return KErrGeneral; */
|
|
2605 |
if(output[0] != -10)
|
|
2606 |
failures++;
|
|
2607 |
if(output[1] != -20)
|
|
2608 |
failures++;
|
|
2609 |
if(output[2] != -30)
|
|
2610 |
failures++;
|
|
2611 |
if( output[3] != -40)
|
|
2612 |
failures++;
|
|
2613 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2614 |
|
|
2615 |
}
|
|
2616 |
catch(bad_alloc&)
|
|
2617 |
{
|
|
2618 |
}
|
|
2619 |
catch(...)
|
|
2620 |
{
|
|
2621 |
failures++;
|
|
2622 |
|
|
2623 |
}
|
|
2624 |
|
|
2625 |
// __UHEAP_MARKEND;
|
|
2626 |
|
|
2627 |
if(failures)
|
|
2628 |
return KErrGeneral;
|
|
2629 |
return KErrNone;
|
|
2630 |
}
|
|
2631 |
|
|
2632 |
|
|
2633 |
|
|
2634 |
|
|
2635 |
TInt Ctstl_1::Logicalnot(CStifItemParser& aItem)
|
|
2636 |
{
|
|
2637 |
|
|
2638 |
int failures =0;
|
|
2639 |
|
|
2640 |
|
|
2641 |
try
|
|
2642 |
{
|
|
2643 |
//__UHEAP_MARK;
|
|
2644 |
bool input1 [2] = { 0,1 };
|
|
2645 |
|
|
2646 |
bool output [2];
|
|
2647 |
#if STDCPP_OOM
|
|
2648 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2649 |
|
|
2650 |
#endif
|
|
2651 |
transform((bool*)input1, (bool*)input1 + 2, (bool*)output, logical_not<bool>());
|
|
2652 |
#if STDCPP_OOM
|
|
2653 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2654 |
|
|
2655 |
|
|
2656 |
#endif
|
|
2657 |
|
|
2658 |
|
|
2659 |
/*if(output[0] == 1 && output[1] == 0 )
|
|
2660 |
// __UHEAP_MARKEND;
|
|
2661 |
|
|
2662 |
return KErrNone;
|
|
2663 |
return KErrGeneral; */
|
|
2664 |
if(output[0] != 1)
|
|
2665 |
failures++;
|
|
2666 |
if(output[1] != 0)
|
|
2667 |
failures++;
|
|
2668 |
|
|
2669 |
//#if STDCPP_OOM
|
|
2670 |
//failures++;
|
|
2671 |
//#endif
|
|
2672 |
|
|
2673 |
}
|
|
2674 |
catch(bad_alloc&)
|
|
2675 |
{
|
|
2676 |
}
|
|
2677 |
catch(...)
|
|
2678 |
{
|
|
2679 |
failures++;
|
|
2680 |
|
|
2681 |
}
|
|
2682 |
|
|
2683 |
// __UHEAP_MARKEND;
|
|
2684 |
|
|
2685 |
if(failures)
|
|
2686 |
return KErrGeneral;
|
|
2687 |
return KErrNone;
|
|
2688 |
|
|
2689 |
}
|
|
2690 |
|
|
2691 |
|
|
2692 |
|
|
2693 |
TInt Ctstl_1::Logicaland(CStifItemParser& aItem)
|
|
2694 |
{
|
|
2695 |
|
|
2696 |
int failures =0;
|
|
2697 |
|
|
2698 |
|
|
2699 |
try
|
|
2700 |
{
|
|
2701 |
//__UHEAP_MARK;
|
|
2702 |
bool input1 [4] = { 1, 0, 0, 1 };
|
|
2703 |
bool input2 [4] = { 0, 1, 0, 1 };
|
|
2704 |
bool output [4];
|
|
2705 |
|
|
2706 |
#if STDCPP_OOM
|
|
2707 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2708 |
|
|
2709 |
#endif
|
|
2710 |
transform((bool*)input1, (bool*)input1 + 4, (bool*)input2, (bool*)output, logical_and<bool>());
|
|
2711 |
|
|
2712 |
|
|
2713 |
#if STDCPP_OOM
|
|
2714 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2715 |
|
|
2716 |
|
|
2717 |
#endif
|
|
2718 |
/* if(output[0] == 0 && output[1] == 0 && output[2] ==0 && output[3] == 1)
|
|
2719 |
|
|
2720 |
// __UHEAP_MARKEND;
|
|
2721 |
return KErrNone;
|
|
2722 |
return KErrGeneral;*/
|
|
2723 |
if(output[0] != 0)
|
|
2724 |
failures++;
|
|
2725 |
if( output[1] != 0)
|
|
2726 |
failures++;
|
|
2727 |
if(output[2] !=0)
|
|
2728 |
failures++;
|
|
2729 |
if(output[3] != 1)
|
|
2730 |
failures++;
|
|
2731 |
|
|
2732 |
//#if STDCPP_OOM
|
|
2733 |
// failures++;
|
|
2734 |
// #endif
|
|
2735 |
}
|
|
2736 |
catch(bad_alloc&)
|
|
2737 |
{
|
|
2738 |
}
|
|
2739 |
catch(...)
|
|
2740 |
{
|
|
2741 |
failures++;
|
|
2742 |
|
|
2743 |
}
|
|
2744 |
// __UHEAP_MARKEND;
|
|
2745 |
|
|
2746 |
if(failures)
|
|
2747 |
return KErrGeneral;
|
|
2748 |
return KErrNone;
|
|
2749 |
}
|
|
2750 |
|
|
2751 |
|
|
2752 |
|
|
2753 |
|
|
2754 |
TInt Ctstl_1::Logicalor(CStifItemParser& aItem)
|
|
2755 |
{
|
|
2756 |
|
|
2757 |
int failures =0;
|
|
2758 |
|
|
2759 |
|
|
2760 |
try
|
|
2761 |
{
|
|
2762 |
//__UHEAP_MARK;
|
|
2763 |
bool input1 [4] = { 1, 0, 0, 1 };
|
|
2764 |
bool input2 [4] = { 0, 1, 0, 1};
|
|
2765 |
bool output [4];
|
|
2766 |
#if STDCPP_OOM
|
|
2767 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2768 |
|
|
2769 |
#endif
|
|
2770 |
transform((bool*)input1, (bool*)input1 + 4, (bool*)input2, (bool*)output, logical_or<bool>());
|
|
2771 |
#if STDCPP_OOM
|
|
2772 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2773 |
|
|
2774 |
|
|
2775 |
#endif
|
|
2776 |
|
|
2777 |
// if(output[0] == 1 && output[1] == 1 && output[2] == 0 && output[3] == 1)
|
|
2778 |
|
|
2779 |
//__UHEAP_MARKEND;
|
|
2780 |
// return KErrNone;
|
|
2781 |
//return KErrGeneral;
|
|
2782 |
|
|
2783 |
if(output[0] != 1)
|
|
2784 |
failures++;
|
|
2785 |
if( output[1] != 1)
|
|
2786 |
failures++;
|
|
2787 |
if(output[2] !=0)
|
|
2788 |
failures++;
|
|
2789 |
if(output[3] != 1)
|
|
2790 |
failures++;
|
|
2791 |
//#if STDCPP_OOM
|
|
2792 |
// failures++;
|
|
2793 |
//#endif
|
|
2794 |
}
|
|
2795 |
catch(bad_alloc&)
|
|
2796 |
{
|
|
2797 |
}
|
|
2798 |
catch(...)
|
|
2799 |
{
|
|
2800 |
failures++;
|
|
2801 |
|
|
2802 |
}
|
|
2803 |
|
|
2804 |
// __UHEAP_MARKEND;
|
|
2805 |
|
|
2806 |
if(failures)
|
|
2807 |
return KErrGeneral;
|
|
2808 |
return KErrNone;
|
|
2809 |
}
|
|
2810 |
|
|
2811 |
//remove
|
|
2812 |
|
|
2813 |
TInt Ctstl_1::Remove(CStifItemParser& aItem)
|
|
2814 |
{
|
|
2815 |
|
|
2816 |
int failures =0;
|
|
2817 |
|
|
2818 |
try
|
|
2819 |
{
|
|
2820 |
// __UHEAP_MARK;
|
|
2821 |
int arr[10] = {1,2,3,4,5,6,7,8,7,9};
|
|
2822 |
vector<int> v(arr, arr+10);
|
|
2823 |
|
|
2824 |
int size1 = sizeof(arr);
|
|
2825 |
|
|
2826 |
#if STDCPP_OOM
|
|
2827 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2828 |
|
|
2829 |
#endif
|
|
2830 |
|
|
2831 |
// remove the 7
|
|
2832 |
vector<int>::iterator result =
|
|
2833 |
remove(v.begin(), v.end(), 7);
|
|
2834 |
#if STDCPP_OOM
|
|
2835 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2836 |
|
|
2837 |
|
|
2838 |
#endif
|
|
2839 |
|
|
2840 |
for ( result = v.begin( ) ; result != v.end( ) ; result++ )
|
|
2841 |
|
|
2842 |
{
|
|
2843 |
static int i = 0;
|
|
2844 |
|
|
2845 |
arr[i] = *result;
|
|
2846 |
i++;
|
|
2847 |
|
|
2848 |
}
|
|
2849 |
|
|
2850 |
int size2 = sizeof(arr);
|
|
2851 |
|
|
2852 |
/* if(arr[6] != 7 && arr[6]==8 )
|
|
2853 |
if(arr[0]==1)
|
|
2854 |
if(arr[1]==2)
|
|
2855 |
if(arr[2]==3)
|
|
2856 |
if(arr[3]==4)
|
|
2857 |
if(arr[4]==5)
|
|
2858 |
if(arr[5]==6)
|
|
2859 |
if(arr[6]==8)
|
|
2860 |
if(arr[7]==9)
|
|
2861 |
if(size1==size2)
|
|
2862 |
// __UHEAP_MARKEND;
|
|
2863 |
return KErrNone;
|
|
2864 |
return KErrGeneral;*/
|
|
2865 |
if(arr[0]!=1)
|
|
2866 |
failures++;
|
|
2867 |
if(arr[1]!=2)
|
|
2868 |
failures++;
|
|
2869 |
if(arr[2]!=3)
|
|
2870 |
failures++;
|
|
2871 |
if(arr[3]!=4)
|
|
2872 |
failures++;
|
|
2873 |
if(arr[4]!=5)
|
|
2874 |
failures++;
|
|
2875 |
if(arr[5]!=6)
|
|
2876 |
failures++;
|
|
2877 |
if(arr[6]!=8)
|
|
2878 |
failures++;
|
|
2879 |
if(arr[7]!=9)
|
|
2880 |
failures++;
|
|
2881 |
if(size1!=size2)
|
|
2882 |
failures++;
|
|
2883 |
|
|
2884 |
|
|
2885 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2886 |
}
|
|
2887 |
catch(bad_alloc&)
|
|
2888 |
{
|
|
2889 |
}
|
|
2890 |
catch(...)
|
|
2891 |
{
|
|
2892 |
failures++;
|
|
2893 |
|
|
2894 |
}
|
|
2895 |
|
|
2896 |
// __UHEAP_MARKEND;
|
|
2897 |
|
|
2898 |
if(failures)
|
|
2899 |
return KErrGeneral;
|
|
2900 |
return KErrNone;
|
|
2901 |
|
|
2902 |
}
|
|
2903 |
|
|
2904 |
|
|
2905 |
|
|
2906 |
TInt Ctstl_1::Removeif(CStifItemParser& aItem)
|
|
2907 |
{
|
|
2908 |
|
|
2909 |
int failures =0;
|
|
2910 |
|
|
2911 |
|
|
2912 |
try
|
|
2913 |
{
|
|
2914 |
// __UHEAP_MARK;
|
|
2915 |
int arr[10] = {1,2,3,4,5,6,7,8,7,9};
|
|
2916 |
vector<int> v(arr, arr+10);
|
|
2917 |
|
|
2918 |
int size1 = sizeof(arr);
|
|
2919 |
|
|
2920 |
#if STDCPP_OOM
|
|
2921 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
2922 |
|
|
2923 |
#endif
|
|
2924 |
// remove the 7
|
|
2925 |
vector<int>::iterator result =
|
|
2926 |
remove_if(v.begin(), v.end(),bind2nd(less_equal<int>(), 7));
|
|
2927 |
|
|
2928 |
#if STDCPP_OOM
|
|
2929 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
2930 |
|
|
2931 |
|
|
2932 |
#endif
|
|
2933 |
for ( result = v.begin( ) ; result != v.end( ) ; result++ )
|
|
2934 |
|
|
2935 |
{
|
|
2936 |
static int i = 0;
|
|
2937 |
|
|
2938 |
arr[i] = *result;
|
|
2939 |
i++;
|
|
2940 |
|
|
2941 |
}
|
|
2942 |
|
|
2943 |
int size2 = sizeof(arr);
|
|
2944 |
|
|
2945 |
/*if(arr[0]==8)
|
|
2946 |
if(arr[1]==9)
|
|
2947 |
if(arr[2]==3)
|
|
2948 |
if(arr[3]==4)
|
|
2949 |
if(arr[4]==5)
|
|
2950 |
if(arr[5]==6)
|
|
2951 |
if(arr[6]==7)
|
|
2952 |
if(arr[7]==8)
|
|
2953 |
if(size1==size2)
|
|
2954 |
// __UHEAP_MARKEND;
|
|
2955 |
return KErrNone;
|
|
2956 |
return KErrGeneral;*/
|
|
2957 |
if(arr[0]!=8)
|
|
2958 |
failures++;
|
|
2959 |
if(arr[1]!=9)
|
|
2960 |
failures++;
|
|
2961 |
if(arr[2]!=3)
|
|
2962 |
failures++;
|
|
2963 |
if(arr[3]!=4)
|
|
2964 |
failures++;
|
|
2965 |
if(arr[4]!=5)
|
|
2966 |
failures++;
|
|
2967 |
if(arr[5]!=6)
|
|
2968 |
failures++;
|
|
2969 |
if(arr[6]!=7)
|
|
2970 |
failures++;
|
|
2971 |
if(arr[7]!=8)
|
|
2972 |
failures++;
|
|
2973 |
if(size1!=size2)
|
|
2974 |
failures++;
|
|
2975 |
//#if STDCPP_OOM //failures++; //#endif
|
|
2976 |
}
|
|
2977 |
catch(bad_alloc&)
|
|
2978 |
{
|
|
2979 |
}
|
|
2980 |
catch(...)
|
|
2981 |
{
|
|
2982 |
failures++;
|
|
2983 |
|
|
2984 |
}
|
|
2985 |
|
|
2986 |
// __UHEAP_MARKEND;
|
|
2987 |
|
|
2988 |
if(failures)
|
|
2989 |
return KErrGeneral;
|
|
2990 |
return KErrNone;
|
|
2991 |
|
|
2992 |
}
|
|
2993 |
|
|
2994 |
|
|
2995 |
|
|
2996 |
|
|
2997 |
|
|
2998 |
|
|
2999 |
|
|
3000 |
|
|
3001 |
|
|
3002 |
TInt Ctstl_1::Removecopy(CStifItemParser& aItem)
|
|
3003 |
{
|
|
3004 |
|
|
3005 |
int failures =0;
|
|
3006 |
|
|
3007 |
|
|
3008 |
try
|
|
3009 |
{
|
|
3010 |
// __UHEAP_MARK;
|
|
3011 |
|
|
3012 |
const int MAX_ELEMENTS = 8 ;
|
|
3013 |
|
|
3014 |
// Define a template class vector of integers
|
|
3015 |
typedef vector<int > IntVector ;
|
|
3016 |
|
|
3017 |
//Define an iterator for template class vector of integer
|
|
3018 |
typedef IntVector::iterator IntVectorIt ;
|
|
3019 |
|
|
3020 |
//vector containing numbers
|
|
3021 |
IntVector Numbers(MAX_ELEMENTS), Result(MAX_ELEMENTS) ;
|
|
3022 |
|
|
3023 |
#ifdef __ARMCC__
|
|
3024 |
#pragma diag_suppress 550
|
|
3025 |
#endif
|
|
3026 |
IntVectorIt start, end, it, last, resultIt ;
|
|
3027 |
|
|
3028 |
|
|
3029 |
//Initialize vector Numbers
|
|
3030 |
Numbers[0] = 10 ;
|
|
3031 |
Numbers[1] = 20 ;
|
|
3032 |
Numbers[2] = 10 ;
|
|
3033 |
Numbers[3] = 15 ;
|
|
3034 |
Numbers[4] = 12 ;
|
|
3035 |
Numbers[5] = 7 ;
|
|
3036 |
Numbers[6] = 9 ;
|
|
3037 |
Numbers[7] = 10 ;
|
|
3038 |
|
|
3039 |
start = Numbers.begin() ; // location of first
|
|
3040 |
// element of Numbers
|
|
3041 |
|
|
3042 |
end = Numbers.end() ; // one past the location
|
|
3043 |
// last element of Numbers
|
|
3044 |
|
|
3045 |
resultIt = Result.begin() ; // location of first
|
|
3046 |
// element of Result
|
|
3047 |
|
|
3048 |
#if STDCPP_OOM
|
|
3049 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3050 |
|
|
3051 |
#endif
|
|
3052 |
|
|
3053 |
// copy all elements from Numbers to Result
|
|
3054 |
// skipping any item that equals 10
|
|
3055 |
last = remove_copy(start, end, resultIt, 10) ;
|
|
3056 |
|
|
3057 |
#if STDCPP_OOM
|
|
3058 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3059 |
|
|
3060 |
|
|
3061 |
#endif
|
|
3062 |
start = Result.begin() ; // location of first
|
|
3063 |
// element of Result
|
|
3064 |
|
|
3065 |
end = Result.end() ; // one past the location
|
|
3066 |
// last element of Result
|
|
3067 |
|
|
3068 |
// print content of Result
|
|
3069 |
|
|
3070 |
for(it = start; it != end; it++)
|
|
3071 |
|
|
3072 |
{
|
|
3073 |
static int i;
|
|
3074 |
Numbers[i] = *it;
|
|
3075 |
i++;
|
|
3076 |
|
|
3077 |
}
|
|
3078 |
/*
|
|
3079 |
if(Numbers[0] == 20)
|
|
3080 |
if(Numbers[1] == 15)
|
|
3081 |
if(Numbers[2] == 12)
|
|
3082 |
if(Numbers[3] == 7)
|
|
3083 |
if(Numbers[4] == 9)
|
|
3084 |
if(Numbers[5] == 0)
|
|
3085 |
if(Numbers[6] == 0)
|
|
3086 |
if(Numbers[7] == 0)
|
|
3087 |
|
|
3088 |
// __UHEAP_MARKEND;
|
|
3089 |
return KErrNone;
|
|
3090 |
return KErrGeneral;
|
|
3091 |
*/
|
|
3092 |
if(Numbers[0] != 20)
|
|
3093 |
failures++;
|
|
3094 |
if(Numbers[1] != 15)
|
|
3095 |
failures++;
|
|
3096 |
if(Numbers[2] != 12)
|
|
3097 |
failures++;
|
|
3098 |
if(Numbers[3] != 7)
|
|
3099 |
failures++;
|
|
3100 |
if(Numbers[4] != 9)
|
|
3101 |
failures++;
|
|
3102 |
if(Numbers[5] != 0)
|
|
3103 |
failures++;
|
|
3104 |
if(Numbers[6] != 0)
|
|
3105 |
failures++;
|
|
3106 |
if(Numbers[7] != 0)
|
|
3107 |
failures++;
|
|
3108 |
|
|
3109 |
//#if STDCPP_OOM //failures++; //#endif
|
|
3110 |
|
|
3111 |
}
|
|
3112 |
catch(bad_alloc&)
|
|
3113 |
{
|
|
3114 |
}
|
|
3115 |
catch(...)
|
|
3116 |
{
|
|
3117 |
failures++;
|
|
3118 |
|
|
3119 |
}
|
|
3120 |
|
|
3121 |
// __UHEAP_MARKEND;
|
|
3122 |
|
|
3123 |
if(failures)
|
|
3124 |
return KErrGeneral;
|
|
3125 |
return KErrNone;
|
|
3126 |
|
|
3127 |
|
|
3128 |
}
|
|
3129 |
|
|
3130 |
|
|
3131 |
|
|
3132 |
|
|
3133 |
|
|
3134 |
|
|
3135 |
|
|
3136 |
|
|
3137 |
|
|
3138 |
|
|
3139 |
|
|
3140 |
|
|
3141 |
TInt Ctstl_1::Removecopy_if(CStifItemParser& aItem)
|
|
3142 |
{
|
|
3143 |
|
|
3144 |
|
|
3145 |
int failures =0;
|
|
3146 |
|
|
3147 |
|
|
3148 |
try
|
|
3149 |
{ // __UHEAP_MARK;
|
|
3150 |
|
|
3151 |
const int MAX_ELEMENTS = 8 ;
|
|
3152 |
|
|
3153 |
// Define a template class vector of integers
|
|
3154 |
typedef vector<int > IntVector ;
|
|
3155 |
|
|
3156 |
//Define an iterator for template class vector of integer
|
|
3157 |
typedef IntVector::iterator IntVectorIt ;
|
|
3158 |
|
|
3159 |
//vector containing numbers
|
|
3160 |
IntVector Numbers(MAX_ELEMENTS), Result(MAX_ELEMENTS) ;
|
|
3161 |
|
|
3162 |
IntVectorIt start, end, it, last, resultIt ;
|
|
3163 |
|
|
3164 |
//Initialize vector Numbers
|
|
3165 |
Numbers[0] = 10 ;
|
|
3166 |
Numbers[1] = 20 ;
|
|
3167 |
Numbers[2] = 10 ;
|
|
3168 |
Numbers[3] = 25 ;
|
|
3169 |
Numbers[4] = 12 ;
|
|
3170 |
Numbers[5] = 7 ;
|
|
3171 |
Numbers[6] = 9 ;
|
|
3172 |
Numbers[7] = 30 ;
|
|
3173 |
|
|
3174 |
start = Numbers.begin() ; // location of first
|
|
3175 |
// element of Numbers
|
|
3176 |
|
|
3177 |
end = Numbers.end() ; // one past the location
|
|
3178 |
// last element of Numbers
|
|
3179 |
|
|
3180 |
resultIt = Result.begin() ; // location of first
|
|
3181 |
// element of Result
|
|
3182 |
|
|
3183 |
#if STDCPP_OOM
|
|
3184 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3185 |
|
|
3186 |
#endif
|
|
3187 |
|
|
3188 |
// copy all elements from Numbers to Result
|
|
3189 |
// skipping any item that equals 10
|
|
3190 |
last = remove_copy_if(start, end, resultIt, bind2nd(greater_equal<int>(), 25)) ;
|
|
3191 |
|
|
3192 |
#if STDCPP_OOM
|
|
3193 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3194 |
|
|
3195 |
|
|
3196 |
#endif
|
|
3197 |
start = Result.begin() ; // location of first
|
|
3198 |
// element of Result
|
|
3199 |
|
|
3200 |
end = Result.end() ; // one past the location
|
|
3201 |
// last element of Result
|
|
3202 |
|
|
3203 |
// print content of Result
|
|
3204 |
|
|
3205 |
for(it = start; it != end; it++)
|
|
3206 |
|
|
3207 |
{
|
|
3208 |
static int i;
|
|
3209 |
Numbers[i] = *it;
|
|
3210 |
i++;
|
|
3211 |
|
|
3212 |
}
|
|
3213 |
/*
|
|
3214 |
if(Numbers[0] == 10)
|
|
3215 |
if(Numbers[1] == 20)
|
|
3216 |
if(Numbers[2] == 10)
|
|
3217 |
if(Numbers[3] == 12)
|
|
3218 |
if(Numbers[4] == 7)
|
|
3219 |
if(Numbers[5] == 9)
|
|
3220 |
if(Numbers[6] == 0)
|
|
3221 |
if(Numbers[7] == 0)
|
|
3222 |
|
|
3223 |
//__UHEAP_MARKEND;
|
|
3224 |
return KErrNone;
|
|
3225 |
return KErrGeneral;*/
|
|
3226 |
if(Numbers[0] != 10)
|
|
3227 |
failures++;
|
|
3228 |
if(Numbers[1] != 20)
|
|
3229 |
failures++;
|
|
3230 |
if(Numbers[2] != 10)
|
|
3231 |
failures++;
|
|
3232 |
if(Numbers[3] != 12)
|
|
3233 |
failures++;
|
|
3234 |
if(Numbers[4] != 7)
|
|
3235 |
failures++;
|
|
3236 |
if(Numbers[5] != 9)
|
|
3237 |
failures++;
|
|
3238 |
if(Numbers[6] != 0)
|
|
3239 |
failures++;
|
|
3240 |
if(Numbers[7] != 0)
|
|
3241 |
failures++;
|
|
3242 |
|
|
3243 |
//#if STDCPP_OOM //failures++; //#endif
|
|
3244 |
}
|
|
3245 |
catch(bad_alloc&)
|
|
3246 |
{
|
|
3247 |
}
|
|
3248 |
catch(...)
|
|
3249 |
{
|
|
3250 |
failures++;
|
|
3251 |
|
|
3252 |
}
|
|
3253 |
|
|
3254 |
// __UHEAP_MARKEND;
|
|
3255 |
|
|
3256 |
if(failures)
|
|
3257 |
return KErrGeneral;
|
|
3258 |
return KErrNone;
|
|
3259 |
|
|
3260 |
|
|
3261 |
|
|
3262 |
|
|
3263 |
}
|
|
3264 |
|
|
3265 |
|
|
3266 |
|
|
3267 |
|
|
3268 |
TInt Ctstl_1::Replace_fun(CStifItemParser& aItem)
|
|
3269 |
{
|
|
3270 |
|
|
3271 |
|
|
3272 |
// __UHEAP_MARK;
|
|
3273 |
int failures =0;
|
|
3274 |
|
|
3275 |
|
|
3276 |
try
|
|
3277 |
{
|
|
3278 |
const int MAX_ELEMENTS = 8 ;
|
|
3279 |
|
|
3280 |
// Define a template class vector of integers
|
|
3281 |
typedef vector<int > IntVector ;
|
|
3282 |
|
|
3283 |
//Define an iterator for template class vector of integer
|
|
3284 |
typedef IntVector::iterator IntVectorIt ;
|
|
3285 |
|
|
3286 |
//vector containing numbers
|
|
3287 |
IntVector Numbers(MAX_ELEMENTS) ;
|
|
3288 |
|
|
3289 |
IntVectorIt start, end, it ;
|
|
3290 |
|
|
3291 |
//Initialize vector Numbers
|
|
3292 |
Numbers[0] = 10 ;
|
|
3293 |
Numbers[1] = 20 ;
|
|
3294 |
Numbers[2] = 10 ;
|
|
3295 |
Numbers[3] = 25 ;
|
|
3296 |
Numbers[4] = 12 ;
|
|
3297 |
Numbers[5] = 7 ;
|
|
3298 |
Numbers[6] = 9 ;
|
|
3299 |
Numbers[7] = 30 ;
|
|
3300 |
|
|
3301 |
start = Numbers.begin() ; // location of first
|
|
3302 |
// element of Numbers
|
|
3303 |
|
|
3304 |
end = Numbers.end() ; // one past the location
|
|
3305 |
// last element of Numbers
|
|
3306 |
|
|
3307 |
// location of first
|
|
3308 |
// element of Result
|
|
3309 |
|
|
3310 |
#if STDCPP_OOM
|
|
3311 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3312 |
|
|
3313 |
#endif
|
|
3314 |
|
|
3315 |
// copy all elements from Numbers to Result
|
|
3316 |
// skipping any item that equals 10
|
|
3317 |
replace(start, end, 10, 35) ;
|
|
3318 |
|
|
3319 |
#if STDCPP_OOM
|
|
3320 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3321 |
|
|
3322 |
|
|
3323 |
#endif
|
|
3324 |
|
|
3325 |
|
|
3326 |
// one past the location
|
|
3327 |
// last element of Result
|
|
3328 |
|
|
3329 |
// print content of Result
|
|
3330 |
|
|
3331 |
for(it = start; it != end; it++)
|
|
3332 |
|
|
3333 |
{
|
|
3334 |
static int i;
|
|
3335 |
Numbers[i] = *it;
|
|
3336 |
i++;
|
|
3337 |
|
|
3338 |
}
|
|
3339 |
/*
|
|
3340 |
if(Numbers[0] == 35)
|
|
3341 |
if(Numbers[1] == 20)
|
|
3342 |
if(Numbers[2] == 35)
|
|
3343 |
if(Numbers[3] == 25)
|
|
3344 |
if(Numbers[4] == 12)
|
|
3345 |
if(Numbers[5] == 7)
|
|
3346 |
if(Numbers[6] == 9)
|
|
3347 |
if(Numbers[7] == 30)
|
|
3348 |
|
|
3349 |
// __UHEAP_MARKEND;
|
|
3350 |
return KErrNone;
|
|
3351 |
return KErrGeneral;
|
|
3352 |
|
|
3353 |
*/
|
|
3354 |
if(Numbers[0] != 35)
|
|
3355 |
failures++;
|
|
3356 |
if(Numbers[1] != 20)
|
|
3357 |
failures++;
|
|
3358 |
if(Numbers[2] != 35)
|
|
3359 |
failures++;
|
|
3360 |
if(Numbers[3] != 25)
|
|
3361 |
failures++;
|
|
3362 |
if(Numbers[4] != 12)
|
|
3363 |
failures++;
|
|
3364 |
if(Numbers[5] != 7)
|
|
3365 |
failures++;
|
|
3366 |
if(Numbers[6] != 9)
|
|
3367 |
failures++;
|
|
3368 |
if(Numbers[7] != 30)
|
|
3369 |
failures++;
|
|
3370 |
|
|
3371 |
//#if STDCPP_OOM //failures++; //#endif
|
|
3372 |
}
|
|
3373 |
catch(bad_alloc&)
|
|
3374 |
{
|
|
3375 |
}
|
|
3376 |
catch(...)
|
|
3377 |
{
|
|
3378 |
failures++;
|
|
3379 |
}
|
|
3380 |
|
|
3381 |
// __UHEAP_MARKEND;
|
|
3382 |
|
|
3383 |
if(failures)
|
|
3384 |
return KErrGeneral;
|
|
3385 |
return KErrNone;
|
|
3386 |
|
|
3387 |
|
|
3388 |
|
|
3389 |
}
|
|
3390 |
|
|
3391 |
|
|
3392 |
|
|
3393 |
|
|
3394 |
|
|
3395 |
|
|
3396 |
TInt Ctstl_1::Replacecopy_fun(CStifItemParser& aItem)
|
|
3397 |
{
|
|
3398 |
int failures =0;
|
|
3399 |
|
|
3400 |
|
|
3401 |
try
|
|
3402 |
{ // __UHEAP_MARK;
|
|
3403 |
const int MAX_ELEMENTS = 8 ;
|
|
3404 |
|
|
3405 |
// Define a template class vector of integers
|
|
3406 |
typedef vector<int > IntVector ;
|
|
3407 |
|
|
3408 |
//Define an iterator for template class vector of integer
|
|
3409 |
typedef IntVector::iterator IntVectorIt ;
|
|
3410 |
|
|
3411 |
//vector containing numbers
|
|
3412 |
IntVector Numbers(MAX_ELEMENTS), Result(MAX_ELEMENTS) ;
|
|
3413 |
|
|
3414 |
IntVectorIt start, end, it, last, resultIt ;
|
|
3415 |
|
|
3416 |
//Initialize vector Numbers
|
|
3417 |
Numbers[0] = 10 ;
|
|
3418 |
Numbers[1] = 20 ;
|
|
3419 |
Numbers[2] = 10 ;
|
|
3420 |
Numbers[3] = 15 ;
|
|
3421 |
Numbers[4] = 12 ;
|
|
3422 |
Numbers[5] = 7 ;
|
|
3423 |
Numbers[6] = 9 ;
|
|
3424 |
Numbers[7] = 10 ;
|
|
3425 |
|
|
3426 |
start = Numbers.begin() ; // location of first
|
|
3427 |
// element of Numbers
|
|
3428 |
|
|
3429 |
end = Numbers.end() ; // one past the location
|
|
3430 |
// last element of Numbers
|
|
3431 |
|
|
3432 |
resultIt = Result.begin() ; // location of first
|
|
3433 |
// element of Result
|
|
3434 |
|
|
3435 |
|
|
3436 |
#if STDCPP_OOM
|
|
3437 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3438 |
|
|
3439 |
#endif
|
|
3440 |
// copy all elements from Numbers to Result
|
|
3441 |
// replacing any item that equals 10 with 30
|
|
3442 |
last = replace_copy(start, end, resultIt, 10, 30) ;
|
|
3443 |
|
|
3444 |
#if STDCPP_OOM
|
|
3445 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3446 |
|
|
3447 |
|
|
3448 |
#endif
|
|
3449 |
start = Result.begin() ; // location of first
|
|
3450 |
// element of Result
|
|
3451 |
|
|
3452 |
end = Result.end() ; // one past the location
|
|
3453 |
// last element of Result
|
|
3454 |
|
|
3455 |
|
|
3456 |
for(it = start; it != end; it++)
|
|
3457 |
|
|
3458 |
{
|
|
3459 |
static int i;
|
|
3460 |
Result[i] = *it;
|
|
3461 |
i++;
|
|
3462 |
}
|
|
3463 |
|
|
3464 |
|
|
3465 |
/*
|
|
3466 |
|
|
3467 |
if (Result[0] == 30)
|
|
3468 |
if (Result[1] == 20)
|
|
3469 |
if (Result[2] == 30)
|
|
3470 |
if (Result[3] == 15)
|
|
3471 |
if (Result[4] == 12)
|
|
3472 |
if (Result[5] == 7)
|
|
3473 |
if (Result[6] == 9)
|
|
3474 |
if (Result[7] == 30)
|
|
3475 |
// __UHEAP_MARKEND;
|
|
3476 |
return KErrNone;
|
|
3477 |
return KErrGeneral;
|
|
3478 |
*/
|
|
3479 |
if (Result[0] != 30)
|
|
3480 |
failures++;
|
|
3481 |
if (Result[1] != 20)
|
|
3482 |
failures++;
|
|
3483 |
|
|
3484 |
if (Result[2] != 30)
|
|
3485 |
failures++;
|
|
3486 |
if (Result[3] != 15)
|
|
3487 |
failures++;
|
|
3488 |
if (Result[4] != 12)
|
|
3489 |
failures++;
|
|
3490 |
if (Result[5] != 7)
|
|
3491 |
failures++;
|
|
3492 |
if (Result[6] != 9)
|
|
3493 |
failures++;
|
|
3494 |
if (Result[7] != 30)
|
|
3495 |
failures++;
|
|
3496 |
//#if STDCPP_OOM //failures++; //#endif
|
|
3497 |
}
|
|
3498 |
catch(bad_alloc&)
|
|
3499 |
{
|
|
3500 |
}
|
|
3501 |
catch(...)
|
|
3502 |
{
|
|
3503 |
failures++;
|
|
3504 |
|
|
3505 |
}
|
|
3506 |
|
|
3507 |
// __UHEAP_MARKEND;
|
|
3508 |
|
|
3509 |
if(failures)
|
|
3510 |
return KErrGeneral;
|
|
3511 |
return KErrNone;
|
|
3512 |
|
|
3513 |
|
|
3514 |
}
|
|
3515 |
|
|
3516 |
|
|
3517 |
|
|
3518 |
|
|
3519 |
TInt Ctstl_1::Replacecopyif_fun(CStifItemParser& aItem)
|
|
3520 |
{
|
|
3521 |
|
|
3522 |
int failures =0;
|
|
3523 |
|
|
3524 |
|
|
3525 |
try
|
|
3526 |
{
|
|
3527 |
// __UHEAP_MARK;
|
|
3528 |
const int MAX_ELEMENTS = 8 ;
|
|
3529 |
|
|
3530 |
// Define a template class vector of integers
|
|
3531 |
typedef vector<int > IntVector ;
|
|
3532 |
|
|
3533 |
//Define an iterator for template class vector of integer
|
|
3534 |
typedef IntVector::iterator IntVectorIt ;
|
|
3535 |
|
|
3536 |
//vector containing numbers
|
|
3537 |
IntVector Numbers(MAX_ELEMENTS), Result(MAX_ELEMENTS) ;
|
|
3538 |
|
|
3539 |
IntVectorIt start, end, it, last, resultIt ;
|
|
3540 |
|
|
3541 |
//Initialize vector Numbers
|
|
3542 |
Numbers[0] = 10 ;
|
|
3543 |
Numbers[1] = 20 ;
|
|
3544 |
Numbers[2] = 10 ;
|
|
3545 |
Numbers[3] = 15 ;
|
|
3546 |
Numbers[4] = 12 ;
|
|
3547 |
Numbers[5] = 7 ;
|
|
3548 |
Numbers[6] = 9 ;
|
|
3549 |
Numbers[7] = 10 ;
|
|
3550 |
|
|
3551 |
start = Numbers.begin() ; // location of first
|
|
3552 |
// element of Numbers
|
|
3553 |
|
|
3554 |
end = Numbers.end() ; // one past the location
|
|
3555 |
// last element of Numbers
|
|
3556 |
|
|
3557 |
resultIt = Result.begin() ; // location of first
|
|
3558 |
// element of Result
|
|
3559 |
|
|
3560 |
#if STDCPP_OOM
|
|
3561 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3562 |
|
|
3563 |
#endif
|
|
3564 |
|
|
3565 |
// copy all elements from Numbers to Result
|
|
3566 |
// replacing any item that >= 10 with 30
|
|
3567 |
last = replace_copy_if(start, end, resultIt,
|
|
3568 |
bind2nd(greater_equal<int>(), 10), 30) ;
|
|
3569 |
|
|
3570 |
#if STDCPP_OOM
|
|
3571 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3572 |
|
|
3573 |
|
|
3574 |
#endif
|
|
3575 |
|
|
3576 |
start = Result.begin() ; // location of first
|
|
3577 |
// element of Result
|
|
3578 |
|
|
3579 |
end = Result.end() ; // one past the location
|
|
3580 |
// last element of Result
|
|
3581 |
for(it = start; it != end; it++)
|
|
3582 |
|
|
3583 |
{
|
|
3584 |
static int i;
|
|
3585 |
Result[i] = *it;
|
|
3586 |
i++;
|
|
3587 |
}
|
|
3588 |
|
|
3589 |
/*
|
|
3590 |
if (Result[0] == 30)
|
|
3591 |
if (Result[1] == 30)
|
|
3592 |
if (Result[2] == 30)
|
|
3593 |
if (Result[3] == 30)
|
|
3594 |
if (Result[4] == 30)
|
|
3595 |
if (Result[5] == 7)
|
|
3596 |
if (Result[6] == 9)
|
|
3597 |
if (Result[7] == 30)
|
|
3598 |
// __UHEAP_MARKEND;
|
|
3599 |
return KErrNone;
|
|
3600 |
return KErrGeneral;*/
|
|
3601 |
|
|
3602 |
if (Result[0] != 30)
|
|
3603 |
failures++;
|
|
3604 |
if (Result[1] != 30)
|
|
3605 |
failures++;
|
|
3606 |
if (Result[2] != 30)
|
|
3607 |
failures++;
|
|
3608 |
if (Result[3] != 30)
|
|
3609 |
failures++;
|
|
3610 |
|
|
3611 |
if (Result[4] != 30)
|
|
3612 |
failures++;
|
|
3613 |
|
|
3614 |
if (Result[5] != 7)
|
|
3615 |
failures++;
|
|
3616 |
|
|
3617 |
if (Result[6]!= 9)
|
|
3618 |
failures++;
|
|
3619 |
|
|
3620 |
if (Result[7] != 30)
|
|
3621 |
failures++;
|
|
3622 |
|
|
3623 |
//#if STDCPP_OOM //failures++; //#endif
|
|
3624 |
}
|
|
3625 |
catch(bad_alloc&)
|
|
3626 |
{
|
|
3627 |
|
|
3628 |
}
|
|
3629 |
catch(...)
|
|
3630 |
{
|
|
3631 |
failures++;
|
|
3632 |
|
|
3633 |
}
|
|
3634 |
|
|
3635 |
// __UHEAP_MARKEND;
|
|
3636 |
|
|
3637 |
if(failures)
|
|
3638 |
return KErrGeneral;
|
|
3639 |
return KErrNone;
|
|
3640 |
}
|
|
3641 |
|
|
3642 |
|
|
3643 |
|
|
3644 |
TInt Ctstl_1::Replaceif_fun(CStifItemParser& aItem)
|
|
3645 |
{
|
|
3646 |
|
|
3647 |
int failures =0;
|
|
3648 |
|
|
3649 |
|
|
3650 |
try
|
|
3651 |
{
|
|
3652 |
// __UHEAP_MARK;
|
|
3653 |
const int VECTOR_SIZE = 8 ;
|
|
3654 |
|
|
3655 |
// Define a template class vector of integers
|
|
3656 |
typedef vector<int > IntVector ;
|
|
3657 |
|
|
3658 |
//Define an iterator for template class vector of integer
|
|
3659 |
typedef IntVector::iterator IntVectorIt ;
|
|
3660 |
|
|
3661 |
IntVector Numbers(VECTOR_SIZE) ; //vector containing numbers
|
|
3662 |
|
|
3663 |
IntVectorIt start, end, it ;
|
|
3664 |
|
|
3665 |
start = Numbers.begin() ; // location of first
|
|
3666 |
// element of Numbers
|
|
3667 |
|
|
3668 |
end = Numbers.end() ; // one past the location
|
|
3669 |
// last element of Numbers
|
|
3670 |
|
|
3671 |
//Initialize vector Numbers
|
|
3672 |
Numbers[0] = 10 ;
|
|
3673 |
Numbers[1] = 20 ;
|
|
3674 |
Numbers[2] = 10 ;
|
|
3675 |
Numbers[3] = 15 ;
|
|
3676 |
Numbers[4] = 12 ;
|
|
3677 |
Numbers[5] = 7 ;
|
|
3678 |
Numbers[6] = 9 ;
|
|
3679 |
Numbers[7] = 10 ;
|
|
3680 |
|
|
3681 |
#if STDCPP_OOM
|
|
3682 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3683 |
|
|
3684 |
#endif
|
|
3685 |
|
|
3686 |
// replace all elements from Numbers that are <= 10 with 4
|
|
3687 |
replace_if(start, end, bind2nd(less_equal<int>(), 10), 4 ) ;
|
|
3688 |
#if STDCPP_OOM
|
|
3689 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3690 |
|
|
3691 |
|
|
3692 |
#endif
|
|
3693 |
for(it = start; it != end; it++)
|
|
3694 |
|
|
3695 |
{
|
|
3696 |
static int i;
|
|
3697 |
Numbers[i] = *it;
|
|
3698 |
i++;
|
|
3699 |
|
|
3700 |
}
|
|
3701 |
/*
|
|
3702 |
if(Numbers[0] == 4)
|
|
3703 |
if(Numbers[1] == 20)
|
|
3704 |
if(Numbers[2] == 4)
|
|
3705 |
if(Numbers[3] == 15)
|
|
3706 |
if(Numbers[4] == 12)
|
|
3707 |
if(Numbers[5] == 4)
|
|
3708 |
if(Numbers[6] == 4)
|
|
3709 |
if(Numbers[7] == 4)
|
|
3710 |
|
|
3711 |
// __UHEAP_MARKEND;
|
|
3712 |
return KErrNone;
|
|
3713 |
return KErrGeneral;*/
|
|
3714 |
|
|
3715 |
|
|
3716 |
if(Numbers[0] != 4)
|
|
3717 |
failures++;
|
|
3718 |
if(Numbers[1] != 20)
|
|
3719 |
failures++;
|
|
3720 |
if(Numbers[2] != 4)
|
|
3721 |
failures++;
|
|
3722 |
if(Numbers[3] != 15)
|
|
3723 |
failures++;
|
|
3724 |
if(Numbers[4] != 12)
|
|
3725 |
failures++;
|
|
3726 |
if(Numbers[5] != 4)
|
|
3727 |
failures++;
|
|
3728 |
if(Numbers[6] != 4)
|
|
3729 |
failures++;
|
|
3730 |
if(Numbers[7] != 4)
|
|
3731 |
failures++;
|
|
3732 |
//#if STDCPP_OOM //failures++; //#endif
|
|
3733 |
}
|
|
3734 |
catch(bad_alloc&)
|
|
3735 |
{
|
|
3736 |
}
|
|
3737 |
catch(...)
|
|
3738 |
{
|
|
3739 |
failures++;
|
|
3740 |
|
|
3741 |
}
|
|
3742 |
|
|
3743 |
// __UHEAP_MARKEND;
|
|
3744 |
|
|
3745 |
if(failures)
|
|
3746 |
return KErrGeneral;
|
|
3747 |
return KErrNone;
|
|
3748 |
|
|
3749 |
|
|
3750 |
|
|
3751 |
|
|
3752 |
}
|
|
3753 |
|
|
3754 |
TInt Ctstl_1::Reverse_fun(CStifItemParser& aItem)
|
|
3755 |
{
|
|
3756 |
|
|
3757 |
// __UHEAP_MARK;
|
|
3758 |
int failures =0;
|
|
3759 |
|
|
3760 |
|
|
3761 |
try
|
|
3762 |
{
|
|
3763 |
const int VECTOR_SIZE = 8;
|
|
3764 |
|
|
3765 |
// Define a template class vector of strings
|
|
3766 |
typedef vector<string > StrVector;
|
|
3767 |
|
|
3768 |
//Define an iterator for template class vector of strings
|
|
3769 |
typedef StrVector::iterator StrVectorIt;
|
|
3770 |
|
|
3771 |
StrVector Tongue_Twister(VECTOR_SIZE);
|
|
3772 |
StrVectorIt start, end, it;
|
|
3773 |
|
|
3774 |
// location of first element of Tongue_Twister
|
|
3775 |
start = Tongue_Twister.begin();
|
|
3776 |
|
|
3777 |
// one past the location last element of Tongue_Twister
|
|
3778 |
end = Tongue_Twister.end();
|
|
3779 |
|
|
3780 |
//Initialize vector Tongue_Twister
|
|
3781 |
Tongue_Twister[0] = "she";
|
|
3782 |
Tongue_Twister[1] = "sells";
|
|
3783 |
Tongue_Twister[2] = "sea";
|
|
3784 |
Tongue_Twister[3] = "shells";
|
|
3785 |
Tongue_Twister[4] = "by";
|
|
3786 |
Tongue_Twister[5] = "the";
|
|
3787 |
Tongue_Twister[6] = "sea";
|
|
3788 |
Tongue_Twister[7] = "shore";
|
|
3789 |
|
|
3790 |
// cout<<"";
|
|
3791 |
#if STDCPP_OOM
|
|
3792 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3793 |
|
|
3794 |
#endif
|
|
3795 |
// reverse the items in the vector Tongue_Twister
|
|
3796 |
reverse(start, end);
|
|
3797 |
|
|
3798 |
#if STDCPP_OOM
|
|
3799 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3800 |
|
|
3801 |
|
|
3802 |
#endif
|
|
3803 |
|
|
3804 |
// print content of Tongue_Twister
|
|
3805 |
cout << "Now try the reversed Tongue Twister:";
|
|
3806 |
for (it = start; it != end; it++)
|
|
3807 |
|
|
3808 |
{
|
|
3809 |
static int i;
|
|
3810 |
Tongue_Twister[i] = *it;
|
|
3811 |
i++;
|
|
3812 |
|
|
3813 |
}
|
|
3814 |
|
|
3815 |
|
|
3816 |
/*
|
|
3817 |
|
|
3818 |
if( Tongue_Twister[0] == "shore")
|
|
3819 |
if(Tongue_Twister[1] == "sea")
|
|
3820 |
if(Tongue_Twister[2] == "the")
|
|
3821 |
if(Tongue_Twister[3] == "by")
|
|
3822 |
if(Tongue_Twister[4] == "shells")
|
|
3823 |
if(Tongue_Twister[5] == "sea")
|
|
3824 |
if(Tongue_Twister[6] == "sells")
|
|
3825 |
if(Tongue_Twister[7] == "she")
|
|
3826 |
// __UHEAP_MARKEND;
|
|
3827 |
return KErrNone;
|
|
3828 |
return KErrGeneral;
|
|
3829 |
*/
|
|
3830 |
|
|
3831 |
//#if STDCPP_OOM //failures++; //#endif
|
|
3832 |
|
|
3833 |
if( Tongue_Twister[0] != "shore")
|
|
3834 |
failures++;
|
|
3835 |
|
|
3836 |
if(Tongue_Twister[1] != "sea")
|
|
3837 |
failures++;
|
|
3838 |
|
|
3839 |
if(Tongue_Twister[2] != "the")
|
|
3840 |
failures++;
|
|
3841 |
|
|
3842 |
if(Tongue_Twister[3] != "by")
|
|
3843 |
failures++;
|
|
3844 |
|
|
3845 |
if(Tongue_Twister[4] != "shells")
|
|
3846 |
failures++;
|
|
3847 |
if(Tongue_Twister[5] != "sea")
|
|
3848 |
failures++;
|
|
3849 |
if(Tongue_Twister[6] != "sells")
|
|
3850 |
failures++;
|
|
3851 |
if(Tongue_Twister[7] != "she")
|
|
3852 |
failures++;
|
|
3853 |
}
|
|
3854 |
catch(bad_alloc&)
|
|
3855 |
{
|
|
3856 |
}
|
|
3857 |
catch(...)
|
|
3858 |
{
|
|
3859 |
failures++;
|
|
3860 |
|
|
3861 |
}
|
|
3862 |
|
|
3863 |
// __UHEAP_MARKEND;
|
|
3864 |
|
|
3865 |
if(failures)
|
|
3866 |
return KErrGeneral;
|
|
3867 |
return KErrNone;
|
|
3868 |
|
|
3869 |
|
|
3870 |
}
|
|
3871 |
|
|
3872 |
|
|
3873 |
|
|
3874 |
TInt Ctstl_1::Reversecopy_fun(CStifItemParser& aItem)
|
|
3875 |
{
|
|
3876 |
|
|
3877 |
|
|
3878 |
int failures =0;
|
|
3879 |
|
|
3880 |
|
|
3881 |
try
|
|
3882 |
{
|
|
3883 |
// __UHEAP_MARK;
|
|
3884 |
const int VECTOR_SIZE = 8 ;
|
|
3885 |
|
|
3886 |
// Define a template class vector of strings
|
|
3887 |
typedef vector<string> StrVector ;
|
|
3888 |
|
|
3889 |
//Define an iterator for template class vector of strings
|
|
3890 |
typedef StrVector::iterator StrVectorIt ;
|
|
3891 |
|
|
3892 |
StrVector Tongue_Twister(VECTOR_SIZE) ;
|
|
3893 |
StrVector Reversed_Twister(VECTOR_SIZE) ;
|
|
3894 |
|
|
3895 |
StrVectorIt start, end, it, RTstart, RTend ;
|
|
3896 |
|
|
3897 |
start = Tongue_Twister.begin() ; // location of first
|
|
3898 |
// element of Tongue_Twister
|
|
3899 |
|
|
3900 |
end = Tongue_Twister.end() ; // one past the location last
|
|
3901 |
// element of Tongue_Twister
|
|
3902 |
|
|
3903 |
RTstart = Reversed_Twister.begin() ; // location of first
|
|
3904 |
// element of Reversed_Twister
|
|
3905 |
|
|
3906 |
RTend = Reversed_Twister.end() ; // one past the location last
|
|
3907 |
// element of Reversed_Twister
|
|
3908 |
|
|
3909 |
//Initialize vector Tongue_Twister
|
|
3910 |
Tongue_Twister[0] = "she";
|
|
3911 |
Tongue_Twister[1] = "sells";
|
|
3912 |
Tongue_Twister[2] = "sea";
|
|
3913 |
Tongue_Twister[3] = "shells";
|
|
3914 |
Tongue_Twister[4] = "by";
|
|
3915 |
Tongue_Twister[5] = "the";
|
|
3916 |
Tongue_Twister[6] = "sea";
|
|
3917 |
Tongue_Twister[7] = "shore";
|
|
3918 |
// cout<<"";
|
|
3919 |
#if STDCPP_OOM
|
|
3920 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
3921 |
|
|
3922 |
#endif
|
|
3923 |
|
|
3924 |
// reverse the items in the vector Tongue_Twister
|
|
3925 |
// and copy the results to Reversed_Twister
|
|
3926 |
reverse_copy(start, end, RTstart);
|
|
3927 |
|
|
3928 |
#if STDCPP_OOM
|
|
3929 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
3930 |
|
|
3931 |
|
|
3932 |
#endif
|
|
3933 |
for(it = start; it != end; it++)
|
|
3934 |
|
|
3935 |
|
|
3936 |
{
|
|
3937 |
static int i;
|
|
3938 |
Tongue_Twister[i] = *it;
|
|
3939 |
i++;
|
|
3940 |
}
|
|
3941 |
|
|
3942 |
|
|
3943 |
|
|
3944 |
for(it = RTstart; it != RTend; it++)
|
|
3945 |
|
|
3946 |
|
|
3947 |
{
|
|
3948 |
|
|
3949 |
static int i;
|
|
3950 |
Reversed_Twister[i] = *it;
|
|
3951 |
i++;
|
|
3952 |
}
|
|
3953 |
|
|
3954 |
|
|
3955 |
|
|
3956 |
|
|
3957 |
|
|
3958 |
/* if( Tongue_Twister[7] == "shore")
|
|
3959 |
if(Tongue_Twister[6] == "sea")
|
|
3960 |
if(Tongue_Twister[5] == "the")
|
|
3961 |
if(Tongue_Twister[4] == "by")
|
|
3962 |
if(Tongue_Twister[3] == "shells")
|
|
3963 |
if(Tongue_Twister[2] == "sea")
|
|
3964 |
if(Tongue_Twister[1] == "sells")
|
|
3965 |
if(Tongue_Twister[0] == "she")
|
|
3966 |
|
|
3967 |
*/
|
|
3968 |
if( Tongue_Twister[7] != "shore")
|
|
3969 |
failures++;
|
|
3970 |
if(Tongue_Twister[6] != "sea")
|
|
3971 |
failures++;
|
|
3972 |
if(Tongue_Twister[5] != "the")
|
|
3973 |
failures++;
|
|
3974 |
if(Tongue_Twister[4] != "by")
|
|
3975 |
failures++;
|
|
3976 |
if(Tongue_Twister[3] != "shells")
|
|
3977 |
failures++;
|
|
3978 |
if(Tongue_Twister[2] != "sea")
|
|
3979 |
failures++;
|
|
3980 |
if(Tongue_Twister[1] != "sells")
|
|
3981 |
failures++;
|
|
3982 |
if(Tongue_Twister[0] != "she")
|
|
3983 |
failures++;
|
|
3984 |
/*
|
|
3985 |
if( Reversed_Twister[0] == "shore")
|
|
3986 |
if(Reversed_Twister[1] == "sea")
|
|
3987 |
if(Reversed_Twister[2] == "the")
|
|
3988 |
if(Reversed_Twister[3] == "by")
|
|
3989 |
if(Reversed_Twister[4] == "shells")
|
|
3990 |
if(Reversed_Twister[5] == "sea")
|
|
3991 |
if(Reversed_Twister[6] == "sells")
|
|
3992 |
if(Reversed_Twister[7] == "she")
|
|
3993 |
|
|
3994 |
|
|
3995 |
// __UHEAP_MARKEND;
|
|
3996 |
|
|
3997 |
return KErrNone;
|
|
3998 |
return KErrGeneral;*/
|
|
3999 |
|
|
4000 |
if( Reversed_Twister[0] != "shore")
|
|
4001 |
failures++;
|
|
4002 |
if(Reversed_Twister[1] != "sea")
|
|
4003 |
failures++;
|
|
4004 |
if(Reversed_Twister[2] != "the")
|
|
4005 |
failures++;
|
|
4006 |
if(Reversed_Twister[3] != "by")
|
|
4007 |
failures++;
|
|
4008 |
if(Reversed_Twister[4] != "shells")
|
|
4009 |
failures++;
|
|
4010 |
if(Reversed_Twister[5] != "sea")
|
|
4011 |
failures++;
|
|
4012 |
if(Reversed_Twister[6] != "sells")
|
|
4013 |
failures++;
|
|
4014 |
if(Reversed_Twister[7] != "she")
|
|
4015 |
failures++;
|
|
4016 |
|
|
4017 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4018 |
}
|
|
4019 |
catch(bad_alloc&)
|
|
4020 |
{
|
|
4021 |
}
|
|
4022 |
catch(...)
|
|
4023 |
{
|
|
4024 |
failures++;
|
|
4025 |
|
|
4026 |
}
|
|
4027 |
|
|
4028 |
// __UHEAP_MARKEND;
|
|
4029 |
|
|
4030 |
if(failures)
|
|
4031 |
return KErrGeneral;
|
|
4032 |
return KErrNone;
|
|
4033 |
|
|
4034 |
|
|
4035 |
}
|
|
4036 |
|
|
4037 |
|
|
4038 |
|
|
4039 |
|
|
4040 |
TInt Ctstl_1::Rotate_fun(CStifItemParser& aItem)
|
|
4041 |
|
|
4042 |
{
|
|
4043 |
|
|
4044 |
int failures =0;
|
|
4045 |
|
|
4046 |
|
|
4047 |
try
|
|
4048 |
{
|
|
4049 |
// __UHEAP_MARK;
|
|
4050 |
const int VECTOR_SIZE = 8;
|
|
4051 |
|
|
4052 |
// Define a template class vector of strings
|
|
4053 |
typedef vector<string> StrVector;
|
|
4054 |
|
|
4055 |
//Define an iterator for template class vector of strings
|
|
4056 |
typedef StrVector::iterator StrVectorIt;
|
|
4057 |
|
|
4058 |
StrVector Tongue_Twister(VECTOR_SIZE);
|
|
4059 |
|
|
4060 |
StrVectorIt start, end, middle, it;
|
|
4061 |
|
|
4062 |
// location of first element of Tongue_Twister
|
|
4063 |
start = Tongue_Twister.begin();
|
|
4064 |
|
|
4065 |
// one past the location last element of Tongue_Twister
|
|
4066 |
end = Tongue_Twister.end();
|
|
4067 |
|
|
4068 |
|
|
4069 |
// Initialize vector Tongue_Twister
|
|
4070 |
Tongue_Twister[0] = "she";
|
|
4071 |
Tongue_Twister[1] = "sells";
|
|
4072 |
Tongue_Twister[2] = "sea";
|
|
4073 |
Tongue_Twister[3] = "shells";
|
|
4074 |
Tongue_Twister[4] = "by";
|
|
4075 |
Tongue_Twister[5] = "the";
|
|
4076 |
Tongue_Twister[6] = "sea";
|
|
4077 |
Tongue_Twister[7] = "shore";
|
|
4078 |
|
|
4079 |
middle = start + 3; // start position for rotating elements
|
|
4080 |
|
|
4081 |
// cout<<"";
|
|
4082 |
#if STDCPP_OOM
|
|
4083 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4084 |
|
|
4085 |
#endif
|
|
4086 |
|
|
4087 |
|
|
4088 |
// rotate the items in the vector Tongue_Twister by 3 positions
|
|
4089 |
rotate(start, middle, end);
|
|
4090 |
|
|
4091 |
#if STDCPP_OOM
|
|
4092 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4093 |
|
|
4094 |
|
|
4095 |
#endif
|
|
4096 |
|
|
4097 |
for (it = start; it != end; it++)
|
|
4098 |
{
|
|
4099 |
|
|
4100 |
static int i;
|
|
4101 |
Tongue_Twister[i] = *it;
|
|
4102 |
i++;
|
|
4103 |
|
|
4104 |
}
|
|
4105 |
|
|
4106 |
|
|
4107 |
|
|
4108 |
/* if( Tongue_Twister[4] == "shore")
|
|
4109 |
if(Tongue_Twister[5] == "she")
|
|
4110 |
if(Tongue_Twister[6] == "sells")
|
|
4111 |
if(Tongue_Twister[7] == "sea")
|
|
4112 |
if(Tongue_Twister[0] == "shells")
|
|
4113 |
if(Tongue_Twister[1] == "by")
|
|
4114 |
if(Tongue_Twister[2] == "the")
|
|
4115 |
if(Tongue_Twister[3] == "sea")
|
|
4116 |
// __UHEAP_MARKEND;
|
|
4117 |
return KErrNone;
|
|
4118 |
return KErrGeneral;*/
|
|
4119 |
|
|
4120 |
if( Tongue_Twister[4] != "shore")
|
|
4121 |
failures++;
|
|
4122 |
if(Tongue_Twister[5] != "she")
|
|
4123 |
failures++;
|
|
4124 |
if(Tongue_Twister[6] != "sells")
|
|
4125 |
failures++;
|
|
4126 |
if(Tongue_Twister[7] != "sea")
|
|
4127 |
failures++;
|
|
4128 |
if(Tongue_Twister[0] != "shells")
|
|
4129 |
failures++;
|
|
4130 |
if(Tongue_Twister[1] != "by")
|
|
4131 |
failures++;
|
|
4132 |
if(Tongue_Twister[2] != "the")
|
|
4133 |
failures++;
|
|
4134 |
if(Tongue_Twister[3] != "sea")
|
|
4135 |
failures++;
|
|
4136 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4137 |
|
|
4138 |
}
|
|
4139 |
catch(bad_alloc&)
|
|
4140 |
{
|
|
4141 |
}
|
|
4142 |
catch(...)
|
|
4143 |
{
|
|
4144 |
failures++;
|
|
4145 |
|
|
4146 |
}
|
|
4147 |
|
|
4148 |
// __UHEAP_MARKEND;
|
|
4149 |
|
|
4150 |
if(failures)
|
|
4151 |
return KErrGeneral;
|
|
4152 |
return KErrNone;
|
|
4153 |
|
|
4154 |
|
|
4155 |
}
|
|
4156 |
|
|
4157 |
|
|
4158 |
TInt Ctstl_1::Rotatecopy_fun(CStifItemParser& aItem)
|
|
4159 |
|
|
4160 |
{
|
|
4161 |
// __UHEAP_MARK;
|
|
4162 |
int failures =0;
|
|
4163 |
|
|
4164 |
|
|
4165 |
try
|
|
4166 |
{
|
|
4167 |
const int VECTOR_SIZE = 8 ;
|
|
4168 |
|
|
4169 |
typedef vector<string> StrVector ;
|
|
4170 |
|
|
4171 |
typedef StrVector::iterator StrVectorIt ;
|
|
4172 |
|
|
4173 |
StrVector Tongue_Twister(VECTOR_SIZE) ;
|
|
4174 |
StrVector Rotated_Twister(VECTOR_SIZE) ;
|
|
4175 |
|
|
4176 |
StrVectorIt start, middle, end, it, RTstart, RTend ;
|
|
4177 |
|
|
4178 |
start = Tongue_Twister.begin() ;
|
|
4179 |
|
|
4180 |
end = Tongue_Twister.end() ;
|
|
4181 |
|
|
4182 |
middle = start + 3 ;
|
|
4183 |
|
|
4184 |
// location of first element of Rotated_Twister
|
|
4185 |
RTstart = Rotated_Twister.begin() ;
|
|
4186 |
|
|
4187 |
// one past the location last element of Rotated_Twister
|
|
4188 |
RTend = Rotated_Twister.end() ;
|
|
4189 |
|
|
4190 |
// Initialize vector Tongue_Twister
|
|
4191 |
Tongue_Twister[0] = "she" ;
|
|
4192 |
Tongue_Twister[1] = "sells" ;
|
|
4193 |
Tongue_Twister[2] = "sea" ;
|
|
4194 |
Tongue_Twister[3] = "shells" ;
|
|
4195 |
Tongue_Twister[4] = "by";
|
|
4196 |
Tongue_Twister[5] = "the";
|
|
4197 |
Tongue_Twister[6] = "sea" ;
|
|
4198 |
Tongue_Twister[7] = "shore" ;
|
|
4199 |
// cout<<"";
|
|
4200 |
#if STDCPP_OOM
|
|
4201 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4202 |
|
|
4203 |
#endif
|
|
4204 |
|
|
4205 |
// rotate the items in the vector Tongue_Twist to the right by
|
|
4206 |
// 3 positions and copy the results to Rotated_Twister
|
|
4207 |
rotate_copy(start, middle, end, RTstart) ;
|
|
4208 |
|
|
4209 |
|
|
4210 |
#if STDCPP_OOM
|
|
4211 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4212 |
|
|
4213 |
|
|
4214 |
#endif
|
|
4215 |
|
|
4216 |
|
|
4217 |
for (it = start; it != end; it++)
|
|
4218 |
{
|
|
4219 |
|
|
4220 |
static int i;
|
|
4221 |
Tongue_Twister[i] = *it;
|
|
4222 |
i++;
|
|
4223 |
|
|
4224 |
}
|
|
4225 |
|
|
4226 |
|
|
4227 |
|
|
4228 |
for (it = RTstart; it != RTend; it++)
|
|
4229 |
|
|
4230 |
|
|
4231 |
{
|
|
4232 |
|
|
4233 |
static int i;
|
|
4234 |
|
|
4235 |
|
|
4236 |
Rotated_Twister[i] = *it;
|
|
4237 |
i++;
|
|
4238 |
|
|
4239 |
}
|
|
4240 |
|
|
4241 |
|
|
4242 |
/*
|
|
4243 |
if( Tongue_Twister[7] == "shore")
|
|
4244 |
if(Tongue_Twister[6] == "sea")
|
|
4245 |
if(Tongue_Twister[5] == "the")
|
|
4246 |
if(Tongue_Twister[4] == "by")
|
|
4247 |
if(Tongue_Twister[3] == "shells")
|
|
4248 |
if(Tongue_Twister[2] == "sea")
|
|
4249 |
if(Tongue_Twister[1] == "sells")
|
|
4250 |
if(Tongue_Twister[0] == "she")
|
|
4251 |
|
|
4252 |
|
|
4253 |
if( Rotated_Twister[0] == "shells")
|
|
4254 |
if(Rotated_Twister[1] == "by")
|
|
4255 |
if(Rotated_Twister[2] == "the")
|
|
4256 |
if(Rotated_Twister[3] == "sea")
|
|
4257 |
if(Rotated_Twister[4] == "shore")
|
|
4258 |
if(Rotated_Twister[5] == "she")
|
|
4259 |
if(Rotated_Twister[6] == "sells")
|
|
4260 |
if(Rotated_Twister[7] == "sea")
|
|
4261 |
|
|
4262 |
// __UHEAP_MARKEND;
|
|
4263 |
return KErrNone;
|
|
4264 |
return KErrGeneral;*/
|
|
4265 |
if( Tongue_Twister[7] != "shore")
|
|
4266 |
failures++;
|
|
4267 |
if(Tongue_Twister[6] != "sea")
|
|
4268 |
failures++;
|
|
4269 |
if(Tongue_Twister[5] != "the")
|
|
4270 |
failures++;
|
|
4271 |
if(Tongue_Twister[4] != "by")
|
|
4272 |
failures++;
|
|
4273 |
if(Tongue_Twister[3] != "shells")
|
|
4274 |
failures++;
|
|
4275 |
if(Tongue_Twister[2] != "sea")
|
|
4276 |
failures++;
|
|
4277 |
if(Tongue_Twister[1] != "sells")
|
|
4278 |
failures++;
|
|
4279 |
if(Tongue_Twister[0] != "she")
|
|
4280 |
failures++;
|
|
4281 |
|
|
4282 |
if( Rotated_Twister[4] != "shore")
|
|
4283 |
failures++;
|
|
4284 |
if(Rotated_Twister[3] != "sea")
|
|
4285 |
failures++;
|
|
4286 |
if(Rotated_Twister[2] != "the")
|
|
4287 |
failures++;
|
|
4288 |
if(Rotated_Twister[1] != "by")
|
|
4289 |
failures++;
|
|
4290 |
if(Rotated_Twister[0] != "shells")
|
|
4291 |
failures++;
|
|
4292 |
if(Rotated_Twister[7] != "sea")
|
|
4293 |
failures++;
|
|
4294 |
if(Rotated_Twister[6] != "sells")
|
|
4295 |
failures++;
|
|
4296 |
if(Rotated_Twister[5] != "she")
|
|
4297 |
failures++;
|
|
4298 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4299 |
|
|
4300 |
}
|
|
4301 |
catch(bad_alloc&)
|
|
4302 |
{
|
|
4303 |
}
|
|
4304 |
catch(...)
|
|
4305 |
{
|
|
4306 |
failures++;
|
|
4307 |
|
|
4308 |
}
|
|
4309 |
|
|
4310 |
// __UHEAP_MARKEND;
|
|
4311 |
|
|
4312 |
if(failures)
|
|
4313 |
return KErrGeneral;
|
|
4314 |
return KErrNone;
|
|
4315 |
|
|
4316 |
}
|
|
4317 |
|
|
4318 |
|
|
4319 |
TInt Ctstl_1::equalrange(CStifItemParser& aItem)
|
|
4320 |
|
|
4321 |
{
|
|
4322 |
int failures =0;
|
|
4323 |
|
|
4324 |
|
|
4325 |
try
|
|
4326 |
{ // __UHEAP_MARK;
|
|
4327 |
int failures =0;
|
|
4328 |
vector <int> v1;
|
|
4329 |
// vector <int>::iterator Iter1;
|
|
4330 |
pair < vector <int> :: iterator , vector <int> :: iterator > Result1, Result2;
|
|
4331 |
|
|
4332 |
// Constructing vectors v1a & v1b with default less than ordering
|
|
4333 |
int i;
|
|
4334 |
for ( i = -1 ; i <= 4 ; i++ )
|
|
4335 |
{
|
|
4336 |
v1.push_back( i );
|
|
4337 |
}
|
|
4338 |
|
|
4339 |
int ii;
|
|
4340 |
for ( ii =-3 ; ii <= 0 ; ii++ )
|
|
4341 |
{
|
|
4342 |
v1.push_back( ii );
|
|
4343 |
}
|
|
4344 |
|
|
4345 |
sort ( v1.begin ( ) , v1.end ( ) );
|
|
4346 |
|
|
4347 |
|
|
4348 |
// Constructing vectors v2 with range sorted by greater
|
|
4349 |
vector <int> v2 ( v1 );
|
|
4350 |
// vector <int>::iterator Iter2;
|
|
4351 |
sort ( v2.begin ( ) , v2.end ( ) , greater<int> ( ) );
|
|
4352 |
|
|
4353 |
// cout<<"";
|
|
4354 |
|
|
4355 |
|
|
4356 |
#if STDCPP_OOM
|
|
4357 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4358 |
|
|
4359 |
#endif
|
|
4360 |
|
|
4361 |
// equal_range of 3 in v1 with default binary predicate less <int> ( )
|
|
4362 |
Result1 = equal_range ( v1.begin ( ) , v1.end ( ) , 3 );
|
|
4363 |
#if STDCPP_OOM
|
|
4364 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4365 |
|
|
4366 |
|
|
4367 |
#endif
|
|
4368 |
if( *Result1.first != 3)
|
|
4369 |
failures++;
|
|
4370 |
if(*Result1.second != 4)
|
|
4371 |
failures++;
|
|
4372 |
|
|
4373 |
#if STDCPP_OOM
|
|
4374 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4375 |
|
|
4376 |
#endif
|
|
4377 |
|
|
4378 |
// equal_range of 3 in v2 with the binary predicate greater <int> ( )
|
|
4379 |
Result2 = equal_range ( v2.begin ( ) , v2.end ( ) , 3 , greater <int> ( ) );
|
|
4380 |
|
|
4381 |
#if STDCPP_OOM
|
|
4382 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4383 |
|
|
4384 |
|
|
4385 |
#endif
|
|
4386 |
if( *Result2.first != 3)
|
|
4387 |
failures++;
|
|
4388 |
if( *Result2.second != 2)
|
|
4389 |
failures++;
|
|
4390 |
|
|
4391 |
// __UHEAP_MARKEND;
|
|
4392 |
|
|
4393 |
/* if(failures)
|
|
4394 |
return KErrGeneral;
|
|
4395 |
return KErrNone;*/
|
|
4396 |
|
|
4397 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4398 |
|
|
4399 |
}
|
|
4400 |
catch(bad_alloc&)
|
|
4401 |
{
|
|
4402 |
}
|
|
4403 |
catch(...)
|
|
4404 |
{
|
|
4405 |
failures++;
|
|
4406 |
|
|
4407 |
}
|
|
4408 |
|
|
4409 |
// __UHEAP_MARKEND;
|
|
4410 |
|
|
4411 |
if(failures)
|
|
4412 |
return KErrGeneral;
|
|
4413 |
return KErrNone;
|
|
4414 |
|
|
4415 |
}
|
|
4416 |
|
|
4417 |
|
|
4418 |
|
|
4419 |
|
|
4420 |
static void f() { throw runtime_error("a runtime error"); }
|
|
4421 |
|
|
4422 |
TInt Ctstl_1::exceptionL(CStifItemParser& aItem)
|
|
4423 |
{
|
|
4424 |
|
|
4425 |
|
|
4426 |
|
|
4427 |
try
|
|
4428 |
{
|
|
4429 |
f();
|
|
4430 |
}
|
|
4431 |
catch (const exception& e)
|
|
4432 |
{
|
|
4433 |
// cout << "Got an exception: " << e.what() << endl;
|
|
4434 |
|
|
4435 |
return KErrNone;
|
|
4436 |
|
|
4437 |
|
|
4438 |
}
|
|
4439 |
|
|
4440 |
|
|
4441 |
|
|
4442 |
|
|
4443 |
return KErrGeneral;
|
|
4444 |
|
|
4445 |
|
|
4446 |
|
|
4447 |
}
|
|
4448 |
|
|
4449 |
|
|
4450 |
|
|
4451 |
|
|
4452 |
// prints the cube of integer n
|
|
4453 |
|
|
4454 |
|
|
4455 |
|
|
4456 |
|
|
4457 |
|
|
4458 |
int PrintCube(int n)
|
|
4459 |
{
|
|
4460 |
|
|
4461 |
return(n*n*n);
|
|
4462 |
}
|
|
4463 |
|
|
4464 |
|
|
4465 |
TInt Ctstl_1::foreach(CStifItemParser& aItem)
|
|
4466 |
|
|
4467 |
{
|
|
4468 |
|
|
4469 |
int failures =0;
|
|
4470 |
|
|
4471 |
|
|
4472 |
try
|
|
4473 |
{
|
|
4474 |
|
|
4475 |
const int VECTOR_SIZE = 8 ;
|
|
4476 |
|
|
4477 |
typedef vector<int > IntVector ;
|
|
4478 |
|
|
4479 |
typedef IntVector::iterator IntVectorIt ;
|
|
4480 |
|
|
4481 |
IntVector Numbers(VECTOR_SIZE) ; //vector containing numbers
|
|
4482 |
|
|
4483 |
// IntVectorIt start, end, it ;
|
|
4484 |
|
|
4485 |
int i ;
|
|
4486 |
|
|
4487 |
// Initialize vector Numbers
|
|
4488 |
for (i = 0; i < VECTOR_SIZE; i++)
|
|
4489 |
Numbers[i] = i + 1 ;
|
|
4490 |
|
|
4491 |
|
|
4492 |
|
|
4493 |
// cout<<"";
|
|
4494 |
// for each element in the range [first, last)
|
|
4495 |
// print the cube of the element
|
|
4496 |
|
|
4497 |
#if STDCPP_OOM
|
|
4498 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4499 |
|
|
4500 |
#endif
|
|
4501 |
for_each(Numbers.begin() , Numbers.end(), PrintCube) ;
|
|
4502 |
|
|
4503 |
#if STDCPP_OOM
|
|
4504 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4505 |
|
|
4506 |
|
|
4507 |
#endif
|
|
4508 |
|
|
4509 |
// if(output[0] ==1 )
|
|
4510 |
//if(output[1] == 8)
|
|
4511 |
// return KErrNone;
|
|
4512 |
//return KErrGeneral;
|
|
4513 |
|
|
4514 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4515 |
}
|
|
4516 |
catch(bad_alloc&)
|
|
4517 |
{
|
|
4518 |
}
|
|
4519 |
catch(...)
|
|
4520 |
{
|
|
4521 |
failures++;
|
|
4522 |
}
|
|
4523 |
|
|
4524 |
// __UHEAP_MARKEND;
|
|
4525 |
|
|
4526 |
if(failures)
|
|
4527 |
return KErrGeneral;
|
|
4528 |
return KErrNone;
|
|
4529 |
|
|
4530 |
}
|
|
4531 |
|
|
4532 |
|
|
4533 |
TInt Ctstl_1::gsliceL(CStifItemParser& aItem)
|
|
4534 |
|
|
4535 |
{
|
|
4536 |
|
|
4537 |
int i,failures=0;
|
|
4538 |
|
|
4539 |
|
|
4540 |
try
|
|
4541 |
{
|
|
4542 |
|
|
4543 |
size_t startVAR;
|
|
4544 |
|
|
4545 |
valarray<int> va ( 20 ), vaResult;
|
|
4546 |
|
|
4547 |
|
|
4548 |
|
|
4549 |
valarray<size_t> Len ( 2 ), Stride ( 2 );
|
|
4550 |
Len [0] = 4;
|
|
4551 |
Len [1] = 4;
|
|
4552 |
Stride [0] = 7;
|
|
4553 |
Stride [1] = 4; // cout<<"";
|
|
4554 |
|
|
4555 |
#if STDCPP_OOM
|
|
4556 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4557 |
|
|
4558 |
#endif
|
|
4559 |
gslice vaGSlice(0,Len,Stride);
|
|
4560 |
|
|
4561 |
|
|
4562 |
|
|
4563 |
startVAR = vaGSlice.start ( );
|
|
4564 |
if(startVAR!=0)
|
|
4565 |
failures++;
|
|
4566 |
|
|
4567 |
|
|
4568 |
const valarray <size_t> strideGS = vaGSlice.stride ( );
|
|
4569 |
|
|
4570 |
|
|
4571 |
|
|
4572 |
|
|
4573 |
|
|
4574 |
for ( i = 0 ; i < 2 ; i++ )
|
|
4575 |
|
|
4576 |
|
|
4577 |
{
|
|
4578 |
|
|
4579 |
if( strideGS[ 0 ]!=7)
|
|
4580 |
failures++;
|
|
4581 |
if(strideGS[1]!=4)
|
|
4582 |
failures++;
|
|
4583 |
}
|
|
4584 |
|
|
4585 |
const valarray <size_t> sizeGS = vaGSlice.size ( ); // cout<<"";
|
|
4586 |
#if STDCPP_OOM
|
|
4587 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4588 |
|
|
4589 |
|
|
4590 |
#endif
|
|
4591 |
for ( i = 0 ; i < 2 ; i++ )
|
|
4592 |
{
|
|
4593 |
|
|
4594 |
if (sizeGS[0] !=4 )
|
|
4595 |
failures++;
|
|
4596 |
|
|
4597 |
if(sizeGS[1]!=4)
|
|
4598 |
failures++;
|
|
4599 |
}
|
|
4600 |
/*
|
|
4601 |
|
|
4602 |
if(failures)
|
|
4603 |
return KErrGeneral;
|
|
4604 |
else
|
|
4605 |
return KErrNone;
|
|
4606 |
|
|
4607 |
*/
|
|
4608 |
|
|
4609 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4610 |
}
|
|
4611 |
catch(bad_alloc&)
|
|
4612 |
{
|
|
4613 |
|
|
4614 |
}
|
|
4615 |
catch(...)
|
|
4616 |
{
|
|
4617 |
failures++;
|
|
4618 |
|
|
4619 |
}
|
|
4620 |
|
|
4621 |
// __UHEAP_MARKEND;
|
|
4622 |
|
|
4623 |
if(failures)
|
|
4624 |
return KErrGeneral;
|
|
4625 |
return KErrNone;
|
|
4626 |
}
|
|
4627 |
|
|
4628 |
|
|
4629 |
|
|
4630 |
|
|
4631 |
TInt Ctstl_1::sliceL(CStifItemParser& aItem)
|
|
4632 |
|
|
4633 |
{
|
|
4634 |
|
|
4635 |
int failures=0;
|
|
4636 |
|
|
4637 |
// Simulating no memory
|
|
4638 |
|
|
4639 |
|
|
4640 |
try
|
|
4641 |
{ // cout<<"";
|
|
4642 |
#if STDCPP_OOM
|
|
4643 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4644 |
#endif
|
|
4645 |
|
|
4646 |
size_t startVAR,strideVAR,sizeVAR;
|
|
4647 |
|
|
4648 |
|
|
4649 |
|
|
4650 |
|
|
4651 |
slice vaSlice ( 3 , 6 , 3 );
|
|
4652 |
|
|
4653 |
|
|
4654 |
|
|
4655 |
|
|
4656 |
startVAR = vaSlice.start ( );
|
|
4657 |
if(startVAR!=3)
|
|
4658 |
failures++;
|
|
4659 |
|
|
4660 |
|
|
4661 |
strideVAR = vaSlice.stride();
|
|
4662 |
|
|
4663 |
if(strideVAR !=3)
|
|
4664 |
failures++;
|
|
4665 |
|
|
4666 |
|
|
4667 |
|
|
4668 |
sizeVAR = vaSlice.size();
|
|
4669 |
#if STDCPP_OOM
|
|
4670 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4671 |
#endif
|
|
4672 |
if(sizeVAR!=6)
|
|
4673 |
failures++;
|
|
4674 |
|
|
4675 |
|
|
4676 |
/*
|
|
4677 |
if(failures)
|
|
4678 |
return KErrGeneral;
|
|
4679 |
return KErrNone;
|
|
4680 |
*/
|
|
4681 |
//#if STDCPP_OOM
|
|
4682 |
//failures++;
|
|
4683 |
//#endif
|
|
4684 |
}
|
|
4685 |
|
|
4686 |
|
|
4687 |
// catch's bad_alloc exception
|
|
4688 |
|
|
4689 |
catch(bad_alloc&)
|
|
4690 |
{
|
|
4691 |
}
|
|
4692 |
// catch's exception
|
|
4693 |
catch(...)
|
|
4694 |
{
|
|
4695 |
failures++;
|
|
4696 |
|
|
4697 |
}
|
|
4698 |
|
|
4699 |
|
|
4700 |
// __UHEAP_MARKEND;
|
|
4701 |
|
|
4702 |
if(failures)
|
|
4703 |
return KErrGeneral;
|
|
4704 |
return KErrNone;
|
|
4705 |
}
|
|
4706 |
|
|
4707 |
// unary function
|
|
4708 |
|
|
4709 |
class greaterthan10: unary_function<int, bool>
|
|
4710 |
{
|
|
4711 |
|
|
4712 |
public:
|
|
4713 |
result_type operator()(argument_type i)
|
|
4714 |
{
|
|
4715 |
return (result_type)(i > 10);
|
|
4716 |
}
|
|
4717 |
};
|
|
4718 |
|
|
4719 |
|
|
4720 |
|
|
4721 |
|
|
4722 |
TInt Ctstl_1::unaryfunc(CStifItemParser& aItem)
|
|
4723 |
|
|
4724 |
{
|
|
4725 |
int failures=0;
|
|
4726 |
|
|
4727 |
try
|
|
4728 |
{
|
|
4729 |
vector<int> v1;
|
|
4730 |
//vector<int>::iterator Iter;
|
|
4731 |
int i ;
|
|
4732 |
for (i = 0; i <= 5; i++)
|
|
4733 |
{
|
|
4734 |
v1.push_back(5 * i);
|
|
4735 |
}
|
|
4736 |
|
|
4737 |
|
|
4738 |
int result1; // cout<<"";
|
|
4739 |
// Simulating no memory
|
|
4740 |
#if STDCPP_OOM
|
|
4741 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4742 |
#endif
|
|
4743 |
//vector<int>::iterator::difference_type result1;
|
|
4744 |
result1 = count_if(v1.begin(), v1.end(), greaterthan10());
|
|
4745 |
#if STDCPP_OOM
|
|
4746 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4747 |
#endif
|
|
4748 |
/*if(result1 == 3)
|
|
4749 |
return KErrNone;
|
|
4750 |
else
|
|
4751 |
return KErrGeneral;*/
|
|
4752 |
if(result1!=3)
|
|
4753 |
failures++;
|
|
4754 |
|
|
4755 |
|
|
4756 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4757 |
}
|
|
4758 |
|
|
4759 |
|
|
4760 |
// catch's bad_alloc exception
|
|
4761 |
|
|
4762 |
catch(bad_alloc&)
|
|
4763 |
{
|
|
4764 |
|
|
4765 |
}
|
|
4766 |
// catch's exception
|
|
4767 |
catch(...)
|
|
4768 |
{
|
|
4769 |
failures++;
|
|
4770 |
|
|
4771 |
}
|
|
4772 |
|
|
4773 |
|
|
4774 |
// __UHEAP_MARKEND;
|
|
4775 |
|
|
4776 |
if(failures)
|
|
4777 |
return KErrGeneral;
|
|
4778 |
return KErrNone;
|
|
4779 |
}
|
|
4780 |
|
|
4781 |
|
|
4782 |
|
|
4783 |
|
|
4784 |
// unintiallized fill
|
|
4785 |
|
|
4786 |
|
|
4787 |
|
|
4788 |
class Integer
|
|
4789 |
{ // No default constructor
|
|
4790 |
public:
|
|
4791 |
Integer( int x ) : val( x ) {}
|
|
4792 |
int get( ) { return val; }
|
|
4793 |
private:
|
|
4794 |
int val;
|
|
4795 |
};
|
|
4796 |
|
|
4797 |
TInt Ctstl_1::uni_fill(CStifItemParser& aItem)
|
|
4798 |
|
|
4799 |
{
|
|
4800 |
|
|
4801 |
// __UHEAP_MARK;
|
|
4802 |
int failures=0;
|
|
4803 |
|
|
4804 |
|
|
4805 |
|
|
4806 |
try
|
|
4807 |
{
|
|
4808 |
const int N = 3;
|
|
4809 |
int failures = 0;
|
|
4810 |
Integer val (1);
|
|
4811 |
Integer* Array = ( Integer* ) malloc( N * sizeof( int ) ); // cout<<"";
|
|
4812 |
// Simulating no memory
|
|
4813 |
#if STDCPP_OOM
|
|
4814 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4815 |
#endif
|
|
4816 |
uninitialized_fill( Array, Array + N, val );
|
|
4817 |
|
|
4818 |
#if STDCPP_OOM
|
|
4819 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4820 |
#endif
|
|
4821 |
int i;
|
|
4822 |
for ( i = 0 ; i < N; i++ )
|
|
4823 |
{
|
|
4824 |
if( Array [ 0 ].get( ) !=1)
|
|
4825 |
failures++;
|
|
4826 |
if( Array [ 1 ].get( ) !=1)
|
|
4827 |
failures++;
|
|
4828 |
if( Array [ 2 ].get( ) !=1)
|
|
4829 |
failures++;
|
|
4830 |
|
|
4831 |
|
|
4832 |
|
|
4833 |
}
|
|
4834 |
|
|
4835 |
delete Array;
|
|
4836 |
|
|
4837 |
// __UHEAP_MARKEND;
|
|
4838 |
/* if(failures)
|
|
4839 |
return KErrGeneral;
|
|
4840 |
else
|
|
4841 |
return KErrNone;*/
|
|
4842 |
|
|
4843 |
|
|
4844 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4845 |
}
|
|
4846 |
// catch's bad_alloc exception
|
|
4847 |
|
|
4848 |
catch(bad_alloc&)
|
|
4849 |
{
|
|
4850 |
}
|
|
4851 |
// catch's exception
|
|
4852 |
catch(...)
|
|
4853 |
{
|
|
4854 |
failures++;
|
|
4855 |
|
|
4856 |
}
|
|
4857 |
|
|
4858 |
// __UHEAP_MARKEND;
|
|
4859 |
|
|
4860 |
if(failures)
|
|
4861 |
return KErrGeneral;
|
|
4862 |
return KErrNone;
|
|
4863 |
|
|
4864 |
|
|
4865 |
}
|
|
4866 |
|
|
4867 |
|
|
4868 |
|
|
4869 |
|
|
4870 |
|
|
4871 |
|
|
4872 |
|
|
4873 |
//unintiallzed fill n
|
|
4874 |
|
|
4875 |
class Integer1 { // No default constructor
|
|
4876 |
public:
|
|
4877 |
Integer1( int x ) : val( x ) {}
|
|
4878 |
int get( ) { return val; }
|
|
4879 |
private:
|
|
4880 |
int val;
|
|
4881 |
};
|
|
4882 |
|
|
4883 |
TInt Ctstl_1::uni_fill_n(CStifItemParser& aItem)
|
|
4884 |
{
|
|
4885 |
// __UHEAP_MARK;
|
|
4886 |
int failures=0;
|
|
4887 |
|
|
4888 |
|
|
4889 |
|
|
4890 |
try
|
|
4891 |
{
|
|
4892 |
//__UHEAP_MARK;
|
|
4893 |
int failures =0;
|
|
4894 |
const int N = 3;
|
|
4895 |
Integer1 val ( 6);
|
|
4896 |
Integer1* Array = ( Integer1* ) malloc( N * sizeof( int ) ); // cout<<"";
|
|
4897 |
// Simulating no memory
|
|
4898 |
#if STDCPP_OOM
|
|
4899 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4900 |
#endif
|
|
4901 |
uninitialized_fill_n( Array, N, val ); // C4996
|
|
4902 |
|
|
4903 |
#if STDCPP_OOM
|
|
4904 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4905 |
#endif
|
|
4906 |
int i;
|
|
4907 |
for ( i = 0 ; i < N; i++ )
|
|
4908 |
{
|
|
4909 |
if( Array [ 0 ].get( ) !=6)
|
|
4910 |
failures++;
|
|
4911 |
if( Array [ 1 ].get( ) !=6)
|
|
4912 |
failures++;
|
|
4913 |
if( Array [ 2 ].get( ) !=6)
|
|
4914 |
failures++;
|
|
4915 |
}
|
|
4916 |
|
|
4917 |
delete Array;
|
|
4918 |
/*
|
|
4919 |
//__UHEAP_MARKEND;
|
|
4920 |
if(failures)
|
|
4921 |
return KErrGeneral;
|
|
4922 |
else
|
|
4923 |
return KErrNone; */
|
|
4924 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4925 |
}
|
|
4926 |
// catch's bad_alloc exception
|
|
4927 |
catch(bad_alloc&)
|
|
4928 |
{
|
|
4929 |
}
|
|
4930 |
// catch's exception
|
|
4931 |
catch(...)
|
|
4932 |
{
|
|
4933 |
failures++;
|
|
4934 |
|
|
4935 |
}
|
|
4936 |
|
|
4937 |
|
|
4938 |
// __UHEAP_MARKEND;
|
|
4939 |
|
|
4940 |
if(failures)
|
|
4941 |
return KErrGeneral;
|
|
4942 |
return KErrNone;
|
|
4943 |
|
|
4944 |
}
|
|
4945 |
|
|
4946 |
|
|
4947 |
|
|
4948 |
// unintiallized copy
|
|
4949 |
|
|
4950 |
class Integer2
|
|
4951 |
{
|
|
4952 |
public:
|
|
4953 |
Integer2( int x ) : val( x ) {}
|
|
4954 |
|
|
4955 |
private:
|
|
4956 |
int val;
|
|
4957 |
};
|
|
4958 |
|
|
4959 |
TInt Ctstl_1::uni_copy(CStifItemParser& aItem)
|
|
4960 |
{
|
|
4961 |
int failures=0;
|
|
4962 |
|
|
4963 |
|
|
4964 |
try
|
|
4965 |
{ // cout<<"";
|
|
4966 |
// Simulating no memory
|
|
4967 |
#if STDCPP_OOM
|
|
4968 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
4969 |
#endif
|
|
4970 |
int Array[] = { 10, 20, 30, 40 };
|
|
4971 |
const int N = sizeof( Array ) / sizeof( int );
|
|
4972 |
|
|
4973 |
// int i;
|
|
4974 |
Integer2* ArrayPtr = ( Integer2* ) malloc( N * sizeof( int ) );
|
|
4975 |
|
|
4976 |
|
|
4977 |
Integer2* LArrayPtr = uninitialized_copy(Array, Array + N, ArrayPtr);
|
|
4978 |
#if STDCPP_OOM
|
|
4979 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
4980 |
#endif
|
|
4981 |
/*
|
|
4982 |
if ( ( void* )LArrayPtr == ( void* )( ArrayPtr + N ) )
|
|
4983 |
return KErrNone;
|
|
4984 |
else
|
|
4985 |
return KErrGeneral;*/
|
|
4986 |
if ( ( void* )LArrayPtr != ( void* )( ArrayPtr + N ) )
|
|
4987 |
failures++;
|
|
4988 |
|
|
4989 |
|
|
4990 |
|
|
4991 |
//#if STDCPP_OOM //failures++; //#endif
|
|
4992 |
}
|
|
4993 |
// catch's bad_alloc exception
|
|
4994 |
|
|
4995 |
catch(bad_alloc&)
|
|
4996 |
{
|
|
4997 |
|
|
4998 |
}
|
|
4999 |
// catch's exception
|
|
5000 |
catch(...)
|
|
5001 |
{
|
|
5002 |
failures++;
|
|
5003 |
|
|
5004 |
}
|
|
5005 |
|
|
5006 |
// __UHEAP_MARKEND;
|
|
5007 |
|
|
5008 |
if(failures)
|
|
5009 |
return KErrGeneral;
|
|
5010 |
return KErrNone;
|
|
5011 |
|
|
5012 |
}
|
|
5013 |
|
|
5014 |
|
|
5015 |
// maskarray
|
|
5016 |
|
|
5017 |
|
|
5018 |
TInt Ctstl_1::maskarray(CStifItemParser& aItem)
|
|
5019 |
|
|
5020 |
{
|
|
5021 |
|
|
5022 |
// __UHEAP_MARK;
|
|
5023 |
int failures=0;
|
|
5024 |
|
|
5025 |
|
|
5026 |
|
|
5027 |
try
|
|
5028 |
{
|
|
5029 |
int ibuf[10] = {0,1,2,3,4,5,6,7,8,9};
|
|
5030 |
bool mbuf[10] = {1,0,1,1,1,0,0,1,1,0};
|
|
5031 |
valarray<int> vi(ibuf,10);
|
|
5032 |
valarray<bool> mask(mbuf,10);
|
|
5033 |
// cout<<"";
|
|
5034 |
// Simulating no memory
|
|
5035 |
#if STDCPP_OOM
|
|
5036 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5037 |
#endif
|
|
5038 |
mask_array<int> msk = vi[mask];
|
|
5039 |
#if STDCPP_OOM
|
|
5040 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5041 |
#endif
|
|
5042 |
valarray<int> vi3 = msk;
|
|
5043 |
//__UHEAP_MARKEND;
|
|
5044 |
// return KErrNone;
|
|
5045 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5046 |
}
|
|
5047 |
// catch's bad_alloc exception
|
|
5048 |
|
|
5049 |
catch(bad_alloc&)
|
|
5050 |
{
|
|
5051 |
}
|
|
5052 |
// catch's exception
|
|
5053 |
catch(...)
|
|
5054 |
{
|
|
5055 |
failures++;
|
|
5056 |
|
|
5057 |
}
|
|
5058 |
|
|
5059 |
|
|
5060 |
// __UHEAP_MARKEND;
|
|
5061 |
|
|
5062 |
if(failures)
|
|
5063 |
return KErrGeneral;
|
|
5064 |
return KErrNone;
|
|
5065 |
|
|
5066 |
}
|
|
5067 |
|
|
5068 |
|
|
5069 |
|
|
5070 |
|
|
5071 |
//auto pointer
|
|
5072 |
|
|
5073 |
|
|
5074 |
|
|
5075 |
|
|
5076 |
|
|
5077 |
|
|
5078 |
|
|
5079 |
class ptr
|
|
5080 |
{
|
|
5081 |
public:
|
|
5082 |
ptr(int i)
|
|
5083 |
{
|
|
5084 |
x = i;
|
|
5085 |
} ;
|
|
5086 |
|
|
5087 |
~ptr( )
|
|
5088 |
{
|
|
5089 |
|
|
5090 |
};
|
|
5091 |
|
|
5092 |
int x;
|
|
5093 |
|
|
5094 |
} ;
|
|
5095 |
|
|
5096 |
TInt Ctstl_1::autoptr(CStifItemParser& aItem)
|
|
5097 |
|
|
5098 |
{
|
|
5099 |
|
|
5100 |
int failures=0;
|
|
5101 |
// cout<<"";
|
|
5102 |
// Simulating no memory
|
|
5103 |
#if STDCPP_OOM
|
|
5104 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5105 |
#endif
|
|
5106 |
|
|
5107 |
try
|
|
5108 |
{
|
|
5109 |
// Simulating no memory
|
|
5110 |
#if STDCPP_OOM
|
|
5111 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5112 |
#endif
|
|
5113 |
auto_ptr<ptr> pi ( new ptr( 5 ) );
|
|
5114 |
|
|
5115 |
pi.reset( new ptr( 6 ) );
|
|
5116 |
ptr* pi2 = pi.get ( );
|
|
5117 |
ptr* pi3 = pi.release ( );
|
|
5118 |
#if STDCPP_OOM
|
|
5119 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5120 |
#endif
|
|
5121 |
|
|
5122 |
|
|
5123 |
/*if (pi2 == pi3)
|
|
5124 |
|
|
5125 |
return KErrNone;
|
|
5126 |
else
|
|
5127 |
return KErrGeneral;*/
|
|
5128 |
|
|
5129 |
if(pi2!=pi3)
|
|
5130 |
failures++;
|
|
5131 |
|
|
5132 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5133 |
}
|
|
5134 |
// catch's bad_alloc exception
|
|
5135 |
|
|
5136 |
catch(bad_alloc&)
|
|
5137 |
{
|
|
5138 |
}
|
|
5139 |
// catch's exception
|
|
5140 |
catch(...)
|
|
5141 |
{
|
|
5142 |
failures++;
|
|
5143 |
|
|
5144 |
}
|
|
5145 |
|
|
5146 |
|
|
5147 |
// __UHEAP_MARKEND;
|
|
5148 |
|
|
5149 |
if(failures)
|
|
5150 |
return KErrGeneral;
|
|
5151 |
return KErrNone;
|
|
5152 |
|
|
5153 |
|
|
5154 |
}
|
|
5155 |
|
|
5156 |
|
|
5157 |
|
|
5158 |
|
|
5159 |
//random shuffle
|
|
5160 |
|
|
5161 |
|
|
5162 |
TInt Ctstl_1::randshuf(CStifItemParser& aItem)
|
|
5163 |
|
|
5164 |
{
|
|
5165 |
int failures=0;
|
|
5166 |
|
|
5167 |
|
|
5168 |
|
|
5169 |
try
|
|
5170 |
{
|
|
5171 |
vector <int> v1;
|
|
5172 |
vector <int>::iterator Iter1;
|
|
5173 |
int i,failures = 0 ;
|
|
5174 |
static int j ,k;
|
|
5175 |
for ( i = 1 ; i <= 3 ; i++ )
|
|
5176 |
v1.push_back( i ); // cout<<"";
|
|
5177 |
// Simulating no memory
|
|
5178 |
#if STDCPP_OOM
|
|
5179 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5180 |
#endif
|
|
5181 |
random_shuffle( v1.begin( ), v1.end( ) );
|
|
5182 |
random_shuffle( v1.begin( ), v1.end( ));
|
|
5183 |
#if STDCPP_OOM
|
|
5184 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5185 |
#endif
|
|
5186 |
push_heap( v1.begin( ), v1.end( ) );
|
|
5187 |
|
|
5188 |
for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )
|
|
5189 |
{
|
|
5190 |
|
|
5191 |
if(j == 0)
|
|
5192 |
{
|
|
5193 |
if(*Iter1 != 2)
|
|
5194 |
failures++;
|
|
5195 |
}
|
|
5196 |
|
|
5197 |
|
|
5198 |
j++;
|
|
5199 |
}
|
|
5200 |
|
|
5201 |
random_shuffle( v1.begin( ), v1.end( ));
|
|
5202 |
push_heap( v1.begin( ), v1.end( ) );
|
|
5203 |
|
|
5204 |
for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )
|
|
5205 |
|
|
5206 |
{
|
|
5207 |
|
|
5208 |
if(k == 0)
|
|
5209 |
{
|
|
5210 |
|
|
5211 |
if(*Iter1 != 3)
|
|
5212 |
failures++;
|
|
5213 |
}
|
|
5214 |
k++;
|
|
5215 |
|
|
5216 |
}
|
|
5217 |
/*
|
|
5218 |
if(failures)
|
|
5219 |
return KErrGeneral;
|
|
5220 |
else
|
|
5221 |
return KErrNone;*/
|
|
5222 |
|
|
5223 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5224 |
}
|
|
5225 |
// catch's bad_alloc exception
|
|
5226 |
|
|
5227 |
catch(bad_alloc&)
|
|
5228 |
{
|
|
5229 |
}
|
|
5230 |
// catch's exception
|
|
5231 |
catch(...)
|
|
5232 |
{
|
|
5233 |
failures++;
|
|
5234 |
|
|
5235 |
}
|
|
5236 |
|
|
5237 |
|
|
5238 |
// __UHEAP_MARKEND;
|
|
5239 |
|
|
5240 |
if(failures)
|
|
5241 |
return KErrGeneral;
|
|
5242 |
return KErrNone;
|
|
5243 |
|
|
5244 |
}
|
|
5245 |
|
|
5246 |
|
|
5247 |
|
|
5248 |
|
|
5249 |
|
|
5250 |
|
|
5251 |
|
|
5252 |
class RInt
|
|
5253 |
{
|
|
5254 |
public:
|
|
5255 |
RInt(int i)
|
|
5256 |
{
|
|
5257 |
|
|
5258 |
x = i;
|
|
5259 |
bIsConstructed = true;
|
|
5260 |
};
|
|
5261 |
|
|
5262 |
|
|
5263 |
|
|
5264 |
|
|
5265 |
RInt &operator=( int i )
|
|
5266 |
{
|
|
5267 |
if (!bIsConstructed)
|
|
5268 |
x = i; return *this;
|
|
5269 |
};
|
|
5270 |
int x;
|
|
5271 |
bool bIsConstructed;
|
|
5272 |
};
|
|
5273 |
|
|
5274 |
|
|
5275 |
TInt Ctstl_1::randstoriter(CStifItemParser& aItem)
|
|
5276 |
|
|
5277 |
{
|
|
5278 |
int failures=0;
|
|
5279 |
|
|
5280 |
|
|
5281 |
|
|
5282 |
try
|
|
5283 |
{
|
|
5284 |
int failures =0;
|
|
5285 |
std::list<int> l;
|
|
5286 |
l.push_back( 1 );
|
|
5287 |
l.push_back( 2 );
|
|
5288 |
l.push_back( 3 );
|
|
5289 |
l.push_back( 4 );
|
|
5290 |
|
|
5291 |
|
|
5292 |
RInt *pInt = (RInt*)malloc(sizeof(RInt)*l.size( ));
|
|
5293 |
// cout<<"";
|
|
5294 |
// Simulating no memory
|
|
5295 |
#if STDCPP_OOM
|
|
5296 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5297 |
#endif
|
|
5298 |
std::copy( l.begin( ), l.end( ), std::raw_storage_iterator<RInt*,RInt>(pInt));
|
|
5299 |
#if STDCPP_OOM
|
|
5300 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5301 |
#endif
|
|
5302 |
for (unsigned int i = 0; i < l.size( ); i++ )
|
|
5303 |
{
|
|
5304 |
static int j;
|
|
5305 |
if(j==0)
|
|
5306 |
{
|
|
5307 |
|
|
5308 |
if(pInt[j].x != 1)
|
|
5309 |
failures++;
|
|
5310 |
|
|
5311 |
}
|
|
5312 |
}
|
|
5313 |
free(pInt);
|
|
5314 |
|
|
5315 |
|
|
5316 |
/*
|
|
5317 |
if(failures)
|
|
5318 |
return KErrGeneral;
|
|
5319 |
else
|
|
5320 |
return KErrNone;
|
|
5321 |
|
|
5322 |
*/
|
|
5323 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5324 |
}
|
|
5325 |
// catch's bad_alloc exception
|
|
5326 |
|
|
5327 |
catch(bad_alloc&)
|
|
5328 |
{
|
|
5329 |
}
|
|
5330 |
// catch's exception
|
|
5331 |
catch(...)
|
|
5332 |
{
|
|
5333 |
failures++;
|
|
5334 |
|
|
5335 |
}
|
|
5336 |
|
|
5337 |
|
|
5338 |
// __UHEAP_MARKEND;
|
|
5339 |
|
|
5340 |
if(failures)
|
|
5341 |
return KErrGeneral;
|
|
5342 |
return KErrNone;
|
|
5343 |
|
|
5344 |
}
|
|
5345 |
|
|
5346 |
|
|
5347 |
|
|
5348 |
|
|
5349 |
TInt Ctstl_1::iterswap(CStifItemParser& aItem)
|
|
5350 |
|
|
5351 |
{ int failures=0;
|
|
5352 |
|
|
5353 |
|
|
5354 |
|
|
5355 |
try
|
|
5356 |
{
|
|
5357 |
|
|
5358 |
int myints[]={10,20,30,40,50 };
|
|
5359 |
vector<int> myvector (4,99);
|
|
5360 |
int failures = 0; // cout<<"";
|
|
5361 |
// Simulating no memory
|
|
5362 |
#if STDCPP_OOM
|
|
5363 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5364 |
#endif
|
|
5365 |
iter_swap(myints,myvector.begin());
|
|
5366 |
|
|
5367 |
iter_swap(myints+3,myvector.begin()+2);
|
|
5368 |
#if STDCPP_OOM
|
|
5369 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5370 |
#endif
|
|
5371 |
for (vector<int>::iterator it=myvector.begin(); it!=myvector.end(); ++it)
|
|
5372 |
|
|
5373 |
{
|
|
5374 |
static int i;
|
|
5375 |
if(i==0)
|
|
5376 |
{
|
|
5377 |
|
|
5378 |
if(*it != 10)
|
|
5379 |
failures++;
|
|
5380 |
|
|
5381 |
}
|
|
5382 |
i++;
|
|
5383 |
}
|
|
5384 |
/*
|
|
5385 |
|
|
5386 |
if(failures)
|
|
5387 |
return KErrGeneral;
|
|
5388 |
else
|
|
5389 |
return KErrNone;*/
|
|
5390 |
|
|
5391 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5392 |
}
|
|
5393 |
// catch's bad_alloc exception
|
|
5394 |
|
|
5395 |
catch(bad_alloc&)
|
|
5396 |
{
|
|
5397 |
}
|
|
5398 |
// catch's exception
|
|
5399 |
catch(...)
|
|
5400 |
{
|
|
5401 |
failures++;
|
|
5402 |
|
|
5403 |
}
|
|
5404 |
|
|
5405 |
|
|
5406 |
// __UHEAP_MARKEND;
|
|
5407 |
|
|
5408 |
if(failures)
|
|
5409 |
return KErrGeneral;
|
|
5410 |
return KErrNone;
|
|
5411 |
|
|
5412 |
}
|
|
5413 |
|
|
5414 |
|
|
5415 |
|
|
5416 |
TInt Ctstl_1::ios1(CStifItemParser& aItem)
|
|
5417 |
|
|
5418 |
{
|
|
5419 |
int failures=0;
|
|
5420 |
|
|
5421 |
|
|
5422 |
try
|
|
5423 |
{ // cout<<""; // Simulating no memory
|
|
5424 |
#if STDCPP_OOM
|
|
5425 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5426 |
#endif
|
|
5427 |
|
|
5428 |
fstream file;
|
|
5429 |
file.exceptions(ios::failbit);
|
|
5430 |
#if STDCPP_OOM
|
|
5431 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5432 |
#endif
|
|
5433 |
try
|
|
5434 |
{
|
|
5435 |
file.open( "nofile.txt", ios_base::in );
|
|
5436 |
}
|
|
5437 |
catch( ios_base::failure f )
|
|
5438 |
{
|
|
5439 |
//do nothing
|
|
5440 |
|
|
5441 |
}
|
|
5442 |
catch(...)
|
|
5443 |
{
|
|
5444 |
|
|
5445 |
failures++;
|
|
5446 |
}
|
|
5447 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5448 |
}
|
|
5449 |
// catch's bad_alloc exception
|
|
5450 |
|
|
5451 |
catch(bad_alloc&)
|
|
5452 |
{
|
|
5453 |
}
|
|
5454 |
// catch's exception
|
|
5455 |
catch(...)
|
|
5456 |
{
|
|
5457 |
failures++;
|
|
5458 |
|
|
5459 |
}
|
|
5460 |
|
|
5461 |
|
|
5462 |
// __UHEAP_MARKEND;
|
|
5463 |
|
|
5464 |
if(failures)
|
|
5465 |
return KErrGeneral;
|
|
5466 |
return KErrNone;
|
|
5467 |
|
|
5468 |
}
|
|
5469 |
|
|
5470 |
|
|
5471 |
|
|
5472 |
TInt Ctstl_1::ios2(CStifItemParser& aItem)
|
|
5473 |
|
|
5474 |
{
|
|
5475 |
int failures=0;
|
|
5476 |
|
|
5477 |
|
|
5478 |
try
|
|
5479 |
{ // cout<<"";
|
|
5480 |
// Simulating no memory
|
|
5481 |
#if STDCPP_OOM
|
|
5482 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5483 |
#endif
|
|
5484 |
|
|
5485 |
int k = cout.flags();
|
|
5486 |
if(cout.flags( ) != 4104)
|
|
5487 |
failures++;
|
|
5488 |
|
|
5489 |
cout.flags( ios::dec | ios::boolalpha );
|
|
5490 |
int j = cout.flags();
|
|
5491 |
#if STDCPP_OOM
|
|
5492 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5493 |
#endif
|
|
5494 |
if( cout.flags( )!= 264)
|
|
5495 |
failures++;
|
|
5496 |
|
|
5497 |
/*
|
|
5498 |
|
|
5499 |
if(failures)
|
|
5500 |
return KErrGeneral;
|
|
5501 |
else
|
|
5502 |
return KErrNone;*/
|
|
5503 |
|
|
5504 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5505 |
}
|
|
5506 |
// catch's bad_alloc exception
|
|
5507 |
|
|
5508 |
catch(bad_alloc&)
|
|
5509 |
{
|
|
5510 |
}
|
|
5511 |
// catch's exception
|
|
5512 |
catch(...)
|
|
5513 |
{
|
|
5514 |
failures++;
|
|
5515 |
|
|
5516 |
}
|
|
5517 |
|
|
5518 |
|
|
5519 |
// __UHEAP_MARKEND;
|
|
5520 |
|
|
5521 |
if(failures)
|
|
5522 |
return KErrGeneral;
|
|
5523 |
return KErrNone;
|
|
5524 |
}
|
|
5525 |
|
|
5526 |
|
|
5527 |
|
|
5528 |
TInt Ctstl_1::ios3(CStifItemParser& aItem)
|
|
5529 |
|
|
5530 |
{
|
|
5531 |
int failures=0;
|
|
5532 |
|
|
5533 |
|
|
5534 |
try
|
|
5535 |
{
|
|
5536 |
int failures =0;
|
|
5537 |
// cout<<"";
|
|
5538 |
// Simulating no memory
|
|
5539 |
#if STDCPP_OOM
|
|
5540 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5541 |
#endif
|
|
5542 |
static const int i = ios_base::xalloc();
|
|
5543 |
static const int j = ios_base::xalloc();
|
|
5544 |
cout.iword( i ) = 11;
|
|
5545 |
cin.pword( j ) = (char *)"testing";
|
|
5546 |
if( cout.iword( i ) != 11)
|
|
5547 |
failures++;
|
|
5548 |
|
|
5549 |
cout.width(2);
|
|
5550 |
|
|
5551 |
if( ( char * )cin.pword( j ) != "testing")
|
|
5552 |
failures++;
|
|
5553 |
|
|
5554 |
|
|
5555 |
int k = 10;
|
|
5556 |
if(k!=10)
|
|
5557 |
failures++;
|
|
5558 |
|
|
5559 |
|
|
5560 |
cout.unsetf( ios_base::dec );
|
|
5561 |
cout.setf( ios_base::hex );
|
|
5562 |
if(k!= 0xa)
|
|
5563 |
failures++;
|
|
5564 |
|
|
5565 |
|
|
5566 |
// float l = 31.31234F;
|
|
5567 |
|
|
5568 |
cout.precision( 3 );
|
|
5569 |
|
|
5570 |
cout.getloc( ).name( ).c_str( );
|
|
5571 |
|
|
5572 |
#if STDCPP_OOM
|
|
5573 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5574 |
#endif
|
|
5575 |
|
|
5576 |
/*if(failures)
|
|
5577 |
return KErrGeneral;
|
|
5578 |
else
|
|
5579 |
return KErrNone;*/
|
|
5580 |
|
|
5581 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5582 |
}
|
|
5583 |
// catch's bad_alloc exception
|
|
5584 |
|
|
5585 |
catch(bad_alloc&)
|
|
5586 |
{
|
|
5587 |
}
|
|
5588 |
// catch's exception
|
|
5589 |
catch(...)
|
|
5590 |
{
|
|
5591 |
failures++;
|
|
5592 |
|
|
5593 |
}
|
|
5594 |
|
|
5595 |
|
|
5596 |
// __UHEAP_MARKEND;
|
|
5597 |
|
|
5598 |
if(failures)
|
|
5599 |
return KErrGeneral;
|
|
5600 |
return KErrNone;
|
|
5601 |
}
|
|
5602 |
|
|
5603 |
|
|
5604 |
|
|
5605 |
TInt Ctstl_1::nthelement( CStifItemParser& aItem )
|
|
5606 |
{
|
|
5607 |
int failures=0;
|
|
5608 |
|
|
5609 |
try
|
|
5610 |
{
|
|
5611 |
int myints[] = {4,10,70,30,10,69,96,100 }; // 10 20 20 20 30 30 20 20 10
|
|
5612 |
vector<int> Numbers (myints,myints+8);
|
|
5613 |
int output[8];
|
|
5614 |
typedef vector<int> IntVector ;
|
|
5615 |
|
|
5616 |
typedef IntVector::iterator IntVectorIt ;
|
|
5617 |
|
|
5618 |
|
|
5619 |
IntVectorIt start, end, it ;
|
|
5620 |
|
|
5621 |
|
|
5622 |
start = Numbers.begin() ; // location of first
|
|
5623 |
// element of Numbers
|
|
5624 |
|
|
5625 |
end = Numbers.end() ; // one past the location
|
|
5626 |
// last element of Numbers
|
|
5627 |
|
|
5628 |
// cout<<"";
|
|
5629 |
// Simulating no memory
|
|
5630 |
#if STDCPP_OOM
|
|
5631 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5632 |
#endif
|
|
5633 |
|
|
5634 |
|
|
5635 |
// partition the elements by the 4th element
|
|
5636 |
nth_element(start, start+4, end) ;
|
|
5637 |
|
|
5638 |
|
|
5639 |
#if STDCPP_OOM
|
|
5640 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5641 |
#endif
|
|
5642 |
for(it = start; it != end; it++)
|
|
5643 |
|
|
5644 |
|
|
5645 |
{
|
|
5646 |
static int i;
|
|
5647 |
output[i] = *it;
|
|
5648 |
i++;
|
|
5649 |
}
|
|
5650 |
|
|
5651 |
|
|
5652 |
/* if(output[0]==4)
|
|
5653 |
if(output[1]==10)
|
|
5654 |
if(output[2]==10)
|
|
5655 |
if(output[3]==30)
|
|
5656 |
if(output[4]==69)
|
|
5657 |
if(output[5]==70)
|
|
5658 |
if(output[6]==96)
|
|
5659 |
if(output[7]==100)
|
|
5660 |
|
|
5661 |
|
|
5662 |
return KErrNone;
|
|
5663 |
return KErrGeneral;*/
|
|
5664 |
|
|
5665 |
|
|
5666 |
if(output[0] != 4)
|
|
5667 |
failures++;
|
|
5668 |
if(output[1] != 10)
|
|
5669 |
failures++;
|
|
5670 |
if(output[2] !=10)
|
|
5671 |
failures++;
|
|
5672 |
if( output[3] != 30)
|
|
5673 |
failures++;
|
|
5674 |
if(output[4] != 69)
|
|
5675 |
failures++;
|
|
5676 |
if(output[5] !=70)
|
|
5677 |
failures++;
|
|
5678 |
if( output[6] != 96)
|
|
5679 |
failures++;
|
|
5680 |
if( output[7] != 100)
|
|
5681 |
failures++;
|
|
5682 |
|
|
5683 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5684 |
}
|
|
5685 |
// catch's bad_alloc exception
|
|
5686 |
|
|
5687 |
catch(bad_alloc&)
|
|
5688 |
{
|
|
5689 |
}
|
|
5690 |
// catch's exception
|
|
5691 |
catch(...)
|
|
5692 |
{
|
|
5693 |
failures++;
|
|
5694 |
|
|
5695 |
}
|
|
5696 |
|
|
5697 |
// __UHEAP_MARKEND;
|
|
5698 |
|
|
5699 |
if(failures)
|
|
5700 |
return KErrGeneral;
|
|
5701 |
return KErrNone;
|
|
5702 |
}
|
|
5703 |
|
|
5704 |
|
|
5705 |
|
|
5706 |
|
|
5707 |
// hasfacet
|
|
5708 |
|
|
5709 |
|
|
5710 |
TInt Ctstl_1::hasfacet( CStifItemParser& aItem )
|
|
5711 |
{
|
|
5712 |
int failures=0;
|
|
5713 |
|
|
5714 |
|
|
5715 |
|
|
5716 |
try
|
|
5717 |
{
|
|
5718 |
bool result ;
|
|
5719 |
// __UHEAP_MARK;
|
|
5720 |
|
|
5721 |
|
|
5722 |
locale loc("en_GB.UTF-8") ;
|
|
5723 |
|
|
5724 |
// cout<<"";
|
|
5725 |
// Simulating no memory
|
|
5726 |
#if STDCPP_OOM
|
|
5727 |
User::__DbgSetAllocFail(FALSE,RHeap::EDeterministic,1);
|
|
5728 |
#endif
|
|
5729 |
result = has_facet <ctype<char> > ( loc );
|
|
5730 |
|
|
5731 |
#if STDCPP_OOM
|
|
5732 |
User::__DbgSetAllocFail(FALSE,RHeap::ENone,1);
|
|
5733 |
#endif
|
|
5734 |
|
|
5735 |
|
|
5736 |
|
|
5737 |
//__UHEAP_MARKEND;
|
|
5738 |
/*
|
|
5739 |
if(result)
|
|
5740 |
return KErrNone;
|
|
5741 |
else
|
|
5742 |
return KErrGeneral;*/
|
|
5743 |
if(!result)
|
|
5744 |
failures++;
|
|
5745 |
|
|
5746 |
//#if STDCPP_OOM //failures++; //#endif
|
|
5747 |
}
|
|
5748 |
// catch's bad_alloc exception
|
|
5749 |
|
|
5750 |
catch(bad_alloc&)
|
|
5751 |
{
|
|
5752 |
}
|
|
5753 |
// catch's exception
|
|
5754 |
catch(...)
|
|
5755 |
{
|
|
5756 |
failures++;
|
|
5757 |
|
|
5758 |
}
|
|
5759 |
|
|
5760 |
// __UHEAP_MARKEND;
|
|
5761 |
|
|
5762 |
if(failures)
|
|
5763 |
return KErrGeneral;
|
|
5764 |
return KErrNone;
|
|
5765 |
}
|
|
5766 |
|
|
5767 |
|
|
5768 |
|
|
5769 |
//end of file
|