Struct App 

pub struct App {
    pub tree: Tree,
    pub state: TreeListViewState<NodeId>,
    pub query: TreeQuery,
    pub mode: Mode,
    pub keybinding_panel: KeybindingPanelState,
    pub page_height: usize,
    pub palette: Option<Palette>,
    /* private fields */
}

Fields

tree: Tree

state: TreeListViewState<NodeId>

query: TreeQuery

mode: Mode

The current input mode; see Mode.

keybinding_panel: KeybindingPanelState

page_height: usize

Rows per screen; the UI updates this every frame.

palette: Option<Palette>

Terminal default colors, when the terminal answered the startup query.

Implementations

impl App

pub fn new(tree: Tree, config: &Config, expand: Option<ExpandSpec>) -> Self

pub fn default_keymap() -> HashMap<Key, Binding>

The default keybindings, before user config is merged.

pub fn focused_id(&mut self) -> Option<NodeId>

pub fn visible_names(&mut self) -> Vec<String>

Names of currently visible rows, in on-screen order.

pub fn handle_key(&mut self, key: Key) -> Effect

Handle a normalized key through the active mode and effective keymap.

pub fn run_command(&mut self, cmd: AppCommand) -> Effect

Execute an app command.

pub fn do_work(&mut self) -> bool

One cooperative quantum of index building, run by the event loop between input polls: load what is on screen first, then advance the arena-order sweep. Returns true while more work remains. This is the background indexer — cooperative rather than threaded, so the tree stays single-threaded and lock-free; a worker thread could later slot in behind this same seam.

pub fn has_work(&self) -> bool

Whether the event loop should keep scheduling work quanta.