@@ -109,14 +109,14 @@ bool RvcServiceAreaDelegate::IsSupportedLocationsChangeAllowed()
109
109
110
110
uint32_t RvcServiceAreaDelegate::GetNumberOfSupportedLocations ()
111
111
{
112
- return (uint32_t )mSupportedLocations .size ();
112
+ return (uint32_t ) mSupportedLocations .size ();
113
113
}
114
114
115
115
bool RvcServiceAreaDelegate::GetSupportedLocationByIndex (uint32_t listIndex, LocationStructureWrapper & aSupportedLocation)
116
116
{
117
117
bool ret_value = false ;
118
118
119
- if (listIndex < (uint32_t )mSupportedLocations .size ())
119
+ if (listIndex < (uint32_t ) mSupportedLocations .size ())
120
120
{
121
121
aSupportedLocation = mSupportedLocations [listIndex];
122
122
ret_value = true ;
@@ -134,7 +134,7 @@ bool RvcServiceAreaDelegate::GetSupportedLocationById(uint32_t aLocationId, uint
134
134
bool ret_value = false ;
135
135
136
136
listIndex = 0 ;
137
- uint32_t listSize = (uint32_t )mSupportedLocations .size ();
137
+ uint32_t listSize = (uint32_t ) mSupportedLocations .size ();
138
138
139
139
while (listIndex < listSize)
140
140
{
@@ -159,11 +159,11 @@ bool RvcServiceAreaDelegate::AddSupportedLocation(const LocationStructureWrapper
159
159
// etc.
160
160
161
161
// Double-check list size to ensure there no memory issues.
162
- if ((uint32_t )mSupportedLocations .size () < kMaxNumSupportedLocations )
162
+ if ((uint32_t ) mSupportedLocations .size () < kMaxNumSupportedLocations )
163
163
{
164
164
// not sorting list, number of locations normally expected to be small, max 255
165
165
mSupportedLocations .push_back (newLocation);
166
- listIndex = (uint32_t )mSupportedMaps .size () - 1 ; // new element is last in list
166
+ listIndex = (uint32_t ) mSupportedMaps .size () - 1 ; // new element is last in list
167
167
ret_value = true ;
168
168
}
169
169
else
@@ -200,7 +200,7 @@ bool RvcServiceAreaDelegate::ClearSupportedLocations()
200
200
{
201
201
bool ret_value = false ;
202
202
203
- if ((uint32_t )mSupportedLocations .size () > 0 )
203
+ if ((uint32_t ) mSupportedLocations .size () > 0 )
204
204
{
205
205
mSupportedLocations .clear ();
206
206
ret_value = true ;
@@ -219,14 +219,14 @@ bool RvcServiceAreaDelegate::IsSupportedMapChangeAllowed()
219
219
220
220
uint32_t RvcServiceAreaDelegate::GetNumberOfSupportedMaps ()
221
221
{
222
- return (uint32_t )mSupportedMaps .size ();
222
+ return (uint32_t ) mSupportedMaps .size ();
223
223
}
224
224
225
225
bool RvcServiceAreaDelegate::GetSupportedMapByIndex (uint32_t listIndex, MapStructureWrapper & aSupportedMap)
226
226
{
227
227
bool ret_value = false ;
228
228
229
- if (listIndex < (uint32_t )mSupportedMaps .size ())
229
+ if (listIndex < (uint32_t ) mSupportedMaps .size ())
230
230
{
231
231
aSupportedMap = mSupportedMaps [listIndex];
232
232
ret_value = true ;
@@ -243,7 +243,7 @@ bool RvcServiceAreaDelegate::GetSupportedMapById(uint8_t aMapId, uint32_t & list
243
243
bool ret_value = false ;
244
244
245
245
listIndex = 0 ;
246
- uint32_t listSize = (uint32_t )mSupportedMaps .size ();
246
+ uint32_t listSize = (uint32_t ) mSupportedMaps .size ();
247
247
248
248
while (listIndex < listSize)
249
249
{
@@ -268,11 +268,11 @@ bool RvcServiceAreaDelegate::AddSupportedMap(const MapStructureWrapper & newMap,
268
268
// etc.
269
269
270
270
// Double-check list size to ensure there no memory issues.
271
- if ((uint32_t )mSupportedMaps .size () < kMaxNumSupportedMaps )
271
+ if ((uint32_t ) mSupportedMaps .size () < kMaxNumSupportedMaps )
272
272
{
273
273
// not sorting list, number of locations normally expected to be small, max 255
274
274
mSupportedMaps .push_back (newMap);
275
- listIndex = (uint32_t )mSupportedMaps .size () - 1 ; // new element is last in list
275
+ listIndex = (uint32_t ) mSupportedMaps .size () - 1 ; // new element is last in list
276
276
}
277
277
else
278
278
{
@@ -307,7 +307,7 @@ bool RvcServiceAreaDelegate::ClearSupportedMaps()
307
307
{
308
308
bool ret_value = false ;
309
309
310
- if ((uint32_t )mSupportedMaps .size () > 0 )
310
+ if ((uint32_t ) mSupportedMaps .size () > 0 )
311
311
{
312
312
mSupportedMaps .clear ();
313
313
ret_value = true ;
@@ -321,14 +321,14 @@ bool RvcServiceAreaDelegate::ClearSupportedMaps()
321
321
322
322
uint32_t RvcServiceAreaDelegate::GetNumberOfSelectedLocations ()
323
323
{
324
- return (uint32_t )mSelectedLocations .size ();
324
+ return (uint32_t ) mSelectedLocations .size ();
325
325
}
326
326
327
327
bool RvcServiceAreaDelegate::GetSelectedLocationByIndex (uint32_t listIndex, uint32_t & aSelectedLocation)
328
328
{
329
329
bool ret_value = false ;
330
330
331
- if (listIndex < (uint32_t )mSelectedLocations .size ())
331
+ if (listIndex < (uint32_t ) mSelectedLocations .size ())
332
332
{
333
333
aSelectedLocation = mSelectedLocations [listIndex];
334
334
ret_value = true ;
@@ -345,11 +345,11 @@ bool RvcServiceAreaDelegate::AddSelectedLocation(uint32_t aLocationId, uint32_t
345
345
// etc.
346
346
347
347
// Double-check list size to ensure there no memory issues.
348
- if ((uint32_t )mSelectedLocations .size () < kMaxNumSelectedLocations )
348
+ if ((uint32_t ) mSelectedLocations .size () < kMaxNumSelectedLocations )
349
349
{
350
350
// not sorting list, number of locations normally expected to be small, max 255
351
351
mSelectedLocations .push_back (aLocationId);
352
- listIndex = (uint32_t )mSelectedLocations .size () - 1 ; // new element is last in list
352
+ listIndex = (uint32_t ) mSelectedLocations .size () - 1 ; // new element is last in list
353
353
}
354
354
else
355
355
{
@@ -364,7 +364,7 @@ bool RvcServiceAreaDelegate::ClearSelectedLocations()
364
364
{
365
365
bool ret_value = false ;
366
366
367
- if ((uint32_t )mSelectedLocations .size () > 0 )
367
+ if ((uint32_t ) mSelectedLocations .size () > 0 )
368
368
{
369
369
mSelectedLocations .clear ();
370
370
ret_value = true ;
@@ -378,14 +378,14 @@ bool RvcServiceAreaDelegate::ClearSelectedLocations()
378
378
379
379
uint32_t RvcServiceAreaDelegate::GetNumberOfProgressElements ()
380
380
{
381
- return (uint32_t )mProgressList .size ();
381
+ return (uint32_t ) mProgressList .size ();
382
382
}
383
383
384
384
bool RvcServiceAreaDelegate::GetProgressElementByIndex (uint32_t listIndex, Structs::ProgressStruct::Type & aProgressElement)
385
385
{
386
386
bool ret_value = false ;
387
387
388
- if (listIndex < (uint32_t )mProgressList .size ())
388
+ if (listIndex < (uint32_t ) mProgressList .size ())
389
389
{
390
390
aProgressElement = mProgressList [listIndex];
391
391
ret_value = true ;
@@ -403,7 +403,7 @@ bool RvcServiceAreaDelegate::GetProgressElementById(uint32_t aLocationId, uint32
403
403
bool ret_value = false ;
404
404
405
405
listIndex = 0 ;
406
- uint32_t listSize = (uint32_t )mProgressList .size ();
406
+ uint32_t listSize = (uint32_t ) mProgressList .size ();
407
407
408
408
while (listIndex < listSize)
409
409
{
@@ -428,11 +428,11 @@ bool RvcServiceAreaDelegate::AddProgressElement(const Structs::ProgressStruct::T
428
428
// etc.
429
429
430
430
// Double-check list size to ensure there no memory issues.
431
- if ((uint32_t )mProgressList .size () < kMaxNumProgressElements )
431
+ if ((uint32_t ) mProgressList .size () < kMaxNumProgressElements )
432
432
{
433
433
// not sorting list, number of locations normally expected to be small, max 255
434
434
mProgressList .push_back (newProgressElement);
435
- listIndex = (uint32_t )mProgressList .size () - 1 ; // new element is last in list
435
+ listIndex = (uint32_t ) mProgressList .size () - 1 ; // new element is last in list
436
436
}
437
437
else
438
438
{
@@ -457,7 +457,7 @@ bool RvcServiceAreaDelegate::ClearProgress()
457
457
{
458
458
bool ret_value = false ;
459
459
460
- if ((uint32_t )mProgressList .size () > 0 )
460
+ if ((uint32_t ) mProgressList .size () > 0 )
461
461
{
462
462
mProgressList .clear ();
463
463
ret_value = true ;
0 commit comments