Revert of Remove StringBuilder::appendLiteral.

third_party/WebKit/Source/core/dom/Range.cpp

 /*
  * (C) 1999 Lars Knoll (knoll@kde.org)
  * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)
  * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2011 Motorola Mobility. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 1295 matching lines @@
     }
 }
 
 #ifndef NDEBUG
 void Range::formatForDebugger(char* buffer, unsigned length) const
 {
     StringBuilder result;
 
     const int FormatBufferSize = 1024;
     char s[FormatBufferSize];
-    result.append("from offset ");
+    result.appendLiteral("from offset ");
     result.appendNumber(m_start.offset());
-    result.append(" of ");
+    result.appendLiteral(" of ");
     m_start.container()->formatForDebugger(s, FormatBufferSize);
     result.append(s);
-    result.append(" to offset ");
+    result.appendLiteral(" to offset ");
     result.appendNumber(m_end.offset());
-    result.append(" of ");
+    result.appendLiteral(" of ");
     m_end.container()->formatForDebugger(s, FormatBufferSize);
     result.append(s);
 
     strncpy(buffer, result.toString().utf8().data(), length - 1);
 }
 #endif
 
 bool areRangesEqual(const Range* a, const Range* b)
 {
     if (a == b)
@@ skipping 273 matching lines @@
 {
     if (range && range->boundaryPointsValid()) {
         range->startContainer()->showTreeAndMark(range->startContainer(), "S", range->endContainer(), "E");
         fprintf(stderr, "start offset: %d, end offset: %d\n", range->startOffset(), range->endOffset());
     } else {
         fprintf(stderr, "Cannot show tree if range is null, or if boundary points are invalid.\n");
     }
 }
 
 #endif