Redo escaping in GN

base/containers/stack_container.h

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef BASE_CONTAINERS_STACK_CONTAINER_H_
 #define BASE_CONTAINERS_STACK_CONTAINER_H_
 
 #include <string>
 #include <vector>
 
@@ skipping 72 matching lines @@
   // For this constructor, we cannot share storage; there's
   // no guarantee that the Source buffer of Ts is large enough
   // for Us.
   // TODO: If we were fancy pants, perhaps we could share storage
   // iff sizeof(T) == sizeof(U).
   template<typename U, size_t other_capacity>
   StackAllocator(const StackAllocator<U, other_capacity>& other)
       : source_(NULL) {
   }
 
+  // This constructor must exist. It creates a default allocator that doesn't
+  // actually have a stack buffer. glibc's std::string() will compare the
+  // current allocator against the default-constructed allocator, so this
+  // should be fast.
+  StackAllocator() : source_(NULL) {
+  }
+
   explicit StackAllocator(Source* source) : source_(source) {
   }
 
   // Actually do the allocation. Use the stack buffer if nobody has used it yet
   // and the size requested fits. Otherwise, fall through to the standard
   // allocator.
   pointer allocate(size_type n, void* hint = 0) {
     if (source_ != NULL && !source_->used_stack_buffer_
         && n <= stack_capacity) {
       source_->used_stack_buffer_ = true;
@@ skipping 146 matching lines @@
   // operator-> (using "->at()" does exception stuff we don't want).
   T& operator[](size_t i) { return this->container().operator[](i); }
   const T& operator[](size_t i) const {
     return this->container().operator[](i);
   }
 };
 
 }  // namespace base
 
 #endif  // BASE_CONTAINERS_STACK_CONTAINER_H_