GitHub - derwolfe/hw5: worker simulation

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 30 Commits
assignment		assignment
Document.cpp		Document.cpp
Document.h		Document.h
Document.o		Document.o
LinkedList.cpp		LinkedList.cpp
LinkedList.h		LinkedList.h
LinkedList.o		LinkedList.o
Linked_List.cpp		Linked_List.cpp
Linked_List.h		Linked_List.h
Office.cpp		Office.cpp
Office.h		Office.h
Office.o		Office.o
Queue.cpp		Queue.cpp
Queue.h		Queue.h
Queue.o		Queue.o
README		README
Stack.cpp		Stack.cpp
Stack.h		Stack.h
Stack.o		Stack.o
doc_test.cpp		doc_test.cpp
infile.txt		infile.txt
llp.cpp		llp.cpp
llp.h		llp.h
main.cpp		main.cpp
main.o		main.o
makefile		makefile
mktest		mktest
no_such_object_exception.h		no_such_object_exception.h
office_sim		office_sim
output1		output1
output1.correct		output1.correct

Repository files navigation

This project will simulate the workflow of an office. Let's say the office is a sewage plant.

Bob, the lead sewage worker, has an inbox. The underlings come in and drop documents in this overflowing box. Bob can barely keep up, so he has his underlings assign a priority of 1 through 3, with one being a horrific sewer explosion and three being a floater in a filter.

Bob obviously needs to read the important documents before the lesser ones. He also can only sort these out while not busying himself with another task. So, he either sorts, reads, or is out of the office. 

Once he sorts the documents by priority, he sets them into a simple queue. they are stacked, and taken from the stack and placed in queue. Similar to taking a page and flipping it face down on a stack. 


There will be three queues, each filled with documents. i

The infile lists a document by name and priority. I.e. A 2. One could use an index for this, but why not search for the element directly?
My implementation of the doubly-linked list should make it simple to find and delete the document, regardless of it's index, which seems to be the point.