01077nam 2200397 450 991046639080332120200520144314.02-8062-4962-7(CKB)3820000000022691(MiAaPQ)EBC4465957(PPN)248792148(Au-PeEL)EBL4465957(CaPaEBR)ebr11192412(OCoLC)946263251(EXLCZ)99382000000002269120160516h20132013 uy 0freurcnu||||||||rdacontentrdamediardacarrierPascal /document rédigé par Aurélie Garon[Place of publication not identified] :lePetitLitteraire.fr,2013.©20131 online resource (23 pages)Fiche PhilosopheElectronic books.121.092Garon Aurélie847130MiAaPQMiAaPQMiAaPQBOOK9910466390803321Pascal1892456UNINA03684nam 22005535 450 99646558900331620200705063646.03-540-46777-710.1007/BFb0016877(CKB)1000000000233575(SSID)ssj0000327104(PQKBManifestationID)11266275(PQKBTitleCode)TC0000327104(PQKBWorkID)10298553(PQKB)11265803(DE-He213)978-3-540-46777-9(PPN)155213342(EXLCZ)99100000000023357520121227d1990 u| 0engurnn|008mamaatxtccrA Systematic Catalogue of Reusable Abstract Data Types[electronic resource] /by Jürgen Uhl, Hans A. Schmid1st ed. 1990.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1990.1 online resource (XIV, 344 p.) Lecture Notes in Computer Science,0302-9743 ;460Bibliographic Level Mode of Issuance: Monograph3-540-53229-3 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.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.Lecture Notes in Computer Science,0302-9743 ;460Software engineeringProgramming languages (Electronic computers)Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Software engineering.Programming languages (Electronic computers).Software Engineering.Programming Languages, Compilers, Interpreters.005.7/3Uhl Jürgenauthttp://id.loc.gov/vocabulary/relators/aut736355Schmid Hans Aauthttp://id.loc.gov/vocabulary/relators/autBOOK996465589003316A Systematic Catalogue of Reusable Abstract Data Types2831786UNISA