Scribd
Upload
18 views21 pages

List Implementations That Use Arrays

This document discusses different implementations of lists using arrays. It describes using a fixed-size array which requires shifting elements when adding or removing in the middle. Using dynamic array expansion allows the array to grow in size. The Java Vector class provides a dynamically expanding array that can be used to implement lists. Pros of using arrays include fast retrieval and adding at the end, while adding/removing in the middle requires shifting elements. Java also provides the ArrayList class and Serializable interface for list implementations.

Uploaded by

gitu583
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
18 views21 pages

List Implementations That Use Arrays

This document discusses different implementations of lists using arrays. It describes using a fixed-size array which requires shifting elements when adding or removing in the middle. Using dynamic array expansion allows the array to grow in size. The Java Vector class provides a dynamically expanding array that can be used to implement lists. Pros of using arrays include fast retrieval and adding at the end, while adding/removing in the middle requires shifting elements. Java also provides the ArrayList class and Serializable interface for list implementations.

Uploaded by

gitu583
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 21

List Implementations

That Use Arrays


Chapter 5
Chapter Contents
Using a Fixed-Size Array to Implement the ADT List
• An Analogy
• The Java Implementation
Using Dynamic Array Expansion to Implement the ADT
List
• Expanding an Array
• A News Implementation of a List
Using a Vector to Implement the ADT List
• A Summary of Methods in the Class Vector
The Pros and Cons of Using an Array to Implement the
ADT List
• The Class ArrayList
• The Interface Serializable
2
An Analogy

Consider a classroom with 40 desks in


fixed position
• Desks are wasted if less than 40 students
• Not enough desks if more than 40 students

An array is like the classroom


• Each desk an array location

3
An Analogy

Fig. 5-1 A classroom that contains desks in a fixed position.


4
An Analogy
Suppose we have some students in
classroom in order alphabetically
We add a new student
• We desire to maintain the alphabetic order
• We must shift some students

We remove a student in the middle of the


sequence
• Again, we must shift some students

5
Adding a Student

Fig. 5-2 Seating a new student between two existing


students: at least one other student must move 6
The Java Implementation
Private data fields for implementation of
AList
• Implements interface ListInterface of
Chapter 4
private Object entry[]; // array of list entries
private int length; // current number of entries in list
private static final int MAX_SIZE = 50; // max length of list

Note the full specification, pgs 103-105

7
AList add() Methods
First add method adds a new item at the
end of the list
• Assign new value at end
• Increment length of list

Second add method adds item in mid-list


• Requires a utility method, makeRoom()
• This shifts elements ahead

8
Adding Items in Mid-list

Fig. 5-3 Making room to insert Carla as


third entry in an array.
9
The remove() Method
Must shift existing entries to avoid gap in
the array
• Except when removing last entry

Method must also handle error situation


• When position specified in the remove is
invalid
• When remove() is called and the list is empty
• Invalid call returns null value

10
Removing a List Entry

Fig. 5-4 Removing Bob by shifting array entries.


11
Dynamic Array Expansion
An array has a fixed size
• If we need a larger list, we are in trouble

When array becomes full


• Move its contents to a larger array (dynamic
expansion)
• Copy data from original to new location
• Manipulate names so new location keeps
name of original array

12
Dynamic Array Expansion

Fig. 5-5 The dynamic expansion of an array copies the


array's contents to a larger second array.

13
Dynamic Array Expansion

Fig. 5-6 (a) an array;


(b) the same array with two references;
(c) the two arrays, reference to original array now
14
referencing a new, larger array
A New Implementation of a List
Change the isFull to always return false
• We will expand the array when it becomes full
• We keep this function so that the original
interface does not change
The add() methods will double the size of
the array when it becomes full
Now declare a private method
isArrayFull
• Called by the add() methods
15
Using a Vector to Implement the ADT List

Java's Vector class provides capabilities


of an array
• Able to expand dynamically
• Hides the details of the process

Vector
• Found in package java.util
• Has methods for manipulating entries
• Enables implementing the ADT List

16
Using a Vector

Fig. 5-7 A client uses the methods given in


ListInterface, but the implementation of the list
uses Vector methods to perform its operations
17
Using a Vector
Elements of the class
import java.util.Vector;
public class VectorList implements ListInterface
{
private Vector entry; // entries in list
...
• Class Vector comes from package
java.util
• Data field entry is an instance of a Vector

18
Using a Vector
The add() methods
• The first uses the addElement method from
the Vector class
• The other uses the insertElementAt
method
The remove() method
• Uses the removeElementAt method

19
Pros and Cons of Array Use for the ADT List

When using an array or vector …


• Retrieving an entry is fast
• Adding an entry at the end of the list is fast
• Adding or removing an entry that is between
other entries requires shifting elements in the
array
• Increasing the size of the array or vector
requires copying elements

20
Java Class Library
Has a class similar to class AList defined
in this chapter
• Class ArrayList
• Uses dynamic array expansion

Interface Serializable
• Represent an object as a sequence of bytes to
be written to a file
• Add the words implements Serializable
to class definition
public class AList implements ListInterface, Serializable
{ ... 21

You might also like