(svn r27363) -Codechange: Fix codestyle of one-line methods and header codestyle of derived structs.
This commit is contained in:
@@ -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 */
|
||||
|
Reference in New Issue
Block a user