ShopSpell
The Modula-2 Software Component Library Volume 3 [Paperback]
$79.99
$109.99
27% Off
(Free Shipping)
100 available
- Category: Books
(Computers)
- Author:
Lins, Charles
-
Author:
Lins, Charles
- ISBN-10:
1468463888
-
ISBN-10:
1468463888
- ISBN-13:
9781468463880
-
ISBN-13:
9781468463880
- Publisher:
Springer
-
Publisher:
Springer
- Binding:
Paperback
-
Binding:
Paperback
- Pub Date:
01-Feb-2012
-
Pub Date:
01-Feb-2012
- SKU:
1468463888-11-SPRI
-
SKU:
1468463888-11-SPRI
- Item ID: 100913764
- List Price: $109.99
- Seller: ShopSpell
- Ships in: 5 business days
- Transit time: Up to 5 business days
- Delivery by: Jul 03 to Jul 05
- Notes: Brand New Book. Order Now.
0 Introduction to Volume 3.- 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.- References.- 2 Module Guide.- 2.1 Purpose.- 2.2 Characterization of Modules.- 2.3 Module Guide Organization.- 2.4 Binary Trees.- 2.4.1 Tree Types.- 2.4.2 AVL Tree Sequential Unbounded Managed Iterator.- 2.4.3 BB Tree Sequential Unbounded Managed Iterator.- 2.4.4 Binary Tree Sequential Bounded Managed Iterator.- 2.4.5 Binary Tree Sequential Unbounded Managed Iterator.- 2.4.6 IPB Tree Sequential Unbounded Managed Iterator.- 2.5 Graphs.- 2.5.1 Graph Types.- 2.5.2 Graph Directed Sequential Bounded Managed Iterator.- 2.5.3 Graph Directed Sequential Unbounded Managed Iterator.- 2.5.4 Graph Undirected Sequential Bounded Managed Iterator.- 2.5.5 Graph Undirected Sequential Unbounded Managed Iterator.- 2.6 Graph Utilities.- 2.7 Module Names.- References.- 2 Trees.- 3 Tree Abstraction.- 3.1 Concepts and Definitions.- 3.1.1 Basic Tree Definitions.- 3.1.2 Attributes of Nodes.- 3.1.3 Relationships Between Nodes.- 3.1.4 Attributes of Trees.- 3.1.5 Kinds of Trees.- 3.1.6 Tree Traversals.- 3.1.6.1 General Tree Traversals.- 3.1.6.2 Binary Tree Traversals.- 3.1.7 Forests.- 3.2 Applications and Uses.- 3.3 Binary Search Tree Operations.- 3.3.1 Constructors.- 3.3.1.1 Create.- 3.3.1.2 Destroy.- 3.3.1.3 Clear.- 3.3.1.4 Assign.- 3.3.1.5 Insert.- 3.3.1.6 MakeTree.- 3.3.1.7 Remove.- 3.3.2 Selectors.- 3.3.2.1 IsDefined.- 3.3.2.2 IsEmpty.- 3.3.2.3 IsEqual.- 3.3.2.4 ExtentOf.- 3.3.2.5 IsPresent.- 3.3.3 Passive Iterators.- 3.3.3.1 Preorder.- 3.3.3.2 Inorder.- 3.3.3.3 Postorder.- 3.3.4 Active Iterators.- 3.3.4.1 RootOf.- 3.3.4.2 LeftOf.- 3.3.4.3 RightOf.- 3.3.4.4 IsNull.- 3.3.4.5 KeyOf.- 3.3.4.6 DataOf.- 3.4 Balanced Binary Trees.- 3.4.1 Height-Balanced (AVL) Treel3‹