A systematic catalogue of reusable abstract data types
Our rough guess is there are 86,000 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 44 minutes to read. With a half hour per day, this will take 12 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Contributions
- Schmid, Hans Albrecht, 1944- - Contributor
Publication
1990 - Springer-Verlag, Berlin
Language
English
Word Count
86,000 words, Guess
Page Count
344 pages
Identifiers
- Open LibraryOL1888042M
- ISBN-103540532293
- OCLC Control Number22507159
- OCLC Control Numbersystematiccatalo0000uhlj
- Library of Congress Control Number90049360
and 1 more
- Goodreads4482754
Classifications
- DDC005.7/3
- LCCQA76.9.A23 U37 1990
Description
"This book presents a comprehensive catalogue of elementary data types like sets, maps, orders, trees and lists, written in Ada. Such data types are often used in systems programming. The major focus is on: - a uniform syntactic and semantic interface for all data types, - many implementation variants per data type, all ac cessible through a single interface, - a hierarchical system of the data types as a basis for data type selection and implementation. Meeting these goals is the main achievement of the book. The combination of efficient applicability and ease of learning and maintenance is achieved by the carefully elaborated interfaces of the catalogue's data types. These interfaces combine abstraction, which is necessary for easy learning and for leaving implementation freedom, and functional completeness, which is an essential prerequisite for high performance in different application contexts. The selection of the right data type implementation for a given context is supported by the data type hierarchy which imposes different abstraction levels, and an orthogonal scheme of implementation variants which can be freely combined. Together with the uniformity of interfaces, the hierarchical composition of the catalogue leads to a small code base, from which different implementation variants are generated using a macro processor."--PUBLISHER'S WEBSITE.
Subjects
Topics
Series Statement
- Lecture notes in computer science ;
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!