[CPP] Function pointers and virtual functions

Function Pointers

  • Functions are stored in memory, in code segament.
  • You can ask for the address of them.
  • You can store these in function pointers.
enter image description here
void (*g1)() = NULL;
The above code means g1 is a function pointer, the function takes no parameter and it returns void.
Note that (*g1)(); and g1() both call f1()
enter image description here
Here we change again, we assign g1 to g2:
Remember g2 is just a pointer, g1 assign to g2 so g2 just assign the address of g1 and g1 points to f1, so when we call g2, what we actually did is to call f1();

Callback Function

A callback is any executable code that is passed as an argument to other code, which is expected to call back (execute) the argument at a given time
Briefly speaking, callback function is a function pointer(a address), you know this pointer or address, you can use it whenever and wherever you want. Therefore, you can use it as function argument.
enter image description here

v-tables

non-virtual

  • For normal/default (non-virtual) functions:
  • Type of pointer determines function to call
  • Type is known at compile-time

virtual

  • Finds out the actual function to call based upon the object type at runtime-much difficult- slower
  • look-up “which function should i really call”
  • works in the same way as Java functions

Possible Implementation

How could virtual functions be implemented?
One possible implementation uses vtables(virtual function tables) and vpointers(pointers to a vtable)
It is quite easy, when you have a virtual function, you add it to the vtable. If there is a virtual sub-function in the sub-class, you substitute it. But we still save the previous position(maybe function in super-class). It is because we need to save the index(position).
enter image description here
Note: Only virtual functions appear in vtables, no need to record non-virtual functions

Virtualness is inherited in C++

  • Virtual-ness is inherited
  • If a function is virtual in the base class then the function is virtual in the derived class(es)
  • Including destructor! (If virtual in base class then destructors of derived classes are virtual)
  • Even when the keyword virtual is not used in the derived class
  • All functions in Java are virtual by default
  • unless the function is final, if it is final you cannot re-implemented in sub-classes.

look up virtual function

Looking up which function to call is slower than calling a non-virtual function:
1. Go to object itself
2. Go to the vtable(following the vpointer)
3. Look up which function to call from index
4. Call the function

评论

  1. MikeChen2017年5月27日 05:45

    Note: If a add a member function to an existing class, the object usually will not be bigger because functions act on objects but there is one exception. Adding the first virtual function may add a vtable pointer!

    回复删除

发表评论

此博客中的热门博文

[MLE] Linear Classification

图片
Linear Classification Discriminant functions Least squares for classification Fisher’s linear discriminant K-Nearest Neighbour(KNN) Classification What’s decision boundaries/linearly separable? The goal in classification is to take an input vector x and to assign it to one of K discrete classes \(C_k\) where k = 1,…,K. In the most common scenario, the classes are taken to be disjoint, so that each input is assigned to one and only one class. The input space is thereby divided into decision regions whose boundaries are called decision boundaries or decision surfaces. In this blog, we consider linear models for classification , by which we mean that the decision surfaces are linear functions of the input vector x and hence are defined by (D-1) -dimensional hyperplanes within the D-dimensional input space. For example: in 3D input space, the decision boundary will be a 2D surface What is Linear Separability Linearly separable data: Datasets whose classes can be separated by
阅读全文

[AIM] MetaHeuristics

图片
Day2 Outline Metaheuristics -definition Single point based search method(simple stochastic local search) Iterated local search Scheduling Tabu Search Metaheuristic what is a metaheuristic? A metaheuristic is a high-level problem independent algorithmic framework that provides a set of guidelines or strategies to develop heuristic optimization algorithms. what is the difference between heuristic and metaheuristic? Heuristic : Heuristics are problem-dependent techniques. As such, they usually are adapted to the problem at hand and they try to take full advantage of the particularities of this problem. However, because they are often too greedy, they usually get trapped in a local optimum and thus fail, in general, to obtain the global optimum solution. Metaheuristic : Meta-heuristics, on the other hand, are problem-independent techniques . As such, they do not take advantage of any specificity of the problem and, therefore, can be used as black boxes . In general, t
阅读全文

[CS231] Neural Networks

图片
Neural Network Table of Contents: Quick intro without brain analogies Modeling one neuron Biological motivation and connections Single neuron as a linear classifier Commonly used activation functions Neural Network architectures Layer-wise organization Summary Additional references Quick intro It is possible to introduce neural networks without appealing to brain analogies. In the section on linear classification we computed scores for different visual categories given the image using the formula \( s = W x \), where \(W\) was a matrix and \(x\) was an input column vector containing all pixel data of the image. In the case of CIFAR-10, \(x\) is a [3072x1] column vector, and \(W\) is a [10x3072] matrix, so that the output scores is a vector of 10 class scores. An example neural network would instead compute \( s = W_2 \max(0, W_1 x) \). Here, \(W_1\) could be, for example, a [100x3072] matrix transforming the image into a 100-dimensional intermediate vector. The funct
阅读全文