Table of Contents

Foreword viiPreface ixPart 1 An Overview 11 Introduction31.1 Standard development 31.2 Software engineering 41.3 Evolution and abstraction 61.4 Structure and objectives of this book 81.5 References 102 Simple Concepts 112.1 Key goals 112.2 Overall structure 122.3 The scalar type model 172.4 Arrays and records 192.5 Access types 222.6 Errors and exceptions 232.7 Terminology 263 Abstraction 273.1 Packages and private types 273.2 Objects and inheritance 303.3 Classes and polymorphism 343.4 Genericity 393.5 Object oriented terminology 413.6 Tasking424 Programs and Libraries 454.1 The hierarchical library 454.2 Input output 474.3 Numeric library504.4 Running a program 52P1 Magic Moments 57Part 2 Algorithmic Aspects 615 Lexical Style 635.1 Syntax notation 635.2 Lexical elements 645.3 Identifiers 655.4 Numbers 675.5 Comments 695.6 Pragmas 6 Scalar Types 716.1 Object declarations and assignments 716.2 Blocks and scopes 746.3 Types 766.4 Subtypes 776.5 Simple numeric types 806.6 Enumeration types 866.7 The type Boolean 886.8 Categories of types 926.9 Expression summary 947 Control Structures997.1 If statements 997.2 Case statements 1037.3 Loop statements 1077.4 Goto statements and labels 1137.5 Statement classification 1138 Arrays and Records 1158.1 Arrays 1158.2 Array types 1208.3 Array aggregates 1258.4 Characters and strings 1318.5 Arrays of arrays and slices 1348.6 One-dimensional array operations 1378.7 Records 1419 Subprograms 1479.1 Functions 1479.2 Operators 1549.3 Procedures 1569.4 Named and default parameters 1629.5 Overloading 1649.6 Declarations, scopes and visibility 16510 Access Types 17110.1 Flexibility versus integrity 17110.2 &nbspp; Pool specific access types 17210.3 Null exclusion and constraints 18010.4 General access types 18310.5 Anonymous access types 10.6 Accessibility 18710.7 Access parameters 18910.8 Access to subprograms 193P2 Sylvan Sorter 199Part 3 The Big Picture 20311 Packages and Private Types 20511.1 Packages 20511.2 Private types 21011.3 Primitive operations and derived types 21611.4 Equality 22211.5 Limited types 22611.6 Resource management 23012 Overall Structure 23512.1 Library units 23512.2 Subunits 23912.3 Child library units 24012.4 Private child units 24512.5 Mutually dependent units 12.6 Scope, visibility and accessibility25012.7 Renaming 25312.8 Programs, partitions and elaboration 257P3 Rational Reckoner26113 Object Oriented Programming 26513.1 Type extension 26513.2 Polymorphism 27113.3 Abstract types and interfaces 27913.4 Primitive operations and tags 28213.5 Views and redispatching 28813.6 Private types and extensions 29413.7 Controlled types 30013.8 Multiple inheritance 13.9 Multiple implementations 30514 Exceptions 31114.1 Handling exceptions 31114.2 Declaring and raising exceptions31514.3 Checking and exceptions 32014.4 Exception occurrences 32214.5 Exception pragmas 14.6 Scope of exceptions 32615 Numeric Types 33115.1 Signed integer types 33215.2 Modular types 33815.3 Real types 34015.4 Floating point types 34115.5 Fixed point types 34415.6 Decimal types 34916 Parameterized Types 35116.1 Discriminated record types 35116.2 Default discriminants 35616.3 Variant parts 36116.4 Discriminants and derived types36616.5 Access types and discriminants 36916.6 Private types and discriminants 37516.7 Access discriminants 37617 Generics 38117.1 Declarations and instantiations 38117.2 Type parameters 38617.3 Subprogram parameters39517.4 Package parameters 40117.5 Generic library units 40618 Tasking 40918.1 Parallelism 40918.2 The rendezvous41218.3 Timing and scheduling 41618.4 Protected objects 42018.5 Simple select statements 42718.6 Timed and conditional calls 43118.7 Concurrent types and activation 43418.8 Termination, exceptions and ATC 44018.9 Signalling and scheduling 44618.10 Summary of structure 45319 Object Oriented Techniques 46319.1 Extension and composition 46319.2 Examples of interfaces 46619.3 Mixin inheritance 19.4 Containers 46819.5 Iterators 47219.6 Object factories47919.7 Controlling abstraction 49120 Tasking Techniques 20.1 Dynamic tasks 20.2 Multiprocessors20.3 Synchronized interfaces20.4 Discriminants 20.5 Task termination 20.6 Clocks and timers 20.7 The Ravenscar profile P4 Super Sieve497Part 4 Completing the Story 50121 Predefined Library50321.1 The package Standard 50321.2 The package Ada 50621.3 Characters and strings 50821.4 Numerics 52221.5 Input and output 52621.6 Text input output 53121.7 Streams 54121.8 Environment commands545P5 Wild Words 54722 Container Library 22.1 Organization of library 22.2 Doubly linked lists 22.3 Vectors 22.4 Maps 22.5 Sets 22.6 Indefinite containers 22.7 Sorting 22.8 Summary table23 Interfacing 55123.1 Representations55123.2 Unchecked programming 55623.3 The package System 55823.4 Storage pools 56023.5 Other languages 563P6 Playing Pools 56524 The Specialized Annexes 56924.1 Systems Programming 56924.2 Real-Time Systems 57124.3 Distributed Systems 57324.4 Information Systems 57524.5 Numerics 57524.6 High Integrity Systems 57825 Finale57925.1 Names and expressions57925.2 Type equivalence 58225.3 Overall program structure 58525.4 Portability 59425.5 Final thoughts 597Appendices601A1 Reserved Words, Attributes and Pragmas 601A1.1 Reserved words 601A1.2 Predefined attributes 602A1.3 Predefined pragmas 608A2 Glossary 611A3 Syntax 615A3.1 Syntax rules 615A3.2 Syntax index 629Answers to Exercises 637Bibliography 685Index 687

Promotional Information

The definitive text on the new version of Ada Ada 2005 written by one of the language's creators. Barnes is to Ada what Kernighan & Ritchie are to C, or as Stroustrup is to C++. Previous editions have sold over 150,000 copies.