The Modula-2 Software Component Library: Volume 1

Overview

This book is the first 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 programmers software project in Modula-2. Components that are implementations of commonly used data structures are presented, along with an adequate 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. ...

See more details below
Paperback (Softcover reprint of the original 1st ed. 1989)
$86.85
BN.com price
(Save 12%)$99.00 List Price
Other sellers (Paperback)
  • All (6) from $79.70   
  • New (5) from $79.70   
  • Used (1) from $134.54   
Sending request ...

Overview

This book is the first 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 programmers software project in Modula-2. Components that are implementations of commonly used data structures are presented, along with an adequate 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 might prove as useful and indispensible as the original language reference by Niklaus Wirth.

Read More Show Less

Editorial Reviews

Booknews
Third volume in the series discusses the concepts of trees and graphs, shows their specifications, and provides implementations for various forms of trees and graphs. No index. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9781468463705
  • Publisher: Springer New York
  • Publication date: 3/4/2012
  • Series: Springer Compass International Series
  • Edition description: Softcover reprint of the original 1st ed. 1989
  • Edition number: 1
  • Pages: 312
  • Product dimensions: 6.14 (w) x 9.21 (h) x 0.69 (d)

Table of Contents

0 Introduction.- 1 Reusable Software Components.- 1.1 Components and Data Abstraction.- 1.1.1 Data Abstraction.- 1.1.2 Components.- 1.2 Importance of Reusable Software.- 1.3 Component Forms.- 1.3.1 Concurrency.- 1.3.2 Space.- 1.3.3 Garbage Collection & Memory Management.- 1.3.4 Iterators.- 1.3.5 Variations in Form.- References.- 2 Specification.- 2.1 Requirements for Specifications.- 2.2 Specification of Abstractions.- 2.2.1 Procedure Abstractions.- 2.2.2 Specifying Procedure Abstractions.- 2.2.3 Data Abstractions.- 2.2.4 Specifying Data Abstractions.- 2.2.5 Special Symbols.- 2.3 Abstract Data Type Operations.- 2.3.1 Standard Specification of Primitive Constructors.- 2.3.2 Standard Specification of Constructors.- 2.3.3 Standard Specification of Selectors.- 2.3.4 Standard Specification of Iterators.- Further Reading.- References.- 3 Module Guide.- 3.1 Purpose.- 3.2 Exception Handling Modules.- 3.2.1 Error Handling.- 3.3 Generic Item Support Modules.- 3.3.1 Items.- 3.3.2 Item Operations.- 3.3.3 Relations.- 3.3.4 Type Manager.- 3.4 Bags.- 3.4.1 Bag Enumerations.- 3.4.2 Bag-Sequential Bounded Managed Iterator (SBMI).- 3.4.3 Bag-Sequential Unbounded Managed Iterator (SUMI).- 3.4.4 Bag-Discrete Sequential Bounded Managed Iterator (DSBMI).- 3.5 Sets.- 3.5.1 Set Enumerations.- 3.5.2 Set-Sequential Bounded Managed Iterator (SBMI).- 3.5.3 Set-Sequential Unbounded Managed Iterator (SUMI).- 3.5.4 Set-Discrete Sequential Bounded Managed Iterator (DSBMI).- 3.6 Stacks.- 3.6.1 Stack Enumerations.- 3.6.2 Stack-Sequential Bounded Managed Iterator (SBMI).- 3.6.3 Stack-Sequential Unbounded Managed Iterator (SUMI).- 3.7 Strings.- 3.7.1 String Enumerations.- 3.7.2 String-Sequential Bounded Managed Iterator (SBMI).- 3.7.3 String-Sequential Unbounded Managed Iterator (SUMI).- 3.8 Module Names.- References.- 4 Generic Items.- 4.1 Items.- 4.1.1 Kinds of Items.- 4.1.2 Static vs. Dynamic Items.- 4.1.3 Operations on Items.- 4.1.4 Generic Items.- 4.1.5 Defining Generic Items.- 4.2 Generic Item Specifications.- 4.2.1 Relations.- 4.2.2 Items.- 4.3 Implementing Generic Items.- 4.3.1 Relations Definition Module.- 4.3.2 Relations Implementation Module.- 4.3.3 Items Definition Module.- 4.3.4 Items Implementation Module.- 4.3.5 Character Items Definition Module.- 4.3.6 Integer Items Definition Module.- 4.3.7 Item Operations Definition Module.- 4.3.8 Item Operations Implementation Module.- 4.3.9 Type Manager Definition Module.- 4.3.10 Type Manager Implementation Module.- 4.3.11 Error Handling Definition Module.- References.- 5 Stack Abstraction.- 5.1 Stacks: Concepts and Definitions.- 5.2 Summary of Applications and Uses.- 5.3 Stack Constructor Operations.- 5.3.1 Create.- 5.3.2 Destroy.- 5.3.3 Clear.- 5.3.4 Assign.- 5.3.5 Push.- 5.3.6 Pop.- 5.3.7 PopTopOf.- 5.4 Stack Selector Operations.- 5.4.1 IsDefined.- 5.4.2 IsEmpty.- 5.4.3 IsEqual.- 5.4.4 TopOf.- 5.4.5 DepthOf.- 5.5 Stack Iterator Operations.- 5.5.1 LoopOver.- 5.5.2 LoopChange.- 5.5.3 Traverse.- 5.5.4 TraverseChange.- 5.6 Stack Exceptions.- 5.6.1 Initialization Failed.- 5.6.2 Overflow.- 5.6.3 Type Error.- 5.6.4 Underflow.- 5.6.5 Undefined.- 5.7 Summary.- 5.7.1 Operations Summary.- 5.7.2 Exceptions Summary.- References.- 6 The Bounded Stack.- 6.1 StackEnumerations Interface.- 6.2 StackSBMI Interface.- 6.2.1 Exceptions.- 6.2.2 Constructors.- 6.2.3 Selectors.- 6.2.4 Iterators.- 6.3 StackSBMI Implementation.- 6.3.1 Internal Representation.- 6.3.2 Exceptions.- 6.3.3 Constructors.- 6.3.4 Selectors.- 6.3.5 Iterators.- 6.3.6 Module Initialization.- References.- 7 The Unbounded Stack.- 7.1 StackSUMI Interface.- 7.1.1 Exceptions.- 7.1.2 Constructors.- 7.1.3 Selectors.- 7.1.4 Iterators.- 7.2 StackSUMI Implementation.- 7.2.1 Internal Unbounded Stack Representation.- 7.2.2 Efficiency of Operations.- 7.2.3 Exceptions.- 7.2.4 Constructors.- 7.2.5 Selectors.- 7.2.6 Iterators.- 7.2.7 Module Initialization.- References.- 8 String Abstraction.- 8.1 Concepts and Definitions.- 8.2 Applications.- 8.3 String Constructor Operations.- 8.3.1 Create.- 8.3.2 Destroy.- 8.3.3 Clear.- 8.3.4 Assign.- 8.3.5 Prepaid.- 8.3.6 Append.- 8.3.7 Insert.- 8.3.8 Delete.- 8.3.9 Replace.- 8.3.10 Setltem.- 8.4 String Selector Operations.- 8.4.1 IsDefined.- 8.4.2 IsEmpty.- 8.4.3 IsEqual.- 8.4.4 LengthOf.- 8.4.5 IsLessThen.- 8.4.6 IsGtrThen.- 8.4.7 Compare.- 8.4.8 ItemOf.- 8.4.9 SubstringOf.- 8.4.10 SliceOf.- 8.5 String Iterator Operations.- 8.5.1 LoopOver.- 8.5.2 LoopChange.- 8.5.3 Traverse.- 8.5.4 TraverseChange.- 8.6 String Exceptions.- 8.6.1 InitFailed.- 8.6.2 Overflow.- 8.6.3 Position Error.- 8.6.4 Type Error.- 8.6.5 Undefined.- 8.7 Summary.- 8.7.1 Operations Summary.- 8.7.2 Exceptions Summary.- References.- 9 The Bounded String.- 9.1 S tringEnumerations Interface.- 9.2 StringCSBMI Interface.- 9.2.1 Exceptions.- 9.2.2 Constructors.- 9.2.3 Selectors.- 9.2.4 Iterators.- 9.3 StringCSBMI Implementation.- 9.3.1 Internal Bounded String Representation.- 9.3.2 Exceptions.- 9.3.3 Local Routines.- 9.3.4 Constructors.- 9.3.5 Selectors.- 9.3.6 Iterators.- 9.3.7 Module Initialization.- References.- 10 The Unbounded String.- 10.1 StringCSUMI Interface.- 10.1.1 Exceptions.- 10.1.2 Constructors.- 10.1.3 Selectors.- 10.1.4 Iterators.- 10.2 StringCSUMI Implementation.- 10.2.1 Internal Unbounded String Representation.- 10.2.2 Exceptions.- 10.2.3 Local Routines.- 10.2.4 SetSize.- 10.2.5 Constructors.- 10.2.6 Selectors.- 10.2.7 Iterators.- 10.2.8 Module Initialization.- References.- 11 Set Abstraction.- 11.1 Concepts and Definitions.- 11.1.1 Concepts.- 11.1.2 Definitions.- 11.2 Applications.- 11.3 Set Notation.- 11.3.1 Examples.- 11.3.2 Laws of Set Theory.- 11.4 Set Constructor Operations.- 11.4.1 Assign.- 11.4.2 Clear.- 11.4.3 Create.- 11.4.4 Destroy.- 11.4.5 Complement.- 11.4.6 Difference.- 11.4.7 Exclude.- 11.4.8 Include.- 11.4.9 Intersection.- 11.4.10 Symmetric Difference.- 11.4.11 Union.- 11.5 Set Selector Operations.- 11.5.1 IsDefined.- 11.5.2 IsEmpty.- 11.5.3 IsEqual.- 11.5.4 NumMembers.- 11.5.5 IsAMember.- 11.5.6 IsAProperSubset.- 11.5.7 IsASubset.- 11.6 Set Iterator Operations.- 11.6.1 LoopOver.- 11.6.2 Traverse.- 11.7 Undesired Events & Exceptions.- 11.7.1 Initialization Failed.- 11.7.2 Domain Error.- 11.7.3 Item In Set.- 11.7.4 Item Not In Set.- 11.7.5 Overflow.- 11.7.6 Undefined.- 11.8 Summary.- 11.8.1 Operations Summary.- 11.8.2 Exceptions Summary.- References.- 12 The Bounded Set.- 12.1 SetEnumerations Interface.- 12.2 SetSBMI Interface.- 12.2.1 Exceptions.- 12.2.2 Constructors.- 12.2.3 Selectors.- 12.2.4 Iterators.- 12.3 SetSBMI Implementation.- 12.3.1 Internal Bounded Set Representation.- 12.3.2 Exceptions.- 12.3.3 Local Routines.- 12.3.4 Constructors.- 12.3.5 Selectors.- 12.3.6 Iterators.- 12.3.7 Module Initialization.- References.- 13 The Unbounded Set.- 13.1 SetSUMI Interface.- 13.1.1 Exceptions.- 13.1.2 Constructors.- 13.1.3 Selectors.- 13.1.4 Iterators.- 13.2 SetSUMI Implementation.- 13.2.1 Internal Unbounded Set Representation.- 13.2.2 Exceptions.- 13.2.3 Local Routines.- 13.2.4 Constructors.- 13.2.5 Selectors.- 13.2.6 Iterators.- 13.2.7 Module Initialization.- References.- 14 The Discrete Bounded Set.- 14.1 SetCSBMI Interface.- 14.1.1 Exceptions.- 14.1.2 Constructors.- 14.1.3 Selectors.- 14.1.4 Iterators.- 14.2 SetCSBMI Implementation.- 14.2.1 Internal Discrete Set Representation.- 14.2.2 Exceptions.- 14.2.3 Constructors.- 14.2.4 Selectors.- 14.2.5 Iterators.- 14.2.6 Module Initialization.- References.- Appendices.- A Modula-2 Syntax Diagrams.- B Standard Modula-2 Routines.- C Modula-2 Compilers.- D ASCII Table.- E Import Graphs.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)