[CPP] Casting and operator overloading

Casting

Casting away the const-ness

When we have a const value, normally we can’t change them, but using casting, we can cast the const value to remove the constness of a reference or pointer.
enter image description here
WARNING: Do not actually do this unless there is a really good reason! Casting away const-ness is really bad.

C++11 new way to cast

enter image description here
Four new casts:
  • cosnt_cast< newtype >(?)
  • dynamic_cast < newtype >(?): safely cast a pointer or reference from base-class to sub-class
  • static_cast< newtype >(?): cast between types, converting the type
  • reinterpret_cast< newtype >(?)
Four types give more control over what you mean, and help you to identify the effects.
Sometimes needed : dynamic_cast provides run-time type checking.
Note: Casting a pointer will not usually change the stored address value, only the type. This is NOT true with multiple inheritance.

static_cast

Commonly used cast, attempts to convert correctly between two types.
The example is in the previous blog. You can use label [CPP] to find them.

dynamic_cast

  • Casting from derived class to base class is easy, because derived class object is a base class object.
  • But base class object might not be a derived class object.
  • Using dynamic_cast, safely convert from a base-class pointer or reference to a sub-class pointer or reference
  • Checks the type at run-time rather than compile time
  • returns NULL if the type conversion of a pointer cannot take place.
  • If reference conversion fails, it throws an exception of type std::bad_cast
    enter image description here

reinterpret_cast< type >(var)

Usually this kind of cast is rarely used, and used on pointers(addresses)

Operator overloading

In C++, operators are implemented as functions. By using function overloading on the operator functions, you can define your own versions of the operators that work with different data types (including classes that you’ve written). Using function overloading to overload operators is called operator overloading.
- Function overloading: change the meaning of function according to the types of the parameters
- Operator overloading: change the meaning of operator according to the types of the parameters
enter image description here
enter image description here
What’s the difference between member function and non-member function?
enter image description here

Restriction

  • You cannot change an operator’s precedence
  • You cannot create new operators
  • You cannot change number of parameters (operands)
  • You cannot override some operators: :: sizeof ? : or . (dot)

评论

发表评论

此博客中的热门博文

[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
阅读全文