/Users/maurits/Documents/studie/afstuderen/biosphere/common/stack.h

Go to the documentation of this file.

/*
 * Author: MA Hartman
 * Date: feb 28, 2007
 * 
 * Function:
 * A general purpose stack implementation.
 * 
 * License information:
 * 
 * Copyright (c) 2006 Maurits Hartman
 *
 * 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.
 * 
 */

#ifndef STACK_H
#define STACK_H

#include <apr_pools.h>

typedef struct bs_stack
{
    unsigned    size, allocated;
    apr_pool_t  *pool;
    void                **data;
} bs_stack;

bs_stack *new_stack(apr_pool_t *mp);

void delete_stack(bs_stack *stack);

void stack_push(bs_stack *stack, void *data);

void *stack_pop(bs_stack *stack);

void *stack_top(const bs_stack *stack);

int stack_empty(const bs_stack *stack);

void *stack_index(const bs_stack *stack, unsigned index);

inline unsigned stack_size(const bs_stack *stack);

#endif /*STACK_H_*/

---