-
```
The new C++11 standard allows for rvalue references in method parameters. Using
those for move semantics is very useful. We need to suppor them, e.g.:
MOCK_METHOD1(mock, foo(int&& i));
```
Orig…
-
```
The new C++11 standard allows for rvalue references in method parameters. Using
those for move semantics is very useful. We need to suppor them, e.g.:
MOCK_METHOD1(mock, foo(int&& i));
```
Orig…
-
```
The new C++11 standard allows for rvalue references in method parameters. Using
those for move semantics is very useful. We need to suppor them, e.g.:
MOCK_METHOD1(mock, foo(int&& i));
```
Orig…
-
- git bash 설치 / 윈도우 cmd 내에서 git 명령어가 작동해야함.
-
```
Many algorithms (e.g. std::sort) require a binary comparator to be a strict
weak ordering, or the program may crash or result in corrupted memory. It
would be very useful to provide a function te…
-
```
Many algorithms (e.g. std::sort) require a binary comparator to be a strict
weak ordering, or the program may crash or result in corrupted memory. It
would be very useful to provide a function te…
-
```
Many algorithms (e.g. std::sort) require a binary comparator to be a strict
weak ordering, or the program may crash or result in corrupted memory. It
would be very useful to provide a function te…
-
```
Many algorithms (e.g. std::sort) require a binary comparator to be a strict
weak ordering, or the program may crash or result in corrupted memory. It
would be very useful to provide a function te…
-
```
Many algorithms (e.g. std::sort) require a binary comparator to be a strict
weak ordering, or the program may crash or result in corrupted memory. It
would be very useful to provide a function te…
-
```
Many algorithms (e.g. std::sort) require a binary comparator to be a strict
weak ordering, or the program may crash or result in corrupted memory. It
would be very useful to provide a function te…