5 #include "config_test.h" 45 for( i = 0; i < 32; i++) {
51 printf(
"pushed item %d=%d (stack top %g), vector size: %u, capacity: %u\n", i, x,
jm_stack_top(
double)(s),
53 if(top != x)
log_error(
"Stack top does not match the pushed value \n");
59 if( index != 2)
log_error(
"Index of '%d' should be '2' but got %d\n",
TESTVAL, k );
61 for( i = 0; i < 22; i++) {
64 jm_vector_resize_int(
v,10);
65 printf(
"Printing the vector \n");
68 printf(
"Printing sorted vector \n");
71 printf(
"Printing the stack \n");
#define jm_vector_find_index(T)
void log_error(const char *fmt,...)
#define jm_vector_foreach_c(T)
#define jm_vector_bsearch_index(T)
#define jm_stack_push(T)
Put an element on the stack.
#define jm_vector_free_data(T)
#define jm_vector_reserve(T)
#define jm_vector_zero(T)
jm_vector(JM_TEMPLATE_INSTANCE_TYPE)*jm_vector_alloc(JM_TEMPLATE_INSTANCE_TYPE)(size_t size
#define jm_vector_qsort(T)
#define jm_vector_push_back(T)
#define jm_vector_init(T)
jm_vector_init initializes a vector allocated on stack.
#define jm_vector_get_size(T)
#define jm_vector_set_item(T)
#define jm_stack_free(T)
Release memory allocated for a stack.
void print_int(int i, void *data)
#define jm_stack_foreach(T)
#define jm_stack(T)
A basic stack of items.
int compar_int(int *a, int *b)
#define jm_stack_alloc(T)
Allocates a stack with the given reserved memory.
void print_dbl(double d, void *data)