> Overall looks very good to me.
>
> 133 + std::list<AbstractPlacesGroup*> groups;
> 134 +
> 135 + std::transform(children.begin(), children.end(),
> std::back_inserter(groups),
> 136 + [](Area* obj) -> AbstractPlacesGroup*
> 137 + {
> 138 + return static_cast<AbstractPlacesGroup*>(obj);
> 139 + });
>
> I this really much more optimized, than using a normal loop? I mean, it's a
> nice C++ code, but it could look more cryptic than it really is :)
> Overall looks very good to me. AbstractPlacesG roup*> groups; children. begin() , children.end(), inserter( groups) , roup* cast<AbstractPl acesGroup* >(obj);
>
> 133 + std::list<
> 134 +
> 135 + std::transform(
> std::back_
> 136 + [](Area* obj) -> AbstractPlacesG
> 137 + {
> 138 + return static_
> 139 + });
>
> I this really much more optimized, than using a normal loop? I mean, it's a
> nice C++ code, but it could look more cryptic than it really is :)
Not sure, how do you prefer?