OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright 2015 The WebRTC Project Authors. All rights reserved. | |
3 * | |
4 * Use of this source code is governed by a BSD-style license | |
5 * that can be found in the LICENSE file in the root of the source | |
6 * tree. An additional intellectual property rights grant can be found | |
7 * in the file PATENTS. All contributing project authors may | |
8 * be found in the AUTHORS file in the root of the source tree. | |
9 */ | |
10 | |
11 #ifndef WEBRTC_BASE_MAYBE_H_ | |
12 #define WEBRTC_BASE_MAYBE_H_ | |
13 | |
14 #include <algorithm> | |
15 #include <utility> | |
16 | |
17 #include "webrtc/base/checks.h" | |
18 | |
19 namespace rtc { | |
20 | |
21 // Simple std::experimental::optional-wannabe. It either contains a T or not. | |
22 // In order to keep the implementation simple and portable, this implementation | |
23 // actually contains a (default-constructed) T even when it supposedly doesn't | |
24 // contain a value; use e.g. rtc::scoped_ptr<T> instead if that's too | |
25 // expensive. | |
26 // | |
27 // A moved-from Maybe<T> may only be destroyed, and assigned to if T allows | |
28 // being assigned to after having been moved from. Specifically, you may not | |
29 // assume that it just doesn't contain a value anymore. | |
30 // | |
31 // TODO(kwiberg): Get rid of this class when the standard library has | |
32 // std::optional (and we're allowed to use it). | |
33 template <typename T> | |
34 class Maybe final { | |
35 public: | |
36 // Construct an empty Maybe. | |
37 Maybe() : has_value_(false) {} | |
38 | |
39 // Construct a Maybe that contains a value. | |
40 explicit Maybe(const T& val) : value_(val), has_value_(true) {} | |
41 explicit Maybe(T&& val) : value_(static_cast<T&&>(val)), has_value_(true) {} | |
42 | |
43 // Copy and move constructors. | |
44 // TODO(kwiberg): =default the move constructor when MSVC supports it. | |
45 Maybe(const Maybe&) = default; | |
46 Maybe(Maybe&& m) | |
47 : value_(static_cast<T&&>(m.value_)), has_value_(m.has_value_) {} | |
48 | |
49 // Assignment. | |
50 // TODO(kwiberg): =default the move assignment op when MSVC supports it. | |
51 Maybe& operator=(const Maybe&) = default; | |
52 Maybe& operator=(Maybe&& m) { | |
53 value_ = static_cast<T&&>(m.value_); | |
54 has_value_ = m.has_value_; | |
55 return *this; | |
56 } | |
57 | |
58 friend void swap(Maybe& m1, Maybe& m2) { | |
59 using std::swap; | |
60 swap(m1.value_, m2.value_); | |
61 swap(m1.has_value_, m2.has_value_); | |
62 } | |
63 | |
64 // Conversion to bool to test if we have a value. | |
65 explicit operator bool() const { return has_value_; } | |
66 | |
67 // Dereferencing. Only allowed if we have a value. | |
68 const T* operator->() const { | |
69 RTC_DCHECK(has_value_); | |
70 return &value_; | |
71 } | |
72 T* operator->() { | |
73 RTC_DCHECK(has_value_); | |
74 return &value_; | |
75 } | |
76 const T& operator*() const { | |
77 RTC_DCHECK(has_value_); | |
78 return value_; | |
79 } | |
80 T& operator*() { | |
81 RTC_DCHECK(has_value_); | |
82 return value_; | |
83 } | |
84 | |
85 // Dereference with a default value in case we don't have a value. | |
86 const T& value_or(const T& default_val) const { | |
87 return has_value_ ? value_ : default_val; | |
88 } | |
89 | |
90 // Equality tests. Two Maybes are equal if they contain equivalent values, or | |
91 // if they're both empty. | |
92 friend bool operator==(const Maybe& m1, const Maybe& m2) { | |
93 return m1.has_value_ && m2.has_value_ ? m1.value_ == m2.value_ | |
94 : m1.has_value_ == m2.has_value_; | |
95 } | |
96 friend bool operator!=(const Maybe& m1, const Maybe& m2) { | |
97 return m1.has_value_ && m2.has_value_ ? m1.value_ != m2.value_ | |
98 : m1.has_value_ != m2.has_value_; | |
99 } | |
100 | |
101 private: | |
102 // Invariant: Unless *this has been moved from, value_ is default-initialized | |
103 // (or copied or moved from a default-initialized T) if !has_value_. | |
104 T value_; | |
105 bool has_value_; | |
106 }; | |
107 | |
108 } // namespace rtc | |
109 | |
110 #endif // WEBRTC_BASE_MAYBE_H_ | |
OLD | NEW |