File tree Expand file tree Collapse file tree 2 files changed +2
-4
lines changed Expand file tree Collapse file tree 2 files changed +2
-4
lines changed Original file line number Diff line number Diff line change @@ -67,7 +67,6 @@ namespace dynamicgraph {
67
67
{
68
68
for (std::size_t i = 0 ; i < signalsIN.size (); ++i) {
69
69
_removeSignal (i);
70
- delete signalsIN[i];
71
70
}
72
71
};
73
72
@@ -98,7 +97,7 @@ namespace dynamicgraph {
98
97
void removeSignal ()
99
98
{
100
99
assert (signalsIN.size ()>0 );
101
- _removeSignal (signalsIN () .size ()-1 );
100
+ _removeSignal (signalsIN.size ()-1 );
102
101
// names.pop_back();
103
102
signalsIN.pop_back ();
104
103
}
Original file line number Diff line number Diff line change @@ -961,7 +961,7 @@ namespace dynamicgraph {
961
961
AdderVariadic () : coeffs () {}
962
962
void operator ()( const std::vector<const T*>& vs, T& res ) const
963
963
{
964
- assert (vs.size () == coeffs.size ());
964
+ assert (vs.size () == (std:: size_t ) coeffs.size ());
965
965
if (vs.size () == 0 ) return ;
966
966
res = coeffs[0 ]*(*vs[0 ]);
967
967
for (std::size_t i = 1 ; i < vs.size (); ++i)
@@ -1088,7 +1088,6 @@ namespace dynamicgraph {
1088
1088
// TODO computation could be optimized with lazy evaluation of the
1089
1089
// signals. When the output result is know, the remaining signals are
1090
1090
// not computed.
1091
- assert (vs.size () == coeffs.size ());
1092
1091
if (vs.size () == 0 ) return ;
1093
1092
res = *vs[0 ];
1094
1093
for (std::size_t i = 1 ; i < vs.size (); ++i)
You can’t perform that action at this time.
0 commit comments