1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
/** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **
* This file is part of clib library
* Copyright (C) 2011 Avinash Dongre ( dongre.avinash@gmail.com )
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **/
#include "c_lib.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
static int
compare_e ( void *left, void *right ) {
int *l = (int*) left;
int *r = (int*) right;
return *l == *r ;
}
static void
free_e ( void *ptr ) {
if ( ptr )
free ( ptr);
}
void
test_clib_deque() {
int flip = 1;
int i = 0;
int limit = 20;
void* element;
int j = 0;
struct clib_deque* myDeq = new_clib_deque ( 10, compare_e, NULL);
assert ( (struct clib_deque*)0 != myDeq );
for ( i = 0; i <= limit; i++ ) {
if ( flip ) {
push_back_clib_deque ( myDeq, &i , sizeof(int));
flip = 0;
} else {
push_front_clib_deque ( myDeq, &i, sizeof(int) );
flip = 1;
}
}
front_clib_deque ( myDeq, &element );
assert ( *(int*)element == limit - 1 );
free ( element );
back_clib_deque ( myDeq, &element );
assert ( *(int*)element == limit);
free ( element );
while ( empty_clib_deque(myDeq) != clib_true ) {
pop_front_clib_deque ( myDeq);
}
delete_clib_deque(myDeq);
myDeq = new_clib_deque ( 10, compare_e, free_e);
for ( i = 0; i <= limit; i ++ ) {
int *v = (int*)malloc(sizeof(int ));
memcpy ( v, &i, sizeof ( int ));
push_back_clib_deque ( myDeq, v , sizeof(int*));
free ( v );
}
for ( i = myDeq->head + 1; i < myDeq->tail; i++ ){
void *elem;
if ( element_at_clib_deque( myDeq, i, &elem ) == CLIB_ERROR_SUCCESS ) {
assert ( *(int*)elem == j++ );
free ( elem );
}
}
delete_clib_deque(myDeq);
}
|
