jm_stack.h

Go to the documentation of this file.

/*
    Copyright (C) 2012 Modelon AB

    This program is free software: you can redistribute it and/or modify
    it under the terms of the BSD style license.

     This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    FMILIB_License.txt file for more details.

    You should have received a copy of the FMILIB_License.txt file
    along with this program. If not, contact Modelon AB <http://www.modelon.com>.
*/

#ifndef jm_stack_h_
#define jm_stack_h_

#include "jm_vector.h"
#ifdef __cplusplus
extern "C" {
#endif

#define jm_stack(T) jm_mangle(jm_stack, T)

#define jm_stack_alloc(T) jm_mangle(jm_stack_alloc, T)

#define jm_stack_free(T) jm_mangle(jm_stack_free, T)

#define jm_stack_init(T) jm_mangle(jm_stack_init, T)

#define jm_stack_free_data(T) jm_mangle(jm_stack_free_data, T)

#define jm_stack_get_size(T) jm_mangle(jm_stack_get_size, T)

#define jm_stack_reserve(T) jm_mangle(jm_stack_reserve, T)

#define jm_stack_push(T) jm_mangle(jm_stack_push, T)

#define jm_stack_is_empty(T) jm_mangle(jm_stack_is_empty, T)

#define jm_stack_pop(T) jm_mangle(jm_stack_pop, T)

#define jm_stack_top(T) jm_mangle(jm_stack_top, T)

#define jm_stack_foreach(T) jm_mangle(jm_stack_foreach, T)


#define JM_STACK_MINIMAL_CAPACITY JM_VECTOR_MINIMAL_CAPACITY

#define JM_STACK_MAX_MEMORY_CHUNK JM_VECTOR_MAX_MEMORY_CHUNK

#define jm_stack_declare_template(T)            \
typedef jm_vector(T) jm_stack(T);                                       \
 \
static jm_stack(T)* jm_stack_alloc(T)(size_t capacity,jm_callbacks* c) { return jm_vector_alloc(T)(0, capacity, c); }   \
    \
static void jm_stack_free(T)(jm_stack(T) * a) { jm_vector_free(T)(a); } \
    \
static void jm_stack_init(T)(jm_stack(T)* a, jm_callbacks* c) { jm_vector_init(T)(a,0,c); }     \
\
static void jm_stack_free_data(T)(jm_stack(T)* a) { jm_vector_free_data(T)(a); } \
\
static size_t jm_stack_get_size(T)(jm_stack(T)* a) { return jm_vector_get_size(T)(a); } \
\
static size_t jm_stack_reserve(T)(jm_stack(T)* a, size_t capacity) { return jm_vector_reserve(T)(a, capacity);  } \
    \
static T* jm_stack_push(T)(jm_stack(T)* a, T item) { return jm_vector_push_back(T)(a, item); }\
    \
static int jm_stack_is_empty(T)(jm_stack(T)* a) { return ((jm_stack_get_size(T)(a) > 0)? 0:1); } \
    \
static T jm_stack_top(T)(jm_stack(T)* a) { \
    assert(!jm_stack_is_empty(T)(a)); \
    return jm_vector_get_item(T)(a,jm_vector_get_size(T)(a)-1) ; \
} \
            \
static T jm_stack_pop(T)(jm_stack(T)* a) { \
    T ret; \
    ret = jm_stack_top(T)(a); \
    jm_vector_resize(T)(a, jm_vector_get_size(T)(a) - 1); \
    return ret; \
} \
\
static void jm_stack_foreach(T)(jm_stack(T)* a, void (*f)(T, void*), void * data) { jm_vector_foreach_c(T)(a,f,data); }

jm_stack_declare_template(char)
jm_stack_declare_template(int)
jm_stack_declare_template(double)
jm_stack_declare_template(jm_voidp)
jm_stack_declare_template(size_t)
jm_stack_declare_template(jm_string)

#ifdef __cplusplus
}
#endif

#endif