Make platform/text to use USING_FAST_MALLOC.

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

 /*
  * Copyright (C) 2010 Adam Barth. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
  *    documentation and/or other materials provided with the distribution.
  *
  * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE COMPUTER, INC. OR
  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 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 SuffixTree_h
 #define SuffixTree_h
 
+#include "wtf/Allocator.h"
+#include "wtf/Noncopyable.h"
 #include "wtf/Vector.h"
 #include "wtf/text/WTFString.h"
 
 namespace blink {
 
 class UnicodeCodebook {
+    STATIC_ONLY(UnicodeCodebook);
 public:
     static int codeWord(UChar c) { return c; }
     enum { codeSize = 1 << 8 * sizeof(UChar) };
 };
 
 class ASCIICodebook {
+    STATIC_ONLY(ASCIICodebook);
 public:
     static int codeWord(UChar c) { return c & (codeSize - 1); }
     enum { codeSize = 1 << (8 * sizeof(char) - 1) };
 };
 
 template<typename Codebook>
 class SuffixTree {
+    USING_FAST_MALLOC(SuffixTree);
+    WTF_MAKE_NONCOPYABLE(SuffixTree);
 public:
     SuffixTree(const String& text, unsigned depth)
         : m_depth(depth)
         , m_leaf(true)
     {
         build(text);
     }
 
     bool mightContain(const String& query)
     {
         Node* current = &m_root;
         int limit = std::min(m_depth, query.length());
         for (int i = 0; i < limit; ++i) {
             current = current->at(Codebook::codeWord(query[i]));
             if (!current)
                 return false;
         }
         return true;
     }
 
 private:
     class Node {
+        USING_FAST_MALLOC(Node);
+        WTF_MAKE_NONCOPYABLE(Node);
     public:
         Node(bool isLeaf = false)
         {
             m_children.resize(Codebook::codeSize);
             m_children.fill(0);
             m_isLeaf = isLeaf;
         }
 
         ~Node()
         {
@@ skipping 33 matching lines @@
 
     // Instead of allocating a fresh empty leaf node for ever leaf in the tree
     // (there can be a lot of these), we alias all the leaves to this "static"
     // leaf node.
     Node m_leaf;
 };
 
 } // namespace blink
 
 #endif // SuffixTree_h