projects
/
folly.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
logging: rename the `DEBUG` log level to `DBG`
[folly.git]
/
folly
/
detail
/
RangeCommon.cpp
diff --git
a/folly/detail/RangeCommon.cpp
b/folly/detail/RangeCommon.cpp
index 95c66dc6be3678722c5aff189dd8680515a3f242..87467b6204d3292a74393ad912a7582e94c306c7 100644
(file)
--- a/
folly/detail/RangeCommon.cpp
+++ b/
folly/detail/RangeCommon.cpp
@@
-1,5
+1,5
@@
/*
/*
- * Copyright 201
6
Facebook, Inc.
+ * Copyright 201
7
Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
@@
-17,14
+17,16
@@
#include <folly/detail/RangeCommon.h>
#include <bitset>
#include <folly/detail/RangeCommon.h>
#include <bitset>
-#include <folly/SparseByteSet.h>
+
+#include <folly/container/SparseByteSet.h>
namespace folly {
namespace detail {
namespace folly {
namespace detail {
-size_t qfind_first_byte_of_bitset(const StringPieceLite haystack,
- const StringPieceLite needles) {
+size_t qfind_first_byte_of_bitset(
+ const StringPieceLite haystack,
+ const StringPieceLite needles) {
std::bitset<256> s;
for (auto needle : needles) {
s[(uint8_t)needle] = true;
std::bitset<256> s;
for (auto needle : needles) {
s[(uint8_t)needle] = true;
@@
-37,10
+39,11
@@
size_t qfind_first_byte_of_bitset(const StringPieceLite haystack,
return std::string::npos;
}
return std::string::npos;
}
-size_t qfind_first_byte_of_byteset(const StringPieceLite haystack,
- const StringPieceLite needles) {
+size_t qfind_first_byte_of_byteset(
+ const StringPieceLite haystack,
+ const StringPieceLite needles) {
SparseByteSet s;
SparseByteSet s;
- for (auto needle: needles) {
+ for (auto needle
: needles) {
s.add(uint8_t(needle));
}
for (size_t index = 0; index < haystack.size(); ++index) {
s.add(uint8_t(needle));
}
for (size_t index = 0; index < haystack.size(); ++index) {
@@
-50,7
+53,5
@@
size_t qfind_first_byte_of_byteset(const StringPieceLite haystack,
}
return std::string::npos;
}
}
return std::string::npos;
}
-
-}
-
-}
+} // namespace detail
+} // namespace folly