抛出 std::length_error 的实例，示例需要 boost答案

【问题标题】：throwing an instance of std::length_error, example requires boost抛出 std::length_error 的实例，示例需要 boost
【发布时间】：2014-11-18 15:33:22
【问题描述】：

这是我的第一个 c++ 项目，所以初学者可能会失败。还是要学很多东西的。

我通过将连接的圆柱体与点云库拟合来对树木（真正的户外树木）进行建模。在我的真实场景中，我检测到大约 3000 个圆柱体，我想将它们存储到具有两个级别的树（信息树）结构中。

如果两个圆柱的终点和起点重合，我建立父子关系。我从根圆柱体开始并检测它的子项。对于每个孩子，这也是递归执行的。只要一个圆柱体只有一个孩子，我就会将它添加到一个带有圆柱体向量的所谓段中。如果 child 的 children 大小也为 1，则将孙子添加到同一段，依此类推。如果一个圆柱体有多个子项，则当前段停止并为每个子项创建一个新段。所有段也都有父子信息，因此我可以在两个方向上遍历树。

我已经设置了一个最小的运行示例来重现错误。而不是 7 个参数圆柱体，我的测试圆柱体只有一个 start int 和一个 end int。头文件和cpp文件：

TestCylinder.h

#ifndef TESTCYLINDER_H
#define TESTCYLINDER_H


class TestCylinder
{
public:
int start;
int end;
TestCylinder(int a, int b);
virtual ~TestCylinder();
protected:
private:
};

#endif // TESTCYLINDER_H

TestCylinder.cpp

#include "TestCylinder.h"

TestCylinder::TestCylinder(int a, int b)
{
    start = a;
    end = b;
}

TestCylinder::~TestCylinder()
{
     //dtor
}

段（它们代表两个分支部分之间的分支部分或茎部分）。父段用指针引用，子段存储在向量中：

TestSegment.h：

#ifndef TESTSEGMENT_H
#define TESTSEGMENT_H

#include "TestCylinder.h"
#include <vector>
#include <boost/shared_ptr.hpp>
#include <boost/make_shared.hpp>

class TestSegment
{
public:
    TestSegment(TestCylinder cylinder, boost::shared_ptr<TestSegment> parent);
    TestSegment(TestCylinder cylinder);
    TestSegment();
    virtual ~TestSegment();
    std::vector<TestCylinder> getCylinders();
    boost::shared_ptr<TestSegment> getParentSegment();
    std::vector<TestSegment> getChildSegments();
    bool addCylinder(TestCylinder nextCylinder);

protected:
private:
    std::vector<TestCylinder> cylinders;
    std::vector<TestSegment> childSegments;
    boost::shared_ptr<TestSegment>  parentSegment;
};

#endif // TESTSEGMENT_H

TestSegment.cpp：

#include "TestSegment.h"

TestSegment::TestSegment(TestCylinder cylinder)
{
    cylinders.empty();
    cylinders.push_back(cylinder);
}
TestSegment::TestSegment(TestCylinder cylinder, boost::shared_ptr<TestSegment> parent)
{
    cylinders.empty();
    cylinders.push_back(cylinder);
    parentSegment = parent;
}
TestSegment::~TestSegment()
{
}

std::vector<TestCylinder>
TestSegment::getCylinders()
{
    return cylinders;
}

boost::shared_ptr<TestSegment>
TestSegment::getParentSegment()
{
    return parentSegment;
}

std::vector<TestSegment>
TestSegment::getChildSegments()
{
    return childSegments;
}

bool TestSegment::addCylinder(TestCylinder nextCylinder)
{
    TestCylinder endCylinder = cylinders.back();
    int x1 = endCylinder.end;
    int x2 = nextCylinder.start;
    if(x1==x2)
    {
        cylinders.push_back(nextCylinder);
        return true;
    }
    return false;
}

还有树类，它构建了树形结构并提供了一些方法来遍历段/圆柱体：

TestTree.h：

#ifndef TESTTREE_H
#define TESTTREE_H
#include "TestSegment.h"

class TestTree
{
public:
    TestTree(std::vector<TestCylinder> cylinders_in);
    virtual ~TestTree();

    /*
     * Getters and Setters
     */
    TestCylinder&
    getRootCylinder ();
    void
    setRootCylinder (TestCylinder rootCylinderNew);
    boost::shared_ptr<TestSegment>&
    getRootSegment ();
    void
    setRootSegment (boost::shared_ptr<TestSegment> rootSegmentNew);


    void addChildCylinders(TestCylinder& currentCylinder, TestSegment& segment);
    std::vector<TestCylinder>
    getChildCylinders(TestCylinder& currentCylinder);
    std::vector<TestSegment>
    getSegmentList ();
    std::vector<TestCylinder>
    getCylinderList ();

protected:
private:
    std::vector<TestCylinder> cylinders ;
    boost::shared_ptr<TestSegment> rootSegment;
    std::vector<TestSegment> getChildSegmentsRecursively(TestSegment parent);
};

#endif // TESTTREE_H

TestTree.cpp

#include "TestTree.h"


TestTree::TestTree(std::vector<TestCylinder> cylinders_in)
{
    cylinders = cylinders_in;
    TestCylinder rootCylinder = cylinders.at(0);
    TestSegment root(rootCylinder);
    rootSegment = boost::make_shared<TestSegment>(root);
    addChildCylinders(rootCylinder,*rootSegment);
}

TestTree::~TestTree()
{
    //dtor
}


std::vector<TestCylinder>
TestTree::getCylinderList ()
{

    std::vector<TestCylinder> cylinders;
    std::cout << "GetCylinderList before getSegmentsList" << "\n";
    std::vector<TestSegment> allSegments = getSegmentList();
    std::cout << "GetCylinderList after getSegmentsList" << allSegments.size()<<"\n";
    for(std::vector<TestSegment>::iterator it = allSegments.begin(); it!= allSegments.end(); ++it)
    {
        TestSegment segment = *it;
        //std::cout << segment.getSegmentCylinders().size();
        cylinders.insert(cylinders.end(),segment.getCylinders().begin(), segment.getCylinders().end());
    }
    return cylinders;
}

std::vector<TestSegment>
TestTree::getSegmentList ()
{
//    std::cout<<"GetSegmentList rootsegment size :"<< rootSegment->get.size()<<"\n";
    return getChildSegmentsRecursively(*rootSegment);
}

std::vector<TestSegment>
TestTree::getChildSegmentsRecursively(TestSegment parent)
{

    std::vector<TestSegment> allSegments;
    allSegments.push_back(parent);
    for(std::vector<TestSegment>::iterator it = parent.getChildSegments().begin (); it != parent.getChildSegments().end (); ++it)
    {
        TestSegment child = *it;
        std::vector<TestSegment> children = getChildSegmentsRecursively(child);
        allSegments.insert(allSegments.end(),children.begin(),children.end());
    }
    //std::cout << "TestTree geChildSegmentsRecursively" << parent.getChildSegments().size()<< "\n";
    return allSegments;
}


void TestTree::addChildCylinders(TestCylinder& currentCylinder, TestSegment& segment)
{
    std::vector<TestCylinder> children = getChildCylinders(currentCylinder);
    if(children.size()==1)
    {
        TestCylinder child = children.at(0);
        if(segment.addCylinder(child))
        {
        addChildCylinders(child,segment);
        }
    }
    else if (children.size()>1)
    {
        for (std::vector<TestCylinder>::iterator it = children.begin (); it != children.end (); ++it)
        {
            TestCylinder child = *it;
            boost::shared_ptr<TestSegment> seg_ptr = boost::make_shared<TestSegment>(segment);
            TestSegment childSegment (child, seg_ptr);
            if (childSegment.getParentSegment() == rootSegment)
            {
                std::cout << "TestTreeCpp::addChildCylinders, rootSegment is parentSegment \n";
            }
            addChildCylinders(child,childSegment);
        }
    }
}


std::vector<TestCylinder>
TestTree::getChildCylinders(TestCylinder& currentCylinder)
{
    std::vector<TestCylinder> children;

    for (std::vector<TestCylinder>::iterator it = cylinders.begin (); it != cylinders.end (); ++it)
    {
        TestCylinder cylinder = *it;
        if(currentCylinder.end == cylinder.start)
        {
            children.push_back(cylinder);
        }
    }
    return children;
}


/*
 * Getters and Setters
 */



TestCylinder&
TestTree::getRootCylinder ()
{
    TestSegment root = *rootSegment;
    return root.getCylinders().at(0);
}


boost::shared_ptr<TestSegment>&
TestTree::getRootSegment ()
{
    return rootSegment;
}

//void
//TestTree::setRootSegment (SegmentModel rootSegmentNew)
//{
//    rootSegment = rootSegmentNew;
//}

主函数，只创建 6 个连接的圆柱体并使用此列表调用树：

int
main (int argc,
      char** argv)
{

    // ------------------------------------
    // -----Load Cherry 1             -----
    // ------------------------------------
    std::vector<TestCylinder> cylinders;
    TestCylinder cyl(0,1);
    cylinders.push_back(cyl);
    TestCylinder cyl2(1,2);
    cylinders.push_back(cyl2);
    TestCylinder cyl3(2,3);
    cylinders.push_back(cyl3);
    TestCylinder cyl4(3,4);
    cylinders.push_back(cyl4);
    TestCylinder cyl5(3,14);
    cylinders.push_back(cyl5);
    TestCylinder cyl6(14,15);
    cylinders.push_back(cyl6);

    std::cout << cylinders.size() << "\n";
    TestTree tree (cylinders);
    std::cout << tree.getCylinderList().size() << "\n";
}

建树可能可行，调用getCylinderList函数时出现以下错误：

terminate called after throwing an instance of 'std::length_error'
  what():  vector::_M_range_insert
Aborted (core dumped)

Possible dublicate 对我没有帮助，因为我在迭代时不会添加或删除项目。

【问题讨论】：

这里有很多代码。你能把它烧成更简单、独立的东西吗？
很难让它更简单，因为我认为我已经从我的主项目中删除了不必要的功能。可以使每个变量都公开，从而摆脱 getter 和 setter。自我包含是指将所有内容放在一个文件中并摆脱标题？
自包含我的意思是：sscce.org
明天将在一个文件中更新代码。

标签： c++ boost tree

【解决方案1】：

问题在于 TestSegment 按值返回向量，例如在 TestSegment::getChildSegments 中。这意味着，您制作了向量的副本。

现在，在 getCylinderlist 中，您使用参数 segment.getCylinders().begin() 和 segment.getCylinders( ）。结尾（）。但是这两个对 getCylinders 的调用不会返回相同的向量，而是每个向量的单独副本。所以你本质上说的是

std::vector< TestCylinder > c1 = segment.getCylinders();
std::vector< TestCylinder > c2 = segment.getCylinders();
cylinders.insert( cylinders.end(), c1.begin(), c2.end() )

c1和c2不一样，这就是代码失败的原因。

TestSegment::getChildSegments 也会出现同样的问题。

要解决这个问题，您应该通过 const& 返回向量。

希望对您有所帮助。

【讨论】：

附注（与问题无关）：对 cylinders.empty(); 的调用不是必需的，也可能不是您想要的： - 创建后 std::vector 始终为空 - std::vector::empty() 只是告诉您向量是否为空，它不会修改向量。您正在寻找的功能可能是 std::vector::clear
感谢两位有用的 cmets。还没有上传我的代码，已经离开了我的办公室，所以我明天继续。