Skip to content

Improve Stack implementation to dynamically resize #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
jordanmontt merged 3 commits into from
Jul 23, 2025
Merged

Improve Stack implementation to dynamically resize #9

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
c5f62a2
Fix Stack implementation to be dynamic
Alokzh Jul 20, 2025
2cece9b
Updated README with dynamic growth of stack implementation
Alokzh Jul 20, 2025
ff8fbb0
Fix minor issues & add more tests
Alokzh Jul 20, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 12 additions & 15 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
# Containers-Stack
A High-performance, Array based Stack implementation providing efficient LIFO (Last In, First Out) operations with fixed capacity and proper bounds checking.
A High-performance, Array-based Stack implementation providing efficient LIFO (Last In, First Out) operations with dynamic growth and proper bounds checking.

![Pharo Version](https://img.shields.io/badge/Pharo-10+-blue)
[![License: MIT](https://img.shields.io/badge/License-MIT-green.svg)](LICENSE)
Expand All @@ -10,10 +10,9 @@ A Stack is a linear data structure that follows the LIFO (Last In, First Out) pr

### Key Benefits
- **O(1) Performance**: Constant time push, pop, and top operations
- **Fixed Memory Usage**: Array-based implementation with bounded capacity
- **Memory Safe**: Automatic cleanup prevents memory leaks
- **Dynamic Growth**: Automatically expands capacity when needed - no size limits
- **Simple API**: Clean, intuitive interface following standard conventions
- **Robust Error Handling**: Proper stack overflow and underflow protection
- **Robust Error Handling**: Proper stack underflow protection

## Loading
The following script installs Containers-Stack in Pharo.
Expand All @@ -38,21 +37,19 @@ spec
## Quick Start

```smalltalk
"Create a stack with capacity of 5"
stack := CTStack new: 5.
"Create a stack (grows automatically when needed)"
stack := CTStack new: 2.
stack capacity. "Returns 2"

"Push elements"
stack push: 'first'.
stack push: 'second'.
stack push: 'third'.

"Check top element without removing"
stack top. "Returns 'third'"
"Push elements - grows beyond initial capacity"
stack push: 'first'; push: 'second'; push: 'third'.
stack capacity. "Returns 4 (doubled automatically)"
stack size. "Returns 3"

"Pop elements (LIFO order)"
"LIFO operations"
stack top. "Returns 'third'"
stack pop. "Returns 'third'"
stack pop. "Returns 'second'"
stack pop. "Returns 'second'"
stack pop. "Returns 'first'"

"Stack is now empty"
Expand Down
Loading
Loading