@@ -16,30 +16,29 @@
 #include "config.h"
 
 #include <stdint.h>
 #include <stdlib.h>
 
-#import "huffman_tree.h"
+#import "OFHuffmanTree.h"
 
 #import "OFInvalidFormatException.h"
 #import "OFOutOfMemoryException.h"
 
-static struct of_huffman_tree *
+static OFHuffmanTree *
 newTree(void)
 {
-	struct of_huffman_tree *tree;
+	OFHuffmanTree *tree;
 
 	tree = OFAllocMemory(1, sizeof(*tree));
 	tree->leaves[0] = tree->leaves[1] = NULL;
 	tree->value = 0xFFFF;
 
 	return tree;
 }
 
 static void
-insertTree(struct of_huffman_tree *tree, uint16_t code, uint8_t length,
-    uint16_t value)
+insertTree(OFHuffmanTree *tree, uint16_t code, uint8_t length, uint16_t value)
 {
 	while (length > 0) {
 		uint8_t bit;
 
 		length--;
@@ -52,14 +51,14 @@
 	}
 
 	tree->value = value;
 }
 
-struct of_huffman_tree *
-of_huffman_tree_construct(uint8_t lengths[], uint16_t count)
+OFHuffmanTree *
+OFHuffmanTreeNew(uint8_t lengths[], uint16_t count)
 {
-	struct of_huffman_tree *tree;
+	OFHuffmanTree *tree;
 	uint16_t *lengthCount = NULL;
 	uint16_t code, maxCode = 0, *nextCode = NULL;
 	uint_fast8_t maxBit = 0;
 
 	@try {
@@ -107,24 +106,24 @@
 	}
 
 	return tree;
 }
 
-struct of_huffman_tree *
-of_huffman_tree_construct_single(uint16_t value)
+OFHuffmanTree *
+OFHuffmanTreeNewSingle(uint16_t value)
 {
-	struct of_huffman_tree *tree = newTree();
+	OFHuffmanTree *tree = newTree();
 
 	tree->value = value;
 
 	return tree;
 }
 
 void
-of_huffman_tree_release(struct of_huffman_tree *tree)
+OFHuffmanTreeFree(OFHuffmanTree *tree)
 {
 	for (uint_fast8_t i = 0; i < 2; i++)
 		if OF_LIKELY (tree->leaves[i] != NULL)
-			of_huffman_tree_release(tree->leaves[i]);
+			OFHuffmanTreeFree(tree->leaves[i]);
 
 	OFFreeMemory(tree);
 }