Is there a convenient way to erase a node from a p

2020-03-05 06:33发布

I want to delete a node from a boost property tree, but I want to preserve its children and connect them to the parent of the deleted node (i.e. to their grandparent node). Is there an elegant way to achieve this?

2条回答
闹够了就滚
2楼-- · 2020-03-05 06:58

I had to do something similar.

I used an iterator with recursion and copied the child before removing the node and branching it back on a newly created one.

But I guess the full copy of each trees before removing to be quite resources-consuming so you can only do it with relatively small trees and it isn't really elegant.

查看更多
戒情不戒烟
3楼-- · 2020-03-05 07:13

This might be the most efficient way to move the grandchildren:

std::move(middle.begin(), middle.end(), back_inserter(parent));

Full sample

Live On Coliru

#include <boost/property_tree/ptree.hpp>
#include <boost/property_tree/json_parser.hpp>

using boost::property_tree::ptree;
using boost::property_tree::read_json;
using boost::property_tree::write_json;

int main() {

    std::istringstream iss(R"({ "a" : { "middle" : { "a1":1, "a2":2, "a3":3 }, "more":"stuff" } })");
    ptree pt;
    read_json(iss, pt);

    auto& parent = pt.get_child("a");
    auto& middle = pt.get_child("a.middle");

    std::move(middle.begin(), middle.end(), back_inserter(parent));
    parent.erase("middle");

    write_json(std::cout, pt);

}

Sample json output:

{
    "a": {
        "more": "stuff",
        "a1": "1",
        "a2": "2",
        "a3": "3"
    }
}
查看更多
登录 后发表回答