From 1105b4d2c99e99750f42b7a39443bb03b40f4afa Mon Sep 17 00:00:00 2001
From: alberth <alberth@openttd.org>
Date: Sat, 8 Aug 2015 13:19:38 +0000
Subject: (svn r27363) -Codechange: Fix codestyle of one-line methods and
 header codestyle of derived structs.

---
 src/misc/binaryheap.hpp | 20 ++++++++++++++++----
 1 file changed, 16 insertions(+), 4 deletions(-)

(limited to 'src/misc/binaryheap.hpp')

diff --git a/src/misc/binaryheap.hpp b/src/misc/binaryheap.hpp
index 092ab720b..5bd2b794a 100644
--- a/src/misc/binaryheap.hpp
+++ b/src/misc/binaryheap.hpp
@@ -157,21 +157,30 @@ public:
 	 *
 	 *  @return The number of items in the queue
 	 */
-	inline uint Length() const { return this->items; }
+	inline uint Length() const
+	{
+		return this->items;
+	}
 
 	/**
 	 * Test if the priority queue is empty.
 	 *
 	 * @return True if empty
 	 */
-	inline bool IsEmpty() const { return this->items == 0; }
+	inline bool IsEmpty() const
+	{
+		return this->items == 0;
+	}
 
 	/**
 	 * Test if the priority queue is full.
 	 *
 	 * @return True if full.
 	 */
-	inline bool IsFull() const { return this->items >= this->capacity; }
+	inline bool IsFull() const
+	{
+		return this->items >= this->capacity;
+	}
 
 	/**
 	 * Get the smallest item in the binary tree.
@@ -287,7 +296,10 @@ public:
 	 * Make the priority queue empty.
 	 * All remaining items will remain untouched.
 	 */
-	inline void Clear() { this->items = 0; }
+	inline void Clear()
+	{
+		this->items = 0;
+	}
 };
 
 #endif /* BINARYHEAP_HPP */
-- 
cgit v1.2.3-54-g00ecf