From fe3491419b084c2d41ad9f29274325e6c0043856 Mon Sep 17 00:00:00 2001 From: David Robillard Date: Tue, 31 Jan 2012 22:28:18 +0000 Subject: Windows/Visual C++ portability. git-svn-id: http://svn.drobilla.net/zix/trunk@51 df6676b4-ccc9-40e5-b5d6-7c4628a128e3 --- src/fat_patree.c | 13 +++++++------ 1 file changed, 7 insertions(+), 6 deletions(-) (limited to 'src/fat_patree.c') diff --git a/src/fat_patree.c b/src/fat_patree.c index 278da2a..454cfba 100644 --- a/src/fat_patree.c +++ b/src/fat_patree.c @@ -17,7 +17,6 @@ #define _XOPEN_SOURCE 500 #include -#include #include #include #include @@ -85,15 +84,16 @@ patree_find_edge(ZixFatPatreeNode* n, uint8_t c, n_edges_t* index) static void patree_add_edge(ZixFatPatreeNode* n, - char* str, - char* first, - char* last) + char* str, + char* first, + char* last) { assert(last >= first); const int index = (uint8_t)first[0]; assert(!n->children[index]); - ZixFatPatreeNode* new_node = malloc(sizeof(ZixFatPatreeNode)); + ZixFatPatreeNode* new_node = (ZixFatPatreeNode*)malloc( + sizeof(ZixFatPatreeNode)); n->children[index] = new_node; n->children[index]->label_first = first; n->children[index]->label_last = last; @@ -112,7 +112,8 @@ patree_split_edge(ZixFatPatreeNode* child, char* const last = child->label_last; assert(last >= first); - ZixFatPatreeNode* new_node = malloc(sizeof(ZixFatPatreeNode)); + ZixFatPatreeNode* new_node = (ZixFatPatreeNode*)malloc( + sizeof(ZixFatPatreeNode)); new_node->label_first = first; new_node->label_last = last; new_node->str = child->str; -- cgit v1.2.1