DO NOT SUBMIT results of new clang-format

third_party/WebKit/Source/platform/text/BidiTestHarness.h

 /*
  * Copyright (C) 2013 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 13 matching lines @@
  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #ifndef BidiTestHarness_h
 #define BidiTestHarness_h
 
+#include <stdio.h>
 #include <istream>
 #include <map>
-#include <stdio.h>
 #include <string>
 #include <vector>
 
 // FIXME: We don't have any business owning this code. We should try to
 // upstream this to unicode.org if possible (for other implementations to use).
 // Unicode.org provides a reference implmentation, including parser:
 // http://www.unicode.org/Public/PROGRAMS/BidiReferenceC/6.3.0/source/brtest.c
 // But it, like the other implementations I've found, is rather tied to
 // the algorithms it is testing. This file seeks to only implement the parser
 // bits.
@@ skipping 204 matching lines @@
       }
       test_string = ParseTestString(line.substr(0, seperator_index));
       if (!ParseParagraphDirectionMask(line.substr(seperator_index + 1),
                                        paragraph_direction_mask)) {
         ParseError(original_line, line_number);
         continue;
       }
 
       if (paragraph_direction_mask & kDirectionAutoLTR) {
         runner_.RunTest(test_string, reorder, levels, kDirectionAutoLTR,
-                         original_line, line_number);
+                        original_line, line_number);
       }
       if (paragraph_direction_mask & kDirectionLTR) {
         runner_.RunTest(test_string, reorder, levels, kDirectionLTR,
-                         original_line, line_number);
+                        original_line, line_number);
       }
       if (paragraph_direction_mask & kDirectionRTL) {
         runner_.RunTest(test_string, reorder, levels, kDirectionRTL,
-                         original_line, line_number);
+                        original_line, line_number);
       }
     }
   }
 }
 
 template <class Runner>
 class CharacterHarness {
  public:
   CharacterHarness(Runner& runner) : runner_(runner) {}
   void Parse(std::istream& bidi_test_file);
@@ skipping 118 matching lines @@
       continue;
     }
 
     std::vector<int> visual_ordering = ParseIntList(line);
     if (test_string.size() - supressed_chars != visual_ordering.size()) {
       ParseError(original_line, line_number);
       continue;
     }
 
     runner_.RunTest(test_string, visual_ordering, levels, paragraph_direction,
-                     original_line, line_number);
+                    original_line, line_number);
   }
 }
 
 }  // namespace bidi_test
 
 #endif  // BidiTestHarness_h