static void
tree_move_pgup (WTree * tree)
{
tree_move_backward (tree, tlines (tree) - 1);
show_tree (tree);
maybe_chdir (tree);
}
static void
tree_move_pgdn (WTree * tree)
{
tree_move_forward (tree, tlines (tree) - 1);
show_tree (tree);
maybe_chdir (tree);
}
static inline void
tree_move_home (WTree * tree)
{
tree_move_to_top (tree);
show_tree (tree);
maybe_chdir (tree);
}
static inline void
tree_move_end (WTree * tree)
{
tree_move_to_bottom (tree);
show_tree (tree);
maybe_chdir (tree);
}
static inline void
tree_move_down (WTree * tree)
{
tree_move_forward (tree, 1);
show_tree (tree);
maybe_chdir (tree);
}
static inline void
tree_move_up (WTree * tree)
{
tree_move_backward (tree, 1);
show_tree (tree);
maybe_chdir (tree);
}
static int
move_right (WTree *tree)
{
if (tree_navigation_flag){
tree_move_to_child (tree);
show_tree (tree);
maybe_chdir (tree);
return 1;
}
return 0;
}
static int
move_left (WTree *tree)
{
int v;
if (tree_navigation_flag){
v = tree_move_to_parent (tree);
show_tree (tree);
maybe_chdir (tree);
return v;
}
return 0;
}
static gboolean
tree_move_left (WTree * tree)
{
gboolean v = FALSE;
if (tree_navigation_flag)
{
v = tree_move_to_parent (tree);
show_tree (tree);
maybe_chdir (tree);
}
return v;
}
static gboolean
tree_move_right (WTree * tree)
{
gboolean v = FALSE;
if (tree_navigation_flag)
{
tree_move_to_child (tree);
show_tree (tree);
maybe_chdir (tree);
v = TRUE;
}
return v;
}
static void
tree_do_search (WTree * tree, int key)
{
size_t l;
l = strlen (tree->search_buffer);
if ((l != 0) && (key == KEY_BACKSPACE))
tree->search_buffer[--l] = '\0';
else if (key && l < sizeof (tree->search_buffer))
{
tree->search_buffer[l] = key;
tree->search_buffer[++l] = '\0';
}
if (!search_tree (tree, tree->search_buffer))
tree->search_buffer[--l] = 0;
show_tree (tree);
maybe_chdir (tree);
}
