1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* vim: set ts=8 sts=2 et sw=2 tw=80: */
3 /* This Source Code Form is subject to the terms of the Mozilla Public
4 * License, v. 2.0. If a copy of the MPL was not distributed with this
5 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
7 /* A class for optional values and in-place lazy construction. */
9 #ifndef mozilla_Maybe_h
10 #define mozilla_Maybe_h
13 #include <new> // for placement new
15 #include <type_traits>
18 #include "mozilla/Alignment.h"
19 #include "mozilla/Assertions.h"
20 #include "mozilla/Attributes.h"
21 #include "mozilla/MaybeStorageBase.h"
22 #include "mozilla/MemoryChecking.h"
23 #include "mozilla/OperatorNewExtensions.h"
24 #include "mozilla/Poison.h"
25 #include "mozilla/ThreadSafety.h"
27 class nsCycleCollectionTraversalCallback
;
30 inline void CycleCollectionNoteChild(
31 nsCycleCollectionTraversalCallback
& aCallback
, T
* aChild
, const char* aName
,
38 inline constexpr bool operator==(const Nothing
&, const Nothing
&) {
47 // You would think that poisoning Maybe instances could just be a call
48 // to mozWritePoison. Unfortunately, using a simple call to
49 // mozWritePoison generates poor code on MSVC for small structures. The
50 // generated code contains (always not-taken) branches and does a bunch
51 // of setup for `rep stos{l,q}`, even though we know at compile time
52 // exactly how many words we're poisoning. Instead, we're going to
53 // force MSVC to generate the code we want via recursive templates.
55 // Write the given poisonValue into p at offset*sizeof(uintptr_t).
56 template <size_t offset
>
57 inline void WritePoisonAtOffset(void* p
, const uintptr_t poisonValue
) {
58 memcpy(static_cast<char*>(p
) + offset
* sizeof(poisonValue
), &poisonValue
,
62 template <size_t Offset
, size_t NOffsets
>
63 struct InlinePoisoner
{
64 static void poison(void* p
, const uintptr_t poisonValue
) {
65 WritePoisonAtOffset
<Offset
>(p
, poisonValue
);
66 InlinePoisoner
<Offset
+ 1, NOffsets
>::poison(p
, poisonValue
);
71 struct InlinePoisoner
<N
, N
> {
72 static void poison(void*, const uintptr_t) {
77 // We can't generate inline code for large structures, though, because we'll
78 // blow out recursive template instantiation limits, and the code would be
79 // bloated to boot. So provide a fallback to the out-of-line poisoner.
80 template <size_t ObjectSize
>
81 struct OutOfLinePoisoner
{
82 static MOZ_NEVER_INLINE
void poison(void* p
, const uintptr_t) {
83 mozWritePoison(p
, ObjectSize
);
88 inline void PoisonObject(T
* p
) {
89 const uintptr_t POISON
= mozPoisonValue();
90 std::conditional_t
<(sizeof(T
) <= 8 * sizeof(POISON
)),
91 InlinePoisoner
<0, sizeof(T
) / sizeof(POISON
)>,
92 OutOfLinePoisoner
<sizeof(T
)>>::poison(p
, POISON
);
96 struct MaybePoisoner
{
97 static const size_t N
= sizeof(T
);
99 static void poison(void* aPtr
) {
100 #ifdef MOZ_DIAGNOSTIC_ASSERT_ENABLED
101 if (N
>= sizeof(uintptr_t)) {
102 PoisonObject(static_cast<std::remove_cv_t
<T
>*>(aPtr
));
105 MOZ_MAKE_MEM_UNDEFINED(aPtr
, N
);
109 template <typename T
,
110 bool TriviallyDestructibleAndCopyable
=
111 IsTriviallyDestructibleAndCopyable
<T
>,
112 bool Copyable
= std::is_copy_constructible_v
<T
>,
113 bool Movable
= std::is_move_constructible_v
<T
>>
114 class Maybe_CopyMove_Enabler
;
116 #define MOZ_MAYBE_COPY_OPS() \
117 Maybe_CopyMove_Enabler(const Maybe_CopyMove_Enabler& aOther) { \
118 if (downcast(aOther).isSome()) { \
119 downcast(*this).emplace(*downcast(aOther)); \
123 Maybe_CopyMove_Enabler& operator=(const Maybe_CopyMove_Enabler& aOther) { \
124 return downcast(*this).template operator= <T>(downcast(aOther)); \
127 #define MOZ_MAYBE_MOVE_OPS() \
128 constexpr Maybe_CopyMove_Enabler(Maybe_CopyMove_Enabler&& aOther) { \
129 if (downcast(aOther).isSome()) { \
130 downcast(*this).emplace(std::move(*downcast(aOther))); \
131 downcast(aOther).reset(); \
135 constexpr Maybe_CopyMove_Enabler& operator=( \
136 Maybe_CopyMove_Enabler&& aOther) { \
137 downcast(*this).template operator= <T>(std::move(downcast(aOther))); \
142 #define MOZ_MAYBE_DOWNCAST() \
143 static constexpr Maybe<T>& downcast(Maybe_CopyMove_Enabler& aObj) { \
144 return static_cast<Maybe<T>&>(aObj); \
146 static constexpr const Maybe<T>& downcast( \
147 const Maybe_CopyMove_Enabler& aObj) { \
148 return static_cast<const Maybe<T>&>(aObj); \
151 template <typename T
>
152 class Maybe_CopyMove_Enabler
<T
, true, true, true> {
154 Maybe_CopyMove_Enabler() = default;
156 Maybe_CopyMove_Enabler(const Maybe_CopyMove_Enabler
&) = default;
157 Maybe_CopyMove_Enabler
& operator=(const Maybe_CopyMove_Enabler
&) = default;
158 constexpr Maybe_CopyMove_Enabler(Maybe_CopyMove_Enabler
&& aOther
) {
159 downcast(aOther
).reset();
161 constexpr Maybe_CopyMove_Enabler
& operator=(Maybe_CopyMove_Enabler
&& aOther
) {
162 downcast(aOther
).reset();
170 template <typename T
>
171 class Maybe_CopyMove_Enabler
<T
, true, false, true> {
173 Maybe_CopyMove_Enabler() = default;
175 Maybe_CopyMove_Enabler(const Maybe_CopyMove_Enabler
&) = delete;
176 Maybe_CopyMove_Enabler
& operator=(const Maybe_CopyMove_Enabler
&) = delete;
177 constexpr Maybe_CopyMove_Enabler(Maybe_CopyMove_Enabler
&& aOther
) {
178 downcast(aOther
).reset();
180 constexpr Maybe_CopyMove_Enabler
& operator=(Maybe_CopyMove_Enabler
&& aOther
) {
181 downcast(aOther
).reset();
189 template <typename T
>
190 class Maybe_CopyMove_Enabler
<T
, false, true, true> {
192 Maybe_CopyMove_Enabler() = default;
201 template <typename T
>
202 class Maybe_CopyMove_Enabler
<T
, false, false, true> {
204 Maybe_CopyMove_Enabler() = default;
206 Maybe_CopyMove_Enabler(const Maybe_CopyMove_Enabler
&) = delete;
207 Maybe_CopyMove_Enabler
& operator=(const Maybe_CopyMove_Enabler
&) = delete;
214 template <typename T
>
215 class Maybe_CopyMove_Enabler
<T
, false, true, false> {
217 Maybe_CopyMove_Enabler() = default;
220 Maybe_CopyMove_Enabler(Maybe_CopyMove_Enabler
&&) = delete;
221 Maybe_CopyMove_Enabler
& operator=(Maybe_CopyMove_Enabler
&&) = delete;
227 template <typename T
, bool TriviallyDestructibleAndCopyable
>
228 class Maybe_CopyMove_Enabler
<T
, TriviallyDestructibleAndCopyable
, false,
231 Maybe_CopyMove_Enabler() = default;
233 Maybe_CopyMove_Enabler(const Maybe_CopyMove_Enabler
&) = delete;
234 Maybe_CopyMove_Enabler
& operator=(const Maybe_CopyMove_Enabler
&) = delete;
235 Maybe_CopyMove_Enabler(Maybe_CopyMove_Enabler
&&) = delete;
236 Maybe_CopyMove_Enabler
& operator=(Maybe_CopyMove_Enabler
&&) = delete;
239 #undef MOZ_MAYBE_COPY_OPS
240 #undef MOZ_MAYBE_MOVE_OPS
241 #undef MOZ_MAYBE_DOWNCAST
243 template <typename T
, bool TriviallyDestructibleAndCopyable
=
244 IsTriviallyDestructibleAndCopyable
<T
>>
247 template <typename T
>
248 struct MaybeStorage
<T
, false> : MaybeStorageBase
<T
> {
250 char mIsSome
= false; // not bool -- guarantees minimal space consumption
252 MaybeStorage() = default;
253 explicit MaybeStorage(const T
& aVal
)
254 : MaybeStorageBase
<T
>{aVal
}, mIsSome
{true} {}
255 explicit MaybeStorage(T
&& aVal
)
256 : MaybeStorageBase
<T
>{std::move(aVal
)}, mIsSome
{true} {}
258 template <typename
... Args
>
259 explicit MaybeStorage(std::in_place_t
, Args
&&... aArgs
)
260 : MaybeStorageBase
<T
>{std::in_place
, std::forward
<Args
>(aArgs
)...},
264 // Copy and move operations are no-ops, since copying is moving is implemented
265 // by Maybe_CopyMove_Enabler.
267 MaybeStorage(const MaybeStorage
&) : MaybeStorageBase
<T
>{} {}
268 MaybeStorage
& operator=(const MaybeStorage
&) { return *this; }
269 MaybeStorage(MaybeStorage
&&) : MaybeStorageBase
<T
>{} {}
270 MaybeStorage
& operator=(MaybeStorage
&&) { return *this; }
274 this->addr()->T::~T();
279 template <typename T
>
280 struct MaybeStorage
<T
, true> : MaybeStorageBase
<T
> {
282 char mIsSome
= false; // not bool -- guarantees minimal space consumption
284 constexpr MaybeStorage() = default;
285 constexpr explicit MaybeStorage(const T
& aVal
)
286 : MaybeStorageBase
<T
>{aVal
}, mIsSome
{true} {}
287 constexpr explicit MaybeStorage(T
&& aVal
)
288 : MaybeStorageBase
<T
>{std::move(aVal
)}, mIsSome
{true} {}
290 template <typename
... Args
>
291 constexpr explicit MaybeStorage(std::in_place_t
, Args
&&... aArgs
)
292 : MaybeStorageBase
<T
>{std::in_place
, std::forward
<Args
>(aArgs
)...},
296 template <typename T
>
297 struct IsMaybeImpl
: std::false_type
{};
299 template <typename T
>
300 struct IsMaybeImpl
<Maybe
<T
>> : std::true_type
{};
302 template <typename T
>
303 using IsMaybe
= IsMaybeImpl
<std::decay_t
<T
>>;
305 } // namespace detail
307 template <typename T
, typename U
= typename
std::remove_cv
<
308 typename
std::remove_reference
<T
>::type
>::type
>
309 constexpr Maybe
<U
> Some(T
&& aValue
);
312 * Maybe is a container class which contains either zero or one elements. It
313 * serves two roles. It can represent values which are *semantically* optional,
314 * augmenting a type with an explicit 'Nothing' value. In this role, it provides
315 * methods that make it easy to work with values that may be missing, along with
316 * equality and comparison operators so that Maybe values can be stored in
317 * containers. Maybe values can be constructed conveniently in expressions using
318 * type inference, as follows:
320 * void doSomething(Maybe<Foo> aFoo) {
321 * if (aFoo) // Make sure that aFoo contains a value...
322 * aFoo->takeAction(); // and then use |aFoo->| to access it.
323 * } // |*aFoo| also works!
325 * doSomething(Nothing()); // Passes a Maybe<Foo> containing no value.
326 * doSomething(Some(Foo(100))); // Passes a Maybe<Foo> containing |Foo(100)|.
328 * You'll note that it's important to check whether a Maybe contains a value
329 * before using it, using conversion to bool, |isSome()|, or |isNothing()|. You
330 * can avoid these checks, and sometimes write more readable code, using
331 * |valueOr()|, |ptrOr()|, and |refOr()|, which allow you to retrieve the value
332 * in the Maybe and provide a default for the 'Nothing' case. You can also use
333 * |apply()| to call a function only if the Maybe holds a value, and |map()| to
334 * transform the value in the Maybe, returning another Maybe with a possibly
337 * Maybe's other role is to support lazily constructing objects without using
338 * dynamic storage. A Maybe directly contains storage for a value, but it's
339 * empty by default. |emplace()|, as mentioned above, can be used to construct a
340 * value in Maybe's storage. The value a Maybe contains can be destroyed by
341 * calling |reset()|; this will happen automatically if a Maybe is destroyed
342 * while holding a value.
344 * It's a common idiom in C++ to use a pointer as a 'Maybe' type, with a null
345 * value meaning 'Nothing' and any other value meaning 'Some'. You can convert
346 * from such a pointer to a Maybe value using 'ToMaybe()'.
348 * Maybe is inspired by similar types in the standard library of many other
349 * languages (e.g. Haskell's Maybe and Rust's Option). In the C++ world it's
350 * very similar to std::optional, which was proposed for C++14 and originated in
351 * Boost. The most important differences between Maybe and std::optional are:
353 * - std::optional<T> may be compared with T. We deliberately forbid that.
354 * - std::optional has |valueOr()|, equivalent to Maybe's |valueOr()|, but
355 * lacks corresponding methods for |refOr()| and |ptrOr()|.
356 * - std::optional lacks |map()| and |apply()|, making it less suitable for
357 * functional-style code.
358 * - std::optional lacks many convenience functions that Maybe has. Most
359 * unfortunately, it lacks equivalents of the type-inferred constructor
360 * functions |Some()| and |Nothing()|.
363 class MOZ_INHERIT_TYPE_ANNOTATIONS_FROM_TEMPLATE_ARGS Maybe
364 : private detail::MaybeStorage
<T
>,
365 public detail::Maybe_CopyMove_Enabler
<T
> {
366 template <typename
, bool, bool, bool>
367 friend class detail::Maybe_CopyMove_Enabler
;
369 template <typename U
, typename V
>
370 friend constexpr Maybe
<V
> Some(U
&& aValue
);
374 template <typename U
>
375 constexpr Maybe(U
&& aValue
, SomeGuard
)
376 : detail::MaybeStorage
<T
>{std::forward
<U
>(aValue
)} {}
378 using detail::MaybeStorage
<T
>::mIsSome
;
379 using detail::MaybeStorage
<T
>::mStorage
;
381 void poisonData() { detail::MaybePoisoner
<T
>::poison(&mStorage
.val
); }
386 MOZ_ALLOW_TEMPORARY
constexpr Maybe() = default;
388 MOZ_ALLOW_TEMPORARY MOZ_IMPLICIT
constexpr Maybe(Nothing
) : Maybe
{} {}
390 template <typename
... Args
>
391 constexpr explicit Maybe(std::in_place_t
, Args
&&... aArgs
)
392 : detail::MaybeStorage
<T
>{std::in_place
, std::forward
<Args
>(aArgs
)...} {}
395 * Maybe<T> can be copy-constructed from a Maybe<U> if T is constructible from
398 template <typename U
,
399 std::enable_if_t
<std::is_constructible_v
<T
, const U
&>, bool> = true>
400 MOZ_IMPLICIT
Maybe(const Maybe
<U
>& aOther
) {
401 if (aOther
.isSome()) {
406 template <typename U
, std::enable_if_t
<!std::is_constructible_v
<T
, const U
&>,
408 explicit Maybe(const Maybe
<U
>& aOther
) = delete;
411 * Maybe<T> can be move-constructed from a Maybe<U> if T is constructible from
414 template <typename U
,
415 std::enable_if_t
<std::is_constructible_v
<T
, U
&&>, bool> = true>
416 MOZ_IMPLICIT
Maybe(Maybe
<U
>&& aOther
) {
417 if (aOther
.isSome()) {
418 emplace(std::move(*aOther
));
422 template <typename U
,
423 std::enable_if_t
<!std::is_constructible_v
<T
, U
&&>, bool> = true>
424 explicit Maybe(Maybe
<U
>&& aOther
) = delete;
426 template <typename U
,
427 std::enable_if_t
<std::is_constructible_v
<T
, const U
&>, bool> = true>
428 Maybe
& operator=(const Maybe
<U
>& aOther
) {
429 if (aOther
.isSome()) {
431 ref() = aOther
.ref();
441 template <typename U
, std::enable_if_t
<!std::is_constructible_v
<T
, const U
&>,
443 Maybe
& operator=(const Maybe
<U
>& aOther
) = delete;
445 template <typename U
,
446 std::enable_if_t
<std::is_constructible_v
<T
, U
&&>, bool> = true>
447 Maybe
& operator=(Maybe
<U
>&& aOther
) {
448 if (aOther
.isSome()) {
450 ref() = std::move(aOther
.ref());
452 emplace(std::move(*aOther
));
462 template <typename U
,
463 std::enable_if_t
<!std::is_constructible_v
<T
, U
&&>, bool> = true>
464 Maybe
& operator=(Maybe
<U
>&& aOther
) = delete;
466 constexpr Maybe
& operator=(Nothing
) {
471 /* Methods that check whether this Maybe contains a value */
472 constexpr explicit operator bool() const { return isSome(); }
473 constexpr bool isSome() const { return mIsSome
; }
474 constexpr bool isNothing() const { return !mIsSome
; }
476 /* Returns the contents of this Maybe<T> by value. Unsafe unless |isSome()|.
478 constexpr T
value() const&;
479 constexpr T
value() &&;
480 constexpr T
value() const&&;
483 * Move the contents of this Maybe<T> out of internal storage and return it
484 * without calling the destructor. The internal storage is also reset to
485 * avoid multiple calls. Unsafe unless |isSome()|.
487 constexpr T
extract() {
488 MOZ_RELEASE_ASSERT(isSome());
489 T v
= std::move(mStorage
.val
);
495 * Returns the value (possibly |Nothing()|) by moving it out of this Maybe<T>
496 * and leaving |Nothing()| in its place.
498 Maybe
<T
> take() { return std::exchange(*this, Nothing()); }
501 * Returns the contents of this Maybe<T> by value. If |isNothing()|, returns
502 * the default value provided.
504 * Note: If the value passed to aDefault is not the result of a trivial
505 * expression, but expensive to evaluate, e.g. |valueOr(ExpensiveFunction())|,
506 * use |valueOrFrom| instead, e.g.
507 * |valueOrFrom([arg] { return ExpensiveFunction(arg); })|. This ensures
508 * that the expensive expression is only evaluated when its result will
511 template <typename V
>
512 constexpr T
valueOr(V
&& aDefault
) const {
516 return std::forward
<V
>(aDefault
);
520 * Returns the contents of this Maybe<T> by value. If |isNothing()|, returns
521 * the value returned from the function or functor provided.
523 template <typename F
>
524 constexpr T
valueOrFrom(F
&& aFunc
) const {
531 /* Returns the contents of this Maybe<T> by pointer. Unsafe unless |isSome()|.
534 constexpr const T
* ptr() const;
537 * Returns the contents of this Maybe<T> by pointer. If |isNothing()|,
538 * returns the default value provided.
540 T
* ptrOr(T
* aDefault
) {
547 constexpr const T
* ptrOr(const T
* aDefault
) const {
555 * Returns the contents of this Maybe<T> by pointer. If |isNothing()|,
556 * returns the value returned from the function or functor provided.
558 template <typename F
>
559 T
* ptrOrFrom(F
&& aFunc
) {
566 template <typename F
>
567 const T
* ptrOrFrom(F
&& aFunc
) const {
574 constexpr T
* operator->();
575 constexpr const T
* operator->() const;
577 /* Returns the contents of this Maybe<T> by ref. Unsafe unless |isSome()|. */
578 constexpr T
& ref() &;
579 constexpr const T
& ref() const&;
580 constexpr T
&& ref() &&;
581 constexpr const T
&& ref() const&&;
584 * Returns the contents of this Maybe<T> by ref. If |isNothing()|, returns
585 * the default value provided.
587 constexpr T
& refOr(T
& aDefault
) {
594 constexpr const T
& refOr(const T
& aDefault
) const {
602 * Returns the contents of this Maybe<T> by ref. If |isNothing()|, returns the
603 * value returned from the function or functor provided.
605 template <typename F
>
606 constexpr T
& refOrFrom(F
&& aFunc
) {
613 template <typename F
>
614 constexpr const T
& refOrFrom(F
&& aFunc
) const {
621 constexpr T
& operator*() &;
622 constexpr const T
& operator*() const&;
623 constexpr T
&& operator*() &&;
624 constexpr const T
&& operator*() const&&;
626 /* If |isSome()|, runs the provided function or functor on the contents of
628 template <typename Func
>
629 constexpr Maybe
& apply(Func
&& aFunc
) & {
631 std::forward
<Func
>(aFunc
)(ref());
636 template <typename Func
>
637 constexpr const Maybe
& apply(Func
&& aFunc
) const& {
639 std::forward
<Func
>(aFunc
)(ref());
644 template <typename Func
>
645 constexpr Maybe
& apply(Func
&& aFunc
) && {
647 std::forward
<Func
>(aFunc
)(extract());
652 template <typename Func
>
653 constexpr Maybe
& apply(Func
&& aFunc
) const&& {
655 std::forward
<Func
>(aFunc
)(extract());
661 * If |isSome()|, runs the provided function and returns the result wrapped
662 * in a Maybe. If |isNothing()|, returns an empty Maybe value with the same
663 * value type as what the provided function would have returned.
665 template <typename Func
>
666 constexpr auto map(Func
&& aFunc
) & {
668 return Some(std::forward
<Func
>(aFunc
)(ref()));
670 return Maybe
<decltype(std::forward
<Func
>(aFunc
)(ref()))>{};
673 template <typename Func
>
674 constexpr auto map(Func
&& aFunc
) const& {
676 return Some(std::forward
<Func
>(aFunc
)(ref()));
678 return Maybe
<decltype(std::forward
<Func
>(aFunc
)(ref()))>{};
681 template <typename Func
>
682 constexpr auto map(Func
&& aFunc
) && {
684 return Some(std::forward
<Func
>(aFunc
)(extract()));
686 return Maybe
<decltype(std::forward
<Func
>(aFunc
)(extract()))>{};
689 template <typename Func
>
690 constexpr auto map(Func
&& aFunc
) const&& {
692 return Some(std::forward
<Func
>(aFunc
)(extract()));
694 return Maybe
<decltype(std::forward
<Func
>(aFunc
)(extract()))>{};
698 * If |isSome()|, runs the provided function or functor on the contents of
699 * this Maybe and returns the result. Note that the provided function or
700 * functor must return a Maybe<U> of any type U.
701 * If |isNothing()|, returns an empty Maybe value with the same type as what
702 * the provided function would have returned.
704 template <typename Func
>
705 constexpr auto andThen(Func
&& aFunc
) & {
706 static_assert(std::is_invocable_v
<Func
, T
&>);
707 using U
= std::invoke_result_t
<Func
, T
&>;
708 static_assert(detail::IsMaybe
<U
>::value
);
710 return std::invoke(std::forward
<Func
>(aFunc
), ref());
712 return std::remove_cv_t
<std::remove_reference_t
<U
>>{};
715 template <typename Func
>
716 constexpr auto andThen(Func
&& aFunc
) const& {
717 static_assert(std::is_invocable_v
<Func
, const T
&>);
718 using U
= std::invoke_result_t
<Func
, const T
&>;
719 static_assert(detail::IsMaybe
<U
>::value
);
721 return std::invoke(std::forward
<Func
>(aFunc
), ref());
723 return std::remove_cv_t
<std::remove_reference_t
<U
>>{};
726 template <typename Func
>
727 constexpr auto andThen(Func
&& aFunc
) && {
728 static_assert(std::is_invocable_v
<Func
, T
&&>);
729 using U
= std::invoke_result_t
<Func
, T
&&>;
730 static_assert(detail::IsMaybe
<U
>::value
);
732 return std::invoke(std::forward
<Func
>(aFunc
), extract());
734 return std::remove_cv_t
<std::remove_reference_t
<U
>>{};
737 template <typename Func
>
738 constexpr auto andThen(Func
&& aFunc
) const&& {
739 static_assert(std::is_invocable_v
<Func
, const T
&&>);
740 using U
= std::invoke_result_t
<Func
, const T
&&>;
741 static_assert(detail::IsMaybe
<U
>::value
);
743 return std::invoke(std::forward
<Func
>(aFunc
), extract());
745 return std::remove_cv_t
<std::remove_reference_t
<U
>>{};
749 * If |isNothing()|, runs the provided function or functor and returns its
750 * result. If |isSome()|, returns the contained value wrapped in a Maybe.
752 template <typename Func
>
753 constexpr Maybe
orElse(Func
&& aFunc
) & {
754 static_assert(std::is_invocable_v
<Func
>);
755 using U
= std::invoke_result_t
<Func
>;
757 std::is_same_v
<Maybe
, std::remove_cv_t
<std::remove_reference_t
<U
>>>);
761 return std::invoke(std::forward
<Func
>(aFunc
));
764 template <typename Func
>
765 constexpr Maybe
orElse(Func
&& aFunc
) const& {
766 static_assert(std::is_invocable_v
<Func
>);
767 using U
= std::invoke_result_t
<Func
>;
769 std::is_same_v
<Maybe
, std::remove_cv_t
<std::remove_reference_t
<U
>>>);
773 return std::invoke(std::forward
<Func
>(aFunc
));
776 template <typename Func
>
777 constexpr Maybe
orElse(Func
&& aFunc
) && {
778 static_assert(std::is_invocable_v
<Func
>);
779 using U
= std::invoke_result_t
<Func
>;
781 std::is_same_v
<Maybe
, std::remove_cv_t
<std::remove_reference_t
<U
>>>);
783 return std::move(*this);
785 return std::invoke(std::forward
<Func
>(aFunc
));
788 template <typename Func
>
789 constexpr Maybe
orElse(Func
&& aFunc
) const&& {
790 static_assert(std::is_invocable_v
<Func
>);
791 using U
= std::invoke_result_t
<Func
>;
793 std::is_same_v
<Maybe
, std::remove_cv_t
<std::remove_reference_t
<U
>>>);
795 return std::move(*this);
797 return std::invoke(std::forward
<Func
>(aFunc
));
800 /* If |isSome()|, empties this Maybe and destroys its contents. */
801 constexpr void reset() {
803 if constexpr (!std::is_trivially_destructible_v
<T
>) {
805 * Static analyzer gets confused if we have Maybe<MutexAutoLock>,
806 * so we suppress thread-safety warnings here
808 MOZ_PUSH_IGNORE_THREAD_SAFETY
810 MOZ_POP_THREAD_SAFETY
818 * Constructs a T value in-place in this empty Maybe<T>'s storage. The
819 * arguments to |emplace()| are the parameters to T's constructor.
821 template <typename
... Args
>
822 constexpr void emplace(Args
&&... aArgs
);
824 template <typename U
>
825 constexpr std::enable_if_t
<std::is_same_v
<T
, U
> &&
826 std::is_copy_constructible_v
<U
> &&
827 !std::is_move_constructible_v
<U
>>
832 friend std::ostream
& operator<<(std::ostream
& aStream
,
833 const Maybe
<T
>& aMaybe
) {
835 aStream
<< aMaybe
.ref();
837 aStream
<< "<Nothing>";
843 template <typename T
>
846 constexpr Maybe() = default;
847 constexpr MOZ_IMPLICIT
Maybe(Nothing
) {}
849 void emplace(T
& aRef
) { mValue
= &aRef
; }
851 /* Methods that check whether this Maybe contains a value */
852 constexpr explicit operator bool() const { return isSome(); }
853 constexpr bool isSome() const { return mValue
; }
854 constexpr bool isNothing() const { return !mValue
; }
857 MOZ_RELEASE_ASSERT(isSome());
861 T
* operator->() const { return &ref(); }
862 T
& operator*() const { return ref(); }
864 // Deliberately not defining value and ptr accessors, as these may be
865 // confusing on a reference-typed Maybe.
867 // XXX Should we define refOr?
869 void reset() { mValue
= nullptr; }
871 template <typename Func
>
872 const Maybe
& apply(Func
&& aFunc
) const {
874 std::forward
<Func
>(aFunc
)(ref());
879 template <typename Func
>
880 auto map(Func
&& aFunc
) const {
881 Maybe
<decltype(std::forward
<Func
>(aFunc
)(ref()))> val
;
883 val
.emplace(std::forward
<Func
>(aFunc
)(ref()));
888 template <typename Func
>
889 constexpr auto andThen(Func
&& aFunc
) const {
890 static_assert(std::is_invocable_v
<Func
, T
&>);
891 using U
= std::invoke_result_t
<Func
, T
&>;
892 static_assert(detail::IsMaybe
<U
>::value
);
894 return std::invoke(std::forward
<Func
>(aFunc
), ref());
896 return std::remove_cv_t
<std::remove_reference_t
<U
>>{};
899 template <typename Func
>
900 constexpr Maybe
orElse(Func
&& aFunc
) const {
901 static_assert(std::is_invocable_v
<Func
>);
902 using U
= std::invoke_result_t
<Func
>;
904 std::is_same_v
<Maybe
, std::remove_cv_t
<std::remove_reference_t
<U
>>>);
908 return std::invoke(std::forward
<Func
>(aFunc
));
911 bool refEquals(const Maybe
<T
&>& aOther
) const {
912 return mValue
== aOther
.mValue
;
915 bool refEquals(const T
& aOther
) const { return mValue
== &aOther
; }
921 template <typename T
>
922 constexpr T Maybe
<T
>::value() const& {
923 MOZ_RELEASE_ASSERT(isSome());
927 template <typename T
>
928 constexpr T Maybe
<T
>::value() && {
929 MOZ_RELEASE_ASSERT(isSome());
930 return std::move(ref());
933 template <typename T
>
934 constexpr T Maybe
<T
>::value() const&& {
935 MOZ_RELEASE_ASSERT(isSome());
936 return std::move(ref());
939 template <typename T
>
941 MOZ_RELEASE_ASSERT(isSome());
945 template <typename T
>
946 constexpr const T
* Maybe
<T
>::ptr() const {
947 MOZ_RELEASE_ASSERT(isSome());
951 template <typename T
>
952 constexpr T
* Maybe
<T
>::operator->() {
953 MOZ_RELEASE_ASSERT(isSome());
957 template <typename T
>
958 constexpr const T
* Maybe
<T
>::operator->() const {
959 MOZ_RELEASE_ASSERT(isSome());
963 template <typename T
>
964 constexpr T
& Maybe
<T
>::ref() & {
965 MOZ_RELEASE_ASSERT(isSome());
969 template <typename T
>
970 constexpr const T
& Maybe
<T
>::ref() const& {
971 MOZ_RELEASE_ASSERT(isSome());
975 template <typename T
>
976 constexpr T
&& Maybe
<T
>::ref() && {
977 MOZ_RELEASE_ASSERT(isSome());
978 return std::move(mStorage
.val
);
981 template <typename T
>
982 constexpr const T
&& Maybe
<T
>::ref() const&& {
983 MOZ_RELEASE_ASSERT(isSome());
984 return std::move(mStorage
.val
);
987 template <typename T
>
988 constexpr T
& Maybe
<T
>::operator*() & {
989 MOZ_RELEASE_ASSERT(isSome());
993 template <typename T
>
994 constexpr const T
& Maybe
<T
>::operator*() const& {
995 MOZ_RELEASE_ASSERT(isSome());
999 template <typename T
>
1000 constexpr T
&& Maybe
<T
>::operator*() && {
1001 MOZ_RELEASE_ASSERT(isSome());
1002 return std::move(ref());
1005 template <typename T
>
1006 constexpr const T
&& Maybe
<T
>::operator*() const&& {
1007 MOZ_RELEASE_ASSERT(isSome());
1008 return std::move(ref());
1011 template <typename T
>
1012 template <typename
... Args
>
1013 constexpr void Maybe
<T
>::emplace(Args
&&... aArgs
) {
1014 MOZ_RELEASE_ASSERT(!isSome());
1015 ::new (KnownNotNull
, &mStorage
.val
) T(std::forward
<Args
>(aArgs
)...);
1020 * Some() creates a Maybe<T> value containing the provided T value. If T has a
1021 * move constructor, it's used to make this as efficient as possible.
1023 * Some() selects the type of Maybe it returns by removing any const, volatile,
1024 * or reference qualifiers from the type of the value you pass to it. This gives
1025 * it more intuitive behavior when used in expressions, but it also means that
1026 * if you need to construct a Maybe value that holds a const, volatile, or
1027 * reference value, you need to use emplace() instead.
1029 template <typename T
, typename U
>
1030 constexpr Maybe
<U
> Some(T
&& aValue
) {
1031 return {std::forward
<T
>(aValue
), typename Maybe
<U
>::SomeGuard
{}};
1034 template <typename T
>
1035 constexpr Maybe
<T
&> SomeRef(T
& aValue
) {
1037 value
.emplace(aValue
);
1041 template <typename T
>
1042 constexpr Maybe
<T
&> ToMaybeRef(T
* const aPtr
) {
1043 return aPtr
? SomeRef(*aPtr
) : Nothing
{};
1046 template <typename T
>
1047 Maybe
<std::remove_cv_t
<std::remove_reference_t
<T
>>> ToMaybe(T
* aPtr
) {
1055 * Two Maybe<T> values are equal if
1056 * - both are Nothing, or
1057 * - both are Some, and the values they contain are equal.
1059 template <typename T
>
1060 constexpr bool operator==(const Maybe
<T
>& aLHS
, const Maybe
<T
>& aRHS
) {
1061 static_assert(!std::is_reference_v
<T
>,
1062 "operator== is not defined for Maybe<T&>, compare values or "
1063 "addresses explicitly instead");
1064 if (aLHS
.isNothing() != aRHS
.isNothing()) {
1067 return aLHS
.isNothing() || *aLHS
== *aRHS
;
1070 template <typename T
>
1071 constexpr bool operator!=(const Maybe
<T
>& aLHS
, const Maybe
<T
>& aRHS
) {
1072 return !(aLHS
== aRHS
);
1076 * We support comparison to Nothing to allow reasonable expressions like:
1077 * if (maybeValue == Nothing()) { ... }
1079 template <typename T
>
1080 constexpr bool operator==(const Maybe
<T
>& aLHS
, const Nothing
& aRHS
) {
1081 return aLHS
.isNothing();
1084 template <typename T
>
1085 constexpr bool operator!=(const Maybe
<T
>& aLHS
, const Nothing
& aRHS
) {
1086 return !(aLHS
== aRHS
);
1089 template <typename T
>
1090 constexpr bool operator==(const Nothing
& aLHS
, const Maybe
<T
>& aRHS
) {
1091 return aRHS
.isNothing();
1094 template <typename T
>
1095 constexpr bool operator!=(const Nothing
& aLHS
, const Maybe
<T
>& aRHS
) {
1096 return !(aLHS
== aRHS
);
1100 * Maybe<T> values are ordered in the same way T values are ordered, except that
1101 * Nothing comes before anything else.
1103 template <typename T
>
1104 constexpr bool operator<(const Maybe
<T
>& aLHS
, const Maybe
<T
>& aRHS
) {
1105 if (aLHS
.isNothing()) {
1106 return aRHS
.isSome();
1108 if (aRHS
.isNothing()) {
1111 return *aLHS
< *aRHS
;
1114 template <typename T
>
1115 constexpr bool operator>(const Maybe
<T
>& aLHS
, const Maybe
<T
>& aRHS
) {
1116 return !(aLHS
< aRHS
|| aLHS
== aRHS
);
1119 template <typename T
>
1120 constexpr bool operator<=(const Maybe
<T
>& aLHS
, const Maybe
<T
>& aRHS
) {
1121 return aLHS
< aRHS
|| aLHS
== aRHS
;
1124 template <typename T
>
1125 constexpr bool operator>=(const Maybe
<T
>& aLHS
, const Maybe
<T
>& aRHS
) {
1126 return !(aLHS
< aRHS
);
1129 template <typename T
>
1130 inline void ImplCycleCollectionTraverse(
1131 nsCycleCollectionTraversalCallback
& aCallback
, mozilla::Maybe
<T
>& aField
,
1132 const char* aName
, uint32_t aFlags
= 0) {
1134 ImplCycleCollectionTraverse(aCallback
, aField
.ref(), aName
, aFlags
);
1138 template <typename T
>
1139 inline void ImplCycleCollectionUnlink(mozilla::Maybe
<T
>& aField
) {
1141 ImplCycleCollectionUnlink(aField
.ref());
1145 } // namespace mozilla
1147 #endif /* mozilla_Maybe_h */