43 ListBaseT<TreeElement> tree = {
nullptr};
47 {.lb = &tree, .index = -1, .persistent_ptr = source_data.
bmain});
48 current_file_te->
name =
IFACE_(
"Current File");
51 build_hierarchy_for_lib_or_main(source_data.
bmain, *current_file_te);
54 if (current_file_te->
subtree.is_empty()) {
56 dummy_te->
name =
IFACE_(
"No Library Overrides");
62 lib =
static_cast<Library *
>(lib->id.next))
65 build_hierarchy_for_lib_or_main(source_data.
bmain, *tenlib, lib);
69 for (
TreeElement &top_level_te : tree.items_mutable()) {
70 if (&top_level_te == current_file_te) {
74 if (top_level_te.subtree.is_empty()) {
97 struct HierarchyBuildData {
98 const ID &override_root_id_;
112 : tree_display_(tree_display),
113 space_outliner_(space_outliner),
115 id_relations_(id_relations)
122 void build_hierarchy_for_ID_recursive(
const ID &parent_id,
123 HierarchyBuildData &build_data,
127ListBaseT<TreeElement> TreeDisplayOverrideLibraryHierarchies::build_hierarchy_for_lib_or_main(
130 ListBaseT<TreeElement> tree = {
nullptr};
148 if (iter_id->
lib !=
lib) {
153 TreeElement *new_te = add_element<TreeElementIDBase>(
154 {.parent = &parent_te,
155 .index = base_index++,
156 .owner_id = reinterpret_cast<ID *>(lib),
157 .persistent_ptr = bmain});
162 TreeElement *new_id_te =
add_id_element({.parent = new_base_te, .expand =
false}, iter_id);
164 builder.build_hierarchy_for_ID(*iter_id, *new_id_te);
176 HierarchyBuildData build_data{override_root_id};
177 build_hierarchy_for_ID_recursive(override_root_id, build_data, te_to_expand);
190 const ID &relationship_parent_id,
191 const ID &override_root_id);
193void OverrideIDHierarchyBuilder::build_hierarchy_for_ID_recursive(
const ID &parent_id,
194 HierarchyBuildData &build_data,
198 build_data.parent_ids.add(&parent_id);
202 if (&
id == &parent_id) {
211 if (build_data.parent_ids.lookup_key_default(&
id,
nullptr)) {
217 if (build_data.sibling_ids.lookup_key_default(&
id,
nullptr)) {
232 new_te = tree_display_.add_element<TreeElementShapeKeyBase>(
233 {.parent = &te_to_expand, .expand =
false}, *
reinterpret_cast<Key *
>(&id));
236 new_te = tree_display_.add_id_element({.parent = &te_to_expand, .expand =
false}, &id);
239 build_data.sibling_ids.add(&
id);
242 HierarchyBuildData child_build_data{build_data.override_root_id_};
243 child_build_data.parent_ids = build_data.parent_ids;
244 child_build_data.parent_ids.add(&
id);
245 child_build_data.sibling_ids.reserve(10);
246 build_hierarchy_for_ID_recursive(
id, child_build_data, *new_te);
281 to_id_entry = to_id_entry->
next)
284 ID &target_id = *to_id_entry->id_pointer.to;
294 const Object &potential_child_ob =
reinterpret_cast<const Object &
>(target_id);
295 if (potential_child_ob.
parent) {
311 from_id_entry = from_id_entry->
next)
313 ID &potential_child_id = *from_id_entry->id_pointer.from;
319 const Object &potential_child_ob =
reinterpret_cast<Object &
>(potential_child_id);
320 if (!potential_child_ob.
parent || &potential_child_ob.
parent->
id != &parent_id) {
333 const ID &relationship_parent_id,
334 const ID &override_root_id)
339 const ID *real_override_id = &
id;
345 const_cast<ID *
>(&
id),
346 const_cast<ID *
>(&relationship_parent_id),
347 const_cast<ID **
>(&real_override_id));
#define FOREACH_MAIN_ID_END
#define FOREACH_MAIN_ID_BEGIN(_bmain, _id)
#define ID_IS_OVERRIDE_LIBRARY_VIRTUAL(_id)
#define ID_IS_OVERRIDE_LIBRARY_REAL(_id)
#define ID_IS_OVERRIDE_LIBRARY(_id)
#define ID_IS_OVERRIDE_LIBRARY_HIERARCHY_ROOT(_id)
Value & lookup_or_add_cb(const Key &key, const CreateValueF &create_value)
Base Class For Tree-Displays.
TreeElement * add_id_element(const TreeElementAddParams ¶ms, ID *id)
AbstractTreeDisplay(SpaceOutliner &space_outliner)
SpaceOutliner & space_outliner_
TreeElement * add_element(const TreeElementAddParams ¶ms, Args &&...args)
static void uncollapse_by_default(TreeElement *legacy_te)
void build_hierarchy_for_ID(ID &root_id, TreeElement &te_to_expand)
OverrideIDHierarchyBuilder(AbstractTreeDisplay &tree_display, SpaceOutliner &space_outliner, Main &bmain, MainIDRelations &id_relations)
bool is_lazy_built() const override
TreeDisplayOverrideLibraryHierarchies(SpaceOutliner &space_outliner)
ListBaseT< TreeElement > build_tree(const TreeSourceData &source_data) override
static DynamicLibrary lib
const char * outliner_idcode_to_plural(short idcode)
static void foreach_natural_hierarchy_child(const MainIDRelations &id_relations, const ID &parent_id, FunctionRef< ForeachChildReturn(ID &)> fn)
static bool id_is_in_override_hierarchy(const Main &bmain, const ID &id, const ID &relationship_parent_id, const ID &override_root_id)
void outliner_free_tree_element(TreeElement *element, ListBaseT< TreeElement > *parent_subtree)
@ TE_PRETEND_HAS_CHILDREN
void BKE_main_relations_free(Main *bmain)
void BKE_main_relations_create(Main *bmain, short flag)
ID_Type GS(const char *name)
IDOverrideLibrary * BKE_lib_override_library_get(Main *bmain, ID *id, ID *owner_id_hint, ID **r_owner_id)
#define TSELEM_OPEN(telm, sv)
struct ID * hierarchy_root
IDOverrideLibrary * override_library
MainIDRelationsEntryItem * next
MainIDRelationsEntryItem * from_ids
MainIDRelationsEntryItem * to_ids
Map< const ID *, MainIDRelationsEntry * > * relations_from_pointers
MainIDRelations * relations
ListBaseT< Library > libraries
ListBaseT< TreeElement > subtree
The data to build the tree from.
Establish and manage Outliner trees for different display modes.