The Modula-2 Software Component Library - Volume 2

This book is the second volume in a series entitled The Modula-2 Software Component Library . Charles Lins' collection of reusable standard software components could be the basis for every programmer's software project in Modula-2. Components that are implementations of commonly used data structures are presented, along with a description of their functionality and efficiency. Moreover, the books provide the background necessary to tailor these components to the specific needs of any Modula-2 environment. For every Modula-2 programmer, this series of books could prove as useful and indispensable as the original language reference by Niklaus Wirth. This second volume introduces software modules for lists, queues, and deques.

List of contents

0 Introduction to Volume 4.- 1 - Preliminaries.- 1 Specification.- 1.1 Specification of Procedure Abstractions.- 1.1.1 Header Section.- 1.1.2 Requires Section.- 1.1.3 Where Section.- 1.1.4 Modifies Section.- 1.1.5 Effects Section.- 1.1.6 Signals Section.- 1.2 Specification of Data Abstractions.- 1.3 Special Symbols 8 References.- References.- 2 Module Guide.- 2.1 Purpose.- 2.2 Characterization of Modules.- 2.3 Module Guide Organization.- 2.4 Sorting.- 2.5 Hash Tables.- 2.5.1 Hash Types.- 2.5.2 Linear Probing Hashing.- 2.5.3 Double Hashing.- 2.5.4 Ordered Hash Table with Double Hashing.- 2.5.5 Double Hashing with Brent's Reorganization.- 2.5.6 Hash Table with Direct Chaining.- 2.5.7 Hash Table with Linear Hashing.- 2.6 Maps.- 2.6.1 Map Types.- 2.6.2 Map - Sequential Bounded Managed Iterator (unordered array).- 2.6.3 Map - Sequential Bounded Managed Iterator (ordered array).- 2.6.4 Map - Sequential Bounded Managed Iterator (double hashing).- 2.6.5 Map - Sequential Unbounded Managed Iterator (unordered list).- 2.6.6 Map - Sequential Unbounded Managed Iterator (linear hashing).- 2.7 Module Names 20 References.- References.- 2 - Sorting.- 3 Sorting.- 3.1 Sorting: Concepts and Definitions.- 3.2 Applications and Uses.- 3.3 Sorting Interface.- 3.3.1 Sort.- 3.3.2 CompareProc.- 3.3.3 SwapProc.- 3.3.4 AssignProc.- 3.4 Sort Algorithm Taxonomy.- 3.5 Sort Algorithm Interfaces.- 3.5.1 Binary Insertion Sort.- 3.5.2 BSort.- 3.5.3 Exchange Sort.- 3.5.4 Heap Sort.- 3.5.5 Insertion Sort.- 3.5.6 Mean Sort.- 3.5.7 Quicksort.- 3.5.8 Selection Sort.- 3.5.9 Shaker Sort.- 3.5.10 Shell Sort.- 3.5.11 Straight Merge Sort.- 3.6 Empirical Results.- 3.7 Sort Definition Module.- 3.8 Sort Implementation Module.- 3.8.1 Insertion Sort.- 3.8.2 Binary Insertion Sort.- 3.8.3 Selection Sort.- 3.8.4 Shell Sort.- 3.8.5 Heap Sort.- 3.8.6 Quicksort.- 3.8.7 BSort.- 3.8.8 MeanSort.- 3.8.9 Straight Merge Sort.- 3.8.10 Exchange Sort.- 3.8.11 Shaker Sort.- References.- 3 - Hash Tables.- 4 The Hash Table Abstraction.- 4.1 Concepts and Definitions.- 4.1.1 Hash Tables and Hashing Functions.- 4.1.2 Collisions and Collision Resolution.- 4.1.3 Load Factor.- 4.1.4 Open Hashing.- 4.1.5 Closed Hashing.- 4.2 Applications and Uses.- 4.3 Hash Table Types.- 4.4 Hash Table Constructors.- 4.4.1 Create.- 4.4.2 Destroy.- 4.4.3 Clear.- 4.4.4 Assign.- 4.4.5 Insert.- 4.4.6 Remove.- 4.4.7 Update.- 4.5 Hash Table Selectors.- 4.5.1 IsDefined.- 4.5.2 IsEmpty.- 4.5.3 SizeOf.- 4.5.4 ExtentOf.- 4.5.5 IsPresent.- 4.6 Hash Table Iterators.- 4.6.1 LoopOver.- 4.6.2 Traverse.- 4.6.3 Iterate [Closed Hash Table Form].- 4.6.4 Iterate [Open Hash Table Form].- 4.6.5 IsNull [Open Hash Table Form].- 4.6.6 KeyOf [Open Hash Table Form].- 4.6.7 DataOf [Open Hash Table Form].- 4.6.8 NextOf [Open Hash Table Form].- 4.7 Hash Table Exceptions.- 4.7.1 Duplicate Key.- 4.7.2 Initialization Failed.- 4.7.3 Overflow.- 4.7.4 Undefined.- 4.8 Hash Table Summary.- 4.8.1 Hash Table Operations Summary.- 4.8.2 Hash Table Exceptions Summary.- References.- 5 Linear Probing Hashing.- 5.1 Hash Types Interface.- 5.1.1 Exception Handling.- 5.1.2 Closed Hash Table Entry States.- 5.1.3 Hash Table Procedure Types.- 5.1.4 Hash Types Definition Module.- 5.2 Linear Probing Hashing Interface.- 5.2.1 Type Declarations.- 5.2.2 Exception Handling.- 5.2.3 Hash Table Constructors.- 5.2.4 Hash Table Selectors.- 5.2.5 Hash Table Iterators.- 5.3 Linear Probing Hashing Implementation.- 5.3.1 Internal Representation.- 5.3.2 Exception Handling.- 5.3.3 Local Operations.- 5.3.4 Hash Table Constructors.- 5.3.5 Hash Table Selectors.- 5.3.6 Hash Table Iterators.- 5.3.7 Module Initialization.- References.- 6 Double Hashing.- 6.1 Double Hashing Interface.- 6.1.1 Type Declarations.- 6.1.2 Exception Handling.- 6.1.3 Hash Table Constructors.- 6.1.4 Hash Table Selectors.- 6.1.5 Hash Table Iterators.- 6.2 Double Hashing Implementation.- 6.2.1 Internal Representation.- 6.2.2 Exception Handling.- 6.2.3 Local Operations.- 6.2.4 Hash Table Constructors.- 6.2.5 Hash Table

Product details

• Authors: Charles Lins, LINS CHARLES
• Publisher: Springer, Berlin
• Languages: English
• Product format: Hardback
• Released: 05.12.2012
• EAN: 9780387969398
• ISBN: 978-0-387-96939-8
• No. of pages: 368
• Dimensions: 160 mm x 240 mm x 21 mm
• Weight: 685 g
• Illustrations: XVIII, 368 pp. 35 figs.
• Series: Springer Compass International; Modula-2 Software Component Library; Springer Compass International
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > Programming languages