daily automatic beautifier

wuhaiyangit · Feb 3, 2017 · 1cc7ac7 · 1cc7ac7
1 parent 3916fbc
commit 1cc7ac7
Showing 1 changed file with 9 additions and 11 deletions.
diff --git a/moses2/InMemoryTrie/InMemoryTrie.h b/moses2/InMemoryTrie/InMemoryTrie.h
@@ -10,24 +10,23 @@ template<class KeyClass, class ValueClass>
 class InMemoryTrie
 {
 public:
-  InMemoryTrie()
-  {
+  InMemoryTrie() {
   }
   Node<KeyClass, ValueClass>* insert(const std::vector<KeyClass>& word,
-      const ValueClass& value);
+                                     const ValueClass& value);
   const Node<KeyClass, ValueClass>* getNode(
-      const std::vector<KeyClass>& words) const;
+    const std::vector<KeyClass>& words) const;
   const Node<KeyClass, ValueClass> &getNode(const std::vector<KeyClass>& words,
       size_t &stoppedAtInd) const;
   std::vector<const Node<KeyClass, ValueClass>*> getNodes(
-      const std::vector<KeyClass>& words, size_t &stoppedAtInd) const;
+    const std::vector<KeyClass>& words, size_t &stoppedAtInd) const;
 private:
   Node<KeyClass, ValueClass> root;
 };
 
 template<class KeyClass, class ValueClass>
 Node<KeyClass, ValueClass>* InMemoryTrie<KeyClass, ValueClass>::insert(
-    const std::vector<KeyClass>& word, const ValueClass& value)
+  const std::vector<KeyClass>& word, const ValueClass& value)
 {
   Node<KeyClass, ValueClass>* cNode = &root;
   for (size_t i = 0; i < word.size(); ++i) {
@@ -40,7 +39,7 @@ Node<KeyClass, ValueClass>* InMemoryTrie<KeyClass, ValueClass>::insert(
 
 template<class KeyClass, class ValueClass>
 const Node<KeyClass, ValueClass>* InMemoryTrie<KeyClass, ValueClass>::getNode(
-    const std::vector<KeyClass>& words) const
+  const std::vector<KeyClass>& words) const
 {
   size_t stoppedAtInd;
   const Node<KeyClass, ValueClass> &ret = getNode(words, stoppedAtInd);
@@ -52,7 +51,7 @@ const Node<KeyClass, ValueClass>* InMemoryTrie<KeyClass, ValueClass>::getNode(
 
 template<class KeyClass, class ValueClass>
 const Node<KeyClass, ValueClass> &InMemoryTrie<KeyClass, ValueClass>::getNode(
-    const std::vector<KeyClass>& words, size_t &stoppedAtInd) const
+  const std::vector<KeyClass>& words, size_t &stoppedAtInd) const
 {
   const Node<KeyClass, ValueClass> *prevNode = &root, *newNode;
   for (size_t i = 0; i < words.size(); ++i) {
@@ -71,7 +70,7 @@ const Node<KeyClass, ValueClass> &InMemoryTrie<KeyClass, ValueClass>::getNode(
 
 template<class KeyClass, class ValueClass>
 std::vector<const Node<KeyClass, ValueClass>*> InMemoryTrie<KeyClass, ValueClass>::getNodes(
-    const std::vector<KeyClass>& words, size_t &stoppedAtInd) const
+  const std::vector<KeyClass>& words, size_t &stoppedAtInd) const
 {
   std::vector<const Node<KeyClass, ValueClass>*> ret;
   const Node<KeyClass, ValueClass> *prevNode = &root, *newNode;
@@ -83,8 +82,7 @@ std::vector<const Node<KeyClass, ValueClass>*> InMemoryTrie<KeyClass, ValueClass
     if (newNode == NULL) {
       stoppedAtInd = i;
       return ret;
-    }
-    else {
+    } else {
       ret.push_back(newNode);
     }
     prevNode = newNode;