#test data for the testlist.c - solution

  # originally by Changdz Xiong (Spring 2001 TA), 4/29/01
  # updated by cmc, 10/28/08

#insert one item and delete it
insert last dog
delete first

#to see if deleting on an empty list will cause problem 
delete current
delete first
delete last

#show the value of the current,last and first pointer of empty list
show current
show last
show first

#some bad commands/positions
wrongcommand
delete curren
inser last d
show alll

#insert some items  
insert first dog
insert first cat
insert after person

#the current right now is person
show current
show first
show last

#now the current pointer is the same as last
show current
insert before bird

#the current right now is bird
show current
show all

#the current right now is the first node 
insert before pig
show all
show last

#the current right now is the last node
show current

#advance the iterator to verify it stays on last node
advance
show current
delete current

#advance twice to see if it is correct 
advance 
advance
show current
reset
show current
show all

#clear list and see what displays
clear
show current
show all

# above tests included representative normal cases, and some error cases,
# now a few more systematic boundary case tests:

  # empty cases not tried above
insert before 1
clear
insert after 1
clear
advance
reset

  # some more single node cases:
insert last 1
insert last 2
show all
delete last
show all
delete last
show all
insert last 1
delete current
show all

  # some more two-node cases:
insert first 1
insert after 2
delete last
show last
show all
insert last 2
delete first
show current
show all
insert first 1
show all
delete current
show current

# hopefully that's enough testing! but you never know ...