data-structures/stack_8h_source.html

#ifndef STACK_H

#define STACK_H


#define STACK_STATIC_MAX 10

#include "../iterator/iterator.h"


typedef struct stack Stack;


Stack* stack_create(void);


int stack_empty(Stack* s);


void stack_push(Stack* s, int data);


int stack_pop(Stack* s);


bool stack_has(Stack* s, int data);


void stack_print(Stack* s);


void stack_println(Stack* s);


void stack_free(Stack* s);


// additional functions


int stack_top(Stack* s);


int stack_odds(Stack* s);


Iterator* stack_iterator(Stack *s);


#endif

stack_odds
int stack_odds(Stack *s)
Counts the number of odd elements in a stack.

stack_push
void stack_push(Stack *s, int data)
Pushes an element onto the top of a stack.

stack_pop
int stack_pop(Stack *s)
Pops an element from the top of a stack.

stack_has
bool stack_has(Stack *s, int data)
Check if element is on the stack.

stack_top
int stack_top(Stack *s)
Returns the element at the top of a stack without removing it.

stack_print
void stack_print(Stack *s)
Prints the elements of a stack to the console.

stack_println
void stack_println(Stack *s)
Prints the elements of a stack to the console, followed by a newline character.

stack_empty
int stack_empty(Stack *s)
Checks if a stack is empty.

stack_iterator
Iterator * stack_iterator(Stack *s)
Iterator of a stack structure.

stack_create
Stack * stack_create(void)
Creates an empty stack.

stack_free
void stack_free(Stack *s)
Frees the memory allocated for a stack.

iterator.h

Stack
struct stack Stack
A stack data structure.
Definition stack.h:22

Iterator
A generic iterator struct.
Definition iterator.h:13