static int cd (int argc, char **argv, void *data)
{
Node *pos = (Node *) data;
Node *tnode = pos;
if(argc==1){
return (int)node_root(pos);
}
if (!strcmp (argv[1], "..")){
if (node_left (tnode) != 0)
return (int) (node_left (tnode));
}
tnode = path2node (argv[1], pos);
if (tnode) {
tnode = node_right (tnode);
}
if (!tnode) {
cli_outfun ("no such node\n");
return (int) pos;
}
return (int) tnode;
return (int) pos;
}
void node_update_parents_todo (Node *pos)
{
#if 0
Node *tnode = node_top (pos);
if (node_left (pos) && node_getflag (node_left (pos), F_todo)
&& !node_getflag (pos, F_temp)) {
int status = -1;
while (tnode && status) {
if (node_getflag (tnode, F_todo)) {
status = 1;
if (!node_getflag (tnode, F_done))
status = 0;
}
tnode = node_down (tnode);
}
tnode = node_left (pos);
if (status == 1) { /* all todo nodes were checked */
node_setflag (tnode, F_done, 1);
node_update_parents_todo (tnode);
} else if (status == 0) { /* one or more todo node were unchecked */
node_setflag (tnode, F_done, 0);
node_update_parents_todo (tnode);
}
}
#endif
}
Node *node_recurse (Node *node)
{
if (node_right (node))
return node_right (node);
if (node_down (node))
return node_down (node);
while (node_left (node)) {
if (node_down (node_left (node)))
return node_down (node_left (node));
node = node_left (node);
}
return 0;
}
static Node *node_forced_up ( Node *node)
{
if (node_up (node) && node_getflag( node_up (node), F_expanded)) {
node = node_up (node);
while (node_right (node) && node_getflag(node,F_expanded)) {
node = node_right (node);
node = node_bottom (node);
}
return (node);
} else {
if (node_up (node))
return (node_up (node));
else
return (node_left (node));
}
return node_left (node);
}
static void dot_export_node (FILE * file, Node *node)
{
Node *parent = node_left (node);
if (parent) {
fprintf (file, "\"%s\" -> \"%s\";\n", node_getdata (parent),
node_getdata (node));
} else {
fprintf (file, "\"%s\" -> \"%s\";\n", "hnb", node_getdata (node));
}
}
Node *node_backrecurse (Node *node)
{
if (node_up (node)) {
node = node_up (node);
while (node_right (node)) {
node = node_right (node);
node = node_bottom (node);
}
return (node);
}
return (node_left (node));
}
static void heap_fix_down(struct heap *heap)
{
uint8_t *tree = heap->head;
const size_t size = heap->size;
for (size_t i = 0; i < size; ++i) {
const size_t left = node_left(i);
const size_t right = node_right(i);
if (right < size && tree[left] > tree[right])
exchange(&tree[left], &tree[right]);
if (left < size && tree[i] > tree[left])
exchange(&tree[i], &tree[left]);
}
}
/*
*
* @return the node inserted
* */
Node *import_node_text (import_state_t * is, int level, char *data)
{
int node_level;
level += is->startlevel;
while ((node_level = nodes_left (is->npos)) > level)
is->npos = node_left (is->npos);
if (node_level == level)
is->npos = node_insert_down (is->npos);
if (node_level < level)
is->npos = node_insert_right (is->npos);
node_set (is->npos, TEXT, data);
return is->npos;
}
static Node *node_forced_down ( Node *node)
{
if (node_getflag(node,F_expanded)) {
return node_recurse (node);
} else {
if (node_down (node)) {
return (node_down (node));
} else {
while (node != 0) {
node = node_left (node);
if (node_down (node))
return (node_down (node));
}
}
}
return NULL;
}
/*
*
* @return the node inserted, no need to free the node afterwards
* */
Node *import_node (import_state_t * is, int level, Node *node)
{
int node_level;
level += is->startlevel;
while ((node_level = nodes_left (is->npos)) > level)
is->npos = node_left (is->npos);
if (node_level == level)
is->npos = node_insert_down (is->npos);
if (node_level < level)
is->npos = node_insert_right (is->npos);
node_swap (node, is->npos);
node_free (is->npos);
is->npos = node;
return is->npos;
}
Node *evilloop (Node *pos)
{
cli_outfun = set_status;
while (!quit_tines) {
Tbinding *binding;
ui_draw (pos, inputbuf, 0);
binding = parsekey (ui_input (), ui_current_scope);
do {
switch (binding->action) {
case ui_action_quit:
remove_temp (&pos);
quit_tines = 1;
break;
case ui_action_command:
if(!string_isoneof(binding->action_param, no_remove_temp_commands))
remove_temp (&pos);
pos = docmd (pos, binding->action_param);
if(!string_isoneof(binding->action_param,keep_inputbuf))
inputbuf[0] = 0;
break;
case ui_action_top:
remove_temp (&pos);
inputbuf[0] = 0;
pos = node_top (pos);
break;
case ui_action_bottom:
remove_temp (&pos);
inputbuf[0] = 0;
pos = node_bottom (pos);
break;
case ui_action_up:
if (!remove_temp (&pos)) {
if(forced_up){
if (node_forced_up (pos)){
pos = node_forced_up (pos);
}
} else {
if (node_up (pos)){
pos = node_up (pos);
}
}
}
inputbuf[0] = 0;
break;
case ui_action_down:
if (!remove_temp (&pos)) {
if(forced_down){
if(node_forced_down(pos))
pos = node_forced_down (pos);
} else {
if(node_down(pos))
pos = node_down (pos);
}
inputbuf[0] = 0;
break;
}
case ui_action_pagedown:
remove_temp (&pos);
inputbuf[0] = 0;
{
int n;
for (n = 0; n < tines_nodes_down; n++)
if (node_down (pos)) {
pos = node_down (pos);
}
}
break;
case ui_action_pageup:
remove_temp (&pos);
inputbuf[0] = 0;
{
int n;
for (n = 0; n < tines_nodes_up; n++)
if (node_up (pos))
pos = node_up (pos);
}
break;
case ui_action_left:
if (!remove_temp (&pos)) {
if (node_left (pos))
pos = node_left (pos);
}
inputbuf[0] = 0;
break;
case ui_action_right:
if (node_right (pos)) {
pos = node_right (pos);
} else {
if (fixnullstring (node_get (pos, TEXT))[0]) {
node_insert_right (pos);
if (node_getflag (pos, F_temp))
node_setflag (pos, F_temp, 0);
if (!strcmp(fixnullstring(node_get(pos,"type")),"todo")){
node_set (node_right (pos), "type","todo");
node_set (node_right (pos), "done","no");
}
node_setflag (node_right (pos), F_temp, 1);
pos = node_right (pos);
}
}
inputbuf[0] = 0;
break;
case ui_action_complete:
if (strcmp
(inputbuf,
fixnullstring (node_get (pos, TEXT))) == 0) {
if (node_right (pos)) {
pos = node_right (pos);
} else {
if (fixnullstring (node_get (pos, TEXT))[0]) {
node_insert_right (pos);
if (node_getflag (pos, F_temp))
node_setflag (pos, F_temp, 0);
if (!strcmp(fixnullstring(node_get(pos,"type")),"todo")){
node_set (node_right (pos), "type","todo");
node_set (node_right (pos), "done","no");
}
node_setflag (node_right (pos), F_temp, 1);
pos = node_right (pos);
}
}
inputbuf[0] = 0;
} else {
strcpy (inputbuf,
fixnullstring (node_get (pos, TEXT)));
}
break;
case ui_action_cancel:
if (node_getflag (pos, F_temp)) {
pos = node_remove (pos);
} else {
/*stop = ui_quit (pos); */
}
inputbuf[0] = 0;
break;
case ui_action_backspace:
if (!strlen (inputbuf)) {
/*pos = ui_remove (pos); */
} else {
inputbuf[strlen (inputbuf) - 1] = 0;
if (node_getflag (pos, F_temp))
if (node_up (pos))
pos = node_remove (pos);
}
break;
case ui_action_unbound:
undefined_key (ui_scope_names[ui_current_scope],
binding->key !=
1000 ? binding->key : *((int *) &binding->
action_param[0]));
case ui_action_ignore:
break;
default:
if (binding->action > 31 && binding->action < 255) { /* input for buffer */
inputbuf[strlen (inputbuf) + 1] = 0;
inputbuf[strlen (inputbuf)] = binding->action;
} else
undefined_key (ui_scope_names[ui_current_scope],
binding->key !=
1000 ? binding->
key : *((int *) &binding->
action_param[0]));
break;
}
} while ((++binding)->key == 999);
if (strlen (inputbuf)) {
if (node_getflag (pos, F_temp)) {
node_set (pos, TEXT, inputbuf);
} else {
if (node_match (inputbuf, pos)) {
pos = node_match (inputbuf, pos);
} else {
if (add_at_top) {
pos = node_insert_up (node_top (pos));
} else {
pos = node_insert_down (node_bottom (pos));
}
node_setflag (pos, F_temp, 1);
node_set (pos, TEXT, inputbuf);
if (node_left (pos))
if (!strcmp(fixnullstring(node_get(node_left(pos),"type")),"todo")){
node_set (pos, "type","todo");
node_set (pos, "done","no");
}
}
}
} else {
docmd(pos, "autosave_check_timeout");
}
}
return pos;
}
static inline size_t node_right(size_t index) { return node_left(index) + 1; }
void node_delete(Node *node)
{
if (*node)
{
if (!node_left(*node) && !node_right(*node))
{
Node tmp = *node;
*node = NULL;
free(node_value(tmp));
free(tmp);
return;
}
else if (!node_left(*node))
{
Node tmp = *node;
*node = node_right(*node);
free(tmp->value);
free(tmp);
return;
}
else if (!node_right(*node))
{
Node tmp = *node;
*node = node_left(*node);
free(tmp->value);
free(tmp);
return;
}
else
{
Node successor = node_right((*node));
Node successorParent = (*node);
while(successor->left) {
successorParent = successor;
successor = node_left(successor);
}
if (node_right(*node) == successor)
{
Node temp = *node;
set_left(successor, node_left(*node));
*node = successor;
free(temp->value);
free(temp);
return;
}
else
{
set_left(successorParent, node_right(successor));
set_left(successor, node_left(*node));
set_right(successor, node_right(*node));
Node temp = *node;
*node = successor;
free(temp->value);
free(temp);
return;
}
}
}
}
