wtf reformat test

third_party/WebKit/Source/wtf/LinkedStack.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 20 matching lines @@
 #ifndef LinkedStack_h
 #define LinkedStack_h
 
 #include "wtf/Allocator.h"
 #include "wtf/OwnPtr.h"
 
 namespace WTF {
 
 template <typename T>
 class LinkedStack {
-    USING_FAST_MALLOC(LinkedStack);
-public:
-    LinkedStack() : m_size(0) { }
+  USING_FAST_MALLOC(LinkedStack);
 
-    // Iterative cleanup to prevent stack overflow problems.
-    ~LinkedStack()
-    {
-        OwnPtr<Node> ptr = m_head.release();
-        while (ptr)
-            ptr = ptr->m_next.release();
-    }
+ public:
+  LinkedStack() : m_size(0) {}
 
-    bool isEmpty();
+  // Iterative cleanup to prevent stack overflow problems.
+  ~LinkedStack() {
+    OwnPtr<Node> ptr = m_head.release();
+    while (ptr)
+      ptr = ptr->m_next.release();
+  }
 
-    void push(const T&);
-    const T& peek();
-    void pop();
+  bool isEmpty();
 
-    size_t size();
+  void push(const T&);
+  const T& peek();
+  void pop();
 
-private:
-    class Node {
-        USING_FAST_MALLOC(LinkedStack::Node);
-    public:
-        Node(const T&, PassOwnPtr<Node> next);
+  size_t size();
 
-        T m_data;
-        OwnPtr<Node> m_next;
-    };
+ private:
+  class Node {
+    USING_FAST_MALLOC(LinkedStack::Node);
+
+   public:
+    Node(const T&, PassOwnPtr<Node> next);
+
+    T m_data;
+    OwnPtr<Node> m_next;
+  };
 #if COMPILER(MSVC)
-    friend struct ::WTF::OwnedPtrDeleter<Node>;
+  friend struct ::WTF::OwnedPtrDeleter<Node>;
 #endif
 
-    OwnPtr<Node> m_head;
-    size_t m_size;
+  OwnPtr<Node> m_head;
+  size_t m_size;
 };
 
 template <typename T>
 LinkedStack<T>::Node::Node(const T& data, PassOwnPtr<Node> next)
-    : m_data(data)
-    , m_next(next)
-{
+    : m_data(data), m_next(next) {}
+
+template <typename T>
+inline bool LinkedStack<T>::isEmpty() {
+  return !m_head;
 }
 
 template <typename T>
-inline bool LinkedStack<T>::isEmpty()
-{
-    return !m_head;
+inline void LinkedStack<T>::push(const T& data) {
+  m_head = adoptPtr(new Node(data, m_head.release()));
+  ++m_size;
 }
 
 template <typename T>
-inline void LinkedStack<T>::push(const T& data)
-{
-    m_head = adoptPtr(new Node(data, m_head.release()));
-    ++m_size;
+inline const T& LinkedStack<T>::peek() {
+  return m_head->m_data;
 }
 
 template <typename T>
-inline const T& LinkedStack<T>::peek()
-{
-    return m_head->m_data;
+inline void LinkedStack<T>::pop() {
+  ASSERT(m_head && m_size);
+  m_head = m_head->m_next.release();
+  --m_size;
 }
 
 template <typename T>
-inline void LinkedStack<T>::pop()
-{
-    ASSERT(m_head && m_size);
-    m_head = m_head->m_next.release();
-    --m_size;
+inline size_t LinkedStack<T>::size() {
+  return m_size;
 }
-
-template <typename T>
-inline size_t LinkedStack<T>::size()
-{
-    return m_size;
-}
-
 }
 
 using WTF::LinkedStack;
 
 #endif