initial_pos.item = max(initial_pos.item, contents.first_index());
initial_pos.item = min(initial_pos.item, contents.last_index());
- dbg!(initial_pos);
-
let ff = File {
contents,
rendered: HashMap::new(),
self.pos.line = rendered.len();
self.pos.width = Some(w);
};
- dbg!(self.pos);
}
fn fix_overshoot_at_top(&mut self) {
} else {
fs
};
- let fs = fs.add(Pr('q'), "Exit", 100);
+ let fs = fs
+ .add(Pr('/'), "Search Down", 20)
+ .add(Pr('\\'), "Search Up", 19)
+ .add(Pr('q'), "Exit", 100);
// We calculate the percentage through the file in a
// loose sort of way, by assuming all items are the