Hi , can you help me to make a main method (test method ) for this application ?

[electrical]

/**
* Maintain the appointments for one day in a diary.*/



public class Day
{
// The first and final bookable hours in a day.
public static final int START_OF_DAY = 9;
public static final int FINAL_APPOINTME NT_TIME = 17;
// The number of bookable hours in a day.
public static final int MAX_APPOINTMENT S_PER_DAY =
FINAL_APPOINTME NT_TIME -
START_OF_DAY + 1;
// A day number within a particular year. (1-366)
private int dayNumber;
// The current list of appointments for this day.
private Appointment[] appointments;
/**
* Constructor for objects of class Day.
* @param dayNumber The number of this day in the year (1-366).
*/
public Day(int dayNumber)
{
this.dayNumber = dayNumber;
appointments = new Appointment[MAX_APPOINTMENT S_PER_DAY];
}
/**
* Try to find space for an appointment.
* @param appointment The appointment to be accommodated.
* @return The earliest time today that can accommodate
* the appointment. Return -1 if there is
* insufficient space.
*/
public int findSpace(Appoi ntment appointment)
{
int duration = appointment.get Duration();
for(int slot = 0; slot < MAX_APPOINTMENT S_PER_DAY; slot++) {
if(appointments[slot] == null) {
final int time = START_OF_DAY + slot;
// Potential start point.
if(duration == 1) {
// Only a single slot needed.
return time;
}
else {
// How many more slots are needed?
int further_slots_r equired = duration - 1;
for(int nextSlot = slot + 1;
further_slots_r equired > 0 &&
appointments[nextSlot] == null;
nextSlot++) {
further_slots_r equired--;
}
if(further_slot s_required == 0) {
// A big enough space has been found.
return time;
}
}
}
}
// Not enough space available.
return -1;
}
/**
* Make an appointment.
* @param time The hour at which the appointment starts.
* @param appointment The appointment to be made.
* @return true if the appointment was successful,
* false otherwise.
*/
public boolean makeAppointment (int time,Appointmen t appointment)
{
if(time >= START_OF_DAY && time <= FINAL_APPOINTME NT_TIME)
{ int startTime = time-START_OF_DAY;
if(appointments[startTime] == null)
{ int duration = appointment.get Duration();
// Fill in all the slots for the full duration
// of the appointment.
for(int i = 0; i < duration; i++)
{ appointments[startTime + i] = appointment; }
return true;
}
else{
return false;}
}
else{
return false;}
}


/**
* Print a list of the day's appointments on standard output.
*/
public void showAppointment s()
{ System.out.prin tln("=== Day " + dayNumber + " ===");
for(int i = 0; i < MAX_APPOINTMENT S_PER_DAY; i++)
{ System.out.prin t ((START_OF_DAY + i) + ": ");
if(appointments[i] != null)
{ System.out.prin tln(appointment s[i].getDescription ());}
else {System.out.pri ntln();}
}
}


/**
* @return The number of this day within the year (1 - 366).
*/
public int getDayNumber()
{
return dayNumber;
}
}

[jkmyoung]

What do you want the main function to do? Do you have a numbered list of steps that it should take?

[ThatThatGuy]

/**
* Maintain the appointments for one day in a diary.*/



public class Day
{
// The first and final bookable hours in a day.
public static final int START_OF_DAY = 9;
public static final int FINAL_APPOINTME NT_TIME = 17;
// The number of bookable hours in a day.
public static final int MAX_APPOINTMENT S_PER_DAY =
FINAL_APPOINTME NT_TIME -
START_OF_DAY + 1;
// A day number within a particular year. (1-366)
private int dayNumber;
// The current list of appointments for this day.
private Appointment[] appointments;
/**
* Constructor for objects of class Day.
* @param dayNumber The number of this day in the year (1-366).
*/
public Day(int dayNumber)
{
this.dayNumber = dayNumber;
appointments = new Appointment[MAX_APPOINTMENT S_PER_DAY];
}
/**
* Try to find space for an appointment.
* @param appointment The appointment to be accommodated.
* @return The earliest time today that can accommodate
* the appointment. Return -1 if there is
* insufficient space.
*/
public int findSpace(Appoi ntment appointment)
{
int duration = appointment.get Duration();
for(int slot = 0; slot < MAX_APPOINTMENT S_PER_DAY; slot++) {
if(appointments[slot] == null) {
final int time = START_OF_DAY + slot;
// Potential start point.
if(duration == 1) {
// Only a single slot needed.
return time;
}
else {
// How many more slots are needed?
int further_slots_r equired = duration - 1;
for(int nextSlot = slot + 1;
further_slots_r equired > 0 &&
appointments[nextSlot] == null;
nextSlot++) {
further_slots_r equired--;
}
if(further_slot s_required == 0) {
// A big enough space has been found.
return time;
}
}
}
}
// Not enough space available.
return -1;
}
/**
* Make an appointment.
* @param time The hour at which the appointment starts.
* @param appointment The appointment to be made.
* @return true if the appointment was successful,
* false otherwise.
*/
public boolean makeAppointment (int time,Appointmen t appointment)
{
if(time >= START_OF_DAY && time <= FINAL_APPOINTME NT_TIME)
{ int startTime = time-START_OF_DAY;
if(appointments[startTime] == null)
{ int duration = appointment.get Duration();
// Fill in all the slots for the full duration
// of the appointment.
for(int i = 0; i < duration; i++)
{ appointments[startTime + i] = appointment; }
return true;
}
else{
return false;}
}
else{
return false;}
}


/**
* Print a list of the day's appointments on standard output.
*/
public void showAppointment s()
{ System.out.prin tln("=== Day " + dayNumber + " ===");
for(int i = 0; i < MAX_APPOINTMENT S_PER_DAY; i++)
{ System.out.prin t ((START_OF_DAY + i) + ": ");
if(appointments[i] != null)
{ System.out.prin tln(appointment s[i].getDescription ());}
else {System.out.pri ntln();}
}
}


/**
* @return The number of this day within the year (1 - 366).
*/
public int getDayNumber()
{
return dayNumber;
}
}

So you got the answer!!