printf("Inserting child %d while offset is %d[%d]\n",
pchild, entry->children_offset, entry->children_len);
abort();
printf("Inserting child %d while offset is %d[%d]\n",
pchild, entry->children_offset, entry->children_len);
abort();
const trie_entry_t *entry, int level)
{
static int max_depth = 0;
const trie_entry_t *entry, int level)
{
static int max_depth = 0;
- for (int i = 0 ; i < level ; ++i) {
- fputs(" ", stdout);
- }
- if (entry->c_len == 0) {
- fputs("(nil)", stdout);
- } else {
- const char *c = trie->c + entry->c_offset;
- printf("(%d) ", entry->c_len);
- for (int i = 0 ; i < entry->c_len ; ++i) {
- if (c[i]) {
- printf("%c ", c[i]);
- } else {
- fputs("\\0 ", stdout);
+ if (show_content) {
+ for (int i = 0 ; i < level ; ++i) {
+ fputs(" ", stdout);
+ }
+ if (entry->c_len == 0) {
+ fputs("(nil)", stdout);
+ } else {
+ const char *c = trie->c + entry->c_offset;
+ printf("(%d) ", entry->c_len);
+ for (int i = 0 ; i < entry->c_len ; ++i) {
+ if (c[i]) {
+ printf("%c ", c[i]);
+ } else {
+ fputs("\\0 ", stdout);
+ }
- trie_entry_inspect(trie, &trie->entries[i], level + 1);
+ trie_entry_inspect(trie, show_content, &trie->entries[i], level + 1);
- trie_entry_inspect(trie, trie->entries, 0);
+ trie_entry_inspect(trie, show_content, trie->entries, 0);