#!/usr/bin/perl
# Figure 20.7: fig20_07.pl
# Using a doubly-linked list.

use warnings;
use strict;
use DoublyLinkedList;

my $dll = new DoublyLinkedList();

for ( 1 .. 5 ) {
   $dll->insertNode( $_ );
}

print( "The list contains:\n" );
$dll->printAll();   # display list contents
print( "\nThe head is ", $dll->gotoHead(), ".\n" );

$dll->nextNode();       # move to next node
$dll->deleteNode();     # delete node at current position
$dll->nextNode();       # move to next node
$dll->deleteNode();     # delete node at current position
print( "\nAfter deleting two elements, ",
       "The list contains:\n" );
$dll->printAll();   # display list contents

print( "\nNow at ", $dll->data(), ".\n" );
print( "Now at ", $dll->previousNode(), ".\n" );
print( "Now at ", $dll->previousNode(), ".\n" );

print( "Attempting to go before the first list element:\n" );
$dll->previousNode();

###########################################################################
#  (C) Copyright 2001 by Deitel & Associates, Inc. and Prentice Hall.     #
#  All Rights Reserved.                                                   #
#                                                                         #
#  DISCLAIMER: The authors and publisher of this book have used their     #
#  best efforts in preparing the book. These efforts include the          #
#  development, research, and testing of the theories and programs        #
#  to determine their effectiveness. The authors and publisher make       #
#  no warranty of any kind, expressed or implied, with regard to these    #
#  programs or to the documentation contained in these books. The authors #
#  and publisher shall not be liable in any event for incidental or       #
#  consequential damages in connection with, or arising out of, the       #
#  furnishing, performance, or use of these programs.                     #
###########################################################################