[llvm-commits] [llvm] r45247 - /llvm/trunk/include/llvm/ADT/Trie.h

[Anton Korobeynikov]

Author: asl
Date: Wed Dec 19 19:30:27 2007
New Revision: 45247

URL: http://llvm.org/viewvc/llvm-project?rev=45247&view=rev
Log:
More eye-candy stuff :)

Modified:
    llvm/trunk/include/llvm/ADT/Trie.h

Modified: llvm/trunk/include/llvm/ADT/Trie.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/Trie.h?rev=45247&r1=45246&r2=45247&view=diff

==============================================================================
--- llvm/trunk/include/llvm/ADT/Trie.h (original)
+++ llvm/trunk/include/llvm/ADT/Trie.h Wed Dec 19 19:30:27 2007
@@ -147,7 +147,7 @@
     inline const Node*   &front() const { return Children.front(); }
     inline       Node*   &front()       { return Children.front(); }
     inline const Node*   &back()  const { return Children.back();  }
-    inline Node*         &back()        { return Children.back();  }
+    inline       Node*   &back()        { return Children.back();  }
 
   };
 
@@ -275,26 +275,21 @@
 
 template<class Payload>
 struct GraphTraits<Trie<Payload> > {
-  typedef typename Trie<Payload>::Node NodeType;
-  typedef typename Trie<Payload>::Node::iterator ChildIteratorType;
+  typedef Trie<Payload> TrieType;
+  typedef typename TrieType::Node NodeType;
+  typedef typename NodeType::iterator ChildIteratorType;
 
-  static inline NodeType *getEntryNode(const Trie<Payload>& T) {
-    return T.getRoot();
-  }
+  static inline NodeType *getEntryNode(const TrieType& T) { return T.getRoot(); }
 
-  static inline ChildIteratorType child_begin(NodeType *N) {
-    return N->begin();
-  }
-  static inline ChildIteratorType child_end(NodeType *N) {
-    return N->end();
-  }
+  static inline ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
+  static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
 
   typedef typename std::vector<NodeType*>::const_iterator nodes_iterator;
 
-  static inline nodes_iterator nodes_begin(const Trie<Payload>& G) {
+  static inline nodes_iterator nodes_begin(const TrieType& G) {
     return G.Nodes.begin();
   }
-  static inline nodes_iterator nodes_end(const Trie<Payload>& G) {
+  static inline nodes_iterator nodes_end(const TrieType& G) {
     return G.Nodes.end();
   }