15#include <boost/noncopyable.hpp>
25namespace implementation {
51#if !defined(ADOBE_NO_DOCUMENTATION)
58#if !defined(ADOBE_NO_DOCUMENTATION)
88#if !defined(ADOBE_NO_DOCUMENTATION)
243 friend struct implementation::view_proxy_t;
245 class implementation_t;
246 implementation_t* object_m;
iterator add_placeable(iterator parent, const layout_attributes_t &initial, bool is_container_type, poly_placeable_t &placeable, bool reverse=false)
Adds a new view element to the view hierarchy being formed for layout.
void print_debug(std::ostream &os)
Print the current state of the view proxy forest to stderr.
forest< implementation::view_proxy_t > proxy_tree_t
std::pair< int, int > adjust(evaluate_options_t options, int width, int height)
Adjusts the solved view layout to fit within the newly specified dimensions. Eve will relay the new s...
void set_visible(iterator, bool)
set_visible
std::pair< int, int > evaluate(evaluate_options_t options, int width=0, int height=0)
This call performs the layout, it will call each element to get its dimentions, solve the layout,...
void set_layout_attributes(iterator, const layout_attributes_t &)
set_layout_attributes
proxy_tree_t::iterator iterator
A homogeneous hierarchical structure class.
implementation::forest_iterator< implementation::view_proxy_t > iterator
void set_margin(layout_attributes_t &container, int x)
int width(const place_data_t &place_data)
int height(const place_data_t &place_data)
poly< placeable > poly_placeable_t
convenience typedef.
void reverse(BidirectionalRange &range)
reverse implementation
A utility class for referencing the two slices of a extents_t.
Layout data interface from the client to the engine.
Representative of PlaceableConcept so that placeable models PlaceableConcept when T does.