Thread: Trouble loading elements into a queue

Hey guys ,
I am working on a print queue read from a file but I can only read the input file and parse it, I don't know how to load the elements from the input to the queue.
The file input looks like this :q,5,8

	if (line.charAt(0) == 'q')
			{
			String A = line.substring(0,line.indexOf(","));
			String B = line.substring(line.indexOf(",")+1,line.lastIndexOf(','));
			String C = line.substring(line.lastIndexOf(',')+1,line.length());
 
 
 
jobInfo.setPrintJobInfo(A,Integer.parseInt(B),Integer.parseInt(C))mainQueue.addQueue(jobInfo);
 
 
public static void setPrintJobInfo(String A,int B,int C)
{
		type = A;
		job = B;
		cycle = C;
}

Do any of you guys have an idea of what i need to do ?
Thanks

What variables is the input in? A is suppose to be a string , both B and c are integers
What does "load" mean? I mean I want to pass each variables

What are the definitions of the variables:

jobInfo is located in the queueclass

 public void addQueue(T queueElement)
                            throws QueueOverflowException
    {
        if (isFullQueue())
            throw new QueueOverflowException();
 
        queueRear = (queueRear + 1) % maxQueueSize; //use the
                            //mod operator to advance queueRear
                            //because the array is circular
        count++;
        list[queueRear] = queueElement;
    }

mainQueue is in the testPrintQueue class

public static QueueClass mainQueue
                 = new QueueClass();

What does this statement do:
jobInfo.setPrintJobInfo(A, Integer.parseInt(B), Integer.parseInt(C))mainQueue.addQueue(jobInfo);
I am trying to pass each variable into the setPrintJobInfo , i know that jobInfo is suppose to be like an array but I don't know how to

public static void setPrintJobInfo(String A,int B,int C)
{
		type = A;
		job = B;
		cycle = C;
}

type of the print which is q and is aString
job number = 5 and is an int
the number of cycle which is 8 and is an int

It does compile and print out the readings from the file when i have a system.out.println();

q
5
8

Here is the test file

public class testPrintQueue
	{
	public static QueueClass mainQueue
                 = new QueueClass();
	public static QueueClass addQueuePriority
                 = new QueueClass();
 
	static String type = "a";
	static int job = 0;
	static int cycle = 0;
 
	public static void readFile(String line)
		{
 
		if (line.charAt(0) == 'q')
			{
			String A = line.substring(0,line.indexOf(","));
			String B = line.substring(line.indexOf(",")+1,line.lastIndexOf(','));
			String C = line.substring(line.lastIndexOf(',')+1,line.length());
 
		jobInfo.setPrintJobInfo(A,Integer.parseInt(B),Integer.parseInt(C));
			mainQueue.addQueue(jobInfo);
		//	System.out.println();
			}
 
	public static void setPrintJobInfo(String A,int B,int C)
	{
		type = A;
		job = B;
		cycle = C;
	}
 
	public void printJob()
	{
		setPrintJobInfo("a",0,0);
	}
 
	public void printJob(String type,int job,int cycle)
	{
		setPrintJobInfo(type,job,cycle);
	}
 
	public int getCycle()
	{
		return cycle;
	}
 
	public void incrementCycle()
	{
		cycle++;
	}
 
 
	public static void main(String[] args)
						throws FileNotFoundException, IOException
		{
		int count = 0;
		int cjob = 0;
		int ccycle = 0;
		String clet = "a";
		Scanner input = new Scanner(new File("C://QueueIn.txt"));
 
		while(input.hasNext())
			{
			readFile(input.nextLine());
			}
 
 
		}
	}

and the queueClass

 
public class QueueClass<T> implements QueueADT<T>
{
    private int maxQueueSize;
    private int count;
    private int queueFront;
    private int queueRear;
    private T[] list;  //Array of references to the
                       //objects that store queue elements
 
       //Default constructor
       //Postcondition: Creates the array of references to the
       //               objects that store queue elements.
       //               maxQueueSize = 100;
       //               count = 0; queueFront = 0;
       //               queueRear = maxQueueSize - 1;
    public QueueClass()
    {
        maxQueueSize = 100;
 
        queueFront = 0;                 //initialize queueFront
        queueRear = maxQueueSize - 1;   //initialize queueRear
        count = 0;
        list = (T[]) new Object[maxQueueSize];  //create the
                                //array to implement the queue
    }
 
       //Constructor with a parameter
       //Postcondition: Creates the array of references to the
       //               objects that store queue elements.
       //               maxQueueSize = queueSize;
       //               count = 0; queueFront = 0;
       //               queueRear = maxQueueSize - 1;
       //               If queueSize <= 0, maxQueueSize = 100;
    public QueueClass(int queueSize)
    {
        if (queueSize <= 0)
        {
            System.err.println("The size of the array to "
                             + "implement the queue must be "
                             + "positive.");
            System.err.println("Creating an array of the "
                             + "size 100.");
 
            maxQueueSize = 100;
        }
        else
            maxQueueSize = queueSize; //set maxQueueSize to
                                      //queueSize
 
        queueFront = 0;                 //initialize queueFront
        queueRear = maxQueueSize - 1;   //initialize queueRear
        count = 0;
        list = (T[]) new Object[maxQueueSize]; //create the
                                //array to implement the queue
    }
 
       //Method to initialize the queue to an empty state.
       //Postcondition: count = 0; queueFront = 0;
       //               queueRear = maxQueueSize - 1
    public void initializeQueue()
    {
        for (int i = queueFront; i < queueRear;
                                 i = (i + 1) % maxQueueSize)
        list[i] = null;
 
        queueFront = 0;
        queueRear = maxQueueSize - 1;
        count = 0;
    }
 
       //Method to determine whether the queue is empty.
       //Postcondition: Returns true if the queue is empty;
       //               otherwise, returns false.
    public boolean isEmptyQueue()
    {
        return (count == 0);
    }
 
       //Method to determine whether the queue is full.
       //Postcondition: Returns true if the queue is full;
       //               otherwise, returns false.
    public boolean isFullQueue()
    {
        return (count == maxQueueSize);
    }
 
       //Method to return the first element of the queue.
       //Precondition: The queue exists and is not empty.
       //Postcondition: If the queue is empty, the method
       //               throws QueueUnderflowException;
       //               otherwise, a reference to a copy of
       //               the first element of the queue
       //               is returned.
    public T front() throws QueueUnderflowException
    {
        if (isEmptyQueue())
            throw new QueueUnderflowException();
 
        return (T) list[queueFront];
    }
 
       //Method to return the last element of the queue.
       //Precondition: The queue exists and is not empty.
       //Postcondition: If the queue is empty, the method
       //               throws QueueUnderflowException;
       //               otherwise, a reference to a copy
       //               of the last element of the queue
       //              is returned.
    public T back() throws QueueUnderflowException
    {
        if (isEmptyQueue())
            throw new QueueUnderflowException();
 
        return (T) list[queueRear];
    }
 
       //Method to add queueElement to the queue.
       //Precondition: The queue exists and is not full.
       //Postcondition: The queue is changed and queueElement
       //               is added to the queue.
    public void addQueue(T queueElement)
                            throws QueueOverflowException
    {
        if (isFullQueue())
            throw new QueueOverflowException();
 
        queueRear = (queueRear + 1) % maxQueueSize; //use the
                            //mod operator to advance queueRear
                            //because the array is circular
        count++;
        list[queueRear] = queueElement;
    }
 
 
       //Method to remove the first element of the queue.
       //Precondition: The queue exists and is not empty.
       //Postcondition: The queue is changed and the first
       //               element is removed from the queue.
    public void deleteQueue() throws QueueUnderflowException
    {
        if (isEmptyQueue())
            throw new QueueUnderflowException();
 
        count--;
        list[queueFront] = null;
        queueFront = (queueFront + 1) % maxQueueSize; //use the
                           //mod operator to advance queueFront
                           //because the array is circular
    }
 
}

I am trying to Implement a virtual print queue. A single print queue is servicing a single printer.
q,5,8 is a q type record which indicates that a print job, # 5, shall be placed at the rear of the queue and print for 8 cycles when it is removed from the front of the queue and prints.
I think i got everything done but i don't know how to pass each elements after I input it from the file
Thanks

Sorry lol
import java.io.*;
import java.util.*;
import java.lang.*;

I have attached the folder where i have everything stored and thanks again for helping me

the error is from this line

jobInfo.setPrintJobInfo(A,Integer.parseInt(B),Inte ger.parseInt(C));
mainQueue.addQueue(jobInfo);

that's why i have a system.out.println(); to see it the parsing is actually working , now i am trying to pass each variables into the setPrintjobInfo method
type is the q , job is 5 and cycle is 8

Alright I made some change to the testprintqueue :

import java.io.*;
import java.util.*;
import java.lang.*;
 
public class testPrintQueue
	{
	public static QueueClass mainQueue
                 = new QueueClass();
	public static QueueClass addQueuePriority
                 = new QueueClass();
 
	static String type = "a";
	static int job = 0;
	static int cycle = 0;
 
	public static void readFile(String line)
		{
 
		if (line.charAt(0) == 'q')
			{
			String A = line.substring(0,line.indexOf(","));
			String B = line.substring(line.indexOf(",")+1,line.lastIndexOf(','));
			String C = line.substring(line.lastIndexOf(',')+1,line.length());
 
			System.out.println(A);
			System.out.println(Integer.parseInt(B));
			System.out.println(Integer.parseInt(C));
			}
		}
 
	public static void setPrintJobInfo(String A,int B,int C)
	{
		type = A;
		job = B;
		cycle = C;
 
	}
 
	public void printJob()
	{
		setPrintJobInfo("a",0,0);
	}
 
	public void printJob(String type,int job,int cycle)
	{
		setPrintJobInfo(type,job,cycle);
	}
 
	public int getCycle()
	{
		return cycle;
	}
 
	public void incrementCycle()
	{
		cycle++;
	}
 
 
	public static void main(String[] args)
						throws FileNotFoundException, IOException
		{
		int count = 0;
		int cjob = 0;
		int ccycle = 0;
		String clet = "a";
		Scanner input = new Scanner(new File("C://QueueIn.txt"));
 
		while(input.hasNext())
			{
			readFile(input.nextLine());
 
			}
 
 
		}
	}

I can print individually all the string(A,B,C) from the input file now I want to pass those strings as element to the setPrintJobInfo method .

but i get a "Picked up _JAVA_OPTIONS: -Xmx1g"error . The whole point of this program is to act like a printer so each print job will decrement the number of remaining cycles I don't know if you get what i am trying to do i know i seems confusing
This what the input text file look like :

q,1,8

Output :

q
1
8
Picked up _JAVA_OPTIONS: -Xmx1g