Next:
Contents
Experiments in Object Oriented Design: Advanced Data Structures: Version 1.0
Jim Peterson
April 9, 1999
Contents
Introduction:
Background Reading and Study:
List Data Structures: Basics
The Basic List Class: A First Design:
The Basic List Class: A Second Design:
The CELL DATA TYPE:
The Source: charsllist.c
Overloaded Input and Output for Operators:
The Constructor/ Destructor:
The Merge Sort Code:
The Print/ Grab Functions:
CHAR_DL_CELL
Source:
The Constructor/Destructor Code:
The Print/ Grab Code:
The MergeSort Agents for the CHAR_DL_CELL Class:
Using the CELL Classes:
Application Code:
Annotated Output:
Exercises:
The CHAR LIST DATA TYPE:
The Basic Design:
The CHAR_SLLIST Implementation Details:
The Overloaded Input/ Output Operators:
The print and grab Agents:
The Constructors:
The Overloaded Equal:
The Destructor Call for the SLLIST class:
Building a List:
How Many Elements Are in the List?
Delete an Element From the List:
Insertion Agents:
The Protected Search Elements:
The MergeSort Agent:
The CHAR_DLLIST Implementation Details:
Overloaded I/O Methods:
The print and grab Agents:
Iterators:
The Header File in Outline:
The Iterator Definitions:
Using the Iterators:
The Constructors:
The Overloaded Equal:
The Destructor Call for the DLLIST class:
Building a List:
How Many Elements Are in the List?
Delete an Element From the List:
Is A Given Element In The List?
Insertion Agents:
The Protected Search Elements:
The DLLIST MergeSort Agent:
Exercises:
Using Various SLLIST Objects:
Testing INT_SLLIST Instantiation:
Testing the delete Operator from the Front:
Testing the Delete Operator from the Inside:
Testing the Overloaded Equal:
Testing the Insertion Agents:
Testing MergeSort:
Using Various DLLIST Objects:
Testing the CHAR_DLLIST Class:
Testing the INT_DLLIST Instantiation:
Testing the FLOAT_DLLIST Instantiation
Exercises:
The FLOAT_POLY_CELL Class:
Defining the POLY_CELL Class:
Implementing the FLOAT_POLY_CELL Methods:
The Print/Grab Methods:
The Constructors:
The Destructor:
Building Polynomials: The FLOAT_POLY Class:
Defining the FLOAT_POLY Class:
The Implementation:
The Iterators:
The Print/Grab Methods:
The Copy Constructor and Overloaded Equal:
Comparison Operators:
The Destructor:
Finding Addresses:
Find the Address of an Element:
Find the Address of the Element Before:
Find the Address of the Element After:
Sorting a Polynomial With Respect to the Power:
Splitting a Polynomial Into Two Halves:
Merging Two Halves:
Mergesort Two Chains of POLY_CELLs:
Mergesort a Polynomial:
Find the Degree of the Polynomial:
Deleting a Term:
Find If a Power Is in the Polynomial:
The Insert Methods:
Algebraic Operations:
Addition:
Subtraction:
Multiplication:
Scalar Multiplication:
Polynomial Integration:
The Antiderivative of a Polynomial:
The Definite Integral of a Polynomial:
The Evaluation Method:
The DOt Product of Two Polynomials:
The Polynomial Class In Use:
Application Code:
Exercises:
The Complex Class: MYCOMPLEX
The MYCOMPLEX header: mycomplex.h:
The Definition File mycomplex.c:
Speciality Functions:
The Modulus of a Complex Number:
The n
th
Roots of Unity:
The Usual Private Print and Grab Agents:
The Overloaded Input and Output Operators:
The Complex Exponential
e
z
:
Constructors:
The Overloaded Operator *:
The Overloaded Operator * =:
Some Basic Concerns:
Efficiencies:
The Overloaded Operator /:
The Overloaded Operator / =:
The Overloaded Operator +:
The Overloaded Operator + =:
The Overloaded Operator -:
The Overloaded Operator - =:
The Overloaded Operator =:
The Overloaded Operator = =:
The Overloaded Operator ! =:
The Overloaded Operator >:
The Overloaded Operator <:
Testing the Class MYCOMPLEX:
Exercises:
The Fast Fourier Transform:
Complex Polynomials Classes:
The Definitions:
The Complex_CELL_CORE Class:
The Child Complex_POLY_CELL Class:
The Complex_POLY_CORE Class:
The Complex_POLY Class:
The Iterators:
Implementation: The Complex_POLY_CELL Class:
Grab and Print Methods:
Constructors:
The Destructor:
Overloaded Equal:
Deletion of Terms:
Insertion of Terms:
Building a List:
Polynomial Comparison Operators:
Finding Things in the Polynomial:
Mergesort:
Arithmetic Operators:
Integration:
The Inner Product:
The Fast Fourier Transform Methods:
Padding the Polynomial:
The FFT Method:
The FFT Polynomial Multiplication Method:
An Application:
The Application Source:
The Run Time Results:
Exercises:
References:
About this document ...
Jim Peterson
1999-04-22
