Rev 2111 | Rev 3058 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2111 | Rev 2216 | ||
---|---|---|---|
Line 968... | Line 968... | ||
968 | depth = node->depth; |
968 | depth = node->depth; |
969 | } |
969 | } |
970 | 970 | ||
971 | printf("("); |
971 | printf("("); |
972 | for (i = 0; i < node->keys; i++) { |
972 | for (i = 0; i < node->keys; i++) { |
973 | printf("%lld%s", node->key[i], i < node->keys - 1 ? "," : ""); |
973 | printf("%llu%s", node->key[i], i < node->keys - 1 ? "," : ""); |
974 | if (node->depth && node->subtree[i]) { |
974 | if (node->depth && node->subtree[i]) { |
975 | list_append(&node->subtree[i]->bfs_link, &head); |
975 | list_append(&node->subtree[i]->bfs_link, &head); |
976 | } |
976 | } |
977 | } |
977 | } |
978 | if (node->depth && node->subtree[i]) { |
978 | if (node->depth && node->subtree[i]) { |
Line 990... | Line 990... | ||
990 | 990 | ||
991 | ASSERT(node); |
991 | ASSERT(node); |
992 | 992 | ||
993 | printf("("); |
993 | printf("("); |
994 | for (i = 0; i < node->keys; i++) |
994 | for (i = 0; i < node->keys; i++) |
995 | printf("%lld%s", node->key[i], i < node->keys - 1 ? "," : ""); |
995 | printf("%llu%s", node->key[i], i < node->keys - 1 ? "," : ""); |
996 | printf(")"); |
996 | printf(")"); |
997 | } |
997 | } |
998 | printf("\n"); |
998 | printf("\n"); |
999 | } |
999 | } |
1000 | 1000 |