You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@trafficserver.apache.org by ma...@apache.org on 2017/08/15 07:36:54 UTC

[trafficserver] 02/02: clang-format

This is an automated email from the ASF dual-hosted git repository.

maskit pushed a commit to branch quic-latest
in repository https://gitbox.apache.org/repos/asf/trafficserver.git

commit 39356833845830c0f6901af61dbacd3885cd5cc9
Author: Masakazu Kitajo <ma...@apache.org>
AuthorDate: Tue Aug 15 16:36:23 2017 +0900

    clang-format
---
 lib/records/I_RecHttp.h | 2 +-
 lib/ts/Vec.h            | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/lib/records/I_RecHttp.h b/lib/records/I_RecHttp.h
index 8fa2c69..066486a 100644
--- a/lib/records/I_RecHttp.h
+++ b/lib/records/I_RecHttp.h
@@ -305,7 +305,7 @@ public:
   /// Check for QUIC ports.
   /// @return @c true if any port in @a ports is an QUIC port.
   static bool hasQUIC(Group const &ports ///< Ports to check.
-                     );
+                      );
 
   /// Check for QUIC ports.
   /// @return @c true if any global port is an QUIC port.
diff --git a/lib/ts/Vec.h b/lib/ts/Vec.h
index ff7d815..f599ead 100644
--- a/lib/ts/Vec.h
+++ b/lib/ts/Vec.h
@@ -988,7 +988,7 @@ qsort_Vec(C *left, C *right, bool (*lt)(C, C))
       Vec<C>::swap((right - 1), center);
     }
     Vec<C>::swap(center, right - 2); // stash the median one from the right for now
-    median = *(right - 2);   // the median of left, center and right values
+    median = *(right - 2);           // the median of left, center and right values
 
     // now partition, pivoting on the median value
     // l ptr is +1 b/c we already put the lowest of the incoming left, center
@@ -1054,7 +1054,7 @@ qsort_VecRef(C *left, C *right, bool (*lt)(const C &, const C &), unsigned int *
       Vec<C>::swap((right - 1), center);
     }
     Vec<C>::swap(center, right - 2); // stash the median one from the right for now
-    median = *(right - 2);   // the median of left, center and right values
+    median = *(right - 2);           // the median of left, center and right values
 
     // now partition, pivoting on the median value
     // l ptr is +1 b/c we already put the lowest of the incoming left, center

-- 
To stop receiving notification emails like this one, please contact
"commits@trafficserver.apache.org" <co...@trafficserver.apache.org>.