- c - 在位数组中找到第一个零
- linux - Unix 显示有关匹配两种模式之一的文件的信息
- 正则表达式替换多个文件
- linux - 隐藏来自 xtrace 的命令
我的代码似乎有问题,想知道你们是否可以帮助我找到问题...我已经尝试使用 gdb 和 valgrind,后者“更有用”,但我仍然无法修复我的错误.
下面是我的类(class)代码(这是我的缩小版本,但问题的主要本质仍然存在):
/* vector .h */
template<typename _TYPE_, Int _SIZE_>
class Vec
{
public:
Vec(void);
Vec(const Vec<_TYPE_,_SIZE_>& vec);
virtual ~Vec(void);
Boolean operator==(const Vec<_TYPE_,_SIZE_>& vec ) const;
Boolean operator!=(const Vec<_TYPE_,_SIZE_>& vec ) const;
Boolean operator< (const Vec<_TYPE_,_SIZE_>& vec ) const;
Boolean operator> (const Vec<_TYPE_,_SIZE_>& vec ) const;
Boolean operator<=(const Vec<_TYPE_,_SIZE_>& vec ) const;
Boolean operator>=(const Vec<_TYPE_,_SIZE_>& vec ) const;
const _TYPE_& operator[](const Int index) const;
_TYPE_& operator[](const Int index);
Vec<_TYPE_,_SIZE_> operator+ (const Vec<_TYPE_,_SIZE_>& vec) const;
Vec<_TYPE_,_SIZE_> operator- (const Vec<_TYPE_,_SIZE_>& vec) const;
Vec<_TYPE_,_SIZE_> operator* (const _TYPE_ val ) const;
_TYPE_ operator* (const Vec<_TYPE_,_SIZE_>& vec) const;
Vec<_TYPE_,_SIZE_>& operator+=(const Vec<_TYPE_,_SIZE_>& vec);
Vec<_TYPE_,_SIZE_>& operator-=(const Vec<_TYPE_,_SIZE_>& vec);
Vec<_TYPE_,_SIZE_>& operator*=(const _TYPE_ val );
private:
_TYPE_* __data;
};
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_>::Vec(void)
{
me.__data = new _TYPE_[_SIZE_];
for(Int i = 0; i < _SIZE_; i++)
me.__data[i] = 0;
}
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_>::Vec(const Vec<_TYPE_,_SIZE_>& vec)
{
me.__data = new _TYPE_[_SIZE_];
for(Int i = 0; i < _SIZE_; i++)
me.__data[i] = vec[i];
}
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_>::~Vec(void)
{
printf("~Vec<%p>...", (void*)this);
if(me.__data != NOTHING)
delete[] me.__data;
}
/*******************************************************************************
* COMPARISON OPERATORS.
*******************************************************************************/
template<typename _TYPE_, Int _SIZE_>
Boolean Vec<_TYPE_,_SIZE_>::operator==(const Vec<_TYPE_,_SIZE_>& vec) const
{
if(this == &vec)
return true;
for(Int i = 0; i < _SIZE_; i++)
if(me.__data[i] != vec[i])
return false;
return true;
}
template<typename _TYPE_, Int _SIZE_>
Boolean Vec<_TYPE_,_SIZE_>::operator!=(const Vec<_TYPE_,_SIZE_>& vec) const
{
return !(me == vec);
}
template<typename _TYPE_, Int _SIZE_>
Boolean Vec<_TYPE_,_SIZE_>::operator< (const Vec<_TYPE_,_SIZE_>& vec ) const
{
if(this == &vec)
return false;
for(Int i = 0; i < _SIZE_; i++)
if(me.__data[i] >= vec[i])
return false;
return true;
}
template<typename _TYPE_, Int _SIZE_>
Boolean Vec<_TYPE_,_SIZE_>::operator> (const Vec<_TYPE_,_SIZE_>& vec ) const
{
if(this == &vec)
return false;
for(Int i = 0; i < _SIZE_; i++)
if(me.__data[i] <= vec[i])
return false;
return true;
}
template<typename _TYPE_, Int _SIZE_>
Boolean Vec<_TYPE_,_SIZE_>::operator<=(const Vec<_TYPE_,_SIZE_>& vec ) const
{
return !(me > vec);
}
template<typename _TYPE_, Int _SIZE_>
Boolean Vec<_TYPE_,_SIZE_>::operator>=(const Vec<_TYPE_,_SIZE_>& vec ) const
{
return !(me < vec);
}
/*******************************************************************************
* ELEMENT ACCESSORS.
*******************************************************************************/
template<typename _TYPE_, Int _SIZE_>
const _TYPE_& Vec<_TYPE_,_SIZE_>::operator[](const Int index) const
{
return me.__data[index];
}
template<typename _TYPE_, Int _SIZE_>
_TYPE_& Vec<_TYPE_,_SIZE_>::operator[](const Int index)
{
return me.__data[index];
}
/*******************************************************************************
* ARITHMATICAL OPERATORS.
*******************************************************************************/
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_> Vec<_TYPE_,_SIZE_>::operator+ (const Vec<_TYPE_,_SIZE_>& vec) const
{
Vec<_TYPE_,_SIZE_> tmp;
for(Int i = 0; i < _SIZE_; i++)
tmp[i] = me.__data[i] + vec[i];
return tmp;
}
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_> Vec<_TYPE_,_SIZE_>::operator- (const Vec<_TYPE_,_SIZE_>& vec) const
{
Vec<_TYPE_,_SIZE_> tmp;
for(Int i = 0; i < _SIZE_; i++)
tmp[i] = me.__data[i] - vec[i];
return tmp;
}
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_> Vec<_TYPE_,_SIZE_>::operator* (const _TYPE_ val ) const
{
Vec<_TYPE_,_SIZE_> tmp;
for(Int i = 0; i < _SIZE_; i++)
tmp[i] = me.__data[i] * val;
return tmp;
}
template<typename _TYPE_, Int _SIZE_>
_TYPE_ Vec<_TYPE_,_SIZE_>::operator* (const Vec<_TYPE_,_SIZE_>& vec) const
{
_TYPE_ tmp = 0;
for(Int i = 0; i < _SIZE_; i++)
tmp += me.__data[i] * vec[i];
return tmp;
}
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_>& Vec<_TYPE_,_SIZE_>::operator+=(const Vec<_TYPE_,_SIZE_>& vec)
{
for(Int i = 0; i < _SIZE_; i++)
me.__data[i] = me.__data[i] + vec[i];
return me;
}
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_>& Vec<_TYPE_,_SIZE_>::operator-=(const Vec<_TYPE_,_SIZE_>& vec)
{
for(Int i = 0; i < _SIZE_; i++)
me.__data[i] = me.__data[i] - vec[i];
return me;
}
template<typename _TYPE_, Int _SIZE_>
Vec<_TYPE_,_SIZE_>& Vec<_TYPE_,_SIZE_>::operator*=(const _TYPE_ val )
{
for(Int i = 0; i < _SIZE_; i++)
me.__data[i] = me.__data[i] * val;
return me;
}
/*******************************************************************************
********************************************************************************
** 3D Vector Class.
********************************************************************************
*******************************************************************************/
template<typename _TYPE_>
class Vec3 : public Vec<_TYPE_,3>
{
public:
Vec3(_TYPE_ x = 0, _TYPE_ y = 0, _TYPE_ z = 0);
Vec3(const Vec<_TYPE_,3>& vec);
~Vec3(void);
};
#define Vec3_f Vec3<Float>
template<typename _TYPE_>
Vec3<_TYPE_>::Vec3(_TYPE_ x, _TYPE_ y, _TYPE_ z)
{
me[XYZ::X] = x;
me[XYZ::Y] = y;
me[XYZ::Z] = z;
}
template<typename _TYPE_>
Vec3<_TYPE_>::Vec3(const Vec<_TYPE_,3>& vec)
{
me[XYZ::X] = vec[XYZ::X];
me[XYZ::Y] = vec[XYZ::Y];
me[XYZ::Z] = vec[XYZ::Z];
}
template<typename _TYPE_>
Vec3<_TYPE_>::~Vec3(void)
{
}
/* 物理状态.h */
class PhysicalState
{
public:
PhysicalState(Vec3_f pos = Vec3_f(1,1,1), Vec3_f rot = Vec3_f(2,2,2), Vec3_f scale = Vec3_f(3,3,3));
PhysicalState(const PhysicalState& phys);
~PhysicalState(void);
PhysicalState& operator=(const PhysicalState& phys);
//Private:
Vec3_f position;
Vec3_f rotation;
Vec3_f scale;
};
/* 物理状态.cpp */
PhysicalState::PhysicalState(Vec3_f pos, Vec3_f rot, Vec3_f scale)
{
me.position = pos;
me.rotation = rot;
me.scale = scale;
}
PhysicalState::PhysicalState(const PhysicalState& phys)
{
me.position = phys.position;
me.rotation = phys.rotation;
me.scale = phys.scale;
}
PhysicalState::~PhysicalState(void)
{
}
PhysicalState& PhysicalState::operator=(const PhysicalState& phys)
{
if(this != &phys)
{
me.position = phys.position;
me.rotation = phys.rotation;
me.scale = phys.scale;
}
return me;
}
/* 测试.cpp */
int main(void)
{
PhysicalState ps;
return 0;
}
对长度感到抱歉。这是 valgrind 的输出:
darkdivine@darkdivine-laptop:~/Development/Projects/Engines/DarkDivine$ LD_LIBRARY_PATH=./Bin/Debug/ valgrind
--track-origins=yes --leak-check=full ./Bin/Debug/Test
==18549== Memcheck, a memory error detector
==18549== Copyright (C) 2002-2009, and GNU GPL'd, by Julian Seward et al.
==18549== Using Valgrind-3.6.0.SVN-Debian and LibVEX; rerun with -h for copyright info
==18549== Command: ./Bin/Debug/Test
==18549==
==18549== Invalid free() / delete / delete[]
==18549== at 0x40244D3: operator delete[](void*) (vg_replace_malloc.c:409)
==18549== by 0x804905A: DarkDivine::Vec<float, 3>::~Vec() (Vector.h:91)
==18549== by 0x8048FE3: DarkDivine::Vec3<float>::~Vec3() (Vector.h:282)
==18549== by 0x4036B69: DarkDivine::PhysicalState::~PhysicalState() (PhysicalState.cpp:23)
==18549== by 0x8048E77: main (Test.cpp:15)
==18549== Address 0x4740128 is 0 bytes inside a block of size 12 free'd
==18549== at 0x40244D3: operator delete[](void*) (vg_replace_malloc.c:409)
==18549== by 0x804905A: DarkDivine::Vec<float, 3>::~Vec() (Vector.h:91)
==18549== by 0x8048FE3: DarkDivine::Vec3<float>::~Vec3() (Vector.h:282)
==18549== by 0x8048E3B: main (Test.cpp:13)
==18549==
==18549== Invalid free() / delete / delete[]
==18549== at 0x40244D3: operator delete[](void*) (vg_replace_malloc.c:409)
==18549== by 0x804905A: DarkDivine::Vec<float, 3>::~Vec() (Vector.h:91)
==18549== by 0x8048FE3: DarkDivine::Vec3<float>::~Vec3() (Vector.h:282)
==18549== by 0x4036B77: DarkDivine::PhysicalState::~PhysicalState() (PhysicalState.cpp:23)
==18549== by 0x8048E77: main (Test.cpp:15)
==18549== Address 0x4740168 is 0 bytes inside a block of size 12 free'd
==18549== at 0x40244D3: operator delete[](void*) (vg_replace_malloc.c:409)
==18549== by 0x804905A: DarkDivine::Vec<float, 3>::~Vec() (Vector.h:91)
==18549== by 0x8048FE3: DarkDivine::Vec3<float>::~Vec3() (Vector.h:282)
==18549== by 0x8048E04: main (Test.cpp:13)
==18549==
==18549== Invalid free() / delete / delete[]
==18549== at 0x40244D3: operator delete[](void*) (vg_replace_malloc.c:409)
==18549== by 0x804905A: DarkDivine::Vec<float, 3>::~Vec() (Vector.h:91)
==18549== by 0x8048FE3: DarkDivine::Vec3<float>::~Vec3() (Vector.h:282)
==18549== by 0x4036B9C: DarkDivine::PhysicalState::~PhysicalState() (PhysicalState.cpp:23)
==18549== by 0x8048E77: main (Test.cpp:15)
==18549== Address 0x47401a8 is 0 bytes inside a block of size 12 free'd
==18549== at 0x40244D3: operator delete[](void*) (vg_replace_malloc.c:409)
==18549== by 0x804905A: DarkDivine::Vec<float, 3>::~Vec() (Vector.h:91)
==18549== by 0x8048FE3: DarkDivine::Vec3<float>::~Vec3() (Vector.h:282)
==18549== by 0x8048DE2: main (Test.cpp:13)
==18549==
==18549==
==18549== HEAP SUMMARY:
==18549== in use at exit: 36 bytes in 3 blocks
==18549== total heap usage: 10 allocs, 10 frees, 120 bytes allocated
==18549==
==18549== 12 bytes in 1 blocks are definitely lost in loss record 1 of 3
==18549== at 0x402532E: operator new[](unsigned int) (vg_replace_malloc.c:299)
==18549== by 0x804923C: DarkDivine::Vec<float, 3>::Vec() (Vector.h:72)
==18549== by 0x8048F76: DarkDivine::Vec3<float>::Vec3(float, float, float) (Vector.h:265)
==18549== by 0x40367F1: DarkDivine::PhysicalState::PhysicalState(DarkDivine::Vec3<float>, DarkDivine::Vec3<float>, DarkDivine::Vec3<float>) (PhysicalState.cpp:6)
==18549== by 0x8048DD7: main (Test.cpp:13)
==18549==
==18549== 12 bytes in 1 blocks are definitely lost in loss record 2 of 3
==18549== at 0x402532E: operator new[](unsigned int) (vg_replace_malloc.c:299)
==18549== by 0x804923C: DarkDivine::Vec<float, 3>::Vec() (Vector.h:72)
==18549== by 0x8048F76: DarkDivine::Vec3<float>::Vec3(float, float, float) (Vector.h:265)
==18549== by 0x403681A: DarkDivine::PhysicalState::PhysicalState(DarkDivine::Vec3<float>, DarkDivine::Vec3<float>, DarkDivine::Vec3<float>) (PhysicalState.cpp:6)
==18549== by 0x8048DD7: main (Test.cpp:13)
==18549==
==18549== 12 bytes in 1 blocks are definitely lost in loss record 3 of 3
==18549== at 0x402532E: operator new[](unsigned int) (vg_replace_malloc.c:299)
==18549== by 0x804923C: DarkDivine::Vec<float, 3>::Vec() (Vector.h:72)
==18549== by 0x8048F76: DarkDivine::Vec3<float>::Vec3(float, float, float) (Vector.h:265)
==18549== by 0x4036843: DarkDivine::PhysicalState::PhysicalState(DarkDivine::Vec3<float>, DarkDivine::Vec3<float>, DarkDivine::Vec3<float>) (PhysicalState.cpp:6)
==18549== by 0x8048DD7: main (Test.cpp:13)
==18549==
==18549== LEAK SUMMARY:
==18549== definitely lost: 36 bytes in 3 blocks
==18549== indirectly lost: 0 bytes in 0 blocks
==18549== possibly lost: 0 bytes in 0 blocks
==18549== still reachable: 0 bytes in 0 blocks
==18549== suppressed: 0 bytes in 0 blocks
==18549==
==18549== For counts of detected and suppressed errors, rerun with: -v
==18549== ERROR SUMMARY: 6 errors from 6 contexts (suppressed: 63 from 6)
提前感谢任何可以帮助我的人,这让我发疯了!!广东省。
附言:我=(*这个); 什么都没有 = 0;
最佳答案
您的 vector 类有一个指针成员,但没有定义赋值运算符。赋值发生在 PhysicalState 的构造函数中,您可以在其中按值传递 Vectors。
使用 std::vector 或 boost::array。请。
关于c++ - g++ Double Free 或腐败...但是如何?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/3153966/
我目前正在尝试让 g++ 工作,并查看 http://gcc.gnu.org/install/build.html ,我似乎找不到它在哪里说如何“执行编译器的 3 阶段 bootstrap ”。我在哪
James Powell 在他对即将举行的演示文稿的简短描述中说,他自豪地发明了最粗糙的 Python 单行代码之一: (None for g in g if (yield from g) and F
请告诉我我的证明是否正确 We have a connected graph, and specific vertex u in V(G). Suppose we compute the dfs tr
下面的test2和test3结果是不同的。 我对此感到困惑,因为它看起来像相同的逻辑,并且与linux bash ||逻辑不同。 $data = @( [PSCustomObject]@{St
我试图找到一个明确的 G 代码语法规范,而不是单个 G 代码的含义,我无处不在的规范,我的意思是详细的语法规范,目的是编写解析器。 我编写解析器没有问题,我只是在寻找语法规范,例如。我知道您不必总是为
我写了这个 mixin,但它循环了很多时间。你能帮我优化我的代码吗?或者你能建议一些其他的东西来获得想要的结果吗? dfgdfgsdfgsdf 最佳答案 希望这就是您要找的。 $spaces: (4,
默认情况下,g++ 似乎会省略未使用的类内定义方法的代码。示例 from my previous question : struct Foo { void bar() {} void baz(
是否可以将文件内容通过管道传送到 g++编译程序? 我想这样做是因为我想使用数据库中的文件而不是磁盘上的物理文件。可以通过我制作的 API 轻松检索文件内容。 例如,我想做这样的事情: g++ con
如何profile c++代码获取每行代码的调用次数和消耗时间,就像profile工具一样在 Matlab 中呢? 我尝试使用-fprofile-arcs之类的东西,但它只生成代码覆盖率报告,其中可以
如何在几行代码上禁用所有警告。可以使用 GCC 诊断功能禁用特定警告,但是否有针对所有警告的标志。我尝试了这个方法,但不起作用 #pragma GCC diagnostic push #pragma
我有一个链接到 opencv 2.2 的可执行文件。但是,我删除了 opencv 2.2 并安装了 opencv 2.3。 问题是,有没有办法在不重新编译整个源代码的情况下将这个可执行文件链接到新的共
在编译带有一些标志的以下文件时,是否可以让 g++ 显示错误? #include using namespace std; int main() { int arr[ 2 ]; cout
在学习 Haskell 时,我遇到了一个挑战,要找到两个函数 f 和 g,例如 f g 和 f 。 g 是等价的(并且是总计,因此像 f = undefined 或 f = (.) f 这样的东西不算
根据我的理解,Theta 位于 Big O 和 Omega 之间,但我看到了这个声明,但我无法理解为什么交集会出现在这里。我能否对 Θ(g(n)) = O(g(n)) ∩ Ω(g(n)) 获得数学和分
我需要为这个递归函数编写一个迭代函数。 int funcRec(int n){ if(n>1) { return 2*funcRec(n - 1) + 3*funcRec(n
我在 github repository 上有代码示例并在 travis-ci 上创建了一个构建便于复制。 最小的、完整的和可验证的例子 可能不是最小的,但我相信它足够小 它使用 boost.inte
编辑:我们将调用箭头 p纯如果存在这样的函数f即:p = arr f . 我试图更好地掌握 Haskell 中的 Arrows,我想弄清楚什么时候 f >>> (g &&& h) = (f >>> g
我有两个(或更多)函数定义为: val functionM: String => Option[Int] = s => Some(s.length) val functionM2: Int => Op
好像是的。任何直观或严肃的证据都值得赞赏。 最佳答案 没有。 我认为您的问题等同于:给定函数 f 和 g,f 是 O(g) 或 g 是 O(f) 是否总是正确的?这在 SE Computer Scie
如果我设法证明 f(n) = o(g(n))(小 o),那么这两个函数的总和 f( n) + g(n) 应该被“更大”的函数 g(n) 紧紧束缚。 然而,我在证明这一点时遇到了一些麻烦。 最佳答案 以
我是一名优秀的程序员,十分优秀!