public void AddLast(CanBrady item)
{
if (ListItems[MaxSize - 1] == null)
{
ListItems[MaxSize - 1] = item;
}
else
{
throw new Exception("List is full");
}
}
public CanBrady RemoveFirst()
{
if (ListItems[0] != null)
{
CanBrady temp = ListItems[0];
ListItems[0] = null;
CanBrady[] tempArray = new CanBrady[MaxSize + 1];
Array.Copy(ListItems, 1, tempArray, 0, MaxSize); //Moves items back one index by copying to tempArray
ListItems = tempArray;
return(temp);
}
else
{
throw new Exception("No need to remove first element - no element present");
}
}
static void Main(string[] args)
{
CanBrady c1 = new CanBrady("Campbell's", "Tomato soup", 16.00, 3.50);
CanBrady c2 = new CanBrady("Lipton", "Cream of chicken", 8.00, 2.75);
CanBrady c3 = new CanBrady("Amy's", "Organic chicken broth", 16.00, 5.50);
CanBrady c4 = new CanBrady("Healthy Choice", "Baked beans", 20.00, 3.75);
CanBrady c5 = new CanBrady("Campbell's", "Corn", 20.00, 3.25);
LinkedList l = new LinkedList();
l.Add(0, c1);
l.Add(1, c2);
l.Add(2, c3);
l.Add(3, c4);
l.Add(4, c5);
l.Remove(4);
l.AddLast(c5);
Console.WriteLine("Peek first: " + l.PeekFirst());
Console.WriteLine(l.Print());
}
public CanBrady Remove(int index)
{
CanBrady removed = ListItems[index];
if (ListItems[index] == null)
{
throw new Exception("Nothing to remove - no element present at specified index");
}
else
{
for (int i = index; i < MaxSize; i++)
{
if (i != MaxSize - 1)
{
ListItems[i] = ListItems[i + 1]; //Copies items back one index starting at index
}
}
}
return(removed);
}
public void Add(int index, CanBrady item)
{
if (ListItems[index] == null)
{
ListItems[index] = item;
}
else
{
CanBrady[] tempArray = new CanBrady[100];
CanBrady[] tempArray2 = new CanBrady[100];
if (ListItems[MaxSize - 1] == null)
{
try
{
//Array.Copy(originalArray, startIndex, newArray, startIndex, endIndex);
Array.Copy(ListItems, 0, tempArray, 0, index); //Copies the first part of the array (up to, but not including index)
Array.Copy(ListItems, index, tempArray2, index + 1, MaxSize - 1); //Copies the second part of the array (index inclusive to the end)
ListItems[index] = item; //Now that we have a backup of ListItems, we can overwrite the current value in index with the new value
Array.Copy(tempArray2, index + 1, tempArray, index + 1, MaxSize - 1); //Now we combine our temp arrays, so now everything is in tempArray, except there's a blank spot at index
tempArray[index] = item; //Copy the item to the blank spot
ListItems = tempArray; //Assign tempArray to ListItems
}
catch
{
throw new Exception("List is full");
}
}
else
{
throw new Exception("List is full.");
}
}
}
public string Print()
{
string concat = "";
int size = Size();
CanBrady[] temp = new CanBrady[size];
Array.Copy(ListItems, 0, temp, 0, size);
ListItems = temp; //Resizes the array to eliminate null values so that Array.Sort will work
Array.Sort(ListItems, (x, y) => String.Compare(x.Content, y.Content)); //Sorts in alphabetical order
foreach (CanBrady item in ListItems)
{
if (item != null)
{
concat += item.Content + ", " + item.Company + ", " + item.Size + " ounces, $" + item.Price + "\n";
}
}
return(concat);
}
