inline optimize

Author: xtaci

include/heap.h

@@ -49,14 +49,16 @@ namespace alg
 KV * m_kvs;// key value pairs.
 
 public:
-Heap(int max) {
+Heap(int max) 
+{
 m_size = 0;
 m_max = max+1;
 m_kvs = new KV[m_max];
 m_kvs[0].key = INT_MIN;
 };
 
-~Heap() {
+~Heap() 
+{
 delete [] m_kvs;
 };
 
@@ -172,7 +174,7 @@ namespace alg
  * step 1. find the value
  * step 2. decrease the key to the newkey
  */
-inline void decrease_key(const T & value, int newkey)
+void decrease_key(const T & value, int newkey)
 {
 uint32_t index = m_size+1;
 for (uint32_t i=1;i<=m_size;i++) {

include/lcs.h

@@ -37,8 +37,7 @@ namespace alg
 7	Z	0	1	2	2	3	3	3	4
  */
 template<typename T>
-static Array2D<uint32_t> * 
-lcs_length(const T X[], uint32_t m, const T Y[], uint32_t n)
+static Array2D<uint32_t> * lcs_length(const T X[], uint32_t m, const T Y[], uint32_t n)
 {
 Array2D<uint32_t> & A = *new Array2D<uint32_t>(m+1,n+1);
 
@@ -67,8 +66,7 @@ namespace alg
  * pass an empty stack, pop out the result in sequential order. 
  */
 template<typename T>
-static void 
-lcs_backtrack(Stack<int> & S, struct Array2D<uint32_t> & A,
+static void lcs_backtrack(Stack<int> & S, struct Array2D<uint32_t> & A,
 const T X[], const T Y[], 
 const uint32_t i, uint32_t j)
 {

include/priority_queue.h

@@ -105,7 +105,7 @@ namespace alg
  * return top element
  * check is_empty() before top().
  */
-const T & top(int * prio) const
+inline const T & top(int * prio) const
 {
 PQNode * n;
 n = list_entry(m_head.next, PQNode, node);
@@ -116,7 +116,7 @@ namespace alg
 /**
  * dequeue the most priority element, i.e. the first element.
  */
-void dequeue()
+inline void dequeue()
 {
 if (list_empty(&m_head)) return;
 
@@ -130,7 +130,8 @@ namespace alg
 /**
  * test whether the priority queue is empty
  */
-inline bool is_empty() const {
+inline bool is_empty() const 
+{
 if (list_empty(&m_head)) return true;
 return false;
 }

include/queue.h

@@ -103,7 +103,7 @@ namespace alg
 /**
  * test weather the queue is empty
  */
-bool is_empty() const 
+inline bool is_empty() const 
 {
 if (m_size ==0) return true;
 return false;

include/stack.h

@@ -83,18 +83,20 @@ class Stack
 /**
  * pop stack
  */
-inline void pop() {
+inline void pop() 
+{
 if(m_size!=0) m_size--;
 return;
 }
 
 /**
  * get the top element
 */
-inline const T& top() const { 
+inline const T& top() const 
+{
 if (m_size==0) throw exp_empty;
 return m_elements[m_size-1]; 
-};
+}
 
 /**
  * push an element into the stack
@@ -117,7 +119,8 @@ class Stack
 /**
  * return value by index
  */
-inline const T& operator[] (int idx) const { 
+inline const T& operator[] (int idx) const 
+{
 if (idx<0 || idx >= m_capacity) throw exp_ioob;
 return m_elements[m_size-1-idx]; 
 }