Consistently have the namespace closing comment

[folly.git] / folly / detail / RangeCommon.h

diff --git a/folly/detail/RangeCommon.h b/folly/detail/RangeCommon.h
index 9e6700469cb4d2ccf40b97d5ba4d6dee4685923d..6a7e8074eb5cf163f3339ba39ac127f5670abd73 100644 (file)
--- a/folly/detail/RangeCommon.h
+++ b/folly/detail/RangeCommon.h
@@ -1,5 +1,5 @@
 /*
- * 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.
@@ -14,12 +14,13 @@
  * limitations under the License.
  */
 
-#ifndef FOLLY_DETAIL_RANGE_COMMON_H_
-#define FOLLY_DETAIL_RANGE_COMMON_H_
+#pragma once
 
 #include <algorithm>
 #include <string>
+
 #include <glog/logging.h>
+
 #include <folly/Likely.h>
 
 namespace folly {
@@ -37,38 +38,60 @@ class StringPieceLite {
  public:
   StringPieceLite(const char* b, const char* e) : b_(b), e_(e) {}
   template <typename Range>
-  /* implicit */ StringPieceLite(const Range& r) :
-      StringPieceLite(r.data(), r.data() + r.size()) {}
-  const char* data() const { return b_; }
-  const char* begin() const { return b_; }
-  const char* end() const { return e_; }
-  size_t size() const { return e_ - b_; }
-  bool empty() const { return size() == 0; }
-  const char& operator[](size_t i) const { DCHECK_GT(size(), i); return b_[i]; }
+  /* implicit */ StringPieceLite(const Range& r)
+      : StringPieceLite(r.data(), r.data() + r.size()) {}
+  const char* data() const {
+    return b_;
+  }
+  const char* begin() const {
+    return b_;
+  }
+  const char* end() const {
+    return e_;
+  }
+  size_t size() const {
+    return size_t(e_ - b_);
+  }
+  bool empty() const {
+    return size() == 0;
+  }
+  const char& operator[](size_t i) const {
+    DCHECK_GT(size(), i);
+    return b_[i];
+  }
   template <typename Range>
-  explicit operator Range() const { return Range(begin(), end()); }
+  explicit operator Range() const {
+    return Range(begin(), end());
+  }
+
  private:
   const char* b_;
   const char* e_;
 };
 
-inline size_t qfind_first_byte_of_std(const StringPieceLite haystack,
-                                      const StringPieceLite needles) {
-  auto ret = std::find_first_of(haystack.begin(), haystack.end(),
-                                needles.begin(), needles.end(),
-                                [](char a, char b) { return a == b; });
+inline size_t qfind_first_byte_of_std(
+    const StringPieceLite haystack,
+    const StringPieceLite needles) {
+  auto ret = std::find_first_of(
+      haystack.begin(),
+      haystack.end(),
+      needles.begin(),
+      needles.end(),
+      [](char a, char b) { return a == b; });
   return ret == haystack.end() ? std::string::npos : ret - haystack.begin();
 }
 
+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);
+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);
-
-inline size_t qfind_first_byte_of_nosse(const StringPieceLite haystack,
-                                        const StringPieceLite needles) {
+inline size_t qfind_first_byte_of_nosse(
+    const StringPieceLite haystack,
+    const StringPieceLite needles) {
   if (UNLIKELY(needles.empty() || haystack.empty())) {
     return std::string::npos;
   }
@@ -76,15 +99,10 @@ inline size_t qfind_first_byte_of_nosse(const StringPieceLite haystack,
   // This is not an exact science since it depends on the CPU, the size of
   // needles, and the size of haystack.
   if ((needles.size() >= 4 && haystack.size() <= 10) ||
-      (needles.size() >= 16 && haystack.size() <= 64) ||
-      needles.size() >= 32) {
+      (needles.size() >= 16 && haystack.size() <= 64) || needles.size() >= 32) {
     return qfind_first_byte_of_byteset(haystack, needles);
   }
   return qfind_first_byte_of_std(haystack, needles);
 }
-
-}
-
-}
-
-#endif
+} // namespace detail
+} // namespace folly