[CPP] STL and namespace

Namespace

  • namespaces are used to avoid name conflicts
  • To put code in a namespace use:
    namespace <NamespaceName>
 {
     <put code for classes or functions here>
 }
  • Can use scoping to specify a namespace to ‘look in’:
  • < namespace >::< class >::< function > or < namespace>::< globalfunction>
  • you can avoid keeping saying :: by “using namespace ”
  • The standard class library is in the std namespace

The scoping operator

Left of scoping operator is
  • blank(to access a global variable/function)
  • class name(to access member of that class)
  • namespace name(to use that namespace)
    enter image description here
if there is just :: but nothing on the left, it means global
enter image description here
On the right, there are three different main(), only 2 and 3 will compile successfully because:
  • The first main() doesn’t clarify which MyPrintFunction1() it calls, so it will be ambiguous.
  • The second main() means the global function which is on the left bottom
  • The third main() means the function from namespace cpp

Standard class library classes

String

string has been covered in the previous blog
note: obtain a const char * for the string–> c_str()

streams for input/output

Three standard streams exist already
  • istream cin; (matches stdin)
  • ostream cout; (matches stdout)
  • ostream cerr; (matches stderr)

File access using streams

  • ifstream object -open the file for input
  • ofstream object -open the file for output
  • fstream object -specify what to open file for
  • use the << and >> operators to read/write

File output example

enter image description here
The file will be like:
Hello File
75

File input example

enter image description here
It is based on the file above, it will read all the file content, output will be “Hello”, str will be “File”, x will be 75

strstream

enter image description here
But strstream will stop reading in when it encounter to a “space”, so C++ standard said it is not recommended to use, we should use stringstream

Standard Template Library

A larger library of template classes and algorithms.
enter image description here
We have covered some important STL like vector before.

评论

发表评论

此博客中的热门博文

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