int
main(int argc, char *argv[])
{
int i;
struct SLT *ptags[SLT__MAX];
(void)argc;
(void)argv;
for (i = 0; i < SLT__MAX; i++)
ptags[i] = &tags[i];
qsort(ptags, SLT__MAX, sizeof *ptags, ptag_cmp);
for (i = 0; i < SLT__MAX; i++) {
if (ptags[i]->name == NULL || !strcmp(ptags[i]->name, ""))
continue;
if (ptags[i]->flags & SLT_F_UNUSED)
continue;
printf("%s", ptags[i]->name);
if (ptags[i]->sdesc != NULL && strcmp(ptags[i]->sdesc, ""))
printf(" - %s", ptags[i]->sdesc);
printf("\n");
if (ptags[i]->ldesc != NULL && strcmp(ptags[i]->ldesc, "")) {
print_tabbed(ptags[i]->ldesc, 1);
}
printf("\n\n");
}
return (0);
}
static void
print_opt(const struct vopt_list *opt)
{
print_nobrackets(opt->synopsis);
printf("\n\n");
print_tabbed(opt->ldesc, 1);
printf("\n\n");
}
void print_tree_r(node_ptr starting_point, uint8_t depth)
{
if (starting_point != NULL && depth < 13)
{
print_tree_r(starting_point->right,depth+1);
print_tabbed(depth,starting_point->key);
print_tree_r(starting_point->left,depth+1);
}
}
