*/
#include "jsw_rbtree.h"
-#ifdef __cplusplus
-#include <cstdlib>
-
-using std::malloc;
-using std::free;
-using std::size_t;
-#else
#include <stdlib.h>
-#endif
#ifndef HEIGHT_LIMIT
#define HEIGHT_LIMIT 64 /* Tallest allowable tree */
*/
static jsw_rbnode_t *new_node ( jsw_rbtree_t *tree, void *data )
{
- jsw_rbnode_t *rn = (jsw_rbnode_t *)malloc ( sizeof *rn );
+ jsw_rbnode_t *rn = malloc ( sizeof *rn );
if ( rn == NULL )
return NULL;
*/
jsw_rbtree_t *jsw_rbnew ( cmp_f cmp, dup_f dup, rel_f rel )
{
- jsw_rbtree_t *rt = (jsw_rbtree_t *)malloc ( sizeof *rt );
+ jsw_rbtree_t *rt = malloc ( sizeof *rt );
if ( rt == NULL )
return NULL;
*/
jsw_rbtrav_t *jsw_rbtnew ( void )
{
- return (jsw_rbtrav_t*)malloc ( sizeof ( jsw_rbtrav_t ) );
+ return malloc ( sizeof ( jsw_rbtrav_t ) );
}
/**
void *jsw_rbtprev ( jsw_rbtrav_t *trav )
{
return move ( trav, 0 ); /* Toward smaller items */
-}
\ No newline at end of file
+}