|
|
|
|
| LEADER |
02607nmm a2200313 u 4500 |
| 001 |
EB000657384 |
| 003 |
EBX01000000000000000510466 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540467779
|
| 100 |
1 |
|
|a Uhl, Jürgen
|
| 245 |
0 |
0 |
|a A Systematic Catalogue of Reusable Abstract Data Types
|h Elektronische Ressource
|c by Jürgen Uhl, Hans A. Schmid
|
| 250 |
|
|
|a 1st ed. 1990
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1990, 1990
|
| 300 |
|
|
|a XIV, 344 p
|b online resource
|
| 505 |
0 |
|
|a Motivation and objectives -- How to reuse abstract data types -- Structure of the catalogue -- Structure of the building blocks -- The building blocks -- Technical issues -- Case study: A file compression system
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Software Engineering
|
| 700 |
1 |
|
|a Schmid, Hans A.
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0016877
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0016877?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.1
|
| 520 |
|
|
|a 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
|