In programming, it is often necessary to have objects with which one can store data, retrieve data when needed, and remove data when no longer needed.  Such objects are instances of what we call container classes.  There are basically two schemes for organizing the objects for storage: a linear scheme and a non-linear scheme.  This leads to the notion of container structures.  The linear container structure is called a list.  The non-linear structure can be sub-classified into many sub-types such as the various tree structures and hash tables, which we will study later in the semester. 

This lecture focuses on the defining the list structure and designing its implementation.

Going Shopping

Before I go to the groceries store, I make a list of what I want to buy.  Note how I build my shopping list: I start with a blank sheet of paper, then I add one item at a time.

When I get to the store, I start buying things by going down my list.  For each item I buy, I mark it off the list.

After I am done shopping, I go to the cashier and check out my items.

The cashier scans my items one item at a time.  Each time, the cash register prints one line showing the item just scanned together with its price.  Again, note how the cash register builds the list: it start with a blank sheet of paper and then add one item at a time.  After all items have been scanned, the cashier press a key and "poof", the cash register prints a subtotal, then a tax amount for all the taxable items, then a total amount, and finally a total number of items bought.

At different store, the cash register not only prints out all of the above, but also a total amount of "savings" due to the fact that I have a "member-plus" card.  Some other stores don't care to print the total number of items bought at all.  Whatever the store, wherever I go, I see "lists" and "list processing" all over.

The check out cash register uses a program to enter the items and print the receipt.  At the heart of the program is a container structure to hold data (data structure) and a few algorithms to manipulate the structure and the data it holds.  The simplest way to organize data is to structure them in a linear fashion; that is, intuitively, if we can get hold of one data element, then there is exactly one way to get to the next element, if any.  We call this linear organization of data the list structure.  In order to write program to process lists, it is necessary to define what lists are and express their definitions in terms of code.

What is a list?

Analogous to the notion of a shape, a list is an abstract notion.  Recall how I built my list of groceries items?  I started with a blank list: an empty list!  The empty set!  

An empty list is a list that has no element.

It is obvious that there are non-empty lists.  But what do we mean by a non-empty list?  How can we articulate such an obvious notion?  Consider for example the following list consisting of three elements.

• milk
• bread
• butter

In the above, we organize the items in a linear fashion with milk being the first element, bread being the next element following milk and butter being the next element following bread.  Is there any item that follows butter?

Is

• bread
• butter

a list?

Is

• butter

a list?

Is there a  list that follows butter in the above?

A non-empty list is a list that has an element called first and a list called rest.

Note that in the above formulation, the rest of a list is itself a list!  The definition of a list is an example of what we call a recursive definition: the list contains a substructure that is isomorphic to itself.

List Design and The Composite Design Pattern

The UML diagram below captures the recursive data definition of the list data structure.

This definition translates into Java code as follows.

/**
 * Represents the abstract list structure.
 */
public interface IList {
}

/**
 * Represents empty lists.
 */
public class MTList implements IList {
}

/**
 * Represents non-empty lists.
 */
public class NEList implements IList {
   private Object _first;
   private IList _rest;
}

The above is an example of what is called the composite design pattern.  The composite pattern is a structural pattern that prescribes how to build a container object that is composed of other objects whose structures are isomorphic to that of the container itself.  In this pattern, the container is called a composite. In the above, IList is called the abstract component, MTList is called the basic component and NEList is called the composite.  The composite design pattern embodies the concept of recursion, one of the most powerful thinking tool in computing.  (There is a subject in theoretical computer science and mathematics called "recursive function theory," which studies the meaning of what computing means and in effect defines in the most abstract form what a computer is and what it can and cannot do.)

List Creation

Now that we have defined what a list is, we ask ourselves how we can process it?  What can we do with a list?  The above code makes it clear that there is not a whole lot we can do with a list besides instantiating a bunch of MTList objects via the call new MTList() (why?).  Now that we are using the full Java language, we need to write a constructor for NEList in order to instantiate non-empty list objects with appropriate first and rest.  The Java code for NEList now looks as follows (note how the comments are written).

/**
 * Represents non-empty lists.
 */
public class NEList implements IList {
   private Object _first;
   private IList _rest;

   /**
    * Initializes this NEList to a given first and a given rest.
    * @param f the first element of this NEList.
    * @param r the rest of this NEList.
    */
   public NEList(Object f, IList r) {
       _first = f;
       _rest = r;
   }
}

The list structure as coded in the above is completely encapsulated, that is, all internal components (if any) of a list  are private and cannot be accessed by any external code.  Using the  appropriate constructors, we can make a bunch of lists to store data but we cannot retrieve data nor do anything with these lists.  In Object-Oriented Programming (OOP) parlance, the list is said to have no behavior at all.  As such they are of no use to us. 

List Processing

In order to perform any meaningful list processing at all, we need to program more "intelligence" into the list structure by adding appropriate methods to the list to provide the desired behaviors.  So instead of asking what we can do with a list, the right question to ask in OOP is "what can a list do for us?"  Let us start by presenting a few simple tasks that we want a list to perform and try to figure out how an "intelligent" list would carry out such tasks via some role acting.

In class role-acting exercises:

• Compute the length of a list.
• Compute the sum of a list that holds integers.

Last Revised Thursday, 03-Jun-2010 09:50:29 CDT

©2008 Stephen Wong and Dung Nguyen