Rev 1177 | Rev 1221 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1177 | Rev 1196 | ||
---|---|---|---|
Line 943... | Line 943... | ||
943 | depth = node->depth; |
943 | depth = node->depth; |
944 | } |
944 | } |
945 | 945 | ||
946 | printf("("); |
946 | printf("("); |
947 | for (i = 0; i < node->keys; i++) { |
947 | for (i = 0; i < node->keys; i++) { |
948 | printf("%d%s", node->key[i], i < node->keys - 1 ? "," : ""); |
948 | printf("%lld%s", node->key[i], i < node->keys - 1 ? "," : ""); |
949 | if (node->depth && node->subtree[i]) { |
949 | if (node->depth && node->subtree[i]) { |
950 | list_append(&node->subtree[i]->bfs_link, &head); |
950 | list_append(&node->subtree[i]->bfs_link, &head); |
951 | } |
951 | } |
952 | } |
952 | } |
953 | if (node->depth && node->subtree[i]) { |
953 | if (node->depth && node->subtree[i]) { |
Line 965... | Line 965... | ||
965 | 965 | ||
966 | ASSERT(node); |
966 | ASSERT(node); |
967 | 967 | ||
968 | printf("("); |
968 | printf("("); |
969 | for (i = 0; i < node->keys; i++) |
969 | for (i = 0; i < node->keys; i++) |
970 | printf("%d%s", node->key[i], i < node->keys - 1 ? "," : ""); |
970 | printf("%lld%s", node->key[i], i < node->keys - 1 ? "," : ""); |
971 | printf(")"); |
971 | printf(")"); |
972 | } |
972 | } |
973 | printf("\n"); |
973 | printf("\n"); |
974 | } |
974 | } |