A Java-based queue simulator that manages both regular and priority queue orders using core data structures.
I'm interested in how backend systems behave internally and how simple data structures can simulate real-world workflows. This project is part of my journey exploring Java backend systems, simulations, and developer-focused software projects.
- Priority and regular order handling
- FIFO (First In First Out) queue processing
- Enqueue and dequeue operations
- Queue inspection using
peek() - Queue visualization with
displayQueue() - Unique order ID generation
- Object-oriented design using separate classes
- Java
- Java Collections Framework
- Queue Interface
- LinkedList
- Clone the repository
git clone https://github.com/JavaLabs-io/QueueSimulator.git- Open the project in VS Code or any Java IDE
- Run
Main.javafrom thesrc/folder
--- Current Queue ---
Priority orders (4):
[PRIORITY] Order #1 | Saket | Item: CinnamonRoll
[PRIORITY] Order #2 | Taylor | Item: Sourdough
Regular orders (2):
[REGULAR] Order #4 | Alice | Item: Bread
[REGULAR] Order #6 | Ajaz | Item: idk
---------------------
=== Processing Orders ===
Serving (PRIORITY): [PRIORITY] Order #1 | Saket | Item: CinnamonRoll
Serving (PRIORITY): [PRIORITY] Order #2 | Taylor | Item: Sourdough
Serving (REGULAR): [REGULAR] Order #4 | Alice | Item: Bread
Serving (REGULAR): [REGULAR] Order #6 | Ajaz | Item: idk
- Cancel order functionality
- Search orders by ID
- JUnit tests
- GUI version
- REST API integration
This project is part of JavaLabs-IO — a collection of Java backend systems, simulations, tools, and experimental software projects.