kas 0.0.1

GUI Toolkit Abstraction System
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

// widget/mod.rs

/// Widget set trait
pub trait WidgetSet {
    /// The number of widgets in the set
    fn len(&self) -> usize;
    
//     /// Get a widget by index
//     fn get(&self, index: usize) -> Option<&Widget>;
//     
//     /// Mutably get a widget by index
//     fn get_mut(&mut self, index: usize) -> Option<&mut Widget>;
    
    /*
    /// Iterate over widgets
    /// 
    /// The default implementation is built using `len` and `get`.
    fn iter(&self) -> impl Iterator<Item = &Widget> {
        (0..self.len()).map(|i| self.get(i))
    }
    
    /// Mutably iterate over widgets
    /// 
    /// The default implementation is built using `len` and `get_mut`.
    fn iter_mut(&mut self) -> impl Iterator<Item = &mut Widget> {
        (0..self.len()).map(|i| self.get_mut(i))
    }
    */
}

// widget/event.rs

// pub trait Handler<R> {
//     fn handle(&mut self, widgets: &mut WidgetSet, event: Event) -> R;
// }
// 
// pub struct DefaultHandler<R>;
// 
// impl<R> Handler<R> for DefaultHandler<R> {
//     fn handle(&mut self, widgets: &mut WidgetSet, event: Event) -> R {
//         match event {
//         }
//     }
// }


    /// For convenience, `Index<usize>` is implemented via this method.
    /// 
impl ::std::ops::Index<usize> for Widget + 'static {
    type Output = dyn Widget + 'static;
    fn index<'a>(&'a self, i: usize) -> &'a Self::Output {
        self.get(i).unwrap_or_else(|| panic!("Widget::get: index out of bounds"))
    }
}