diff options
Diffstat (limited to '')
| -rw-r--r-- | native/src/layout.rs | 75 | ||||
| -rw-r--r-- | native/src/layout/DRUID_LICENSE | 202 | ||||
| -rw-r--r-- | native/src/layout/flex.rs | 155 | ||||
| -rw-r--r-- | native/src/layout/limits.rs | 131 | ||||
| -rw-r--r-- | native/src/layout/node.rs | 37 | 
5 files changed, 556 insertions, 44 deletions
diff --git a/native/src/layout.rs b/native/src/layout.rs index 520bcd88..0a744346 100644 --- a/native/src/layout.rs +++ b/native/src/layout.rs @@ -1,57 +1,50 @@ -use crate::Rectangle; -  mod limits; +mod node; + +pub mod flex;  pub use limits::Limits; +pub use node::Node; -/// The computed bounds of a [`Node`] and its children. -/// -/// This type is provided by the GUI runtime to [`Widget::on_event`] and -/// [`Widget::draw`], describing the layout of the [`Node`] produced by -/// [`Widget::node`]. -/// -/// [`Node`]: struct.Node.html -/// [`Widget::on_event`]: widget/trait.Widget.html#method.on_event -/// [`Widget::draw`]: widget/trait.Widget.html#tymethod.draw -/// [`Widget::node`]: widget/trait.Widget.html#tymethod.node -#[derive(Debug, Clone)] -pub struct Layout { -    bounds: Rectangle, -    children: Vec<Layout>, +use crate::{Point, Rectangle, Vector}; + +#[derive(Debug, Clone, Copy)] +pub struct Layout<'a> { +    position: Point, +    node: &'a Node,  } -impl Layout { -    pub fn new(bounds: Rectangle) -> Self { -        Layout { -            bounds, -            children: Vec::new(), -        } +impl<'a> Layout<'a> { +    pub(crate) fn new(node: &'a Node) -> Self { +        Self::with_offset(Vector::new(0.0, 0.0), node)      } -    pub fn push(&mut self, mut child: Layout) { -        child.bounds.x += self.bounds.x; -        child.bounds.y += self.bounds.y; +    pub(crate) fn with_offset(offset: Vector, node: &'a Node) -> Self { +        let bounds = node.bounds(); -        self.children.push(child); +        Self { +            position: Point::new(bounds.x, bounds.y) + offset, +            node, +        }      } -    /// Gets the bounds of the [`Layout`]. -    /// -    /// The returned [`Rectangle`] describes the position and size of a -    /// [`Node`]. -    /// -    /// [`Layout`]: struct.Layout.html -    /// [`Rectangle`]: struct.Rectangle.html -    /// [`Node`]: struct.Node.html      pub fn bounds(&self) -> Rectangle { -        self.bounds +        let bounds = self.node.bounds(); + +        Rectangle { +            x: self.position.x, +            y: self.position.y, +            width: bounds.width, +            height: bounds.height, +        }      } -    /// Returns an iterator over the [`Layout`] of the children of a [`Node`]. -    /// -    /// [`Layout`]: struct.Layout.html -    /// [`Node`]: struct.Node.html -    pub fn children(&self) -> impl Iterator<Item = &Layout> { -        self.children.iter() +    pub fn children(&'a self) -> impl Iterator<Item = Layout<'a>> { +        self.node.children().iter().map(move |node| { +            Layout::with_offset( +                Vector::new(self.position.x, self.position.y), +                node, +            ) +        })      }  } diff --git a/native/src/layout/DRUID_LICENSE b/native/src/layout/DRUID_LICENSE new file mode 100644 index 00000000..d6456956 --- /dev/null +++ b/native/src/layout/DRUID_LICENSE @@ -0,0 +1,202 @@ + +                                 Apache License +                           Version 2.0, January 2004 +                        http://www.apache.org/licenses/ + +   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + +   1. Definitions. + +      "License" shall mean the terms and conditions for use, reproduction, +      and distribution as defined by Sections 1 through 9 of this document. + +      "Licensor" shall mean the copyright owner or entity authorized by +      the copyright owner that is granting the License. + +      "Legal Entity" shall mean the union of the acting entity and all +      other entities that control, are controlled by, or are under common +      control with that entity. For the purposes of this definition, +      "control" means (i) the power, direct or indirect, to cause the +      direction or management of such entity, whether by contract or +      otherwise, or (ii) ownership of fifty percent (50%) or more of the +      outstanding shares, or (iii) beneficial ownership of such entity. + +      "You" (or "Your") shall mean an individual or Legal Entity +      exercising permissions granted by this License. + +      "Source" form shall mean the preferred form for making modifications, +      including but not limited to software source code, documentation +      source, and configuration files. + +      "Object" form shall mean any form resulting from mechanical +      transformation or translation of a Source form, including but +      not limited to compiled object code, generated documentation, +      and conversions to other media types. + +      "Work" shall mean the work of authorship, whether in Source or +      Object form, made available under the License, as indicated by a +      copyright notice that is included in or attached to the work +      (an example is provided in the Appendix below). + +      "Derivative Works" shall mean any work, whether in Source or Object +      form, that is based on (or derived from) the Work and for which the +      editorial revisions, annotations, elaborations, or other modifications +      represent, as a whole, an original work of authorship. For the purposes +      of this License, Derivative Works shall not include works that remain +      separable from, or merely link (or bind by name) to the interfaces of, +      the Work and Derivative Works thereof. + +      "Contribution" shall mean any work of authorship, including +      the original version of the Work and any modifications or additions +      to that Work or Derivative Works thereof, that is intentionally +      submitted to Licensor for inclusion in the Work by the copyright owner +      or by an individual or Legal Entity authorized to submit on behalf of +      the copyright owner. For the purposes of this definition, "submitted" +      means any form of electronic, verbal, or written communication sent +      to the Licensor or its representatives, including but not limited to +      communication on electronic mailing lists, source code control systems, +      and issue tracking systems that are managed by, or on behalf of, the +      Licensor for the purpose of discussing and improving the Work, but +      excluding communication that is conspicuously marked or otherwise +      designated in writing by the copyright owner as "Not a Contribution." + +      "Contributor" shall mean Licensor and any individual or Legal Entity +      on behalf of whom a Contribution has been received by Licensor and +      subsequently incorporated within the Work. + +   2. Grant of Copyright License. Subject to the terms and conditions of +      this License, each Contributor hereby grants to You a perpetual, +      worldwide, non-exclusive, no-charge, royalty-free, irrevocable +      copyright license to reproduce, prepare Derivative Works of, +      publicly display, publicly perform, sublicense, and distribute the +      Work and such Derivative Works in Source or Object form. + +   3. Grant of Patent License. Subject to the terms and conditions of +      this License, each Contributor hereby grants to You a perpetual, +      worldwide, non-exclusive, no-charge, royalty-free, irrevocable +      (except as stated in this section) patent license to make, have made, +      use, offer to sell, sell, import, and otherwise transfer the Work, +      where such license applies only to those patent claims licensable +      by such Contributor that are necessarily infringed by their +      Contribution(s) alone or by combination of their Contribution(s) +      with the Work to which such Contribution(s) was submitted. If You +      institute patent litigation against any entity (including a +      cross-claim or counterclaim in a lawsuit) alleging that the Work +      or a Contribution incorporated within the Work constitutes direct +      or contributory patent infringement, then any patent licenses +      granted to You under this License for that Work shall terminate +      as of the date such litigation is filed. + +   4. Redistribution. You may reproduce and distribute copies of the +      Work or Derivative Works thereof in any medium, with or without +      modifications, and in Source or Object form, provided that You +      meet the following conditions: + +      (a) You must give any other recipients of the Work or +          Derivative Works a copy of this License; and + +      (b) You must cause any modified files to carry prominent notices +          stating that You changed the files; and + +      (c) You must retain, in the Source form of any Derivative Works +          that You distribute, all copyright, patent, trademark, and +          attribution notices from the Source form of the Work, +          excluding those notices that do not pertain to any part of +          the Derivative Works; and + +      (d) If the Work includes a "NOTICE" text file as part of its +          distribution, then any Derivative Works that You distribute must +          include a readable copy of the attribution notices contained +          within such NOTICE file, excluding those notices that do not +          pertain to any part of the Derivative Works, in at least one +          of the following places: within a NOTICE text file distributed +          as part of the Derivative Works; within the Source form or +          documentation, if provided along with the Derivative Works; or, +          within a display generated by the Derivative Works, if and +          wherever such third-party notices normally appear. The contents +          of the NOTICE file are for informational purposes only and +          do not modify the License. You may add Your own attribution +          notices within Derivative Works that You distribute, alongside +          or as an addendum to the NOTICE text from the Work, provided +          that such additional attribution notices cannot be construed +          as modifying the License. + +      You may add Your own copyright statement to Your modifications and +      may provide additional or different license terms and conditions +      for use, reproduction, or distribution of Your modifications, or +      for any such Derivative Works as a whole, provided Your use, +      reproduction, and distribution of the Work otherwise complies with +      the conditions stated in this License. + +   5. Submission of Contributions. Unless You explicitly state otherwise, +      any Contribution intentionally submitted for inclusion in the Work +      by You to the Licensor shall be under the terms and conditions of +      this License, without any additional terms or conditions. +      Notwithstanding the above, nothing herein shall supersede or modify +      the terms of any separate license agreement you may have executed +      with Licensor regarding such Contributions. + +   6. Trademarks. This License does not grant permission to use the trade +      names, trademarks, service marks, or product names of the Licensor, +      except as required for reasonable and customary use in describing the +      origin of the Work and reproducing the content of the NOTICE file. + +   7. Disclaimer of Warranty. Unless required by applicable law or +      agreed to in writing, Licensor provides the Work (and each +      Contributor provides its Contributions) on an "AS IS" BASIS, +      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or +      implied, including, without limitation, any warranties or conditions +      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A +      PARTICULAR PURPOSE. You are solely responsible for determining the +      appropriateness of using or redistributing the Work and assume any +      risks associated with Your exercise of permissions under this License. + +   8. Limitation of Liability. In no event and under no legal theory, +      whether in tort (including negligence), contract, or otherwise, +      unless required by applicable law (such as deliberate and grossly +      negligent acts) or agreed to in writing, shall any Contributor be +      liable to You for damages, including any direct, indirect, special, +      incidental, or consequential damages of any character arising as a +      result of this License or out of the use or inability to use the +      Work (including but not limited to damages for loss of goodwill, +      work stoppage, computer failure or malfunction, or any and all +      other commercial damages or losses), even if such Contributor +      has been advised of the possibility of such damages. + +   9. Accepting Warranty or Additional Liability. While redistributing +      the Work or Derivative Works thereof, You may choose to offer, +      and charge a fee for, acceptance of support, warranty, indemnity, +      or other liability obligations and/or rights consistent with this +      License. However, in accepting such obligations, You may act only +      on Your own behalf and on Your sole responsibility, not on behalf +      of any other Contributor, and only if You agree to indemnify, +      defend, and hold each Contributor harmless for any liability +      incurred by, or claims asserted against, such Contributor by reason +      of your accepting any such warranty or additional liability. + +   END OF TERMS AND CONDITIONS + +   APPENDIX: How to apply the Apache License to your work. + +      To apply the Apache License to your work, attach the following +      boilerplate notice, with the fields enclosed by brackets "[]" +      replaced with your own identifying information. (Don't include +      the brackets!)  The text should be enclosed in the appropriate +      comment syntax for the file format. We also recommend that a +      file or class name and description of purpose be included on the +      same "printed page" as the copyright notice for easier +      identification within third-party archives. + +   Copyright [yyyy] [name of copyright owner] + +   Licensed under the Apache License, Version 2.0 (the "License"); +   you may not use this file except in compliance with the License. +   You may obtain a copy of the License at + +       http://www.apache.org/licenses/LICENSE-2.0 + +   Unless required by applicable law or agreed to in writing, software +   distributed under the License is distributed on an "AS IS" BASIS, +   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +   See the License for the specific language governing permissions and +   limitations under the License. diff --git a/native/src/layout/flex.rs b/native/src/layout/flex.rs new file mode 100644 index 00000000..98cc344e --- /dev/null +++ b/native/src/layout/flex.rs @@ -0,0 +1,155 @@ +// This code is heavily inspired by the [`druid`] codebase. +// +// [`druid`]: https://github.com/xi-editor/druid +// +// Copyright 2018 The xi-editor Authors, Héctor Ramón +// +// Licensed under the Apache License, Version 2.0 (the "License"); +// you may not use this file except in compliance with the License. +// You may obtain a copy of the License at +// +//     http://www.apache.org/licenses/LICENSE-2.0 +// +// Unless required by applicable law or agreed to in writing, software +// distributed under the License is distributed on an "AS IS" BASIS, +// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +// See the License for the specific language governing permissions and +// limitations under the License. +use crate::{ +    layout::{Limits, Node}, +    Element, Size, +}; + +#[derive(Debug)] +pub enum Axis { +    Horizontal, +    Vertical, +} + +impl Axis { +    fn main(&self, size: Size) -> f32 { +        match self { +            Axis::Horizontal => size.width, +            Axis::Vertical => size.height, +        } +    } + +    fn cross(&self, size: Size) -> f32 { +        match self { +            Axis::Horizontal => size.height, +            Axis::Vertical => size.width, +        } +    } + +    fn pack(&self, main: f32, cross: f32) -> (f32, f32) { +        match self { +            Axis::Horizontal => (main, cross), +            Axis::Vertical => (cross, main), +        } +    } +} + +// TODO: Remove `Message` type parameter +pub fn resolve<Message, Renderer>( +    axis: Axis, +    renderer: &Renderer, +    limits: &Limits, +    padding: f32, +    spacing: f32, +    children: &[Element<'_, Message, Renderer>], +) -> Node +where +    Renderer: crate::Renderer, +{ +    let limits = limits.pad(padding); + +    let mut total_non_fill = spacing as f32 * (children.len() - 1) as f32; +    let mut fill_sum = 0; + +    let mut nodes: Vec<Node> = Vec::with_capacity(children.len()); +    nodes.resize(children.len(), Node::default()); + +    for (i, child) in children.iter().enumerate() { +        let fill_factor = match axis { +            Axis::Horizontal => child.width(), +            Axis::Vertical => child.height(), +        } +        .fill_factor(); + +        if fill_factor == 0 { +            let child_limits = Limits::new(Size::ZERO, limits.max()); + +            let layout = child.layout(renderer, &child_limits); + +            total_non_fill += axis.main(layout.size()); + +            nodes[i] = layout; +        } else { +            fill_sum += fill_factor; +        } +    } + +    let available = axis.main(limits.max()); +    let remaining = (available - total_non_fill).max(0.0); + +    for (i, child) in children.iter().enumerate() { +        let fill_factor = match axis { +            Axis::Horizontal => child.width(), +            Axis::Vertical => child.height(), +        } +        .fill_factor(); + +        if fill_factor != 0 { +            let max_main = remaining * fill_factor as f32 / fill_sum as f32; +            let min_main = if max_main.is_infinite() { +                0.0 +            } else { +                max_main +            }; + +            let (min_main, min_cross) = +                axis.pack(min_main, axis.cross(limits.min())); + +            let (max_main, max_cross) = +                axis.pack(max_main, axis.cross(limits.max())); + +            let child_limits = Limits::new( +                Size::new(min_main, min_cross), +                Size::new(max_main, max_cross), +            ); + +            let layout = child.layout(renderer, &child_limits); + +            nodes[i] = layout; +        } +    } + +    let mut main = padding; +    let mut cross = axis.cross(limits.min()); + +    for (i, node) in nodes.iter_mut().enumerate() { +        if i > 0 { +            main += spacing; +        } + +        let (x, y) = axis.pack(main, padding); + +        node.bounds.x = x; +        node.bounds.y = y; + +        let size = node.size(); + +        main += axis.main(size); +        cross = cross.max(axis.cross(size)); +    } + +    let (width, height) = axis.pack(main, cross); +    let size = limits.resolve(Size::new(width, height)); + +    let (padding_x, padding_y) = axis.pack(padding, padding * 2.0); + +    Node::with_children( +        Size::new(size.width + padding_x, size.height + padding_y), +        nodes, +    ) +} diff --git a/native/src/layout/limits.rs b/native/src/layout/limits.rs index ad105119..e5cee5df 100644 --- a/native/src/layout/limits.rs +++ b/native/src/layout/limits.rs @@ -1,6 +1,131 @@ -#[derive(Debug)] -pub struct Limits {} +use crate::{Length, Size}; + +#[derive(Debug, Clone, Copy)] +pub struct Limits { +    min: Size, +    max: Size, +    fill: Size, +}  impl Limits { -    pub const NONE: Limits = Limits {}; +    pub const NONE: Limits = Limits { +        min: Size::ZERO, +        max: Size::INFINITY, +        fill: Size::INFINITY, +    }; + +    pub fn new(min: Size, max: Size) -> Limits { +        Limits { +            min, +            max, +            fill: Size::INFINITY, +        } +    } + +    pub fn width(mut self, width: Length) -> Limits { +        match width { +            Length::Shrink => { +                self.fill.width = self.min.width; +            } +            Length::Fill => { +                self.fill.width = self.fill.width.min(self.max.width); +            } +            Length::Units(units) => { +                let new_width = +                    (units as f32).min(self.max.width).max(self.min.width); + +                self.min.width = new_width; +                self.max.width = new_width; +                self.fill.width = new_width; +            } +        } + +        self +    } + +    pub fn height(mut self, height: Length) -> Limits { +        match height { +            Length::Shrink => { +                self.fill.height = self.min.height; +            } +            Length::Fill => { +                self.fill.height = self.fill.height.min(self.max.height); +            } +            Length::Units(units) => { +                let new_height = +                    (units as f32).min(self.max.height).max(self.min.height); + +                self.min.height = new_height; +                self.max.height = new_height; +                self.fill.height = new_height; +            } +        } + +        self +    } + +    pub fn min_width(mut self, min_width: u32) -> Limits { +        self.min.width = +            self.min.width.max(min_width as f32).min(self.max.width); + +        self +    } + +    pub fn max_width(mut self, max_width: u32) -> Limits { +        self.max.width = +            self.max.width.min(max_width as f32).max(self.min.width); + +        self +    } + +    pub fn max_height(mut self, max_height: u32) -> Limits { +        self.max.height = +            self.max.height.min(max_height as f32).max(self.min.height); + +        self +    } + +    pub fn resolve(&self, intrinsic_size: Size) -> Size { +        Size::new( +            intrinsic_size +                .width +                .min(self.max.width) +                .max(self.fill.width), +            intrinsic_size +                .height +                .min(self.max.height) +                .max(self.fill.height), +        ) +    } + +    pub fn min(&self) -> Size { +        self.min +    } + +    pub fn max(&self) -> Size { +        self.max +    } + +    pub fn pad(&self, padding: f32) -> Limits { +        self.shrink(Size::new(padding * 2.0, padding * 2.0)) +    } + +    pub fn shrink(&self, size: Size) -> Limits { +        let min = Size::new( +            (self.min().width - size.width).max(0.0), +            (self.min().height - size.height).max(0.0), +        ); + +        let max = Size::new( +            (self.max().width - size.width).max(0.0), +            (self.max().height - size.height).max(0.0), +        ); + +        let fill = Size::new( +            (self.fill.width - size.width).max(0.0), +            (self.fill.height - size.height).max(0.0), +        ); + +        Limits { min, max, fill } +    }  } diff --git a/native/src/layout/node.rs b/native/src/layout/node.rs new file mode 100644 index 00000000..7537ad3b --- /dev/null +++ b/native/src/layout/node.rs @@ -0,0 +1,37 @@ +use crate::{Rectangle, Size}; + +#[derive(Debug, Clone, Default)] +pub struct Node { +    pub bounds: Rectangle, +    children: Vec<Node>, +} + +impl Node { +    pub fn new(size: Size) -> Self { +        Self::with_children(size, Vec::new()) +    } + +    pub fn with_children(size: Size, children: Vec<Node>) -> Self { +        Node { +            bounds: Rectangle { +                x: 0.0, +                y: 0.0, +                width: size.width, +                height: size.height, +            }, +            children, +        } +    } + +    pub fn size(&self) -> Size { +        Size::new(self.bounds.width, self.bounds.height) +    } + +    pub fn bounds(&self) -> Rectangle { +        self.bounds +    } + +    pub fn children(&self) -> &[Node] { +        &self.children +    } +}  | 
