Various adjustments

.clang-format

@@ -80,7 +80,7 @@ BreakAfterJavaFieldAnnotations: false
 BreakArrays:     true
 BreakBeforeBinaryOperators: None
 BreakBeforeConceptDeclarations: Always
-BreakBeforeBraces: Attach
+BreakBeforeBraces: Mozilla
 BreakBeforeInlineASMColon: OnlyMultiline
 BreakBeforeTernaryOperators: true
 BreakConstructorInitializers: BeforeColon
@@ -165,7 +165,7 @@ PenaltyBreakTemplateDeclaration: 10
 PenaltyExcessCharacter: 1000000
 PenaltyIndentedWhitespace: 0
 PenaltyReturnTypeOnItsOwnLine: 60
-PointerAlignment: Right
+PointerAlignment: Left
 PPIndentWidth:   -1
 QualifierAlignment: Leave
 ReferenceAlignment: Pointer
@@ -234,3 +234,4 @@ WhitespaceSensitiveMacros:
   - STRINGIZE
 ...
 
+

src/Hashtable.cpp

@@ -27,16 +27,18 @@ _hash_node::_hash_node(int32 _key, void *_item)
 }
 */
 
-Hashtable::Hashtable(int32 size) {
+Hashtable::Hashtable(int32 size)
+{
 	array_size = size;
 	items = 0;
-	array = new _hash_node *[array_size];
+	array = new _hash_node*[array_size];
 	// initialize to zero
 	for (size = 0; size < array_size; size++)
 		array[size] = NULL;
 }
 
-Hashtable::~Hashtable() {
+Hashtable::~Hashtable()
+{
 	if (array)
 		delete[] array;
 }
@@ -88,8 +90,9 @@ void *Hashtable::del(int32 key)
 */
 
 void
-Hashtable::forEachDo(bool (*func)(void *)) {
-	_hash_node *node;
+Hashtable::forEachDo(bool (*func)(void*))
+{
+	_hash_node* node;
 	int32 i;
 
 	for (i = 0; i < array_size; i++)

src/Hashtable.h

@@ -24,29 +24,33 @@
 #include <SupportKit.h>
 
 // Hashtable that can has only one instance of a key
-struct _hash_node {
+struct _hash_node
+{
 	int32 key;
-	void *item;
-	struct _hash_node *next;
+	void* item;
+	struct _hash_node* next;
 
-	inline _hash_node(int32 _key = -1, void *_item = NULL) {
+	inline _hash_node(int32 _key = -1, void* _item = NULL)
+	{
 		key = _key;
 		item = _item;
 		next = NULL;
 	}
 };
 
-class Hashtable {
+class Hashtable
+{
   protected:
 	int32 array_size;
 	int32 items;
-	_hash_node **array;
+	_hash_node** array;
 
   public:
 	Hashtable(int32 size = 50);
 	~Hashtable();
 
-	inline void *put(int32 key, void *item) {
+	inline void* put(int32 key, void* item)
+	{
 		_hash_node *node = array[key % array_size], *last = NULL;
 
 		for (; node; last = node, node = node->next)
@@ -63,16 +67,18 @@ class Hashtable {
 		return item;
 	}
 
-	inline void *get(int32 key) {
-		_hash_node *node = array[key % array_size];
+	inline void* get(int32 key)
+	{
+		_hash_node* node = array[key % array_size];
 		for (; node; node = node->next)
 			if (node->key == key)
 				return node->item;
 
 		return NULL;
 	}
 
-	inline void *del(int32 key) {
+	inline void* del(int32 key)
+	{
 		_hash_node *node = array[key % array_size], *last = NULL;
 		for (; node; last = node, node = node->next)
 			if (node->key == key) {
@@ -81,15 +87,15 @@ class Hashtable {
 				else
 					array[key % array_size] = node->next;
 				items--;
-				void *item = node->item;
+				void* item = node->item;
 				delete node;
 				return item;
 			}
 
 		return NULL;
 	}
 
-	void forEachDo(bool (*)(void *item));
+	void forEachDo(bool (*)(void* item));
 	// not implemented yet
 	// void rehash(void);
 };