dsa_hkc_docs/stack_8h_source.html

#ifndef STACK_H

#define STACK_H


#include <stdbool.h>


// --- Public Constants and Definitions ---


#define STACK_EMPTY (-2147483647 - 1)


typedef struct {

  int *data;

  int top;

  int capacity;

} Stack;


// --- Public Function Prototypes ---


Stack *stack_create(int capacity);


void stack_destroy(Stack *s);


bool stack_push(Stack *s, int value);


int stack_pop(Stack *s);


int stack_peek(const Stack *s);


int stack_size(const Stack *s);


bool stack_is_empty(const Stack *s);


#endif // STACK_H

stack_destroy
void stack_destroy(Stack *s)
Destroy a stack and release its allocated memory.
Definition stack.c:20

stack_size
int stack_size(const Stack *s)
Get the current number of elements in the stack.
Definition stack.c:47

stack_pop
int stack_pop(Stack *s)
Pop the value at the top of the stack.
Definition stack.c:35

stack_peek
int stack_peek(const Stack *s)
Return the value at the top of the stack without removing it.
Definition stack.c:41

stack_push
bool stack_push(Stack *s, int value)
Push a value onto the top of the stack.
Definition stack.c:27

stack_create
Stack * stack_create(int capacity)
Allocate and initialize a new stack.
Definition stack.c:4

stack_is_empty
bool stack_is_empty(const Stack *s)
Check whether the stack is empty.
Definition stack.c:49

Stack
Representation of a stack of integers.
Definition stack.h:37

Stack::data
int * data
Pointer to the dynamically allocated array of integers.
Definition stack.h:38

Stack::capacity
int capacity
Maximum number of elements the stack can hold.
Definition stack.h:40

Stack::top
int top
Index of the current top element (-1 if empty)
Definition stack.h:39