Struct egui_tiles::Tiles

pub struct Tiles<Pane> { /* private fields */ }

Contains all tile state, but no root.

use egui_tiles::{Tiles, TileId, Tree};

struct Pane { } // put some state here

let mut tiles = Tiles::default();
let tabs: Vec<TileId> = vec![tiles.insert_pane(Pane { }), tiles.insert_pane(Pane { })];
let root: TileId = tiles.insert_tab_tile(tabs);

let tree = Tree::new(root, tiles);

Implementations

impl<Pane> Tiles<Pane>

pub fn get(&self, tile_id: TileId) -> Option<&Tile<Pane>>

pub fn get_mut(&mut self, tile_id: TileId) -> Option<&mut Tile<Pane>>

pub fn iter(&self) -> impl Iterator<Item = (&TileId, &Tile<Pane>)> + '_

All tiles, in arbitrary order

pub fn iter_mut( &mut self ) -> impl Iterator<Item = (&TileId, &mut Tile<Pane>)> + '_

All tiles, in arbitrary order

pub fn tile_ids(&self) -> impl Iterator<Item = TileId> + '_

All TileIds, in arbitrary order

pub fn tiles(&self) -> impl Iterator<Item = &Tile<Pane>> + '_

All Tiles in arbitrary order

pub fn tiles_mut(&mut self) -> impl Iterator<Item = &mut Tile<Pane>> + '_

All Tiles in arbitrary order

pub fn is_visible(&self, tile_id: TileId) -> bool

Tiles are visible by default.

Invisible tiles still retain their place in the tile hierarchy.

pub fn set_visible(&mut self, tile_id: TileId, visible: bool)

Tiles are visible by default.

Invisible tiles still retain their place in the tile hierarchy.

pub fn insert(&mut self, id: TileId, tile: Tile<Pane>)

pub fn remove(&mut self, id: TileId) -> Option<Tile<Pane>>

pub fn remove_recursively(&mut self, id: TileId) -> Vec<Tile<Pane>>

Remove the given tile and all child tiles, recursively.

All removed tiles are returned in unspecified order.

pub fn insert_new(&mut self, tile: Tile<Pane>) -> TileId

pub fn insert_pane(&mut self, pane: Pane) -> TileId

pub fn insert_container(&mut self, container: impl Into<Container>) -> TileId

pub fn insert_tab_tile(&mut self, children: Vec<TileId>) -> TileId

pub fn insert_horizontal_tile(&mut self, children: Vec<TileId>) -> TileId

pub fn insert_vertical_tile(&mut self, children: Vec<TileId>) -> TileId

pub fn insert_grid_tile(&mut self, children: Vec<TileId>) -> TileId

pub fn parent_of(&self, child_id: TileId) -> Option<TileId>

pub fn is_root(&self, tile_id: TileId) -> bool

impl<Pane: PartialEq> Tiles<Pane>

pub fn find_pane(&self, needle: &Pane) -> Option<TileId>

Find the tile with the given pane.

Trait Implementations

impl<Pane: Clone> Clone for Tiles<Pane>

fn clone(&self) -> Tiles<Pane>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Pane: Debug> Debug for Tiles<Pane>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<Pane> Default for Tiles<Pane>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, Pane> Deserialize<'de> for Tiles<Pane>where Pane: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<Pane: PartialEq> PartialEq<Tiles<Pane>> for Tiles<Pane>

fn eq(&self, other: &Tiles<Pane>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Pane> Serialize for Tiles<Pane>where Pane: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

Serialize this value into the given Serde serializer.