Code-style consistency improvement:

Apply clang-format-all.sh using the _clang-format file through all the cpp/.h files.
make sure not to apply it to certain serialization structures, since some parser expects the * as part of the name, instead of type.
This commit contains no other changes aside from adding and applying clang-format-all.sh

Extras/HACD/hacdCircularList.h

@@ -15,66 +15,72 @@
 #pragma once
 #ifndef HACD_CIRCULAR_LIST_H
 #define HACD_CIRCULAR_LIST_H
-#include<stdlib.h>
+#include <stdlib.h>
 #include "hacdVersion.h"
 namespace HACD
 {
-	//!	CircularListElement class.
-	template < typename T > class CircularListElement
-	{
-    public:
-        T &                                     GetData() { return m_data; }
-        const T &                               GetData() const { return m_data; }
-        CircularListElement<T> * &				GetNext() { return m_next; }
-        CircularListElement<T> * &				GetPrev() { return m_prev; }
-        const CircularListElement<T> * &		GetNext() const { return m_next; }
-        const CircularListElement<T> * &		GetPrev() const { return m_prev; }        
-        //!	Constructor
-												CircularListElement(const T & data) {m_data = data;}
-												CircularListElement(void){}
-        //! Destructor
-												~CircularListElement(void){}
-    private:
-        T										m_data;
-        CircularListElement<T> *				m_next; 
-        CircularListElement<T> *				m_prev;
+//!	CircularListElement class.
+template <typename T>
+class CircularListElement
+{
+public:
+	T& GetData() { return m_data; }
+	const T& GetData() const { return m_data; }
+	CircularListElement<T>*& GetNext() { return m_next; }
+	CircularListElement<T>*& GetPrev() { return m_prev; }
+	const CircularListElement<T>*& GetNext() const { return m_next; }
+	const CircularListElement<T>*& GetPrev() const { return m_prev; }
+	//!	Constructor
+	CircularListElement(const T& data) { m_data = data; }
+	CircularListElement(void) {}
+	//! Destructor
+	~CircularListElement(void) {}
 
-												CircularListElement(const CircularListElement & rhs);
-	};
-    
-    
-	//!	CircularList class.
-	template < typename T > class CircularList
+private:
+	T m_data;
+	CircularListElement<T>* m_next;
+	CircularListElement<T>* m_prev;
+
+	CircularListElement(const CircularListElement& rhs);
+};
+
+//!	CircularList class.
+template <typename T>
+class CircularList
+{
+public:
+	CircularListElement<T>*& GetHead() { return m_head; }
+	const CircularListElement<T>* GetHead() const { return m_head; }
+	bool IsEmpty() const { return (m_size == 0); }
+	size_t GetSize() const { return m_size; }
+	const T& GetData() const { return m_head->GetData(); }
+	T& GetData() { return m_head->GetData(); }
+	bool Delete();
+	bool Delete(CircularListElement<T>* element);
+	CircularListElement<T>* Add(const T* data = 0);
+	CircularListElement<T>* Add(const T& data);
+	bool Next();
+	bool Prev();
+	void Clear()
 	{
-	public:
-        CircularListElement<T> *  &             GetHead() { return m_head;}        
-		const CircularListElement<T> *          GetHead() const { return m_head;}
-		bool                                    IsEmpty() const { return (m_size == 0);}
-		size_t                                  GetSize() const { return m_size; }
-		const T &                               GetData() const { return m_head->GetData(); }        
-		T &                                     GetData() { return m_head->GetData();}
-		bool                                    Delete() ;
-        bool                                    Delete(CircularListElement<T> * element);
-		CircularListElement<T> *                Add(const T * data = 0);
-		CircularListElement<T> *                Add(const T & data);
-		bool                                    Next();
-		bool                                    Prev();
-		void									Clear() { while(Delete());};
-        const CircularList&						operator=(const CircularList& rhs);
-		//!	Constructor											
-												CircularList()
-												{ 
-													m_head = 0; 
-													m_size = 0;
-												}
-												CircularList(const CircularList& rhs);
-		//! Destructor
-		virtual								    ~CircularList(void) {Clear();};
-	private:
-		CircularListElement<T> *				m_head;		//!< a pointer to the head of the circular list
-		size_t									m_size;		//!< number of element in the circular list
-        
+		while (Delete())
+			;
 	};
-}
+	const CircularList& operator=(const CircularList& rhs);
+	//!	Constructor
+	CircularList()
+	{
+		m_head = 0;
+		m_size = 0;
+	}
+	CircularList(const CircularList& rhs);
+	//! Destructor
+	virtual ~CircularList(void) { Clear(); };
+
+private:
+	CircularListElement<T>* m_head;  //!< a pointer to the head of the circular list
+	size_t m_size;                   //!< number of element in the circular list
+};
+}  // namespace HACD
 #include "hacdCircularList.inl"
 #endif