50
|
1 |
// Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
|
|
2 |
// All rights reserved.
|
|
3 |
// This component and the accompanying materials are made available
|
|
4 |
// under the terms of "Eclipse Public License v1.0"
|
|
5 |
// which accompanies this distribution, and is available
|
|
6 |
// at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
7 |
//
|
|
8 |
// Initial Contributors:
|
|
9 |
// Nokia Corporation - initial contribution.
|
|
10 |
//
|
|
11 |
// Contributors:
|
|
12 |
//
|
|
13 |
// Description:
|
|
14 |
//
|
|
15 |
|
|
16 |
|
|
17 |
#undef G_DISABLE_ASSERT
|
|
18 |
#undef G_LOG_DOMAIN
|
|
19 |
|
|
20 |
#include <glib.h>
|
72
|
21 |
#include <sys/stat.h>
|
|
22 |
#include <glib/gprintf.h>
|
|
23 |
#ifdef __SYMBIAN32__
|
|
24 |
#include "mrt2_glib2_test.h"
|
|
25 |
#endif /*__SYMBIAN32__*/
|
50
|
26 |
|
|
27 |
static gint sort (gconstpointer a, gconstpointer b)
|
|
28 |
{
|
|
29 |
if(*(guint32*)a == *(guint32*)b)
|
|
30 |
return 0;
|
|
31 |
else
|
|
32 |
return *(guint32*)a < *(guint32*)b ? -1 : 1;
|
|
33 |
}
|
|
34 |
|
|
35 |
|
|
36 |
static gint sort_userdata (gconstpointer a, gconstpointer b, gpointer user_data)
|
|
37 |
{
|
|
38 |
if(*(guint32*)a == *(guint32*)b)
|
|
39 |
return 0;
|
|
40 |
else
|
|
41 |
return *(guint32*)a < *(guint32*)b ? -1 : 1;
|
|
42 |
}
|
|
43 |
|
|
44 |
|
|
45 |
|
|
46 |
/*Will return TRUE if input GArray and int[] array 2 are same else FALSE*/
|
|
47 |
gboolean compare_array(GArray* array1, gint* array2, gint size)
|
|
48 |
{
|
|
49 |
|
|
50 |
int i;
|
|
51 |
if ( size != array1->len)
|
|
52 |
return FALSE;
|
|
53 |
for ( i = 0; i < size ; i++)
|
|
54 |
{
|
|
55 |
if ( g_array_index(array1, gint, i) != array2[i])
|
|
56 |
return FALSE;
|
|
57 |
}
|
|
58 |
|
|
59 |
return TRUE;
|
|
60 |
}
|
|
61 |
|
|
62 |
|
|
63 |
void test_remove_array_index()
|
|
64 |
{
|
|
65 |
GArray *garray;
|
|
66 |
|
|
67 |
const gint ARRAY_SIZE = 7;
|
|
68 |
const gint ARRAY_SIZE_AFTER_REMOVE_INDEX = 6;
|
|
69 |
const gint ARRAY_SIZE_AFTER_REMOVE_INDEX_FAST = 5;
|
|
70 |
|
|
71 |
gint array[ARRAY_SIZE] = {4,5,6,7,8,9,10};
|
|
72 |
gint array_after_remove_index_1[ARRAY_SIZE_AFTER_REMOVE_INDEX]= {4,6,7,8,9,10}; /*array after removing index 1*/
|
|
73 |
gint array_after_remove_index_fast_2[ARRAY_SIZE_AFTER_REMOVE_INDEX_FAST] = {4,6,10,8,9}; /* array after removing index 2 fast. Input is array after removing index 1 */
|
|
74 |
|
|
75 |
int i;
|
|
76 |
gboolean ret;
|
|
77 |
|
|
78 |
garray = g_array_new (FALSE,FALSE,sizeof(gint));
|
|
79 |
if(garray == NULL)
|
|
80 |
{
|
72
|
81 |
g_print( "Array not created");
|
50
|
82 |
assert_failed = 1;
|
|
83 |
return ;
|
|
84 |
}
|
|
85 |
|
|
86 |
/*Insert values into array*/
|
|
87 |
g_array_insert_vals(garray,0,array,ARRAY_SIZE);
|
|
88 |
|
|
89 |
/* test for deleting single element in an array. Removing the element with index 1*/
|
72
|
90 |
g_print( "Delete array element at index 1");
|
50
|
91 |
garray = g_array_remove_index(garray,1);
|
|
92 |
|
|
93 |
if(garray == NULL )
|
|
94 |
{
|
72
|
95 |
g_print( "NULL return by g_array_remove_index");
|
50
|
96 |
assert_failed = 1;
|
|
97 |
return ;
|
|
98 |
}
|
|
99 |
|
|
100 |
/*Print the array elements after remove*/
|
|
101 |
for(i=0; i<garray->len; i++)
|
|
102 |
{
|
72
|
103 |
g_print( "Current array element at index %d is %d", i,g_array_index(garray, gint, i));
|
50
|
104 |
}
|
|
105 |
|
|
106 |
/*Check if the array size is now 4 and element at index 1 is not 5 after removal*/
|
|
107 |
|
|
108 |
ret = compare_array(garray, array_after_remove_index_1, ARRAY_SIZE_AFTER_REMOVE_INDEX);
|
|
109 |
if ( !ret)
|
|
110 |
{
|
72
|
111 |
g_print( "Array Element not properly deleted by g_array_remove_index");
|
50
|
112 |
assert_failed = 1;
|
|
113 |
g_array_free(garray,TRUE);
|
|
114 |
return ;
|
|
115 |
}
|
|
116 |
|
|
117 |
|
|
118 |
/* Test to remove index element 2 using g_array_remove_index_fast*/
|
|
119 |
|
72
|
120 |
g_print( "Delete array element at index 2");
|
50
|
121 |
garray =g_array_remove_index_fast(garray,2);
|
|
122 |
if(garray == NULL)
|
|
123 |
{
|
72
|
124 |
g_print( "NULL return by g_array_remove_index_fast");
|
50
|
125 |
assert_failed = 1;
|
|
126 |
return ;
|
|
127 |
}
|
|
128 |
|
|
129 |
for(i=0; i<garray->len; i++)
|
|
130 |
{
|
72
|
131 |
g_print( "Current array element at index %d is %d", i,g_array_index(garray, gint, i));
|
50
|
132 |
}
|
|
133 |
|
|
134 |
ret = compare_array(garray, array_after_remove_index_fast_2, ARRAY_SIZE_AFTER_REMOVE_INDEX_FAST);
|
|
135 |
if ( !ret)
|
|
136 |
{
|
72
|
137 |
g_print( "Array Element not properly deleted by g_array_remove_index_fast");
|
50
|
138 |
assert_failed = 1;
|
|
139 |
g_array_free(garray,TRUE);
|
|
140 |
return;
|
|
141 |
}
|
|
142 |
g_array_free(garray,TRUE);
|
|
143 |
}
|
|
144 |
|
|
145 |
|
|
146 |
void test_test_remove_array_index_range()
|
|
147 |
{
|
|
148 |
const int ARRAY_SIZE = 10;
|
|
149 |
const int ARRAY_SIZE_AFTER_REMOVE_INDEX_RANGE = 8;
|
|
150 |
|
|
151 |
gint array[ARRAY_SIZE]= {10,5,16,7,11,0,20,1,9,8};
|
|
152 |
gint array_after_remove_index_range[ARRAY_SIZE_AFTER_REMOVE_INDEX_RANGE] = {10,5,16,0,20,1,9,8}; /*after removing 2 elements from index 3*/
|
|
153 |
|
|
154 |
gboolean ret;
|
|
155 |
GArray* garray;
|
|
156 |
int i;
|
|
157 |
|
|
158 |
garray = g_array_new (FALSE,FALSE,sizeof(gint));
|
|
159 |
if(garray == NULL)
|
|
160 |
{
|
72
|
161 |
g_print( "Array not created");
|
50
|
162 |
assert_failed = 1;
|
|
163 |
return ;
|
|
164 |
}
|
|
165 |
|
|
166 |
g_array_insert_vals(garray,0,array,ARRAY_SIZE);
|
|
167 |
for(i=0; i<garray->len;i++)
|
|
168 |
{
|
72
|
169 |
g_print( "Current array elements %d is %d", i,g_array_index(garray, gint, i));
|
50
|
170 |
}
|
|
171 |
|
|
172 |
garray = g_array_remove_range(garray,3,2); /*remove two elements from index 3 */
|
|
173 |
|
|
174 |
if(garray == NULL)
|
|
175 |
{
|
72
|
176 |
g_print("Elements not deleted properly by g_array_remove_range");
|
50
|
177 |
assert_failed = 1;
|
|
178 |
return ;
|
|
179 |
|
|
180 |
}
|
|
181 |
|
|
182 |
/*print the array elements */
|
|
183 |
for(i=0; i<garray->len;i++)
|
|
184 |
{
|
72
|
185 |
g_print( "Curent array element(after deletion) %d is %d", i,g_array_index(garray, gint, i));
|
50
|
186 |
}
|
|
187 |
|
|
188 |
|
|
189 |
ret = compare_array(garray, array_after_remove_index_range, ARRAY_SIZE_AFTER_REMOVE_INDEX_RANGE);
|
|
190 |
if(!ret)
|
|
191 |
{
|
72
|
192 |
g_print("Elements not deleted properly");
|
50
|
193 |
assert_failed = 1;
|
|
194 |
g_array_free(garray,TRUE);
|
|
195 |
return ;
|
|
196 |
}
|
|
197 |
g_array_free(garray,TRUE);
|
|
198 |
}
|
|
199 |
|
|
200 |
|
|
201 |
void test_sort_array()
|
|
202 |
{
|
|
203 |
|
|
204 |
GArray *garray;
|
|
205 |
const int ARRAY_SIZE = 11;
|
|
206 |
gint array[ARRAY_SIZE] = {10,5,16,7,11,0,20,1,9,8,9};
|
|
207 |
gint sort_array[ARRAY_SIZE] = {0,1,5,7,8,9,9,10,11,16,20};
|
|
208 |
|
|
209 |
gboolean ret;
|
|
210 |
int i;
|
|
211 |
|
|
212 |
/* Test for sorting the array elements */
|
|
213 |
|
|
214 |
garray = g_array_new (FALSE,FALSE,sizeof(gint));
|
|
215 |
|
|
216 |
if(garray == NULL)
|
|
217 |
{
|
72
|
218 |
g_print( "Array not created");
|
50
|
219 |
assert_failed = 1;
|
|
220 |
return ;
|
|
221 |
}
|
|
222 |
g_array_insert_vals(garray,0,array,ARRAY_SIZE);
|
|
223 |
|
|
224 |
g_array_sort(garray, sort);
|
|
225 |
|
|
226 |
if(garray == NULL)
|
|
227 |
{
|
72
|
228 |
g_print( "Array not sorted");
|
50
|
229 |
assert_failed = 1;
|
|
230 |
return ;
|
|
231 |
}
|
|
232 |
|
72
|
233 |
g_print("SORTED ARRAY");
|
50
|
234 |
|
|
235 |
for(i=0;i<garray->len;i++)
|
|
236 |
{
|
72
|
237 |
g_print( "Element %d is %d", i,g_array_index(garray, gint, i));
|
50
|
238 |
}
|
|
239 |
|
|
240 |
ret = compare_array(garray, sort_array, ARRAY_SIZE);
|
|
241 |
|
|
242 |
if(!ret)
|
|
243 |
{
|
72
|
244 |
g_print( "Array not sorted correctly");
|
50
|
245 |
assert_failed = 1;
|
|
246 |
return ;
|
|
247 |
}
|
|
248 |
|
|
249 |
g_array_free(garray,TRUE);
|
|
250 |
|
|
251 |
|
|
252 |
garray = g_array_new (FALSE,FALSE,sizeof(gint));
|
|
253 |
if(garray == NULL)
|
|
254 |
{
|
72
|
255 |
g_print( "Array not created");
|
50
|
256 |
return ;
|
|
257 |
}
|
|
258 |
g_array_insert_vals(garray,0,array,ARRAY_SIZE);
|
|
259 |
|
|
260 |
g_array_sort_with_data (garray, sort_userdata, NULL);
|
|
261 |
|
|
262 |
if(garray == NULL)
|
|
263 |
{
|
72
|
264 |
g_print( "Array not sorted with user data");
|
50
|
265 |
assert_failed = 1;
|
|
266 |
return ;
|
|
267 |
}
|
|
268 |
|
72
|
269 |
g_print("SORTED ARRAY WITH USERDATA");
|
50
|
270 |
for(i=0;i<garray->len;i++)
|
|
271 |
{
|
72
|
272 |
g_print( "Element %d is %d", i,g_array_index(garray, gint, i));
|
50
|
273 |
}
|
|
274 |
|
|
275 |
ret = compare_array(garray, sort_array, ARRAY_SIZE);
|
|
276 |
if(!ret)
|
|
277 |
{
|
72
|
278 |
g_print( "Array not sorted correctly with user data");
|
50
|
279 |
assert_failed = 1;
|
|
280 |
return ;
|
|
281 |
}
|
|
282 |
g_array_free(garray,TRUE);
|
|
283 |
}
|
|
284 |
|
|
285 |
|
|
286 |
int main (void)
|
|
287 |
{
|
72
|
288 |
#ifdef __SYMBIAN32__
|
|
289 |
g_log_set_handler (NULL, G_LOG_FLAG_FATAL| G_LOG_FLAG_RECURSION | G_LOG_LEVEL_CRITICAL | G_LOG_LEVEL_WARNING | G_LOG_LEVEL_MESSAGE | G_LOG_LEVEL_INFO | G_LOG_LEVEL_DEBUG, &mrtLogHandler, NULL);
|
|
290 |
g_set_print_handler(mrtPrintHandler);
|
|
291 |
#endif /*__SYMBIAN32__*/
|
|
292 |
|
|
293 |
g_print("Test array1-test Start");
|
|
294 |
test_test_remove_array_index_range();
|
50
|
295 |
test_sort_array();
|
|
296 |
test_remove_array_index();
|
|
297 |
|
|
298 |
if(assert_failed)
|
72
|
299 |
g_print("Test array1-test Failed");
|
50
|
300 |
else
|
72
|
301 |
g_print("Test array1-test Successful");
|
50
|
302 |
|
72
|
303 |
#if __SYMBIAN32__
|
|
304 |
testResultXml("array1-test");
|
|
305 |
#endif /* EMULATOR */
|
50
|
306 |
return 0;
|
|
307 |
}
|
|
308 |
|
|
309 |
|