[C + +] hash (closed hash, open hash)

unordered series associative containers unordered_map&& unordered_set Introduction to relevance container At the bottom of STL, map and set are implemented in red black tree encapsulation, and their complexity is basically logn, because they are highly controllable, but in the future, a great God came up with another container st ...

Added by usmanmr on Mon, 31 Jan 2022 15:59:01 +0200

C + + function overloading, rewriting and redefinition

1, Function overloading 1. Definitions Definition: the same function name, different parameter sequences (including different number of parameters or different types of parameters). 2. Basic conditions Basic conditions:  the function name must be the same;  function parameters must be different, which can be different parameter types ...

Added by samrat_php on Mon, 31 Jan 2022 15:30:46 +0200

AtCoder water problem (C + +) on the valley [questions 6 to 10]

Ah, it's another day to brush questions~~ Friends who want to see questions 1 to 5 can Kangkang here~~ In order to facilitate understanding, I made some questions a little more popular, and some of the original questions really can't go on OK, no more waste words brush questions~~ Question 6: Sushi タワワ - Luogu Title Description: A sush ...

Added by DirtySnipe on Mon, 31 Jan 2022 14:39:55 +0200

Effective c + + learning notes - customize new and delete

Unless otherwise specified, the information discussed in this paper is about The function of new also applies to new[] Clause 49 - Understanding new_handler behavior 1. Global new_handler We know that bad will be thrown when new fails_ Alloc abnormality; We can also set the new operator to return a null pointer instead of throwing an e ...

Added by brandone on Mon, 31 Jan 2022 08:53:39 +0200

Detailed explanation of binary tree and typical questions of force buckle

1, Types of binary trees 1. Full binary tree Except that the last layer has no child nodes, all nodes on each layer have two child node binary trees (if the depth is k, there are 2^k-1 nodes). 2. Complete binary tree Let the depth of a binary tree be H. Except for layer h, the number of nodes in other layers reaches the maximum, and all n ...

Added by xxxzom_biexxx on Mon, 31 Jan 2022 08:43:07 +0200

shared_ptr and weak_ptr

shared_ptr Reference from https://www.jianshu.com/p/b6ac02d406a0 shared_ The PTR class does almost nothing. It inherits__ shared_ptr, __shared_ptr has a type of__ shared_ Member of type count_ M_refcount, __shared_count has an internal type of_ Sp_counted_base *_ M_ Members of PI_ Sp_counted_base is the whole shared_ The core of PTR functi ...

Added by minou on Mon, 31 Jan 2022 05:14:05 +0200

SLAM learning notes -- coordinate transformation and eigen Library

Vector basic knowledge slightly coordinate transformation Basic concepts of coordinate transformation I recommend taking a look at his linear algebra series 3blue1brown The following formula represents the most basic transformation, Euclidean transformation (only rotation + translation), and R is an orthogonal matrix. Left multiplying ...

Added by jmicozzi on Mon, 31 Jan 2022 04:26:37 +0200

opencv c + + Learning III (fuzzy edge detection, expansion and corrosion)

catalogue 1. Ambiguity 1.1 fuzzy mean 1.2 Gaussian filtering ​ 2.canny edge detection 3. Expansion and erosion 1. Ambiguity Smooth/Blur is one of the most common and simplest operations in image processing The main reason for using this operation is to reduce noise during image preprocessing Simple principle: 1.1 fuzzy mean ...

Added by nickcwj on Mon, 31 Jan 2022 03:59:25 +0200

C + + thread learning

1. Simple use of thread #include <iostream> #include <thread> #include <Windows.h> using namespace std; void thread01() { for (int i = 0; i < 5; i++) { cout << "Thread 01 is working !" << endl; Sleep(100); } } void thread02() { for (int i = 0; i < 5; i++) { cout << "Thread 02 is working !" ...

Added by robinas on Mon, 31 Jan 2022 00:18:41 +0200

P2372 yyy2015c01 challenge perimeter

Topic background Yyy2015c01 quickly solved the problem, was praised by the neighbors, happily returned home, gave the sugar to my mother, had a delicious lunch and took a sweet nap. I feel that life is really beautiful. In the afternoon, my father came home and heard that yyy2015c01 had helped the teacher and neighbors solve their problems. He ...

Added by markjohnson on Mon, 31 Jan 2022 00:15:52 +0200