DOCSLIB.ORG

Foundations of Object-Oriented Programming

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Foundations of Object-Oriented Programming Foundations of Object-Oriented Programming RALF HINZE Background Foundations of Object-Oriented Programming FVOP FEOP FOOP Introduction Objects RALF HINZE Classes Open Recursion Subtyping Institut f¨urInformatik III, Universit¨at Bonn Delegation R¨omerstraße 164, 53117 Bonn Inheritance Email: [email protected] Conclusion Homepage: http://www.informatik.uni-bonn.de/~ralf Appendix February 2007 (Pick up the slides at . /~ralf/talks.html#54.) 1 / 28 Foundations of Vision Object-Oriented Programming RALF HINZE Background Possible future course “Foundations of Programming”: FVOP I FVOP: Foundations of Value-Oriented Programming; FEOP I FEOP: Foundations of Effect-Oriented Programming; FOOP Introduction I FOOP: Foundations of Object-Oriented Programming. Objects Classes Open Recursion Subtyping Delegation Inheritance Conclusion Appendix A large part of the material is classroom-tested: I advanced course on “Principles of Programming Languages”; I introductory course on “Programming”. 2 / 28 Foundations of Concept Object-Oriented Programming RALF HINZE You can never understand one language until you understand at least two. Background Ronald Searle (1920–) FVOP FEOP Make everything as simple as possible, FOOP but not simpler. Introduction Objects Albert Einstein (1859–1955) Classes Open Recursion Subtyping Delegation I Idea: explain programming language concepts by growing a “teaching Inheritance language”: Conclusion I empty language, Appendix I functional language, I imperative language, I object-oriented language; I define everything precisely: syntax and semantics; I concentrate on essential concepts and ideas; I guiding principle: a concept should be as simple and pure as possible; I the concepts should be orthogonal; I use the teaching language to explain features of “real programming languages”. 3 / 28 Foundations of Foundations of Value-Oriented Programming Object-Oriented Programming RALF HINZE Background local FVOP val base = 8 FEOP FOOP in Introduction function digits (n : Nat): List hNati = Objects Classes if n 0 then Nil Open Recursion else Cons (n % base, digits (n ÷ base)) Subtyping Delegation Inheritance function nat (ds : List hNati): Nat = Conclusion case ds of Appendix Nil ⇒ 0 | Cons (d, ds0) ⇒ d + base ∗ nat (ds0) end end Introduces expressions, declarations, the concept of scope etc. Advanced topics: type abstraction, polymorphism, contracts etc. 4 / 28 Foundations of Foundations of Effect-Oriented Programming Object-Oriented Programming RALF HINZE Background FVOP FEOP local FOOP val bal = ref 0 Introduction Objects in Classes function deposit (amount : Nat): () = Open Recursion Subtyping bal := !bal + amount Delegation Inheritance function withdraw (amount : Nat): () = Conclusion bal := !bal − amount Appendix function balance () : Nat = !bal end Introduces IO, state, exceptions, the concept of extent etc. 5 / 28 Foundations of Table of contents Object-Oriented Programming RALF HINZE 1 Background Background FVOP 2 Foundations of Value-Oriented Programming FEOP FOOP Introduction 3 Foundations of Effect-Oriented Programming Objects Classes Open Recursion 4 Foundations of Object-Oriented Programming Subtyping Delegation Introduction Inheritance Objects Conclusion Appendix Classes Open Recursion Subtyping Delegation Inheritance Conclusion 5 Appendix 6 / 28 Foundations of Introduction — Jargon Object-Oriented Programming RALF HINZE Background FVOP Every subject has its jargon, object-oriented programming is no exception: FEOP abstract class, anonymous class, behaviour, class hierarchy, class method, FOOP Introduction class variable, class, constructor, delegation, dispatch table, down cast, Objects dynamic binding, dynamic dispatch, encapsulation, extension, field, final, Classes Open Recursion friend, generic class, implementation, inclusion polymorphism, inheritance, Subtyping Delegation inner class, instance variable, instance, interface inheritance, interface, late Inheritance binding, message passing, method invocation, method, multiple inheritance, Conclusion name subtyping, new, object creation, object, object-oriented, open Appendix recursion, overriding, package, private, protected, public, redefinition, self, structural subtyping, subclass, subtype polymorphism, subtyping, super, superclass, this, up cast, (virtual) method table, visibility. Object-orientation seems to be complex and loaded. To help de-mystify the subject, we shall identify the essential principles or characteristics. 7 / 28 Foundations of Characteristics — What is object-oriented programming? Object-Oriented Programming I Dynamic dispatch: RALF HINZE When an operation is invoked on an object, the object itself Background determines what code gets executed. Two objects with the same FVOP interface may be implemented quite differently. FEOP I Encapsulation: FOOP Introduction The implementation of an object is hidden from view. Changes to the Objects implementation can only affect the object itself. Classes Open Recursion I Open recursion: Subtyping Delegation One method can invoke another method via a special identifier called Inheritance self , which is late-bound — dynamic dispatch for recursive invocations. Conclusion Appendix I Subtyping: An object that supports more operations can be used as an object that supports less operations. The ability to ignore parts of an interface allows us to write general code that manipulates different sorts of objects in a uniform way. I Inheritance: The behaviour of an object can be reused in another object so that common behaviour must be implemented just once. This reuse of behaviour can be achieved I via objects and delegation or I via classes and subclassing. 8 / 28 Foundations of Recapitulation: encapsulation in an effect-oriented language Object-Oriented Programming RALF HINZE Encapsulation is achieved by delimiting the scope of internals — only Background entities that have a name can be accessed and reused. FVOP FEOP local FOOP val bal = ref 0 Introduction in Objects Classes function deposit (amount : Nat): () = Open Recursion Subtyping bal := !bal + amount Delegation Inheritance function withdraw (amount : Nat): () = Conclusion bal := !bal − amount Appendix function balance () : Nat = !bal end The representation of a bank account, the reference cell bal, is local to deposit, withdraw and balance. Observation: The functions deposit, withdraw and balance belong together, but they are only loosely coupled. 9 / 28 Foundations of Objects Object-Oriented Programming Wish: linguistic support for integrating operations into a single entity. RALF HINZE Background val my-account = FVOP object FEOP local FOOP Introduction val bal = ref 0 Objects Classes in Open Recursion method deposit (amount : Nat): () = Subtyping Delegation bal := !bal + amount Inheritance Conclusion method withdraw (amount : Nat): () = Appendix bal := !bal − amount method balance : Nat = !bal end end The entity is called an object. As a first approximation an object can be seen as a record of functions. Syntactic changes: object ... end bracket; method instead of function. 10 / 28 Foundations of Method invocation Object-Oriented Programming RALF HINZE Background An integrated function aka method is invoked using the dot notation. FVOP FEOP (Recall: ≫ is the prompt of the evaluator). FOOP Introduction my-account.deposit (4711) Objects ≫ Classes () Open Recursion Subtyping ≫ my-account.withdraw (815) Delegation () Inheritance Conclusion ≫ my-account.withdraw (2765) Appendix () ≫ my-account.balance 1131 Jargon: we say “invoking a method on an object” or “sending an object a message”. 11 / 28 Foundations of Interfaces Object-Oriented Programming RALF HINZE Background Every well-formed expression has a type; object ... end is an expression; FVOP so what is the type of an object? FEOP FOOP type Account = Introduction Objects object Classes method deposit : Nat → () Open Recursion Subtyping method withdraw : Nat → () Delegation Inheritance method balance : Nat Conclusion end Appendix Recall: a type represents our static knowledge of an expression. An object is solely defined by its behaviour; the object’s internal representation does not appear in its type! An object type such as Account is also called an interface. An interface is the set of operations an object supports. 12 / 28 Foundations of Objects and Interfaces Object-Oriented Programming RALF HINZE A different implementation of a bank account with the same interface: Background FVOP val your-account = FEOP object FOOP local Introduction Objects val n = ref 0 Classes Open Recursion val history = array [10] i ⇒ ref 0 Subtyping Delegation function inc (n : Nat): Nat = (n + 1)% 10 Inheritance in Conclusion method deposit (amount : Nat): () = Appendix history.[inc (!n)] := !history.[!n] + amount; n := inc (!n) method withdraw (amount : Nat): () = history.[inc (!n)] := !history.[!n] − amount; n := inc (!n) method balance : Nat = !history.[!n] end end 13 / 28 Foundations of Demo Object-Oriented Programming RALF HINZE Background FVOP ≫ my-account.balance 1131 FEOP FOOP ≫ your-account.deposit 4711 Introduction () Objects Classes ≫ my-account.withdraw 1000; your-account.deposit 1000 Open Recursion () Subtyping Delegation ≫ my-account.balance Inheritance 131 Conclusion Appendix ≫ your-account.balance 5711 The objects my-account and your-account are interchangeable — at least from the point of view of the language. They respond to the same messages. Each object itself determines what code gets executed. 14 / 28 Foundations of Objects and Interfaces Object-Oriented Programming RALF HINZE The fact
Load more

Recommended publications
  • MANNING Greenwich (74° W
    Object Oriented Perl Object Oriented Perl DAMIAN CONWAY MANNING Greenwich (74° w. long.) For electronic browsing and ordering of this and other Manning books, visit http://www.manning.com. The publisher offers discounts on this book when ordered in quantity. For more information, please contact: Special Sales Department Manning Publications Co. 32 Lafayette Place Fax: (203) 661-9018 Greenwich, CT 06830 email: [email protected] ©2000 by Manning Publications Co. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by means electronic, mechanical, photocopying, or otherwise, without prior written permission of the publisher. Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in the book, and Manning Publications was aware of a trademark claim, the designations have been printed in initial caps or all caps. Recognizing the importance of preserving what has been written, it is Manning’s policy to have the books we publish printed on acid-free paper, and we exert our best efforts to that end. Library of Congress Cataloging-in-Publication Data Conway, Damian, 1964- Object oriented Perl / Damian Conway. p. cm. includes bibliographical references. ISBN 1-884777-79-1 (alk. paper) 1. Object-oriented programming (Computer science) 2. Perl (Computer program language) I. Title. QA76.64.C639 1999 005.13'3--dc21 99-27793 CIP Manning Publications Co. Copyeditor: Adrianne Harun 32 Lafayette
    [Show full text]
  • Comp 411 Principles of Programming Languages Lecture 19 Semantics of OO Languages
    Comp 411 Principles of Programming Languages Lecture 19 Semantics of OO Languages Corky Cartwright Mar 10-19, 2021 Overview I • In OO languages, OO data values (except for designated non-OO types) are special records [structures] (finite mappings from names to values). In OO parlance, the components of record are called members. • Some members of an object may be functions called methods. Methods take this (the object in question) as an implicit parameter. Some OO languages like Java also support static methods that do not depend on this; these methods have no implicit parameters. In efficient OO language implementations, method members are shared since they are the same for all instances of a class, but this sharing is an optimization in statically typed OO languages since the collection of methods in a class is immutable during program evaluation (computation). • A method (instance method in Java) can only be invoked on an object (the receiver, an implicit parameter). Additional parameters are optional, depending on whether the method expects them. This invocation process is called dynamic dispatch because the executed code is literally extracted from the object: the code invoked at a call site depends on the value of the receiver, which can change with each execution of the call. • A language with objects is OO if it supports dynamic dispatch (discussed in more detail in Overview II & III) and inheritance, an explicit taxonomy for classifying objects based on their members and class names where superclass/parent methods are inherited unless overridden. • In single inheritance, this taxonomy forms a tree; • In multiple inheritance, it forms a rooted DAG (directed acyclic graph) where the root class is the universal class (Object in Java).
    [Show full text]
  • Dynamic Dispatch
    CS 3110 Lecture 24: Dynamic Dispatch Prof. Clarkson Spring 2015 Today’s music: "Te Core" by Eric Clapton Review Current topic: functional vs. object-oriented programming Today: • Continue encoding objects in OCaml • Te core of OOP – dynamic dispatch – sigma calculus Review: key features of OOP 1. Encapsulation 2. Subtyping 3. Inheritance 4. Dynamic dispatch Review: Counters class Counter {! protected int x = 0;! public int get() { return x; }! public void inc() { x++; }! }! Review: Objects • Type of object is record of functions !type counter = {! !get : unit -> int;! !inc : unit -> unit;! !} • Let-binding hides internal state (with closure) !let x = ref 0 in {! !get = (fun () -> !x);! !inc = (fun () -> x := !x+1);! !}! Review: Classes • Representation type for internal state: !type counter_rep = {! !!x : int ref;! !}! • Class is a function from representation type to object: !let counter_class (r:counter_rep) = {! !!get = (fun () -> !(r.x));! !!inc = (fun () -> (r.x := !(r.x) + 1));! !}! • Constructor uses class function to make a new object: !let new_counter () =! !!let r = {x = ref 0} in! ! !counter_class r !! Review: Inheritance • Subclass creates an object of the superclass with the same internal state as its own – Bind resulting parent object to super • Subclass creates a new object with same internal state • Subclass copies (inherits) any implementations it wants from superclass 4. DYNAMIC DISPATCH This class SetCounter {! protected int x = 0;! public int get() { return x; }! public void set(int i) { x = i; }! public void inc()
    [Show full text]
  • Specialising Dynamic Techniques for Implementing the Ruby Programming Language
    SPECIALISING DYNAMIC TECHNIQUES FOR IMPLEMENTING THE RUBY PROGRAMMING LANGUAGE A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Engineering and Physical Sciences 2015 By Chris Seaton School of Computer Science This published copy of the thesis contains a couple of minor typographical corrections from the version deposited in the University of Manchester Library. [email protected] chrisseaton.com/phd 2 Contents List of Listings7 List of Tables9 List of Figures 11 Abstract 15 Declaration 17 Copyright 19 Acknowledgements 21 1 Introduction 23 1.1 Dynamic Programming Languages.................. 23 1.2 Idiomatic Ruby............................ 25 1.3 Research Questions.......................... 27 1.4 Implementation Work......................... 27 1.5 Contributions............................. 28 1.6 Publications.............................. 29 1.7 Thesis Structure............................ 31 2 Characteristics of Dynamic Languages 35 2.1 Ruby.................................. 35 2.2 Ruby on Rails............................. 36 2.3 Case Study: Idiomatic Ruby..................... 37 2.4 Summary............................... 49 3 3 Implementation of Dynamic Languages 51 3.1 Foundational Techniques....................... 51 3.2 Applied Techniques.......................... 59 3.3 Implementations of Ruby....................... 65 3.4 Parallelism and Concurrency..................... 72 3.5 Summary............................... 73 4 Evaluation Methodology 75 4.1 Evaluation Philosophy
    [Show full text]
  • Subclassing and Dynamic Dispatch
    Subclassing and Dynamic Dispatch 6.170 Lecture 3 This lecture is about dynamic dispatch: how a call o.m() may actually invoke the code of different methods, all with the same name m, depending on the runtime type of the receiver object o. To explain how this happens, we show how one class can be defined as a subclass of another, and can override some of its methods. This is called subclassing or inheritance, and it is a central feature of object oriented languages. At the same time, it’s arguably a rather dangerous and overrused feature, for reasons that we’ll discuss later when we look at subtyping. The notion of dynamic dispatch is broader than the notion of inheritance. You can write a Java program with no inheritance in which dynamic dispatch still occurs. This is because Java has built- in support for specifications. You can declare an object to satisfy a kind of partial specification called an interface, and you can provide many implementations of the same interface. This is actually a more important and fundamental notion than subclassing, and it will be discussed in our lecture on specification. 1 Bank Transaction Code Here is the code for a class representing a bank account: class Account { String name; Vector transv; int balance; Account (String n) { transv = new Vector (); balance = 0; name = n; } boolean checkTrans (Trans t) { return (balance + t.amount >= 0); } void post (Trans t) { transv.add (t); balance += t.amount; } } and a class representing a transaction: class Trans { int amount; 1 Date date; ... } 2 Extending a Class by Inheritance Suppose we want to implement a new kind of account that allows overdrafts.
    [Show full text]
  • Topic 9: Type Checking • Readings: • Chapter 13.5, 13.6 and 13.7
    Recommended Exercises and Readings • From Haskell: The craft of functional programming (3rd Ed.) • Exercises: • 13.17, 13.18, 13.19, 13.20, 13.21, 13.22 Topic 9: Type Checking • Readings: • Chapter 13.5, 13.6 and 13.7 1 2 Type systems Static vs. Dynamic Typing • There are (at least) three different ways that we can compare type • Static typing systems • The type of a variable is known at compile time • Static vs. dynamic typing • It is explicitly stated by the programmer… • Strong vs. weak typing • Or it can be inferred from context • Explicit vs. implicit typing • Type checking can be performed without running the program • Used by Haskell • Also used by C, C++, C#, Java, Fortran, Pascal, … 3 4 Static vs. Dynamic Typing Static vs. Dynamic Typing • Dynamic typing • Static vs. Dynamic typing is a question of timing… • The type of a variable is not known until the program is running • When is type checking performed? • Typically determined from the value that is actually stored in it • At compile time (before the program runs)? Static • Program can crash at runtime due to incorrect types • As the program is running? Dynamic • Permits downcasting, dynamic dispatch, reflection, … • Used by Python, Javascript, PHP, Lisp, Ruby, … 5 6 Static vs. Dynamic Typing Static vs. Dynamic Typing • Some languages do a mixture of both of static and dynamic typing • Advantages of static typing • Most type checking in Java is performed at compile time… • … but downcasting is permitted, and can’t be verified at compile time • Generated code includes a runtime type check • A ClassCastException is thrown if the downcast wasn’t valid • Advantages of dynamic typing • Most type checking in C++ is performed at compile time.
    [Show full text]
  • Multiple Dispatch As Dispatch on Tuples Gary T
    Computer Science Technical Reports Computer Science 7-1998 Multiple Dispatch as Dispatch on Tuples Gary T. Leavens Iowa State University Todd Millstein Iowa State University Follow this and additional works at: http://lib.dr.iastate.edu/cs_techreports Part of the Systems Architecture Commons, and the Theory and Algorithms Commons Recommended Citation Leavens, Gary T. and Millstein, Todd, "Multiple Dispatch as Dispatch on Tuples" (1998). Computer Science Technical Reports. 131. http://lib.dr.iastate.edu/cs_techreports/131 This Article is brought to you for free and open access by the Computer Science at Iowa State University Digital Repository. It has been accepted for inclusion in Computer Science Technical Reports by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. Multiple Dispatch as Dispatch on Tuples Abstract Many popular object-oriented programming languages, such as C++, Smalltalk-80, Java, and Eiffel, do not support multiple dispatch. Yet without multiple dispatch, programmers find it difficult to express binary methods and design patterns such as the ``visitor'' pattern. We describe a new, simple, and orthogonal way to add multimethods to single-dispatch object-oriented languages, without affecting existing code. The new mechanism also clarifies many differences between single and multiple dispatch. Keywords Multimethods, generic functions, object-oriented programming languages, single dispatch, multiple dispatch, tuples, product types, encapsulation,
    [Show full text]
  • Array Operators Using Multiple Dispatch: a Design Methodology for Array Implementations in Dynamic Languages
    Array Operators Using Multiple Dispatch: A design methodology for array implementations in dynamic languages The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Jeff Bezanson, Jiahao Chen, Stefan Karpinski, Viral Shah, and Alan Edelman. 2014. Array Operators Using Multiple Dispatch: A design methodology for array implementations in dynamic languages. In Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming (ARRAY '14). ACM, New York, NY, USA, 56-61, 6 pages. As Published http://dx.doi.org/10.1145/2627373.2627383 Publisher Association for Computing Machinery (ACM) Version Author's final manuscript Citable link http://hdl.handle.net/1721.1/92858 Terms of Use Creative Commons Attribution-Noncommercial-Share Alike Detailed Terms http://creativecommons.org/licenses/by-nc-sa/4.0/ Array Operators Using Multiple Dispatch Array Operators Using Multiple Dispatch A design methodology for array implementations in dynamic languages Jeff Bezanson Jiahao Chen Stefan Karpinski Viral Shah Alan Edelman MIT Computer Science and Artificial Intelligence Laboratory [email protected], [email protected], [email protected], [email protected], [email protected] Abstract ficient, such as loop fusion for array traversals and common subex- Arrays are such a rich and fundamental data type that they tend to pression elimination for indexing operations [3, 24]. Many lan- be built into a language, either in the compiler or in a large low- guage implementations therefore choose to build array semantics level library. Defining this functionality at the user level instead into compilers. provides greater flexibility for application domains not envisioned Only a few of the languages that support n-arrays, however, by the language designer.
    [Show full text]
  • Object-Oriented Programming?
    ³ ° CIS 500 Software Foundations Fall 2002 18 November ² ± CIS 500, 18 November 1 ³ ° Administrivia § Prof. Pierce’s 3PM recitation this afternoon cancelled — please go to Max K. in Towne 307 instead § Midterm results available in 556 § Rough grade breakdown: 65-80: A 50-64: B 35-49: C 34: D/F 58+ points is on-target for WPE-I § Grading questions? See your TA. ² ± CIS 500, 18 November 2 ³ ° On to Objects ² ± CIS 500, 18 November 3 ³ ° AChangeofPace We’ve spent the past 10 weeks developing tools for defining and reasoning about programming language features. Now it’s time to use these tools for something more ambitious. ² ± CIS 500, 18 November 4 ³ ° Case study: object-oriented programming Plan: 1. Identify some characteristic “core features” of object-oriented programming 2. Develop two different analyses of these features: (a) A translation into a lower-level language (b) A direct, high-level formalization of a simple object-oriented language (“Featherweight Java”) ² ± CIS 500, 18 November 5 ³ ° The Translational Analysis Our first goal will be to show how many of the basic features of object-oriented languages objects dynamic dispatch encapsulation of state inheritance self (this) and super late binding can be understood as “derived forms” in a lower-level language with a rich collection of primitive features: (higher-order) functions records references recursion subtyping ² ± CIS 500, 18 November 6 ³ ° For simple objects and classes, this translational analysis works very well. When we come to more complex features (in particular, classes with ×eÐf ), it becomes less satisfactory, leading us to the more direct treatment in the following chapter.
    [Show full text]
  • Multiple Dispatch and Roles in OO Languages: Ficklemr
    Multiple Dispatch and Roles in OO Languages: FickleMR Submitted By: Asim Anand Sinha [email protected] Supervised By: Sophia Drossopoulou [email protected] Department of Computing IMPERIAL COLLEGE LONDON MSc Project Report 2005 September 13, 2005 Abstract Object-Oriented Programming methodology has been widely accepted because it allows easy modelling of real world concepts. The aim of research in object-oriented languages has been to extend its features to bring it as close as possible to the real world. In this project, we aim to add the concepts of multiple dispatch and first-class relationships to a statically typed, class based langauges to make them more expressive. We use Fickle||as our base language and extend its features in FickleMR . Fickle||is a statically typed language with support for object reclassification, it allows objects to change their class dynamically. We study the impact of introducing multiple dispatch and roles in FickleMR . Novel idea of relationship reclassification and more flexible multiple dispatch algorithm are most interesting. We take a formal approach and give a static type system and operational semantics for language constructs. Acknowledgements I would like to take this opportunity to express my heartful gratitude to DR. SOPHIA DROSSOPOULOU for her guidance and motivation throughout this project. I would also like to thank ALEX BUCKLEY for his time, patience and brilliant guidance in the abscence of my supervisor. 1 Contents 1 Introduction 5 2 Background 8 2.1 Theory of Objects . 8 2.2 Single and Double Dispatch . 10 2.3 Multiple Dispatch . 12 2.3.1 Challenges in Implementation .
    [Show full text]
  • Runtime Environments Part II
    Runtime Environments Part II Announcements ● Programming Project 3 Checkpoint due tonight at 11:59PM. ● No late submissions accepted. ● Ask questions on Piazza! ● Stop by office hours! ● Email the staff list! ● Midterm graded; will be returned at end of class. ● Available outside Gates 178 afterwards. Where We Are Source Lexical Analysis Code Syntax Analysis Semantic Analysis IR Generation IR Optimization Code Generation Optimization Machine Code Implementing Objects Objects are Hard ● It is difficult to build an expressive and efficient object-oriented language. ● Certain concepts are difficult to implement efficiently: ● Dynamic dispatch (virtual functions) ● Interfaces ● Multiple Inheritance ● Dynamic type checking (i.e. instanceof) ● Interfaces are so tricky to get right we won't ask you to implement them in PP4. Encoding C-Style structs ● A struct is a type containing a collection of named values. ● Most common approach: lay each field out in the order it's declared. Encoding C-Style structs ● A struct is a type containing a collection of named values. ● Most common approach: lay each field out in the order it's declared. struct MyStruct { int myInt; char myChar; double myDouble; }; Encoding C-Style structs ● A struct is a type containing a collection of named values. ● Most common approach: lay each field out in the order it's declared. struct MyStruct { int myInt; char myChar; double myDouble; }; 4 Bytes 1 8 Bytes Encoding C-Style structs ● A struct is a type containing a collection of named values. ● Most common approach: lay each field out in the order it's declared. struct MyStruct { int myInt; char myChar; double myDouble; }; 4 Bytes 1 3 Bytes 8 Bytes Accessing Fields ● Once an object is laid out in memory, it's just a series of bytes.
    [Show full text]
  • Python Programming on Win32: Chapter 12 Advanced Python and COM
    Python Programming on Win32: Chapter 12 Advanced Python and COM http://www.oreilly.com/catalog/pythonwin32/chapter/ch12.html Python Programming on Win32 Help for Windows Programmers By Mark Hammond & Andy Robinson 1st Edition January 2000 1-56592-621-8, Order Number: 6218 672 pages, $34.95 Chapter 12 Advanced Python and COM In Chapter 5, Introduction to COM , we presented some basic material about Python and COM. If you have never used Python and COM together or are unfamiliar with basic COM concepts, you should review that chapter before continuing here. In this chapter we take a more technical look at COM and using Python from COM. We initially provide a discussion of COM itself and how it works; an understanding of which is necessary if you need to use advanced features of COM from Python. We then look at using COM objects from Python in more detail and finish with an in-depth discussion of implementing COM objects using Python. Advanced COM In order to fully understand Python and COM, it is necessary to understand COM itself. Although Python hides many of the implementation details, understanding these details makes working with Python and COM much easier. If you want to see how to use Python to control COM objects such as Microsoft Word or Excel, you can jump directly to the section "Using Automation Objects from Python ." Interfaces and Objects COM makes a clear distinction between interfaces and objects . An interface describes certain functionality, while an object implements that functionality (that is, implements the interface). An interface describes how an object is to behave, while the object itself implements the behavior.
    [Show full text]