[CPP] Multiple Inheritance

Multiple Inheritance

  • In Java you can implement multiple interfaces but only extend one class
  • In C++ you can inherit from(extend) multiple classes
  • You will inherit all of the behaviour(i.e. function implementations), not just the interface.
  • But be careful of multiple inheritance, because
    • there are dangers, and confusing elements
    • there may be easier ways(e.g. composition)

There are multiple ways to support reuse of classes by new classes

Composition/Aggregation
  • Models the “has a” or “is a part of” relationship
  • Composition is a stronger form
    enter image description here
    • You need to expose the methods manually because they are on component objects
Inheritance
  • “is a” or “is a type of”
  • ImplementationL Make the “type of” a sub-class
    enter image description here
enter image description here

Don’t use C-style casting to keep the code short!

  • Use static_cast or dynamic_cast
  • Dynamic cast will check(at runtime) that the pointer really is to an object of that type
  • If you cast pointers or references when multiple inheritance is being used, then addresses may change
  • Normally, casting a pointer just changes the type, but leaves the address unchanged
  • If you go to or from a second base class, the address will change
  • If you go back to sub-class, the pointer value changes back again(use dynamic cast if necessary, to check the type)
Uses/Association
  • Implementation: Maintain a pointer or reference between them, to get to the other object

Multiple inheritance with common base classes

enter image description here

Multiple inheritance with virtual base classes

enter image description here

Dangers

  • Be aware of:
    • Inheriting the same names from multiple base classes
    • Inheriting the same base class twicem through two different intermediate classes
  • To resolve the problem:
    • Use scoping operator :: to dis-ambiguate
    • Or use virtual base classes, to keep one copy
    • Or ensure that only one base class has any data, or any non-abstract methods

Wait…What is abstract method in C++?(Pure-virtual functions)

enter image description here

评论

发表评论

此博客中的热门博文

[MLE]Decision Trees

图片
Overview Decision Trees Linear vs non-linear classifiers Entropy C4.5 Random Forests Some fundamental concepts The process of selecting a specific model, given a new input x, can be described by a sequential decision making process corresponding to the traversal of a binary tree (one that splits into two branches at each node). Here we focus on a particular tree-based framework called classification and regression trees Basic Decision Trees Decision trees apply a sequence of linear decisions, that often depend on only a single variable at a time. Such trees partition the input space into cuboid regions, gradually refining the level of detail of a decision until a leaf node has been reached, which provides the final predicted label As the above figure indicates, we should follow the rules for tree classification: Start at root node Evaluate relevant attribute of that node Follow branch according to attribute evaluation to descendent node Descendent node can then be co...
阅读全文

[SEC] Cryptography I

图片
Cryptography I Content What is encryption? Primitive types Historic ciphers The One Time Pad Stream Ciphers Cryptanalysis(密码分析学，密码翻译法) Encryption Encryption: We encode a message such that only authorised users may read it Cipher: takes a string of plaintext, and converts it into a string of ciphertext Encryption can provide: Confidentiality Integrity Authenticity Notation A cipher converts a plaintext message M into a ciphertext C under the control of a key K C is not a secret, but without knowledge of the key, it should be impossible to reconstruct M Comes in two forms: Symmetric- same key for encryption/decryption Asymmetric- separate keys The Caesar Cipher An early substitution cipher , we replace each letter of plaintext with a shifted letter further down the alphabet Vulnerable to frequency analysis Frequency Analysis The frequency of occurrences of each character are very consistent across the same language The longer the ciphertext, the e...
阅读全文

[ACE] Binary Search Tree

图片
Binary Search Tree Motivation Why we need BST? We learned binary search before, if we search for an element within a sorted array is fast. The search will be in O(logn), but arrays suffer from being slow, O(n), to insert new elements . So we need a search trees attempt to fix the inefficiency of insertion whilst keeping good O(log n) properties for search. A binary search tree is a binary tree storing key-value entries at its internal nodes and satisfying the following “search tree” property: let u, v and w be any three nodes such that u is in the left subtree of v and w is in the right subtree of v. Then we must have key(u)<= key(v) <= key(w) Now we are going to implement the binary search tree. Similar to the previous implementation, when we want to implement a tree-structure, what we should do first is to define Node in tree. Search Search for a BST is relatively easy, we have learned binary search before, so we use the similar style. To search for...
阅读全文