///////////////////////////////////////////
static inline int bp_parent(bp *b, int s)
{
- int r = bp_bwd_excess(b,s,-2);
+ int r;
+ if (bp_getbit(b->B, s - 1) == OP) return s - 1;
+ r = bp_bwd_excess(b,s,-2);
return (r >= -1) ? r+1 : -1;
}
static inline int bp_next_sibling(bp *b, int s)
{
int t;
- t = bp_find_close(b,s) + 1;
+ t = bp_find_close(b, s) + 1;
return (bp_inspect(b, t) == CP) ? -1 : t;
}
// new functions for persistence purposes, added by Diego Arroyuelo
void saveTree(bp *b, FILE *fp);
bp * loadTree(FILE *fp);
+
+//0: success 1: failure (errno)
+int bp_save(bp *b, int fd);
+
+//non-null: sucess, null: failure (errno)
+
+bp * bp_load(int fd);
void bp_delete(bp *b);