Fix errors preventing compilation

This commit is contained in:
Joscha 2022-06-13 16:43:28 +02:00
parent fb7e504f2c
commit 6fdce9db1e
5 changed files with 156 additions and 30 deletions

View file

@ -1,10 +1,9 @@
mod tree; mod tree;
use crossterm::event::KeyEvent; use crossterm::event::KeyEvent;
use crossterm::style::ContentStyle;
use toss::frame::{Frame, Pos, Size}; use toss::frame::{Frame, Pos, Size};
use crate::traits::{Msg, MsgStore}; use crate::store::{Msg, MsgStore};
use self::tree::TreeView; use self::tree::TreeView;
@ -14,19 +13,28 @@ pub enum Mode {
// Flat, // Flat,
} }
pub struct Cursor<I> {
id: I,
/// Where on the screen the cursor is visible (`0.0` = first line, `1.0` =
/// last line).
proportion: f32,
}
pub struct Chat<M: Msg, S: MsgStore<M>> { pub struct Chat<M: Msg, S: MsgStore<M>> {
store: S, store: S,
cursor: Option<M::Id>, room: String,
cursor: Option<Cursor<M::Id>>,
mode: Mode, mode: Mode,
tree: TreeView, tree: TreeView<M>,
// thread: ThreadView, // thread: ThreadView,
// flat: FlatView, // flat: FlatView,
} }
impl<M: Msg, S: MsgStore<M>> Chat<M, S> { impl<M: Msg, S: MsgStore<M>> Chat<M, S> {
pub fn new(store: S) -> Self { pub fn new(store: S, room: String) -> Self {
Self { Self {
store, store,
room,
cursor: None, cursor: None,
mode: Mode::Tree, mode: Mode::Tree,
tree: TreeView::new(), tree: TreeView::new(),
@ -37,16 +45,21 @@ impl<M: Msg, S: MsgStore<M>> Chat<M, S> {
impl<M: Msg, S: MsgStore<M>> Chat<M, S> { impl<M: Msg, S: MsgStore<M>> Chat<M, S> {
pub fn handle_key_event(&mut self, event: KeyEvent, size: Size) { pub fn handle_key_event(&mut self, event: KeyEvent, size: Size) {
match self.mode { match self.mode {
Mode::Tree => { Mode::Tree => self.tree.handle_key_event(
self.tree &mut self.store,
.handle_key_event(&mut self.store, &mut self.cursor, event, size) &self.room,
} &mut self.cursor,
event,
size,
),
} }
} }
pub fn render(&mut self, frame: &mut Frame, pos: Pos, size: Size) { pub fn render(&mut self, frame: &mut Frame, pos: Pos, size: Size) {
match self.mode { match self.mode {
Mode::Tree => self.tree.render(&mut self.store, frame, pos, size), Mode::Tree => self
.tree
.render(&mut self.store, &self.room, frame, pos, size),
} }
} }
} }

View file

@ -1,32 +1,144 @@
use std::collections::VecDeque;
use std::marker::PhantomData;
use chrono::{DateTime, Utc};
use crossterm::event::KeyEvent; use crossterm::event::KeyEvent;
use crossterm::style::ContentStyle; use crossterm::style::ContentStyle;
use toss::frame::{Frame, Pos, Size}; use toss::frame::{Frame, Pos, Size};
use crate::traits::{Msg, MsgStore}; use crate::store::{Msg, MsgStore};
pub struct TreeView {} use super::Cursor;
impl TreeView { struct Block<I> {
pub fn new() -> Self { line: i32,
Self {} height: i32,
id: Option<I>,
cursor: bool,
content: BlockContent,
} }
pub fn handle_key_event<M, S>( enum BlockContent {
Msg(MsgBlock),
Placeholder,
}
struct MsgBlock {
time: DateTime<Utc>,
indent: usize,
nick: String,
content: Vec<String>,
}
struct Layout<I>(VecDeque<Block<I>>);
impl<I: PartialEq> Layout<I> {
pub fn new() -> Self {
Self(VecDeque::new())
}
fn mark_cursor(&mut self, id: &I) {
for block in &mut self.0 {
if block.id.as_ref() == Some(id) {
block.cursor = true;
}
}
}
fn calculate_offsets_with_cursor(&mut self, line: i32) {
let cursor_index = self
.0
.iter()
.enumerate()
.find(|(_, b)| b.cursor)
.expect("layout must contain cursor block")
.0;
// Propagate lines from cursor to both ends
self.0[cursor_index].line = line;
for i in (0..cursor_index).rev() {
// let succ_line = self.0[i + 1].line;
// let curr = &mut self.0[i];
// curr.line = succ_line - curr.height;
self.0[i].line = self.0[i + 1].line - self.0[i].height;
}
for i in (cursor_index + 1)..self.0.len() {
// let pred = &self.0[i - 1];
// self.0[i].line = pred.line + pred.height;
self.0[i].line = self.0[i - 1].line + self.0[i - 1].height;
}
}
fn calculate_offsets_without_cursor(&mut self, height: i32) {
if let Some(back) = self.0.back_mut() {
back.line = height - back.height;
}
for i in (0..self.0.len() - 1).rev() {
self.0[i].line = self.0[i + 1].line - self.0[i].height;
}
}
pub fn calculate_offsets(&mut self, height: i32, cursor: Option<Cursor<I>>) {
if let Some(cursor) = cursor {
let line = ((height - 1) as f32 * cursor.proportion) as i32;
self.mark_cursor(&cursor.id);
self.calculate_offsets_with_cursor(line);
} else {
self.calculate_offsets_without_cursor(height);
}
}
}
pub struct TreeView<M: Msg> {
// pub focus: Option<M::Id>,
// pub folded: HashSet<M::Id>,
// pub minimized: HashSet<M::Id>,
phantom: PhantomData<M::Id>, // TODO Remove
}
impl<M: Msg> TreeView<M> {
pub fn new() -> Self {
Self {
phantom: PhantomData,
}
}
async fn layout<S: MsgStore<M>>(
&mut self,
room: &str,
store: S,
cursor: &mut Option<Cursor<M::Id>>,
) -> Layout<M::Id> {
if let Some(cursor) = cursor {
// TODO Ensure focus lies on cursor path, otherwise unfocus
// TODO Unfold all messages on path to cursor
let cursor_path = store.path(room, &cursor.id).await;
// TODO Produce layout of cursor subtree (with correct offsets)
// TODO Expand layout upwards and downwards if there is no focus
todo!()
} else {
// TODO Ensure there is no focus
// TODO Produce layout of last tree (with correct offsets)
// TODO Expand layout upwards
todo!()
}
}
pub fn handle_key_event<S: MsgStore<M>>(
&mut self, &mut self,
store: &mut S, store: &mut S,
cursor: &mut Option<M::Id>, room: &str,
cursor: &mut Option<Cursor<M::Id>>,
event: KeyEvent, event: KeyEvent,
size: Size, size: Size,
) where ) {
M: Msg,
S: MsgStore<M>,
{
// TODO // TODO
} }
pub fn render<M: Msg, S: MsgStore<M>>( pub fn render<S: MsgStore<M>>(
&mut self, &mut self,
store: &mut S, store: &mut S,
room: &str,
frame: &mut Frame, frame: &mut Frame,
pos: Pos, pos: Pos,
size: Size, size: Size,

View file

@ -84,6 +84,6 @@ impl<M: Msg> Tree<M> {
#[async_trait] #[async_trait]
pub trait MsgStore<M: Msg> { pub trait MsgStore<M: Msg> {
async fn path(&self, room: &str, id: M::Id) -> Path<M::Id>; async fn path(&self, room: &str, id: &M::Id) -> Path<M::Id>;
async fn thread(&self, room: &str, root: M::Id) -> Tree<M>; async fn thread(&self, room: &str, root: &M::Id) -> Tree<M>;
} }

View file

@ -80,12 +80,12 @@ impl DummyStore {
self self
} }
fn tree(&self, id: usize, result: &mut Vec<DummyMsg>) { fn collect_tree(&self, id: usize, result: &mut Vec<DummyMsg>) {
if let Some(msg) = self.msgs.get(&id) { if let Some(msg) = self.msgs.get(&id) {
result.push(msg.clone()); result.push(msg.clone());
if let Some(children) = self.children.get(&id) { if let Some(children) = self.children.get(&id) {
for child in children { for child in children {
self.tree(*child, result); self.collect_tree(*child, result);
} }
} }
} }
@ -94,7 +94,8 @@ impl DummyStore {
#[async_trait] #[async_trait]
impl MsgStore<DummyMsg> for DummyStore { impl MsgStore<DummyMsg> for DummyStore {
async fn path(&self, _room: &str, mut id: usize) -> Path<usize> { async fn path(&self, _room: &str, id: &usize) -> Path<usize> {
let mut id = *id;
let mut segments = vec![id]; let mut segments = vec![id];
while let Some(parent) = self.msgs.get(&id).and_then(|msg| msg.parent) { while let Some(parent) = self.msgs.get(&id).and_then(|msg| msg.parent) {
segments.push(parent); segments.push(parent);
@ -104,9 +105,9 @@ impl MsgStore<DummyMsg> for DummyStore {
Path::new(segments) Path::new(segments)
} }
async fn thread(&self, _room: &str, root: usize) -> Tree<DummyMsg> { async fn thread(&self, _room: &str, root: &usize) -> Tree<DummyMsg> {
let mut msgs = vec![]; let mut msgs = vec![];
self.collect_tree(*root, &mut msgs);
Tree::new(root, msgs) Tree::new(*root, msgs)
} }
} }

View file

@ -46,7 +46,7 @@ impl Ui {
let store = DummyStore::new() let store = DummyStore::new()
.msg(DummyMsg::new(1, "nick", "content")) .msg(DummyMsg::new(1, "nick", "content"))
.msg(DummyMsg::new(2, "Some1Else", "reply").parent(1)); .msg(DummyMsg::new(2, "Some1Else", "reply").parent(1));
let chat = Chat::new(store); let chat = Chat::new(store, "testroom".to_string());
// Run main UI. // Run main UI.
// //