Convert gn docstrings to C++11 raw strings.

tools/gn/command_path.cc

Index: tools/gn/command_path.cc
diff --git a/tools/gn/command_path.cc b/tools/gn/command_path.cc
index a17001dd6c684491755dd19f5f38de344cc11a23..dd475798bf2253f5969f9b7f640c06f8bbb66ed2 100644
--- a/tools/gn/command_path.cc
+++ b/tools/gn/command_path.cc
@@ -278,44 +278,43 @@ const char kPath[] = "path";
 const char kPath_HelpShort[] =
     "path: Find paths between two targets.";
 const char kPath_Help[] =
-    "gn path <out_dir> <target_one> <target_two>\n"
-    "\n"
-    "  Finds paths of dependencies between two targets. Each unique path\n"
-    "  will be printed in one group, and groups will be separate by newlines.\n"
-    "  The two targets can appear in either order (paths will be found going\n"
-    "  in either direction).\n"
-    "\n"
-    "  By default, a single path will be printed. If there is a path with\n"
-    "  only public dependencies, the shortest public path will be printed.\n"
-    "  Otherwise, the shortest path using either public or private\n"
-    "  dependencies will be printed. If --with-data is specified, data deps\n"
-    "  will also be considered. If there are multiple shortest paths, an\n"
-    "  arbitrary one will be selected.\n"
-    "\n"
-    "Interesting paths\n"
-    "\n"
-    "  In a large project, there can be 100's of millions of unique paths\n"
-    "  between a very high level and a common low-level target. To make the\n"
-    "  output more useful (and terminate in a reasonable time), GN will not\n"
-    "  revisit sub-paths previously known to lead to the target.\n"
-    "\n"
-    "Options\n"
-    "\n"
-    "  --all\n"
-    "     Prints all \"interesting\" paths found rather than just the first\n"
-    "     one. Public paths will be printed first in order of increasing\n"
-    "     length, followed by non-public paths in order of increasing length.\n"
-    "\n"
-    "  --public\n"
-    "     Considers only public paths. Can't be used with --with-data.\n"
-    "\n"
-    "  --with-data\n"
-    "     Additionally follows data deps. Without this flag, only public and\n"
-    "     private linked deps will be followed. Can't be used with --public.\n"
-    "\n"
-    "Example\n"
-    "\n"
-    "  gn path out/Default //base //tools/gn\n";
+    R"(gn path <out_dir> <target_one> <target_two>
+
+  Finds paths of dependencies between two targets. Each unique path will be
+  printed in one group, and groups will be separate by newlines. The two
+  targets can appear in either order (paths will be found going in either
+  direction).
+
+  By default, a single path will be printed. If there is a path with only
+  public dependencies, the shortest public path will be printed. Otherwise, the
+  shortest path using either public or private dependencies will be printed. If
+  --with-data is specified, data deps will also be considered. If there are
+  multiple shortest paths, an arbitrary one will be selected.
+
+Interesting paths
+
+  In a large project, there can be 100's of millions of unique paths between a
+  very high level and a common low-level target. To make the output more useful
+  (and terminate in a reasonable time), GN will not revisit sub-paths
+  previously known to lead to the target.
+
+Options
+
+  --all
+     Prints all "interesting" paths found rather than just the first one.
+     Public paths will be printed first in order of increasing length, followed
+     by non-public paths in order of increasing length.
+
+  --public
+     Considers only public paths. Can't be used with --with-data.
+
+  --with-data
+     Additionally follows data deps. Without this flag, only public and private
+     linked deps will be followed. Can't be used with --public.
+
+Example
+
+  gn path out/Default //base //tools/gn)";

[scottmg, 2016/11/08 00:27:52]

One more

 
 int RunPath(const std::vector<std::string>& args) {
   if (args.size() != 3) {