@ -1,6 +1,6 @@
#![ warn(missing_docs) ] // Let's keep this file well-documented.` to memory.rs
#![ warn(missing_docs) ] // Let's keep this file well-documented.` to memory.rs
use ahash ::HashMap ;
use ahash ::{ HashMap , HashSet } ;
use epaint ::emath ::TSTransform ;
use epaint ::emath ::TSTransform ;
use crate ::{
use crate ::{
@ -951,6 +951,11 @@ pub struct Areas {
/// So if you close three windows and then reopen them all in one frame,
/// So if you close three windows and then reopen them all in one frame,
/// they will all be sent to the top, but keep their previous internal order.
/// they will all be sent to the top, but keep their previous internal order.
wants_to_be_on_top : ahash ::HashSet < LayerId > ,
wants_to_be_on_top : ahash ::HashSet < LayerId > ,
/// List of sublayers for each layer
///
/// When a layer has sublayers, they are moved directly above it in the ordering.
sublayers : ahash ::HashMap < LayerId , HashSet < LayerId > > ,
}
}
impl Areas {
impl Areas {
@ -1042,20 +1047,38 @@ impl Areas {
}
}
}
}
/// Mark the `child` layer as a sublayer of `parent`.
///
/// Sublayers are moved directly above the parent layer at the end of the frame. This is mainly
/// intended for adding a new [Area](crate::Area) inside a [Window](crate::Window).
///
/// This currently only supports one level of nesting. If `parent` is a sublayer of another
/// layer, the behavior is unspecified.
pub fn set_sublayer ( & mut self , parent : LayerId , child : LayerId ) {
self . sublayers . entry ( parent ) . or_default ( ) . insert ( child ) ;
}
pub fn top_layer_id ( & self , order : Order ) -> Option < LayerId > {
pub fn top_layer_id ( & self , order : Order ) -> Option < LayerId > {
self . order
self . order
. iter ( )
. iter ( )
. filter ( | layer | layer . order = = order )
. filter ( | layer | layer . order = = order & & ! self . is_sublayer ( layer ) )
. last ( )
. last ( )
. copied ( )
. copied ( )
}
}
pub ( crate ) fn is_sublayer ( & self , layer : & LayerId ) -> bool {
self . sublayers
. iter ( )
. any ( | ( _ , children ) | children . contains ( layer ) )
}
pub ( crate ) fn end_frame ( & mut self ) {
pub ( crate ) fn end_frame ( & mut self ) {
let Self {
let Self {
visible_last_frame ,
visible_last_frame ,
visible_current_frame ,
visible_current_frame ,
order ,
order ,
wants_to_be_on_top ,
wants_to_be_on_top ,
sublayers ,
. .
. .
} = self ;
} = self ;
@ -1063,6 +1086,23 @@ impl Areas {
visible_current_frame . clear ( ) ;
visible_current_frame . clear ( ) ;
order . sort_by_key ( | layer | ( layer . order , wants_to_be_on_top . contains ( layer ) ) ) ;
order . sort_by_key ( | layer | ( layer . order , wants_to_be_on_top . contains ( layer ) ) ) ;
wants_to_be_on_top . clear ( ) ;
wants_to_be_on_top . clear ( ) ;
// For all layers with sublayers, put the sublayers directly after the parent layer:
let sublayers = std ::mem ::take ( sublayers ) ;
for ( parent , children ) in sublayers {
let mut moved_layers = vec ! [ parent ] ;
order . retain ( | l | {
if children . contains ( l ) {
moved_layers . push ( * l ) ;
false
} else {
true
}
} ) ;
let Some ( parent_pos ) = order . iter ( ) . position ( | l | l = = & parent ) else {
continue ;
} ;
order . splice ( parent_pos . . = parent_pos , moved_layers ) ;
}
}
}
}
}