feat: add authors

This commit is contained in:
Yadunand Prem 2022-08-31 12:31:30 +08:00
parent 66b20a37b7
commit 638c644326
13 changed files with 73 additions and 44 deletions

View File

@ -1,4 +1,8 @@
/**
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
class ArrivalEvent extends BaseShopEvent {
double serviceTime;

View File

@ -4,8 +4,8 @@
* simulation. Your task is to replace this
* class with new classes, following proper OOP principles.
*
* @author Wei Tsang
* @version CS2030S AY21/22 Semester 2
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
abstract class BaseShopEvent extends Event {

View File

@ -1,3 +1,7 @@
/**
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
public class Customer {
final private int id;

View File

@ -1,4 +1,7 @@
/**
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
class DepartureEvent extends BaseShopEvent {
public DepartureEvent(double time, Customer customer, Shop shop) {

View File

@ -1,16 +1,16 @@
/**
* The Event class is an abstract class that encapsulates a
* discrete event to be simulated. An event encapsulates the
* time the event occurs. A subclass of event _must_ override
* the simulate() method to implement the logic of the
* The Event class is an abstract class that encapsulates a
* discrete event to be simulated. An event encapsulates the
* time the event occurs. A subclass of event _must_ override
* the simulate() method to implement the logic of the
* simulation when this event is simulated. The simulate method
* returns an array of events, which the simulator will then
* add to the event queue. Note that an event also implements
* the Comparable interface so that a PriorityQueue can
* returns an array of events, which the simulator will then
* add to the event queue. Note that an event also implements
* the Comparable interface so that a PriorityQueue can
* arrange the events in the order of event time.
*
* @author Wei Tsang
* @version CS2030S AY21/22 Semester 2
*
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
abstract class Event implements Comparable<Event> {
/** The time this event occurs in the simulation. */
@ -38,8 +38,8 @@ abstract class Event implements Comparable<Event> {
* Compare this event with a given event e.
*
* @param e The other event to compare to.
* @return 1 if this event occurs later than e;
* 0 if they occur the same time;
* @return 1 if this event occurs later than e;
* 0 if they occur the same time;
* -1 if this event occurs earlier.
*/
@Override

View File

@ -3,8 +3,8 @@ import java.util.Scanner;
/**
* The main class for CS2030S Lab 1.
*
* @author Wei Tsang
* @version CS2030S AY21/22 Semester 2
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
class Lab1 {
public static void main(String[] args) {
@ -12,8 +12,8 @@ class Lab1 {
// Create a scanner to read from standard input.
Scanner sc = new Scanner(System.in);
// Create a simulation. The ShopSimulation
// constructor will read the simulation parameters
// Create a simulation. The ShopSimulation
// constructor will read the simulation parameters
// and initial events using the scanner.
Simulation simulation = new ShopSimulation(sc);

View File

@ -1,4 +1,7 @@
/**
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
class ServiceBeginEvent extends BaseShopEvent {
double serviceTime;
@ -18,9 +21,9 @@ class ServiceBeginEvent extends BaseShopEvent {
@Override
public Event[] simulate() {
this.counter.setAvailable(false);
this.counter.occupy();
double endTime = this.getTime() + this.serviceTime;
return new Event[] {
new ServiceEndEvent(endTime, this.customer, this.shop, this.counter) };
}
}
}

View File

@ -1,4 +1,7 @@
/**
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
class ServiceEndEvent extends BaseShopEvent {
ShopCounter counter;
@ -16,7 +19,7 @@ class ServiceEndEvent extends BaseShopEvent {
@Override
public Event[] simulate() {
this.counter.setAvailable(true);
this.counter.free();
return new Event[] { new DepartureEvent(this.getTime(), customer, shop) };
}
}

View File

@ -1,3 +1,7 @@
/**
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
public class Shop {
private ShopCounter[] counters;

View File

@ -1,3 +1,7 @@
/**
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
public class ShopCounter {
final private int id;
private boolean available;
@ -6,8 +10,12 @@ public class ShopCounter {
return available;
}
public void setAvailable(boolean available) {
this.available = available;
public void occupy() {
this.available = false;
}
public void free() {
this.available = true;
}
public ShopCounter(int id) {

View File

@ -3,8 +3,8 @@ import java.util.Scanner;
/**
* This class implements a shop simulation.
*
* @author Wei Tsang
* @version CS2030S AY21/22 Semester 2
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
class ShopSimulation extends Simulation {

View File

@ -1,19 +1,19 @@
/**
* This class is a general abstract class that
* encapsulates a simulation. To implement a
* encapsulates a simulation. To implement a
* simulation, inherit from this class and implement
* the `getInitialEvents` method.
* the `getInitialEvents` method.
*
* @author Wei Tsang
* @version CS2030S AY21/22 Semester 2
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
abstract class Simulation {
/**
* An abstract method to return an array of events
* used to initialize the simulation.
*
* @return An array of initial events that the
* simulator can use to kick-start the
* @return An array of initial events that the
* simulator can use to kick-start the
* simulation.
*/
public abstract Event[] getInitialEvents();

View File

@ -3,19 +3,19 @@ import java.util.PriorityQueue;
/**
* This class implements a discrete event simulator.
* The simulator maintains a priority queue of events.
* It runs through the events and simulates each one until
* It runs through the events and simulates each one until
* the queue is empty.
*
* @author Wei Tsang
* @version CS2030S AY21/22 Semester 2
* @author Yadunand Prem
* @version CS2030S AY22/23 Semester 2
*/
public class Simulator {
/** The event queue. */
private final PriorityQueue<Event> events;
/**
* The constructor for a simulator. It takes in
* a simulation as an argument, and calls the
/**
* The constructor for a simulator. It takes in
* a simulation as an argument, and calls the
* getInitialEvents method of that simulation to
* initialize the event queue.
*
@ -30,10 +30,10 @@ public class Simulator {
/**
* Run the simulation until no more events is in
* the queue. For each event in the queue (in
* increasing order of time), print out its string
* representation, then simulate it. If the
* simulation returns one or more events, add them
* the queue. For each event in the queue (in
* increasing order of time), print out its string
* representation, then simulate it. If the
* simulation returns one or more events, add them
* to the queue, and repeat.
*/
public void run() {