destroyTrie(T);
LZT = createLZTrie(parent,letters,Node,n,text_length);
+
+ free(Node); Node = 0;
return LZT;
}
destroyNodemap(T->Node);
destroyPosition(T->TPos);
free(T->boost);
+
free(T);
}
i = 1; // shortcut for first child of root
while (i != 2*T->n-1) { // shortcut for its closing parenthesis
T->boost[T->letters[i-rank(T->pdata->bdata,i)]] = i;
- // shortcut for leftrankLZTrie
+ // shortcut for leftrankLZTrie
i = findclose(T->pdata,i)+1;
}