diff options
| author | 2014-12-07 13:40:04 -0500 | |
|---|---|---|
| committer | 2014-12-07 13:40:04 -0500 | |
| commit | 2aa2d341d04b10a5ecb49acbcf3579cf2c2ae35c (patch) | |
| tree | 4beadeb20c206faf4f85c25d15eee39c964857f6 /src/common/chunk_file.h | |
| parent | Merge pull request #252 from yuriks/patch-1 (diff) | |
| parent | Change NULLs to nullptrs. (diff) | |
| download | yuzu-2aa2d341d04b10a5ecb49acbcf3579cf2c2ae35c.tar.gz yuzu-2aa2d341d04b10a5ecb49acbcf3579cf2c2ae35c.tar.xz yuzu-2aa2d341d04b10a5ecb49acbcf3579cf2c2ae35c.zip | |
Merge pull request #245 from rohit-n/null-nullptr
Change NULLs to nullptrs.
Diffstat (limited to 'src/common/chunk_file.h')
| -rw-r--r-- | src/common/chunk_file.h | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/src/common/chunk_file.h b/src/common/chunk_file.h index 609784076..32af74594 100644 --- a/src/common/chunk_file.h +++ b/src/common/chunk_file.h | |||
| @@ -204,11 +204,11 @@ public: | |||
| 204 | { | 204 | { |
| 205 | for (auto it = x.begin(), end = x.end(); it != end; ++it) | 205 | for (auto it = x.begin(), end = x.end(); it != end; ++it) |
| 206 | { | 206 | { |
| 207 | if (it->second != NULL) | 207 | if (it->second != nullptr) |
| 208 | delete it->second; | 208 | delete it->second; |
| 209 | } | 209 | } |
| 210 | } | 210 | } |
| 211 | T *dv = NULL; | 211 | T *dv = nullptr; |
| 212 | DoMap(x, dv); | 212 | DoMap(x, dv); |
| 213 | } | 213 | } |
| 214 | 214 | ||
| @@ -264,11 +264,11 @@ public: | |||
| 264 | { | 264 | { |
| 265 | for (auto it = x.begin(), end = x.end(); it != end; ++it) | 265 | for (auto it = x.begin(), end = x.end(); it != end; ++it) |
| 266 | { | 266 | { |
| 267 | if (it->second != NULL) | 267 | if (it->second != nullptr) |
| 268 | delete it->second; | 268 | delete it->second; |
| 269 | } | 269 | } |
| 270 | } | 270 | } |
| 271 | T *dv = NULL; | 271 | T *dv = nullptr; |
| 272 | DoMultimap(x, dv); | 272 | DoMultimap(x, dv); |
| 273 | } | 273 | } |
| 274 | 274 | ||
| @@ -320,7 +320,7 @@ public: | |||
| 320 | template<class T> | 320 | template<class T> |
| 321 | void Do(std::vector<T *> &x) | 321 | void Do(std::vector<T *> &x) |
| 322 | { | 322 | { |
| 323 | T *dv = NULL; | 323 | T *dv = nullptr; |
| 324 | DoVector(x, dv); | 324 | DoVector(x, dv); |
| 325 | } | 325 | } |
| 326 | 326 | ||
| @@ -369,7 +369,7 @@ public: | |||
| 369 | template<class T> | 369 | template<class T> |
| 370 | void Do(std::deque<T *> &x) | 370 | void Do(std::deque<T *> &x) |
| 371 | { | 371 | { |
| 372 | T *dv = NULL; | 372 | T *dv = nullptr; |
| 373 | DoDeque(x, dv); | 373 | DoDeque(x, dv); |
| 374 | } | 374 | } |
| 375 | 375 | ||
| @@ -395,7 +395,7 @@ public: | |||
| 395 | template<class T> | 395 | template<class T> |
| 396 | void Do(std::list<T *> &x) | 396 | void Do(std::list<T *> &x) |
| 397 | { | 397 | { |
| 398 | T *dv = NULL; | 398 | T *dv = nullptr; |
| 399 | Do(x, dv); | 399 | Do(x, dv); |
| 400 | } | 400 | } |
| 401 | 401 | ||
| @@ -433,7 +433,7 @@ public: | |||
| 433 | { | 433 | { |
| 434 | for (auto it = x.begin(), end = x.end(); it != end; ++it) | 434 | for (auto it = x.begin(), end = x.end(); it != end; ++it) |
| 435 | { | 435 | { |
| 436 | if (*it != NULL) | 436 | if (*it != nullptr) |
| 437 | delete *it; | 437 | delete *it; |
| 438 | } | 438 | } |
| 439 | } | 439 | } |
| @@ -518,7 +518,7 @@ public: | |||
| 518 | void DoClass(T *&x) { | 518 | void DoClass(T *&x) { |
| 519 | if (mode == MODE_READ) | 519 | if (mode == MODE_READ) |
| 520 | { | 520 | { |
| 521 | if (x != NULL) | 521 | if (x != nullptr) |
| 522 | delete x; | 522 | delete x; |
| 523 | x = new T(); | 523 | x = new T(); |
| 524 | } | 524 | } |
| @@ -567,7 +567,7 @@ public: | |||
| 567 | { | 567 | { |
| 568 | if (mode == MODE_READ) | 568 | if (mode == MODE_READ) |
| 569 | { | 569 | { |
| 570 | cur->next = 0; | 570 | cur->next = nullptr; |
| 571 | list_cur = cur; | 571 | list_cur = cur; |
| 572 | if (prev) | 572 | if (prev) |
| 573 | prev->next = cur; | 573 | prev->next = cur; |
| @@ -586,13 +586,13 @@ public: | |||
| 586 | if (mode == MODE_READ) | 586 | if (mode == MODE_READ) |
| 587 | { | 587 | { |
| 588 | if (prev) | 588 | if (prev) |
| 589 | prev->next = 0; | 589 | prev->next = nullptr; |
| 590 | if (list_end) | 590 | if (list_end) |
| 591 | *list_end = prev; | 591 | *list_end = prev; |
| 592 | if (list_cur) | 592 | if (list_cur) |
| 593 | { | 593 | { |
| 594 | if (list_start == list_cur) | 594 | if (list_start == list_cur) |
| 595 | list_start = 0; | 595 | list_start = nullptr; |
| 596 | do | 596 | do |
| 597 | { | 597 | { |
| 598 | LinkedListItem<T>* next = list_cur->next; | 598 | LinkedListItem<T>* next = list_cur->next; |