/*
- * Copyright 2016 Facebook, Inc.
+ * Copyright 2017 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
#include <type_traits>
#include <utility>
+#include <folly/Utility.h>
#include <folly/portability/BitsFunctexcept.h>
#include <folly/portability/Constexpr.h>
using FixedStringBase = FixedStringBase_<>;
-template <class Char, std::size_t N>
-constexpr std::size_t size(const Char (&)[N]) noexcept {
- return N - 1u;
-}
-
-template <class Char, std::size_t N>
-constexpr std::size_t size(const BasicFixedString<Char, N>& s) noexcept {
- return s.size();
-}
-
// Intentionally NOT constexpr. By making this not constexpr, we make
// checkOverflow below ill-formed in a constexpr context when the condition
// it's testing for fails. In this way, precondition violations are reported
enum class Cmp : int { LT = -1, EQ = 0, GT = 1 };
+// Rather annoyingly, GCC's -Warray-bounds warning issues false positives for
+// this code. See https://gcc.gnu.org/bugzilla/show_bug.cgi?id=61971
+#if defined(__GNUC__) && !defined(__CLANG__) && __GNUC__ <= 4
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Warray-bounds"
+#endif
+
template <class Left, class Right>
constexpr Cmp compare_(
const Left& left,
}
template <class Char, class Left, class Right>
-constexpr Char
-char_at_(const Left& left, const Right& right, std::size_t i) noexcept {
- return i < fixedstring::size(left)
+constexpr Char char_at_(
+ const Left& left,
+ std::size_t left_count,
+ const Right& right,
+ std::size_t right_count,
+ std::size_t i) noexcept {
+ return i < left_count
? left[i]
- : i < (fixedstring::size(left) + fixedstring::size(right))
- ? right[i - fixedstring::size(left)]
- : Char(0);
+ : i < (left_count + right_count) ? right[i - left_count] : Char(0);
}
template <class Char, class Left, class Right>
constexpr Char char_at_(
const Left& left,
+ std::size_t left_size,
std::size_t left_pos,
std::size_t left_count,
const Right& right,
std::size_t i) noexcept {
return i < left_pos
? left[i]
- : (i < right_count + left_pos
- ? right[i - left_pos + right_pos]
- : (i < fixedstring::size(left) - left_count + right_count
- ? left[i - right_count + left_count]
- : Char(0)));
+ : (i < right_count + left_pos ? right[i - left_pos + right_pos]
+ : (i < left_size - left_count + right_count
+ ? left[i - right_count + left_count]
+ : Char(0)));
}
template <class Left, class Right>
template <class Left, class Right>
constexpr std::size_t find_(
const Left& left,
+ std::size_t left_size,
const Right& right,
std::size_t pos,
std::size_t count) noexcept {
- return find_at_(left, right, pos, count)
- ? pos
- : fixedstring::size(left) <= pos + count
+ return find_at_(left, right, pos, count) ? pos
+ : left_size <= pos + count
? FixedStringBase::npos
- : find_(left, right, pos + 1u, count);
+ : find_(left, left_size, right, pos + 1u, count);
}
template <class Left, class Right>
template <class Left, class Right>
constexpr std::size_t find_first_of_(
const Left& left,
+ std::size_t left_size,
const Right& right,
std::size_t pos,
std::size_t count) noexcept {
- return find_one_of_at_(left[pos], right, count)
- ? pos
- : fixedstring::size(left) <= pos + 1u
+ return find_one_of_at_(left[pos], right, count) ? pos
+ : left_size <= pos + 1u
? FixedStringBase::npos
- : find_first_of_(left, right, pos + 1u, count);
+ : find_first_of_(left, left_size, right, pos + 1u, count);
}
template <class Left, class Right>
constexpr std::size_t find_first_not_of_(
const Left& left,
+ std::size_t left_size,
const Right& right,
std::size_t pos,
std::size_t count) noexcept {
- return !find_one_of_at_(left[pos], right, count)
- ? pos
- : fixedstring::size(left) <= pos + 1u
+ return !find_one_of_at_(left[pos], right, count) ? pos
+ : left_size <= pos + 1u
? FixedStringBase::npos
- : find_first_not_of_(left, right, pos + 1u, count);
+ : find_first_not_of_(left, left_size, right, pos + 1u, count);
}
template <class Left, class Right>
template <class Char, class Left, class Right, std::size_t... Is>
static constexpr BasicFixedString<Char, sizeof...(Is)> concat_(
const Left& left,
+ std::size_t left_count,
const Right& right,
- std::index_sequence<Is...> is) noexcept {
- return {left, right, is};
+ std::size_t right_count,
+ folly::index_sequence<Is...> is) noexcept {
+ return {left, left_count, right, right_count, is};
}
template <class Char, class Left, class Right, std::size_t... Is>
static constexpr BasicFixedString<Char, sizeof...(Is)> replace_(
const Left& left,
+ std::size_t left_size,
std::size_t left_pos,
std::size_t left_count,
const Right& right,
std::size_t right_pos,
std::size_t right_count,
- std::index_sequence<Is...> is) noexcept {
- return {left, left_pos, left_count, right, right_pos, right_count, is};
+ folly::index_sequence<Is...> is) noexcept {
+ return {left,
+ left_size,
+ left_pos,
+ left_count,
+ right,
+ right_pos,
+ right_count,
+ is};
+ }
+
+ template <class Char, std::size_t N>
+ static constexpr const Char (
+ &data_(const BasicFixedString<Char, N>& that) noexcept)[N + 1u] {
+ return that.data_;
}
};
+#if defined(__GNUC__) && !defined(__CLANG__) && __GNUC__ <= 4
+#pragma GCC diagnostic pop
+#endif
+
template <class T>
FOLLY_CPP14_CONSTEXPR void constexpr_swap(T& a, T& b) noexcept(
noexcept(a = T(std::move(a)))) {
* of types `FixedString<4>`, `FixedString<8>`, etc. For example:
* \par
* \code
- * using namespace folly::StringLiterals;
+ * using namespace folly::string_literals;
* constexpr auto hello = "hello"_fs8; // A FixedString<8> containing "hello"
* \endcode
* \par
* the right size. For example:
* \par
* \code
- * using namespace folly::StringLiterals;
+ * using namespace folly::string_literals;
* // NOTE: Only works on compilers with GNU extensions enabled. Clang and
* // gcc support this (-Wgnu-string-literal-operator-template):
* constexpr auto hello = "hello"_fs; // A FixedString<5> containing "hello"
Char data_[N + 1u]; // +1 for the null terminator
std::size_t size_; // Nbr of chars, not incl. null terminator. size_ <= N.
- using Indices = std::make_index_sequence<N>;
+ using Indices = folly::make_index_sequence<N>;
template <class That, std::size_t... Is>
constexpr BasicFixedString(
const That& that,
std::size_t size,
- std::index_sequence<Is...>,
+ folly::index_sequence<Is...>,
std::size_t pos = 0,
std::size_t count = npos) noexcept
: data_{(Is < (size - pos) && Is < count ? that[Is + pos] : Char(0))...,
constexpr BasicFixedString(
std::size_t count,
Char ch,
- std::index_sequence<Is...>) noexcept
+ folly::index_sequence<Is...>) noexcept
: data_{((Is < count) ? ch : Char(0))..., Char(0)}, size_{count} {}
// Concatenation constructor
template <class Left, class Right, std::size_t... Is>
constexpr BasicFixedString(
const Left& left,
+ std::size_t left_size,
const Right& right,
- std::index_sequence<Is...>) noexcept
- : data_{detail::fixedstring::char_at_<Char>(left, right, Is)..., Char(0)},
- size_{detail::fixedstring::size(left) +
- detail::fixedstring::size(right)} {}
+ std::size_t right_size,
+ folly::index_sequence<Is...>) noexcept
+ : data_{detail::fixedstring::char_at_<Char>(
+ left,
+ left_size,
+ right,
+ right_size,
+ Is)...,
+ Char(0)},
+ size_{left_size + right_size} {}
// Replace constructor
template <class Left, class Right, std::size_t... Is>
constexpr BasicFixedString(
const Left& left,
+ std::size_t left_size,
std::size_t left_pos,
std::size_t left_count,
const Right& right,
std::size_t right_pos,
std::size_t right_count,
- std::index_sequence<Is...>) noexcept
+ folly::index_sequence<Is...>) noexcept
: data_{detail::fixedstring::char_at_<Char>(
left,
+ left_size,
left_pos,
left_count,
right,
right_count,
Is)...,
Char(0)},
- size_{detail::fixedstring::size(left) - left_count + right_count} {}
+ size_{left_size - left_count + right_count} {}
public:
using size_type = std::size_t;
: BasicFixedString{
that.data_,
that.size_,
- std::make_index_sequence<(M < N ? M : N)>{},
+ folly::make_index_sequence<(M < N ? M : N)>{},
pos,
detail::fixedstring::checkOverflow(
detail::fixedstring::checkOverflowOrNpos(
constexpr /* implicit */ BasicFixedString(const Char (&that)[M]) noexcept
: BasicFixedString{detail::fixedstring::checkNullTerminated(that),
M - 1u,
- std::make_index_sequence<M - 1u>{}} {}
+ folly::make_index_sequence<M - 1u>{}} {}
/** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **
* Construct from a `const Char*` and count
count = detail::fixedstring::checkOverflowOrNpos(count, that.size_ - pos);
detail::fixedstring::checkOverflow(count, N - size_);
for (std::size_t i = 0u; i < count; ++i)
- data_[size_ + i] = that[pos + i];
+ data_[size_ + i] = that.data_[pos + i];
size_ += count;
data_[size_] = Char(0);
return *this;
std::size_t that_pos,
std::size_t that_count) const noexcept(false) {
return static_cast<int>(detail::fixedstring::compare_(
- *this,
+ data_,
detail::fixedstring::checkOverflow(this_pos, size_),
detail::fixedstring::checkOverflow(this_count, size_ - this_pos) +
this_pos,
- that,
+ that.data_,
detail::fixedstring::checkOverflow(that_pos, that.size_),
detail::fixedstring::checkOverflow(that_count, that.size_ - that_pos) +
that_pos));
const Char* that,
std::size_t that_count) const noexcept(false) {
return static_cast<int>(detail::fixedstring::compare_(
- *this,
+ data_,
detail::fixedstring::checkOverflow(this_pos, size_),
detail::fixedstring::checkOverflowOrNpos(this_count, size_ - this_pos) +
this_pos,
const Char* that,
std::size_t that_count) noexcept(false) {
return *this = detail::fixedstring::Helper::replace_<Char>(
- *this,
+ data_,
+ size_,
detail::fixedstring::checkOverflow(this_pos, size_),
detail::fixedstring::checkOverflowOrNpos(
this_count, size_ - this_pos),
std::size_t that_pos,
std::size_t that_count) const noexcept(false) {
return detail::fixedstring::Helper::replace_<Char>(
- *this,
+ data_,
+ size_,
detail::fixedstring::checkOverflow(this_pos, size_),
detail::fixedstring::checkOverflowOrNpos(this_count, size_ - this_pos),
- that,
+ that.data_,
detail::fixedstring::checkOverflow(that_pos, that.size_),
detail::fixedstring::checkOverflowOrNpos(
that_count, that.size_ - that_pos),
- std::make_index_sequence<N + M>{});
+ folly::make_index_sequence<N + M>{});
}
/**
std::size_t that_pos,
std::size_t that_count) const noexcept(false) {
return detail::fixedstring::Helper::replace_<Char>(
- *this,
+ data_,
+ size_,
detail::fixedstring::checkOverflow(this_pos, size_),
detail::fixedstring::checkOverflowOrNpos(this_count, size_ - this_pos),
detail::fixedstring::checkNullTerminated(that),
detail::fixedstring::checkOverflow(that_pos, M - 1u),
detail::fixedstring::checkOverflowOrNpos(that_count, M - 1u - that_pos),
- std::make_index_sequence<N + M - 1u>{});
+ folly::make_index_sequence<N + M - 1u>{});
}
/**
const BasicFixedString<Char, M>& that,
std::size_t pos) const noexcept(false) {
return that.size_ <= size_ - detail::fixedstring::checkOverflow(pos, size_)
- ? detail::fixedstring::find_(*this, that, pos, that.size_)
+ ? detail::fixedstring::find_(data_, size_, that.data_, pos, that.size_)
: npos;
}
std::size_t pos,
std::size_t count) const noexcept(false) {
return count <= size_ - detail::fixedstring::checkOverflow(pos, size_)
- ? detail::fixedstring::find_(*this, that, pos, count)
+ ? detail::fixedstring::find_(data_, size_, that, pos, count)
: npos;
}
using A = const Char[1u];
return 0u == size_ - detail::fixedstring::checkOverflow(pos, size_)
? npos
- : detail::fixedstring::find_(*this, A{ch}, pos, 1u);
+ : detail::fixedstring::find_(data_, size_, A{ch}, pos, 1u);
}
/** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **
std::size_t pos) const noexcept(false) {
return that.size_ <= size_
? detail::fixedstring::rfind_(
- *this,
- that,
+ data_,
+ that.data_,
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_),
size_ - that.size_),
std::size_t count) const noexcept(false) {
return count <= size_
? detail::fixedstring::rfind_(
- *this,
+ data_,
that,
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_),
return 0u == size_
? npos
: detail::fixedstring::rfind_(
- *this,
+ data_,
A{ch},
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_), size_ - 1u),
std::size_t pos) const noexcept(false) {
return size_ == detail::fixedstring::checkOverflow(pos, size_)
? npos
- : detail::fixedstring::find_first_of_(*this, that, pos, that.size_);
+ : detail::fixedstring::find_first_of_(
+ data_, size_, that.data_, pos, that.size_);
}
/**
std::size_t count) const noexcept(false) {
return size_ == detail::fixedstring::checkOverflow(pos, size_)
? npos
- : detail::fixedstring::find_first_of_(*this, that, pos, count);
+ : detail::fixedstring::find_first_of_(data_, size_, that, pos, count);
}
/**
using A = const Char[1u];
return size_ == detail::fixedstring::checkOverflow(pos, size_)
? npos
- : detail::fixedstring::find_first_of_(*this, A{ch}, pos, 1u);
+ : detail::fixedstring::find_first_of_(data_, size_, A{ch}, pos, 1u);
}
/** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **
std::size_t pos) const noexcept(false) {
return size_ == detail::fixedstring::checkOverflow(pos, size_)
? npos
- : detail::fixedstring::find_first_not_of_(*this, that, pos, that.size_);
+ : detail::fixedstring::find_first_not_of_(
+ data_, size_, that.data_, pos, that.size_);
}
/**
std::size_t count) const noexcept(false) {
return size_ == detail::fixedstring::checkOverflow(pos, size_)
? npos
- : detail::fixedstring::find_first_not_of_(*this, that, pos, count);
+ : detail::fixedstring::find_first_not_of_(
+ data_, size_, that, pos, count);
}
/**
noexcept(false) {
using A = const Char[1u];
return 1u <= size_ - detail::fixedstring::checkOverflow(pos, size_)
- ? detail::fixedstring::find_first_not_of_(*this, A{ch}, pos, 1u)
+ ? detail::fixedstring::find_first_not_of_(data_, size_, A{ch}, pos, 1u)
: npos;
}
return 0u == size_
? npos
: detail::fixedstring::find_last_of_(
- *this,
- that,
+ data_,
+ that.data_,
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_), size_ - 1u),
that.size_);
return 0u == size_
? npos
: detail::fixedstring::find_last_of_(
- *this,
+ data_,
that,
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_), size_ - 1u),
return 0u == size_
? npos
: detail::fixedstring::find_last_of_(
- *this,
+ data_,
A{ch},
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_), size_ - 1u),
return 0u == size_
? npos
: detail::fixedstring::find_last_not_of_(
- *this,
- that,
+ data_,
+ that.data_,
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_), size_ - 1u),
that.size_);
return 0u == size_
? npos
: detail::fixedstring::find_last_not_of_(
- *this,
+ data_,
that,
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_), size_ - 1u),
return 0u == size_
? npos
: detail::fixedstring::find_last_not_of_(
- *this,
+ data_,
A{ch},
folly::constexpr_min(
detail::fixedstring::checkOverflow(pos, size_), size_ - 1u),
const Char* a,
const BasicFixedString& b) noexcept {
return detail::fixedstring::equal_(
- a, folly::constexpr_strlen(a), b, b.size());
+ a, folly::constexpr_strlen(a), b.data_, b.size_);
}
/**
const BasicFixedString& b) noexcept {
return detail::fixedstring::Cmp::LT ==
detail::fixedstring::compare_(
- a, 0u, folly::constexpr_strlen(a), b, 0u, b.size_);
+ a, 0u, folly::constexpr_strlen(a), b.data_, 0u, b.size_);
}
/**
const Char* b) noexcept {
return detail::fixedstring::Cmp::LT ==
detail::fixedstring::compare_(
- a, 0u, a.size_, b, 0u, folly::constexpr_strlen(b));
+ a.data_, 0u, a.size_, b, 0u, folly::constexpr_strlen(b));
}
friend constexpr bool operator>(
const BasicFixedString& b) noexcept {
return detail::fixedstring::Helper::concat_<Char>(
detail::fixedstring::checkNullTerminated(a),
- b,
- std::make_index_sequence<N + M - 1u>{});
+ M - 1u,
+ b.data_,
+ b.size_,
+ folly::make_index_sequence<N + M - 1u>{});
}
/**
const BasicFixedString& a,
const Char (&b)[M]) noexcept {
return detail::fixedstring::Helper::concat_<Char>(
- a,
+ a.data_,
+ a.size_,
detail::fixedstring::checkNullTerminated(b),
- std::make_index_sequence<N + M - 1u>{});
+ M - 1u,
+ folly::make_index_sequence<N + M - 1u>{});
}
/**
const BasicFixedString& b) noexcept {
using A = const Char[2u];
return detail::fixedstring::Helper::concat_<Char>(
- A{a, Char(0)}, b, std::make_index_sequence<N + 1u>{});
+ A{a, Char(0)},
+ 1u,
+ b.data_,
+ b.size_,
+ folly::make_index_sequence<N + 1u>{});
}
/**
Char b) noexcept {
using A = const Char[2u];
return detail::fixedstring::Helper::concat_<Char>(
- a, A{b, Char(0)}, std::make_index_sequence<N + 1u>{});
+ a.data_,
+ a.size_,
+ A{b, Char(0)},
+ 1u,
+ folly::make_index_sequence<N + 1u>{});
}
};
constexpr bool operator==(
const BasicFixedString<Char, A>& a,
const BasicFixedString<Char, B>& b) noexcept {
- return detail::fixedstring::equal_(a, a.size(), b, b.size());
+ return detail::fixedstring::equal_(
+ detail::fixedstring::Helper::data_(a),
+ a.size(),
+ detail::fixedstring::Helper::data_(b),
+ b.size());
}
template <class Char, std::size_t A, std::size_t B>
const BasicFixedString<Char, A>& a,
const BasicFixedString<Char, B>& b) noexcept {
return detail::fixedstring::Cmp::LT ==
- detail::fixedstring::compare_(a, 0u, a.size(), b, 0u, b.size());
+ detail::fixedstring::compare_(
+ detail::fixedstring::Helper::data_(a),
+ 0u,
+ a.size(),
+ detail::fixedstring::Helper::data_(b),
+ 0u,
+ b.size());
}
template <class Char, std::size_t A, std::size_t B>
const BasicFixedString<Char, N>& a,
const BasicFixedString<Char, M>& b) noexcept {
return detail::fixedstring::Helper::concat_<Char>(
- a, b, std::make_index_sequence<N + M>{});
+ detail::fixedstring::Helper::data_(a),
+ a.size(),
+ detail::fixedstring::Helper::data_(b),
+ b.size(),
+ folly::make_index_sequence<N + M>{});
}
/** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **
a.swap(b);
}
-inline namespace Literals {
-inline namespace StringLiterals {
+inline namespace literals {
+inline namespace string_literals {
inline namespace {
// "const std::size_t&" is so that folly::npos has the same address in every
// translation unit. This is to avoid potential violations of the ODR.
* \par Example:
* \par
* \code
- * using namespace folly::StringLiterals;
+ * using namespace folly::string_literals;
* constexpr auto hello = "hello world!"_fs;
* \endcode
*
projects / folly.git / blobdiff