Data Structure: A Cell Array List Container 1.0

Intent: Provides a useful 1D data structure (or container) for storing an ordered heterogeneous set of elements.Motivation: MATLABdlT« R2009a provides the "containers.Map" data structure for storing an unordered heterogeneous set of elements - the Map ADT is a container that is indexed with a "key" of any data type. A List ADT is a data container that is indexed by integers. The benefit in using a List ADT opposed to a native MATLAB cell array is the List ADT hides the complexity in implementation of the operations you would perform to insert and remove elements in/from arbitrary positions, for example.Implementation: Class 'CellArrayList' is a concrete realisation of the the List ADT which uses a "native" MATLAB cell array as its storage mechanism.The source files are contained in the zip file 'CellArrayList.zip'. Refer to the comments in 'List.m' and 'CellArrayList.m' for full details on the motivation and implementation. The script 'testCellArrayList.m' demonstrates the use of 'CellArrayList.m'. Further, a corresponding UML class diagram is illustrated in 'CellArrayList_UML_Diagram.pdf'. Written by Bobby NedelkovskiMathWorks AustraliaCopyright 2009-2010, The MathWorks, Inc.

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Bobby,  Cellarraylist,  Cellarraylistm,  Cellarraylistzip,  Class,  Comments,  Concrete,  Contained,  Details,  Files,  Listm,  Mechanismthe,  Motivation,  Quotnativequot,  Realisation,  Refer,  Source,  Storage,  Written
Users rating:	0/10