#endif
#include <folly/CpuId.h>
-#include <folly/Traits.h>
#include <folly/Likely.h>
+#include <folly/Traits.h>
#include <folly/detail/RangeCommon.h>
#include <folly/detail/RangeSse42.h>
namespace folly {
-template <class Iter> class Range;
+template <class Iter>
+class Range;
/**
* Finds the first occurrence of needle in haystack. The algorithm is on
template <
class Iter,
class Comp = std::equal_to<typename Range<Iter>::value_type>>
-inline size_t qfind(const Range<Iter> & haystack,
- const Range<Iter> & needle,
- Comp eq = Comp());
+inline size_t
+qfind(const Range<Iter>& haystack, const Range<Iter>& needle, Comp eq = Comp());
/**
* Finds the first occurrence of needle in haystack. The result is the
* needle wasn't found.
*/
template <class Iter>
-size_t qfind(const Range<Iter> & haystack,
- const typename Range<Iter>::value_type& needle);
+size_t qfind(
+ const Range<Iter>& haystack,
+ const typename Range<Iter>::value_type& needle);
/**
* Finds the last occurrence of needle in haystack. The result is the
* needle wasn't found.
*/
template <class Iter>
-size_t rfind(const Range<Iter> & haystack,
- const typename Range<Iter>::value_type& needle);
-
+size_t rfind(
+ const Range<Iter>& haystack,
+ const typename Range<Iter>::value_type& needle);
/**
* Finds the first occurrence of any element of needle in
* haystack. The algorithm is O(haystack.size() * needle.size()).
*/
template <class Iter>
-inline size_t qfind_first_of(const Range<Iter> & haystack,
- const Range<Iter> & needle);
+inline size_t qfind_first_of(
+ const Range<Iter>& haystack,
+ const Range<Iter>& needle);
/**
* Small internal helper - returns the value just before an iterator.
*/
template <class Iter>
typename std::enable_if<
- std::is_same<typename std::iterator_traits<Iter>::iterator_category,
- std::random_access_iterator_tag>::value,
- typename std::iterator_traits<Iter>::reference>::type
+ std::is_same<
+ typename std::iterator_traits<Iter>::iterator_category,
+ std::random_access_iterator_tag>::value,
+ typename std::iterator_traits<Iter>::reference>::type
value_before(Iter i) {
return i[-1];
}
*/
template <class Iter>
typename std::enable_if<
- !std::is_same<typename std::iterator_traits<Iter>::iterator_category,
- std::random_access_iterator_tag>::value,
- typename std::iterator_traits<Iter>::reference>::type
+ !std::is_same<
+ typename std::iterator_traits<Iter>::iterator_category,
+ std::random_access_iterator_tag>::value,
+ typename std::iterator_traits<Iter>::reference>::type
value_before(Iter i) {
return *--i;
}
* Use IsCharPointer<T>::type to enable const char* or char*.
* Use IsCharPointer<T>::const_type to enable only const char*.
*/
-template <class T> struct IsCharPointer {};
+template <class T>
+struct IsCharPointer {};
template <>
struct IsCharPointer<char*> {
* wouldn't.)
*/
template <class Iter>
-class Range : private boost::totally_ordered<Range<Iter> > {
+class Range : private boost::totally_ordered<Range<Iter>> {
public:
typedef std::size_t size_type;
typedef Iter iterator;
typedef Iter const_iterator;
typedef typename std::remove_reference<
- typename std::iterator_traits<Iter>::reference>::type
- value_type;
+ typename std::iterator_traits<Iter>::reference>::type value_type;
using difference_type = typename std::iterator_traits<Iter>::difference_type;
typedef typename std::iterator_traits<Iter>::reference reference;
* args which are const.
*/
typedef typename std::conditional<
- std::is_same<Iter, char*>::value
- || std::is_same<Iter, unsigned char*>::value,
- Range<const value_type*>,
- Range<Iter>>::type const_range_type;
+ std::is_same<Iter, char*>::value ||
+ std::is_same<Iter, unsigned char*>::value,
+ Range<const value_type*>,
+ Range<Iter>>::type const_range_type;
typedef std::char_traits<typename std::remove_const<value_type>::type>
- traits_type;
+ traits_type;
static const size_type npos;
// Works for all iterators
- constexpr Range() : b_(), e_() {
- }
+ constexpr Range() : b_(), e_() {}
constexpr Range(const Range&) = default;
constexpr Range(Range&&) = default;
public:
// Works for all iterators
- constexpr Range(Iter start, Iter end) : b_(start), e_(end) {
- }
+ constexpr Range(Iter start, Iter end) : b_(start), e_(end) {}
// Works only for random-access iterators
- constexpr Range(Iter start, size_t size)
- : b_(start), e_(start + size) { }
+ constexpr Range(Iter start, size_t size) : b_(start), e_(start + size) {}
-# if !__clang__ || __CLANG_PREREQ(3, 7) // Clang 3.6 crashes on this line
+#if !__clang__ || __CLANG_PREREQ(3, 7) // Clang 3.6 crashes on this line
/* implicit */ Range(std::nullptr_t) = delete;
-# endif
+#endif
template <class T = Iter, typename detail::IsCharPointer<T>::type = 0>
constexpr /* implicit */ Range(Iter str)
}
template <class T = Iter, typename detail::IsCharPointer<T>::const_type = 0>
- Range(const std::string& str,
- std::string::size_type startFrom,
- std::string::size_type size) {
+ Range(
+ const std::string& str,
+ std::string::size_type startFrom,
+ std::string::size_type size) {
if (UNLIKELY(startFrom > str.size())) {
std::__throw_out_of_range("index out of range");
}
}
}
- Range(const Range& other,
- size_type first,
- size_type length = npos)
- : Range(other.subpiece(first, length))
- { }
+ Range(const Range& other, size_type first, size_type length = npos)
+ : Range(other.subpiece(first, length)) {}
template <class T = Iter, typename detail::IsCharPointer<T>::const_type = 0>
/* implicit */ Range(const fbstring& str)
- : b_(str.data()), e_(b_ + str.size()) { }
+ : b_(str.data()), e_(b_ + str.size()) {}
template <class T = Iter, typename detail::IsCharPointer<T>::const_type = 0>
Range(const fbstring& str, fbstring::size_type startFrom) {
}
template <class T = Iter, typename detail::IsCharPointer<T>::const_type = 0>
- Range(const fbstring& str, fbstring::size_type startFrom,
- fbstring::size_type size) {
+ Range(
+ const fbstring& str,
+ fbstring::size_type startFrom,
+ fbstring::size_type size) {
if (UNLIKELY(startFrom > str.size())) {
std::__throw_out_of_range("index out of range");
}
// Range<const unsigned char*> (aka ByteRange), as they're both frequently
// used to represent ranges of bytes. Allow explicit conversion in the other
// direction.
- template <class OtherIter, typename std::enable_if<
- (std::is_same<Iter, const unsigned char*>::value &&
- (std::is_same<OtherIter, const char*>::value ||
- std::is_same<OtherIter, char*>::value)), int>::type = 0>
+ template <
+ class OtherIter,
+ typename std::enable_if<
+ (std::is_same<Iter, const unsigned char*>::value &&
+ (std::is_same<OtherIter, const char*>::value ||
+ std::is_same<OtherIter, char*>::value)),
+ int>::type = 0>
/* implicit */ Range(const Range<OtherIter>& other)
- : b_(reinterpret_cast<const unsigned char*>(other.begin())),
- e_(reinterpret_cast<const unsigned char*>(other.end())) {
- }
+ : b_(reinterpret_cast<const unsigned char*>(other.begin())),
+ e_(reinterpret_cast<const unsigned char*>(other.end())) {}
- template <class OtherIter, typename std::enable_if<
- (std::is_same<Iter, unsigned char*>::value &&
- std::is_same<OtherIter, char*>::value), int>::type = 0>
+ template <
+ class OtherIter,
+ typename std::enable_if<
+ (std::is_same<Iter, unsigned char*>::value &&
+ std::is_same<OtherIter, char*>::value),
+ int>::type = 0>
/* implicit */ Range(const Range<OtherIter>& other)
- : b_(reinterpret_cast<unsigned char*>(other.begin())),
- e_(reinterpret_cast<unsigned char*>(other.end())) {
- }
+ : b_(reinterpret_cast<unsigned char*>(other.begin())),
+ e_(reinterpret_cast<unsigned char*>(other.end())) {}
- template <class OtherIter, typename std::enable_if<
- (std::is_same<Iter, const char*>::value &&
- (std::is_same<OtherIter, const unsigned char*>::value ||
- std::is_same<OtherIter, unsigned char*>::value)), int>::type = 0>
+ template <
+ class OtherIter,
+ typename std::enable_if<
+ (std::is_same<Iter, const char*>::value &&
+ (std::is_same<OtherIter, const unsigned char*>::value ||
+ std::is_same<OtherIter, unsigned char*>::value)),
+ int>::type = 0>
explicit Range(const Range<OtherIter>& other)
- : b_(reinterpret_cast<const char*>(other.begin())),
- e_(reinterpret_cast<const char*>(other.end())) {
- }
+ : b_(reinterpret_cast<const char*>(other.begin())),
+ e_(reinterpret_cast<const char*>(other.end())) {}
- template <class OtherIter, typename std::enable_if<
- (std::is_same<Iter, char*>::value &&
- std::is_same<OtherIter, unsigned char*>::value), int>::type = 0>
+ template <
+ class OtherIter,
+ typename std::enable_if<
+ (std::is_same<Iter, char*>::value &&
+ std::is_same<OtherIter, unsigned char*>::value),
+ int>::type = 0>
explicit Range(const Range<OtherIter>& other)
- : b_(reinterpret_cast<char*>(other.begin())),
- e_(reinterpret_cast<char*>(other.end())) {
- }
+ : b_(reinterpret_cast<char*>(other.begin())),
+ e_(reinterpret_cast<char*>(other.end())) {}
// Allow implicit conversion from Range<From> to Range<To> if From is
// implicitly convertible to To.
- template <class OtherIter, typename std::enable_if<
- (!std::is_same<Iter, OtherIter>::value &&
- std::is_convertible<OtherIter, Iter>::value), int>::type = 0>
+ template <
+ class OtherIter,
+ typename std::enable_if<
+ (!std::is_same<Iter, OtherIter>::value &&
+ std::is_convertible<OtherIter, Iter>::value),
+ int>::type = 0>
constexpr /* implicit */ Range(const Range<OtherIter>& other)
- : b_(other.begin()),
- e_(other.end()) {
- }
+ : b_(other.begin()), e_(other.end()) {}
// Allow explicit conversion from Range<From> to Range<To> if From is
// explicitly convertible to To.
- template <class OtherIter, typename std::enable_if<
- (!std::is_same<Iter, OtherIter>::value &&
- !std::is_convertible<OtherIter, Iter>::value &&
- std::is_constructible<Iter, const OtherIter&>::value), int>::type = 0>
+ template <
+ class OtherIter,
+ typename std::enable_if<
+ (!std::is_same<Iter, OtherIter>::value &&
+ !std::is_convertible<OtherIter, Iter>::value &&
+ std::is_constructible<Iter, const OtherIter&>::value),
+ int>::type = 0>
constexpr explicit Range(const Range<OtherIter>& other)
- : b_(other.begin()),
- e_(other.end()) {
- }
+ : b_(other.begin()), e_(other.end()) {}
/**
* Allow explicit construction of Range() from a std::array of a
return detail::value_before(e_);
}
// Works only for Range<const char*> and Range<char*>
- std::string str() const { return std::string(b_, size()); }
- std::string toString() const { return str(); }
+ std::string str() const {
+ return std::string(b_, size());
+ }
+ std::string toString() const {
+ return str();
+ }
// Works only for Range<const char*> and Range<char*>
- fbstring fbstr() const { return fbstring(b_, size()); }
- fbstring toFbstring() const { return fbstr(); }
+ fbstring fbstr() const {
+ return fbstring(b_, size());
+ }
+ fbstring toFbstring() const {
+ return fbstr();
+ }
const_range_type castToConst() const {
return const_range_type(*this);
// We check the signed bit of the subtraction and bit shift it
// to produce either 0 or 2. The subtraction yields the
// comparison values of either -1 or 1.
- r = (static_cast<int>(
- (osize - tsize) >> (CHAR_BIT * sizeof(size_t) - 1)) << 1) - 1;
+ r = (static_cast<int>((osize - tsize) >> (CHAR_BIT * sizeof(size_t) - 1))
+ << 1) -
+ 1;
}
return r;
}
}
value_type& at(size_t i) {
- if (i >= size()) std::__throw_out_of_range("index out of range");
+ if (i >= size()) {
+ std::__throw_out_of_range("index out of range");
+ }
return b_[i];
}
const value_type& at(size_t i) const {
- if (i >= size()) std::__throw_out_of_range("index out of range");
+ if (i >= size()) {
+ std::__throw_out_of_range("index out of range");
+ }
return b_[i];
}
}
size_type find(const_range_type str, size_t pos) const {
- if (pos > size()) return std::string::npos;
+ if (pos > size()) {
+ return std::string::npos;
+ }
size_t ret = qfind(castToConst().subpiece(pos), str);
return ret == npos ? ret : ret + pos;
}
size_type find(Iter s, size_t pos, size_t n) const {
- if (pos > size()) return std::string::npos;
+ if (pos > size()) {
+ return std::string::npos;
+ }
auto forFinding = castToConst();
size_t ret = qfind(
pos ? forFinding.subpiece(pos) : forFinding, const_range_type(s, n));
// Works only for Range<(const) (unsigned) char*> which have Range(Iter) ctor
size_type find(const Iter s, size_t pos) const {
- if (pos > size()) return std::string::npos;
+ if (pos > size()) {
+ return std::string::npos;
+ }
size_type ret = qfind(castToConst().subpiece(pos), const_range_type(s));
return ret == npos ? ret : ret + pos;
}
}
size_type find(value_type c, size_t pos) const {
- if (pos > size()) return std::string::npos;
+ if (pos > size()) {
+ return std::string::npos;
+ }
size_type ret = qfind(castToConst().subpiece(pos), c);
return ret == npos ? ret : ret + pos;
}
}
size_type find_first_of(const_range_type needles, size_t pos) const {
- if (pos > size()) return std::string::npos;
+ if (pos > size()) {
+ return std::string::npos;
+ }
size_type ret = qfind_first_of(castToConst().subpiece(pos), needles);
return ret == npos ? ret : ret + pos;
}
* Does this Range start with another range?
*/
bool startsWith(const const_range_type& other) const {
- return size() >= other.size()
- && castToConst().subpiece(0, other.size()) == other;
+ return size() >= other.size() &&
+ castToConst().subpiece(0, other.size()) == other;
}
bool startsWith(value_type c) const {
return !empty() && front() == c;
* Does this Range end with another range?
*/
bool endsWith(const const_range_type& other) const {
- return size() >= other.size()
- && castToConst().subpiece(size() - other.size()) == other;
+ return size() >= other.size() &&
+ castToConst().subpiece(size() - other.size()) == other;
}
bool endsWith(value_type c) const {
return !empty() && back() == c;
* @author: Marcelo Juchem <marcelo@fb.com>
*/
template <typename TProcess, typename... Args>
- auto split_step(value_type delimiter, TProcess &&process, Args &&...args)
- -> decltype(process(std::declval<Range>(), std::forward<Args>(args)...))
- { return process(split_step(delimiter), std::forward<Args>(args)...); }
+ auto split_step(value_type delimiter, TProcess&& process, Args&&... args)
+ -> decltype(process(std::declval<Range>(), std::forward<Args>(args)...)) {
+ return process(split_step(delimiter), std::forward<Args>(args)...);
+ }
template <typename TProcess, typename... Args>
- auto split_step(Range delimiter, TProcess &&process, Args &&...args)
- -> decltype(process(std::declval<Range>(), std::forward<Args>(args)...))
- { return process(split_step(delimiter), std::forward<Args>(args)...); }
+ auto split_step(Range delimiter, TProcess&& process, Args&&... args)
+ -> decltype(process(std::declval<Range>(), std::forward<Args>(args)...)) {
+ return process(split_step(delimiter), std::forward<Args>(args)...);
+ }
private:
Iter b_, e_;
template <class A, class B>
struct ComparableAsStringPiece {
enum {
- value =
- (std::is_convertible<A, StringPiece>::value
- && std::is_same<B, StringPiece>::value)
- ||
- (std::is_convertible<B, StringPiece>::value
- && std::is_same<A, StringPiece>::value)
+ value = (std::is_convertible<A, StringPiece>::value &&
+ std::is_same<B, StringPiece>::value) ||
+ (std::is_convertible<B, StringPiece>::value &&
+ std::is_same<A, StringPiece>::value)
};
};
* operator== through conversion for Range<const char*>
*/
template <class T, class U>
-typename
-std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>::type
+_t<std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>>
operator==(const T& lhs, const U& rhs) {
return StringPiece(lhs) == StringPiece(rhs);
}
* operator< through conversion for Range<const char*>
*/
template <class T, class U>
-typename
-std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>::type
+_t<std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>>
operator<(const T& lhs, const U& rhs) {
return StringPiece(lhs) < StringPiece(rhs);
}
* operator> through conversion for Range<const char*>
*/
template <class T, class U>
-typename
-std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>::type
+_t<std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>>
operator>(const T& lhs, const U& rhs) {
return StringPiece(lhs) > StringPiece(rhs);
}
* operator< through conversion for Range<const char*>
*/
template <class T, class U>
-typename
-std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>::type
+_t<std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>>
operator<=(const T& lhs, const U& rhs) {
return StringPiece(lhs) <= StringPiece(rhs);
}
* operator> through conversion for Range<const char*>
*/
template <class T, class U>
-typename
-std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>::type
+_t<std::enable_if<detail::ComparableAsStringPiece<T, U>::value, bool>>
operator>=(const T& lhs, const U& rhs) {
return StringPiece(lhs) >= StringPiece(rhs);
}
* Finds substrings faster than brute force by borrowing from Boyer-Moore
*/
template <class Iter, class Comp>
-size_t qfind(const Range<Iter>& haystack,
- const Range<Iter>& needle,
- Comp eq) {
+size_t qfind(const Range<Iter>& haystack, const Range<Iter>& needle, Comp eq) {
// Don't use std::search, use a Boyer-Moore-like trick by comparing
// the last characters first
auto const nsize = needle.size();
if (haystack.size() < nsize) {
return std::string::npos;
}
- if (!nsize) return 0;
+ if (!nsize) {
+ return 0;
+ }
auto const nsize_1 = nsize - 1;
auto const lastNeedle = needle[nsize_1];
}
// Here we know that the last char matches
// Continue in pedestrian mode
- for (size_t j = 0; ; ) {
+ for (size_t j = 0;;) {
assert(j < nsize);
if (!eq(i[j], needle[j])) {
// Not found, we can skip
namespace detail {
-inline size_t qfind_first_byte_of(const StringPiece haystack,
- const StringPiece needles) {
- static auto const qfind_first_byte_of_fn =
- folly::CpuId().sse42() ? qfind_first_byte_of_sse42
- : qfind_first_byte_of_nosse;
+inline size_t qfind_first_byte_of(
+ const StringPiece haystack,
+ const StringPiece needles) {
+ static auto const qfind_first_byte_of_fn = folly::CpuId().sse42()
+ ? qfind_first_byte_of_sse42
+ : qfind_first_byte_of_nosse;
return qfind_first_byte_of_fn(haystack, needles);
}
} // namespace detail
template <class Iter, class Comp>
-size_t qfind_first_of(const Range<Iter> & haystack,
- const Range<Iter> & needles,
- Comp eq) {
- auto ret = std::find_first_of(haystack.begin(), haystack.end(),
- needles.begin(), needles.end(),
- eq);
+size_t qfind_first_of(
+ const Range<Iter>& haystack,
+ const Range<Iter>& needles,
+ Comp eq) {
+ auto ret = std::find_first_of(
+ haystack.begin(), haystack.end(), needles.begin(), needles.end(), eq);
return ret == haystack.end() ? std::string::npos : ret - haystack.begin();
}
struct AsciiCaseInsensitive {
bool operator()(char lhs, char rhs) const {
char k = lhs ^ rhs;
- if (k == 0) return true;
- if (k != 32) return false;
+ if (k == 0) {
+ return true;
+ }
+ if (k != 32) {
+ return false;
+ }
k = lhs | rhs;
return (k >= 'a' && k <= 'z');
}
};
template <class Iter>
-size_t qfind(const Range<Iter>& haystack,
- const typename Range<Iter>::value_type& needle) {
+size_t qfind(
+ const Range<Iter>& haystack,
+ const typename Range<Iter>::value_type& needle) {
auto pos = std::find(haystack.begin(), haystack.end(), needle);
return pos == haystack.end() ? std::string::npos : pos - haystack.data();
}
template <class Iter>
-size_t rfind(const Range<Iter>& haystack,
- const typename Range<Iter>::value_type& needle) {
- for (auto i = haystack.size(); i-- > 0; ) {
+size_t rfind(
+ const Range<Iter>& haystack,
+ const typename Range<Iter>::value_type& needle) {
+ for (auto i = haystack.size(); i-- > 0;) {
if (haystack[i] == needle) {
return i;
}
return std::string::npos;
}
auto pos = static_cast<const char*>(
- ::memchr(haystack.data(), needle, haystack.size()));
+ ::memchr(haystack.data(), needle, haystack.size()));
return pos == nullptr ? std::string::npos : pos - haystack.data();
}
return std::string::npos;
}
auto pos = static_cast<const char*>(
- ::memrchr(haystack.data(), needle, haystack.size()));
+ ::memrchr(haystack.data(), needle, haystack.size()));
return pos == nullptr ? std::string::npos : pos - haystack.data();
}
// specialization for ByteRange
template <>
-inline size_t qfind(const Range<const unsigned char*>& haystack,
- const unsigned char& needle) {
+inline size_t qfind(
+ const Range<const unsigned char*>& haystack,
+ const unsigned char& needle) {
// memchr expects a not-null pointer, early return if the range is empty.
if (haystack.empty()) {
return std::string::npos;
}
auto pos = static_cast<const unsigned char*>(
- ::memchr(haystack.data(), needle, haystack.size()));
+ ::memchr(haystack.data(), needle, haystack.size()));
return pos == nullptr ? std::string::npos : pos - haystack.data();
}
template <>
-inline size_t rfind(const Range<const unsigned char*>& haystack,
- const unsigned char& needle) {
+inline size_t rfind(
+ const Range<const unsigned char*>& haystack,
+ const unsigned char& needle) {
// memchr expects a not-null pointer, early return if the range is empty.
if (haystack.empty()) {
return std::string::npos;
}
auto pos = static_cast<const unsigned char*>(
- ::memrchr(haystack.data(), needle, haystack.size()));
+ ::memrchr(haystack.data(), needle, haystack.size()));
return pos == nullptr ? std::string::npos : pos - haystack.data();
}
template <class Iter>
-size_t qfind_first_of(const Range<Iter>& haystack,
- const Range<Iter>& needles) {
+size_t qfind_first_of(const Range<Iter>& haystack, const Range<Iter>& needles) {
return qfind_first_of(haystack, needles, AsciiCaseSensitive());
}
// specialization for StringPiece
template <>
-inline size_t qfind_first_of(const Range<const char*>& haystack,
- const Range<const char*>& needles) {
+inline size_t qfind_first_of(
+ const Range<const char*>& haystack,
+ const Range<const char*>& needles) {
return detail::qfind_first_byte_of(haystack, needles);
}
// specialization for ByteRange
template <>
-inline size_t qfind_first_of(const Range<const unsigned char*>& haystack,
- const Range<const unsigned char*>& needles) {
- return detail::qfind_first_byte_of(StringPiece(haystack),
- StringPiece(needles));
+inline size_t qfind_first_of(
+ const Range<const unsigned char*>& haystack,
+ const Range<const unsigned char*>& needles) {
+ return detail::qfind_first_byte_of(
+ StringPiece(haystack), StringPiece(needles));
}
template <class Key, class Enable>
struct hasher;
template <class T>
-struct hasher<folly::Range<T*>,
- typename std::enable_if<std::is_pod<T>::value, void>::type> {
+struct hasher<
+ folly::Range<T*>,
+ typename std::enable_if<std::is_pod<T>::value, void>::type> {
size_t operator()(folly::Range<T*> r) const {
return hash::SpookyHashV2::Hash64(r.begin(), r.size() * sizeof(T), 0);
}
/**
* Ubiquitous helper template for knowing what's a string
*/
-template <class T> struct IsSomeString {
- enum { value = std::is_same<T, std::string>::value
- || std::is_same<T, fbstring>::value };
+template <class T>
+struct IsSomeString {
+ enum {
+ value =
+ std::is_same<T, std::string>::value || std::is_same<T, fbstring>::value
+ };
};
-} // !namespace folly
+} // namespace folly
FOLLY_POP_WARNING
#if !FOLLY_SSE_PREREQ(4, 2)
namespace folly {
namespace detail {
-size_t qfind_first_byte_of_sse42(const StringPieceLite haystack,
- const StringPieceLite needles) {
+size_t qfind_first_byte_of_sse42(
+ const StringPieceLite haystack,
+ const StringPieceLite needles) {
return qfind_first_byte_of_nosse(haystack, needles);
}
}
}
-# else
+#else
#include <cstdint>
#include <limits>
#include <string>
// a function with always_inline fails to build. The _mm_* functions are marked
// always_inline.
// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=67368
-#if defined FOLLY_SANITIZE_ADDRESS && \
- FOLLY_SANITIZE_ADDRESS == 1 && \
+#if defined FOLLY_SANITIZE_ADDRESS && FOLLY_SANITIZE_ADDRESS == 1 && \
__GNUC_PREREQ(4, 9)
-# define _mm_load_si128(p) (*(p))
-# define _mm_loadu_si128(p) ((__m128i)__builtin_ia32_loaddqu((const char*)(p)))
-# ifdef _mm_cmpestri
-# undef _mm_cmpestri
-# endif
-# define _mm_cmpestri(a, b, c, d, e) \
+#define _mm_load_si128(p) (*(p))
+#define _mm_loadu_si128(p) ((__m128i)__builtin_ia32_loaddqu((const char*)(p)))
+#ifdef _mm_cmpestri
+#undef _mm_cmpestri
+#endif
+#define _mm_cmpestri(a, b, c, d, e) \
__builtin_ia32_pcmpestri128((__v16qi)(a), b, (__v16qi)(c), d, e)
#endif
// It's okay if pages are bigger than this (as powers of two), but they should
// not be smaller.
static constexpr size_t kMinPageSize = 4096;
-static_assert(kMinPageSize >= 16,
- "kMinPageSize must be at least SSE register size");
+static_assert(
+ kMinPageSize >= 16,
+ "kMinPageSize must be at least SSE register size");
template <typename T>
static inline uintptr_t page_for(T* addr) {
}
static inline size_t nextAlignedIndex(const char* arr) {
- auto firstPossible = reinterpret_cast<uintptr_t>(arr) + 1;
- return 1 + // add 1 because the index starts at 'arr'
- ((firstPossible + 15) & ~0xF) // round up to next multiple of 16
- - firstPossible;
+ auto firstPossible = reinterpret_cast<uintptr_t>(arr) + 1;
+ return 1 + // add 1 because the index starts at 'arr'
+ ((firstPossible + 15) & ~0xF) // round up to next multiple of 16
+ - firstPossible;
}
-static size_t qfind_first_byte_of_needles16(const StringPieceLite haystack,
- const StringPieceLite needles)
- FOLLY_DISABLE_ADDRESS_SANITIZER;
+static size_t qfind_first_byte_of_needles16(
+ const StringPieceLite haystack,
+ const StringPieceLite needles) FOLLY_DISABLE_ADDRESS_SANITIZER;
// helper method for case where needles.size() <= 16
-size_t qfind_first_byte_of_needles16(const StringPieceLite haystack,
- const StringPieceLite needles) {
+size_t qfind_first_byte_of_needles16(
+ const StringPieceLite haystack,
+ const StringPieceLite needles) {
DCHECK_GT(haystack.size(), 0u);
DCHECK_GT(needles.size(), 0u);
DCHECK_LE(needles.size(), 16u);
return detail::qfind_first_byte_of_nosse(haystack, needles);
}
- auto arr2 = _mm_loadu_si128(
- reinterpret_cast<const __m128i*>(needles.data()));
+ auto arr2 = _mm_loadu_si128(reinterpret_cast<const __m128i*>(needles.data()));
// do an unaligned load for first block of haystack
- auto arr1 = _mm_loadu_si128(
- reinterpret_cast<const __m128i*>(haystack.data()));
+ auto arr1 =
+ _mm_loadu_si128(reinterpret_cast<const __m128i*>(haystack.data()));
auto index =
_mm_cmpestri(arr2, int(needles.size()), arr1, int(haystack.size()), 0);
if (index < 16) {
// Now, we can do aligned loads hereafter...
size_t i = nextAlignedIndex(haystack.data());
- for (; i < haystack.size(); i+= 16) {
+ for (; i < haystack.size(); i += 16) {
arr1 =
_mm_load_si128(reinterpret_cast<const __m128i*>(haystack.data() + i));
index = _mm_cmpestri(
}
template <bool HAYSTACK_ALIGNED>
-size_t scanHaystackBlock(const StringPieceLite haystack,
- const StringPieceLite needles,
- uint64_t idx)
-// Turn off ASAN because the "arr2 = ..." assignment in the loop below reads
-// up to 15 bytes beyond end of the buffer in #needles#. That is ok because
-// ptr2 is always 16-byte aligned, so the read can never span a page boundary.
-// Also, the extra data that may be read is never actually used.
- FOLLY_DISABLE_ADDRESS_SANITIZER;
+size_t scanHaystackBlock(
+ const StringPieceLite haystack,
+ const StringPieceLite needles,
+ uint64_t idx)
+ // Turn off ASAN because the "arr2 = ..." assignment in the loop below reads
+ // up to 15 bytes beyond end of the buffer in #needles#. That is ok because
+ // ptr2 is always 16-byte aligned, so the read can never span a page
+ // boundary. Also, the extra data that may be read is never actually used.
+ FOLLY_DISABLE_ADDRESS_SANITIZER;
// Scans a 16-byte block of haystack (starting at blockStartIdx) to find first
// needle. If HAYSTACK_ALIGNED, then haystack must be 16byte aligned.
// If !HAYSTACK_ALIGNED, then caller must ensure that it is safe to load the
// block.
template <bool HAYSTACK_ALIGNED>
-size_t scanHaystackBlock(const StringPieceLite haystack,
- const StringPieceLite needles,
- uint64_t blockStartIdx) {
+size_t scanHaystackBlock(
+ const StringPieceLite haystack,
+ const StringPieceLite needles,
+ uint64_t blockStartIdx) {
DCHECK_GT(needles.size(), 16u); // should handled by *needles16() method
- DCHECK(blockStartIdx + 16 <= haystack.size() ||
- (page_for(haystack.data() + blockStartIdx) ==
- page_for(haystack.data() + blockStartIdx + 15)));
+ DCHECK(
+ blockStartIdx + 16 <= haystack.size() ||
+ (page_for(haystack.data() + blockStartIdx) ==
+ page_for(haystack.data() + blockStartIdx + 15)));
__m128i arr1;
if (HAYSTACK_ALIGNED) {
}
// This load is safe because needles.size() >= 16
- auto arr2 = _mm_loadu_si128(
- reinterpret_cast<const __m128i*>(needles.data()));
+ auto arr2 = _mm_loadu_si128(reinterpret_cast<const __m128i*>(needles.data()));
auto b =
_mm_cmpestri(arr2, 16, arr1, int(haystack.size() - blockStartIdx), 0);
size_t j = nextAlignedIndex(needles.data());
for (; j < needles.size(); j += 16) {
- arr2 = _mm_load_si128(
- reinterpret_cast<const __m128i*>(needles.data() + j));
+ arr2 = _mm_load_si128(reinterpret_cast<const __m128i*>(needles.data() + j));
auto index = _mm_cmpestri(
arr2,
return std::string::npos;
}
-size_t qfind_first_byte_of_sse42(const StringPieceLite haystack,
- const StringPieceLite needles);
+size_t qfind_first_byte_of_sse42(
+ const StringPieceLite haystack,
+ const StringPieceLite needles);
-size_t qfind_first_byte_of_sse42(const StringPieceLite haystack,
- const StringPieceLite needles) {
+size_t qfind_first_byte_of_sse42(
+ const StringPieceLite haystack,
+ const StringPieceLite needles) {
if (UNLIKELY(needles.empty() || haystack.empty())) {
return std::string::npos;
} else if (needles.size() <= 16) {
// we expect the compiler to optimize things so that there's only one copy
// of the string literal "foo", even though we've got it in multiple places
- EXPECT_EQ(foo, foo2); // remember, this uses ==, not strcmp, so it's a ptr
- // comparison rather than lexical
+ EXPECT_EQ(foo, foo2); // remember, this uses ==, not strcmp, so it's a ptr
+ // comparison rather than lexical
// the string object creates copies though, so the c_str of these should be
// distinct
StringPiece s(foo);
EXPECT_EQ(s.size(), 3);
- EXPECT_EQ(s.start(), foo); // ptr comparison
- EXPECT_NE(s.start(), fooStr.c_str()); // ptr comparison
- EXPECT_NE(s.start(), foo2Str.c_str()); // ptr comparison
+ EXPECT_EQ(s.start(), foo); // ptr comparison
+ EXPECT_NE(s.start(), fooStr.c_str()); // ptr comparison
+ EXPECT_NE(s.start(), foo2Str.c_str()); // ptr comparison
- EXPECT_EQ(s.toString(), foo); // lexical comparison
- EXPECT_EQ(s.toString(), fooStr.c_str()); // lexical comparison
- EXPECT_EQ(s.toString(), foo2Str.c_str()); // lexical comparison
+ EXPECT_EQ(s.toString(), foo); // lexical comparison
+ EXPECT_EQ(s.toString(), fooStr.c_str()); // lexical comparison
+ EXPECT_EQ(s.toString(), foo2Str.c_str()); // lexical comparison
- EXPECT_EQ(s, foo); // lexical comparison
- EXPECT_EQ(s, fooStr); // lexical comparison
- EXPECT_EQ(s, foo2Str); // lexical comparison
+ EXPECT_EQ(s, foo); // lexical comparison
+ EXPECT_EQ(s, fooStr); // lexical comparison
+ EXPECT_EQ(s, foo2Str); // lexical comparison
EXPECT_EQ(foo, s);
// check using StringPiece to reference substrings
EXPECT_EQ(s.find("ba", 4), 6);
EXPECT_EQ(s.find("notfound"), StringPiece::npos);
EXPECT_EQ(s.find("notfound", 1), StringPiece::npos);
- EXPECT_EQ(s.find("bar", 4), StringPiece::npos); // starting position too far
+ EXPECT_EQ(s.find("bar", 4), StringPiece::npos); // starting position too far
// starting pos that is obviously past the end -- This works for std::string
EXPECT_EQ(s.toString().find("notfound", 55), StringPiece::npos);
EXPECT_EQ(s.find("z", s.size()), StringPiece::npos);
EXPECT_EQ(s.find('o', 2), 2);
EXPECT_EQ(s.find('y'), StringPiece::npos);
EXPECT_EQ(s.find('y', 1), StringPiece::npos);
- EXPECT_EQ(s.find('o', 4), StringPiece::npos); // starting position too far
+ EXPECT_EQ(s.find('o', 4), StringPiece::npos); // starting position too far
EXPECT_TRUE(s.contains('z'));
// starting pos that is obviously past the end -- This works for std::string
EXPECT_EQ(s.toString().find('y', 55), StringPiece::npos);
TEST(StringPiece, ToByteRange) {
StringPiece a("hello");
ByteRange b(a);
- EXPECT_EQ(static_cast<const void*>(a.begin()),
- static_cast<const void*>(b.begin()));
- EXPECT_EQ(static_cast<const void*>(a.end()),
- static_cast<const void*>(b.end()));
+ EXPECT_EQ(
+ static_cast<const void*>(a.begin()), static_cast<const void*>(b.begin()));
+ EXPECT_EQ(
+ static_cast<const void*>(a.end()), static_cast<const void*>(b.end()));
// and convert back again
StringPiece c(b);
EXPECT_EQ(s, p);
EXPECT_EQ(1, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 5), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("this", x);
- return 1;
- })));
+ EXPECT_EQ(std::next(s, 5), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("this", x);
+ return 1;
+ })));
EXPECT_EQ(2, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 8), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("is", x);
- return 2;
- })));
+ EXPECT_EQ(std::next(s, 8), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("is", x);
+ return 2;
+ })));
EXPECT_EQ(3, (p.split_step('u', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 10), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("j", x);
- return 3;
- })));
+ EXPECT_EQ(std::next(s, 10), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("j", x);
+ return 3;
+ })));
EXPECT_EQ(4, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 13), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("st", x);
- return 4;
- })));
+ EXPECT_EQ(std::next(s, 13), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("st", x);
+ return 4;
+ })));
EXPECT_EQ(5, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 14), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 5;
- })));
+ EXPECT_EQ(std::next(s, 14), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 5;
+ })));
EXPECT_EQ(6, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 16), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("a", x);
- return 6;
- })));
+ EXPECT_EQ(std::next(s, 16), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("a", x);
+ return 6;
+ })));
EXPECT_EQ(7, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 21), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("test", x);
- return 7;
- })));
+ EXPECT_EQ(std::next(s, 21), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("test", x);
+ return 7;
+ })));
EXPECT_EQ(8, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("string", x);
- return 8;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("string", x);
+ return 8;
+ })));
EXPECT_EQ(9, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 9;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 9;
+ })));
- EXPECT_TRUE((std::is_same<
- void,
- decltype(p.split_step(' ', split_step_with_process_noop))
- >::value));
+ EXPECT_TRUE(
+ (std::is_same<
+ void,
+ decltype(p.split_step(' ', split_step_with_process_noop))>::value));
EXPECT_NO_THROW(p.split_step(' ', split_step_with_process_noop));
}
EXPECT_EQ(s, p);
EXPECT_EQ(1, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 6), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("this", x);
- return 1;
- })));
+ EXPECT_EQ(std::next(s, 6), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("this", x);
+ return 1;
+ })));
EXPECT_EQ(2, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 10), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("is", x);
- return 2;
- })));
+ EXPECT_EQ(std::next(s, 10), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("is", x);
+ return 2;
+ })));
EXPECT_EQ(3, (p.split_step("u", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 12), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("j", x);
- return 3;
- })));
+ EXPECT_EQ(std::next(s, 12), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("j", x);
+ return 3;
+ })));
EXPECT_EQ(4, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 16), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("st", x);
- return 4;
- })));
+ EXPECT_EQ(std::next(s, 16), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("st", x);
+ return 4;
+ })));
EXPECT_EQ(5, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 18), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 5;
- })));
+ EXPECT_EQ(std::next(s, 18), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 5;
+ })));
EXPECT_EQ(6, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 21), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("a", x);
- return 6;
- })));
+ EXPECT_EQ(std::next(s, 21), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("a", x);
+ return 6;
+ })));
EXPECT_EQ(7, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 28), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ(" test", x);
- return 7;
- })));
+ EXPECT_EQ(std::next(s, 28), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ(" test", x);
+ return 7;
+ })));
EXPECT_EQ(8, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("string", x);
- return 8;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("string", x);
+ return 8;
+ })));
EXPECT_EQ(9, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 9;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 9;
+ })));
EXPECT_EQ(10, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 10;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 10;
+ })));
- EXPECT_TRUE((std::is_same<
- void,
- decltype(p.split_step(' ', split_step_with_process_noop))
- >::value));
+ EXPECT_TRUE(
+ (std::is_same<
+ void,
+ decltype(p.split_step(' ', split_step_with_process_noop))>::value));
EXPECT_NO_THROW(p.split_step(' ', split_step_with_process_noop));
}
EXPECT_EQ(e, p.end());
EXPECT_EQ(s, p);
- auto const functor = [](
- folly::StringPiece s,
- folly::StringPiece expected
- ) {
+ auto const functor = [](folly::StringPiece s, folly::StringPiece expected) {
EXPECT_EQ(expected, s);
return expected;
};
EXPECT_EQ(e, p.end());
EXPECT_EQ(s, p);
- auto const functor = [](
- folly::StringPiece s,
- folly::StringPiece expected
- ) {
+ auto const functor = [](folly::StringPiece s, folly::StringPiece expected) {
EXPECT_EQ(expected, s);
return expected;
};
TEST(StringPiece, NoInvalidImplicitConversions) {
struct IsString {
- bool operator()(folly::Range<int*>) { return false; }
- bool operator()(folly::StringPiece) { return true; }
+ bool operator()(folly::Range<int*>) {
+ return false;
+ }
+ bool operator()(folly::StringPiece) {
+ return true;
+ }
};
std::string s = "hello";
}
};
-typedef ::testing::Types<SseNeedleFinder,
- NoSseNeedleFinder,
- ByteSetNeedleFinder> NeedleFinders;
+using NeedleFinders =
+ ::testing::Types<SseNeedleFinder, NoSseNeedleFinder, ByteSetNeedleFinder>;
TYPED_TEST_CASE(NeedleFinderTest, NeedleFinders);
TYPED_TEST(NeedleFinderTest, Null) {
// string(s1.data(), s1.size()).c_str(), s1.size(),
// string(s2.data(), s2.size()).c_str(), s2.size());
auto r1 = this->find_first_byte_of(s1, s2);
- auto f1 = std::find_first_of(s1.begin(), s1.end(),
- s2.begin(), s2.end());
+ auto f1 =
+ std::find_first_of(s1.begin(), s1.end(), s2.begin(), s2.end());
auto e1 = (f1 == s1.end()) ? StringPiece::npos : f1 - s1.begin();
EXPECT_EQ(r1, e1);
auto r2 = this->find_first_byte_of(s2, s1);
- auto f2 = std::find_first_of(s2.begin(), s2.end(),
- s1.begin(), s1.end());
+ auto f2 =
+ std::find_first_of(s2.begin(), s2.end(), s1.begin(), s1.end());
auto e2 = (f2 == s2.end()) ? StringPiece::npos : f2 - s2.begin();
EXPECT_EQ(r2, e2);
freeProtectedBuf(buf1);
}
TEST(RangeFunc, CArray) {
- int x[] {1, 2, 3, 4};
+ int x[]{1, 2, 3, 4};
testRangeFunc(x, 4);
}
EXPECT_EQ(2, numCollRangeSize);
}
-std::string get_rand_str(size_t size,
- std::uniform_int_distribution<>& dist,
- std::mt19937& gen) {
+std::string get_rand_str(
+ size_t size,
+ std::uniform_int_distribution<>& dist,
+ std::mt19937& gen) {
std::string ret(size, '\0');
for (size_t i = 0; i < size; ++i) {
ret[i] = static_cast<char>(dist(gen));
std::mt19937 gen(rd());
std::uniform_int_distribution<> dist('a', 'z');
- for (int i=0; i < 100; ++i) {
+ for (int i = 0; i < 100; ++i) {
for (size_t j = 1; j <= msp.size(); ++j) {
auto replacement = get_rand_str(j, dist, gen);
for (size_t pos = 0; pos < msp.size() - j; ++pos) {
std::mt19937 gen(rd());
std::uniform_int_distribution<> dist('A', 'Z');
- for (int i=0; i < 100; ++i) {
+ for (int i = 0; i < 100; ++i) {
for (size_t j = 1; j <= orig.size(); ++j) {
auto replacement = get_rand_str(j, dist, gen);
for (size_t pos = 0; pos < msp.size() - j; ++pos) {
auto fst = "longer";
auto snd = "small";
char input[] = "meh meh meh";
- auto all = MutableStringPiece(input);
+ auto all = MutableStringPiece(input);
try {
all.replaceAll(fst, snd);
projects / folly.git / commitdiff