@@ -142,48 +142,9 @@ void EngravingElementsProvider::dumpTree(const mu::engraving::EngravingItem* ite
142142
143143void EngravingElementsProvider::dumpTreeTree (const mu::engraving::EngravingObject* obj, int & level)
144144{
145- ++level;
146- QString gap;
147- gap.fill (' ' , level);
148- LOGD () << gap << obj->typeName ();
149-
150- for (const mu::engraving::EngravingObject* child : obj->scanChildren ()) {
151- dumpTreeTree (child, level);
152- }
153-
154- --level;
155145}
156146
157147void EngravingElementsProvider::checkObjectTree (const mu::engraving::EngravingObject* obj)
158148{
159- mu::engraving::EngravingObject* p1 = obj->parent ();
160- mu::engraving::EngravingObject* p2 = obj->scanParent ();
161- if (p1 && p2 && p1 != p2) {
162- LOGD () << " obj: " << obj->typeName ();
163- LOGD () << " parents is differens, p1: " << p1->typeName () << " , p2: " << p2->typeName ();
164- }
165-
166- size_t ch1 = obj->children ().size ();
167- size_t ch2 = obj->scanChildren ().size ();
168- if (ch1 != ch2) {
169- LOGD () << " obj: " << obj->typeName ();
170- LOGD () << " chcount is differens, ch1: " << ch1 << " , ch2: " << ch2;
171-
172- LOGD () << " children1:" ;
173- for (size_t i = 0 ; i < obj->children ().size (); ++i) {
174- LOGD () << i << " : " << obj->children ().at (i)->typeName ();
175- }
176-
177- LOGD () << " children2:" ;
178-
179- int i = 0 ;
180- for (const mu::engraving::EngravingObject* child : obj->scanChildren ()) {
181- LOGD () << i++ << " : " << child->typeName ();
182- }
183- }
184-
185- for (const mu::engraving::EngravingObject* ch : obj->children ()) {
186- checkObjectTree (ch);
187- }
188149}
189150}
0 commit comments