2013-07-24 11:41:39 +04:00
|
|
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
|
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
2012-11-13 04:37:33 +04:00
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
|
2013-07-24 11:41:39 +04:00
|
|
|
#ifndef mozilla_Range_h
|
|
|
|
#define mozilla_Range_h
|
2012-11-13 04:37:33 +04:00
|
|
|
|
|
|
|
#include "mozilla/RangedPtr.h"
|
2017-02-16 12:43:50 +03:00
|
|
|
#include "mozilla/Span.h"
|
2012-11-13 04:37:33 +04:00
|
|
|
|
|
|
|
#include <stddef.h>
|
2020-03-28 16:57:17 +03:00
|
|
|
#include <type_traits>
|
2012-11-13 04:37:33 +04:00
|
|
|
|
|
|
|
namespace mozilla {
|
|
|
|
|
|
|
|
// Range<T> is a tuple containing a pointer and a length.
|
|
|
|
template <typename T>
|
|
|
|
class Range {
|
2020-07-22 01:56:52 +03:00
|
|
|
template <typename U>
|
|
|
|
friend class Range;
|
|
|
|
|
|
|
|
// Reassignment of RangedPtrs is so (subtly) restrictive that we just make
|
|
|
|
// Range immutable.
|
2014-07-11 06:10:17 +04:00
|
|
|
const RangedPtr<T> mStart;
|
|
|
|
const RangedPtr<T> mEnd;
|
2012-11-13 04:37:33 +04:00
|
|
|
|
2014-07-11 06:10:17 +04:00
|
|
|
public:
|
|
|
|
Range() : mStart(nullptr, 0), mEnd(nullptr, 0) {}
|
|
|
|
Range(T* aPtr, size_t aLength)
|
|
|
|
: mStart(aPtr, aPtr, aPtr + aLength),
|
2020-08-20 03:33:52 +03:00
|
|
|
mEnd(aPtr + aLength, aPtr, aPtr + aLength) {
|
|
|
|
if (!aPtr) {
|
|
|
|
MOZ_ASSERT(!aLength,
|
|
|
|
"Range does not support nullptr with non-zero length.");
|
|
|
|
// ...because merely having a pointer to `nullptr + 1` is undefined
|
|
|
|
// behavior. UBSAN catches this as of clang-10.
|
|
|
|
}
|
|
|
|
}
|
2016-05-30 08:58:13 +03:00
|
|
|
Range(const RangedPtr<T>& aStart, const RangedPtr<T>& aEnd)
|
|
|
|
: mStart(aStart.get(), aStart.get(), aEnd.get()),
|
|
|
|
mEnd(aEnd.get(), aStart.get(), aEnd.get()) {
|
|
|
|
// Only accept two RangedPtrs within the same range.
|
|
|
|
aStart.checkIdenticalRange(aEnd);
|
|
|
|
MOZ_ASSERT(aStart <= aEnd);
|
|
|
|
}
|
2012-11-13 04:37:33 +04:00
|
|
|
|
2020-03-28 16:35:31 +03:00
|
|
|
template <typename U, class = std::enable_if_t<
|
|
|
|
std::is_convertible_v<U (*)[], T (*)[]>, int>>
|
2016-11-08 03:26:11 +03:00
|
|
|
MOZ_IMPLICIT Range(const Range<U>& aOther)
|
2016-11-08 02:30:34 +03:00
|
|
|
: mStart(aOther.mStart), mEnd(aOther.mEnd) {}
|
|
|
|
|
2017-02-16 12:43:50 +03:00
|
|
|
MOZ_IMPLICIT Range(Span<T> aSpan) : Range(aSpan.Elements(), aSpan.Length()) {}
|
|
|
|
|
2020-03-28 16:35:31 +03:00
|
|
|
template <typename U, class = std::enable_if_t<
|
|
|
|
std::is_convertible_v<U (*)[], T (*)[]>, int>>
|
2017-02-16 12:43:50 +03:00
|
|
|
MOZ_IMPLICIT Range(const Span<U>& aSpan)
|
|
|
|
: Range(aSpan.Elements(), aSpan.Length()) {}
|
|
|
|
|
2016-11-06 04:13:38 +03:00
|
|
|
RangedPtr<T> begin() const { return mStart; }
|
2014-07-11 06:10:17 +04:00
|
|
|
RangedPtr<T> end() const { return mEnd; }
|
|
|
|
size_t length() const { return mEnd - mStart; }
|
2012-11-13 04:37:33 +04:00
|
|
|
|
2014-07-11 06:10:17 +04:00
|
|
|
T& operator[](size_t aOffset) const { return mStart[aOffset]; }
|
2013-07-10 10:17:32 +04:00
|
|
|
|
2015-02-03 19:52:36 +03:00
|
|
|
explicit operator bool() const { return mStart != nullptr; }
|
2017-02-16 12:43:50 +03:00
|
|
|
|
|
|
|
operator Span<T>() { return Span<T>(mStart.get(), length()); }
|
|
|
|
|
|
|
|
operator Span<const T>() const { return Span<T>(mStart.get(), length()); }
|
2012-11-13 04:37:33 +04:00
|
|
|
};
|
|
|
|
|
2020-08-07 10:42:52 +03:00
|
|
|
template <typename T>
|
|
|
|
Span(Range<T>&) -> Span<T>;
|
2017-02-16 12:43:50 +03:00
|
|
|
|
2020-08-07 10:42:52 +03:00
|
|
|
template <typename T>
|
|
|
|
Span(const Range<T>&) -> Span<const T>;
|
2017-02-16 12:43:50 +03:00
|
|
|
|
2012-11-13 04:37:33 +04:00
|
|
|
} // namespace mozilla
|
|
|
|
|
2013-07-24 11:41:39 +04:00
|
|
|
#endif /* mozilla_Range_h */
|