https://github.com/brendanddev/collections-from-scratch
https://github.com/brendanddev/collections-from-scratch
Last synced: 8 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/brendanddev/collections-from-scratch
- Owner: brendanddev
- License: mit
- Created: 2025-08-23T14:58:36.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2025-08-23T15:59:53.000Z (10 months ago)
- Last Synced: 2025-08-24T05:37:20.584Z (10 months ago)
- Language: Java
- Size: 13.7 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Collections From Scratch
This project explores **Data Structures and Collections in Java** by implementing them from scratch, without using the Java Collections Framework (JCF).
---
## Overview
This repository contains implementations of common data structures such as lists, sets, maps, stacks, queues, heaps, and trees.
Each data structure is built from first principles, including custom iterators and benchmarking utilities to compare performance.
Performance comparison utilities that benchmark custom data structures against Java's built-in counterparts (e.g., `PriorityQueue` for heaps, `TreeSet` for binary trees) using shuffled datasets to ensure fair testing.
---
## Features
- Core abstractions (`CustomCollection`, `CustomIterator`)
- Array-based and linked implementations (`CustomArrayList`, `CustomLinkedList`)
- Hash-based Collections (`CustomHashSet`, `CustomHashMap`)
- Stack, Queue, and Deque implementations (`CustomStack`, `CustomQueue`, `CustomDeque`)
- Tree structures (`CustomBinaryTree`)
- Heap implementations (`CustomHeapList`)
- Benchmarking utilities (`Benchmark.java`)
---
## Project Structure
```
src/main/java/com/brendanddev/collections
│
├── core/ # Shared interfaces & iterators
│ ├── CustomCollection.java
│ └── CustomIterator.java
│
├── list/ # Linear data structures
│ ├── CustomArrayList.java
│ └── CustomLinkedList.java
│
├── set/ # Unique element collections
│ └── CustomHashSet.java
│
├── map/ # Key-Value structures
│ └── CustomHashMap.java
│
├── queue/ # FIFO & Priority queues
│ ├── CustomQueue.java
│ ├── CustomDeque.java
│ └── CustomLinkedPriorityQueue.java
│
├── stack/ # LIFO structure
│ └── CustomStack.java
│
├── heap/ # Binary heap implementations
│ ├── CustomHeap.java
│ └── CustomHeapList.java
│
├── tree/ # Hierarchical structures
│ └── CustomBinaryTree.java
│
├── performance/ # Benchmarking utilities
│ ├── Benchmark.java
│ ├── CompareLists.java
│ ├── CompareQueues.java
│ ├── CompareStack.java
│ ├── CompareHeaps.java
│ ├── CompareMaps.java
│ ├── CompareSets.java
│ └── CompareTrees.java
│
└── Main.java # Entry point for demos/benchmarks
```
---
## Usage
### Running the Demos
You can run the `Main` class to see basic demos of your custom collections in action:
```bash
mvn compile exec:java -Dexec.mainClass="com.brendanddev.collections.Main"
```
This will compile the project and run the main entry point. You can modify Main.java to call any custom collection and test basic operations.
### Running Benchmarks
The `performance` package contains benchmarking utilities to compare your custom implementations with standard Java collections. Each `Compare*.java` class runs performance tests for a specific data structure.