Removing unused parameter names in order to avoid warnings
-> no warning anymore in zigzag-persistence
--- a/include/topology/zigzag-persistence.h Wed Aug 12 11:32:42 2009 -0700
+++ b/include/topology/zigzag-persistence.h Wed Aug 12 07:16:35 2009 -0700
@@ -127,7 +127,7 @@
ZIndex new_z_in_remove(ZigzagPersistence& zz);
- void erasing_z(ZigzagPersistence& zz, ZIndex j) {}
+ void erasing_z(ZigzagPersistence&, ZIndex) {}
Death death(ZigzagPersistence& zz, ZIndex dying_z);
};
--- a/include/topology/zigzag-persistence.hpp Wed Aug 12 11:32:42 2009 -0700
+++ b/include/topology/zigzag-persistence.hpp Wed Aug 12 07:16:35 2009 -0700
@@ -414,7 +414,7 @@
template<class BID, class SD>
bool
ZigzagPersistence<BID,SD>::
-check_consistency(SimplexIndex s_skip, ZIndex z_skip, BIndex b_skip)
+check_consistency(SimplexIndex, ZIndex, BIndex)
{
#ifdef ZIGZAG_CONSISTENCY
#warning "Checking consistency in ZigzagPersistence"
@@ -684,7 +684,7 @@
template<class BID, class SD>
typename ZigzagPersistence<BID,SD>::ZIndex
ZigzagPersistence<BID,SD>::ZigzagVisitor::
-new_z_in_add(ZigzagPersistence& zz, const ZColumn& z, const BRow& u)
+new_z_in_add(ZigzagPersistence& zz, const ZColumn&, const BRow&)
{
int order = zz.z_list.empty() ? 0 : boost::prior(zz.z_list.end())->order + 1;
zz.z_list.push_back(ZNode(order, zz.b_list.end()));
@@ -694,7 +694,7 @@
template<class BID, class SD>
typename ZigzagPersistence<BID,SD>::BIndex
ZigzagPersistence<BID,SD>::ZigzagVisitor::
-select_j_in_remove(ZigzagPersistence& zz, const CRow& c_row)
+select_j_in_remove(ZigzagPersistence&, const CRow& c_row)
{
return c_row.front();
}
@@ -712,7 +712,7 @@
template<class BID, class SD>
typename ZigzagPersistence<BID,SD>::Death
ZigzagPersistence<BID,SD>::ZigzagVisitor::
-death(ZigzagPersistence& zz, ZIndex dying_z)
+death(ZigzagPersistence&, ZIndex dying_z)
{
return Death(dying_z->birth);
}
--- a/include/utilities/containers.h Wed Aug 12 11:32:42 2009 -0700
+++ b/include/utilities/containers.h Wed Aug 12 07:16:35 2009 -0700
@@ -188,16 +188,17 @@
typedef vector<T> Container;
typedef SizeStorage<Container> Self;
- SizeStorage(size_t size = 0) {}
+ SizeStorage() {}
+ SizeStorage(size_t) {}
- Self& operator+=(size_t inc) { return *this; }
- Self& operator-=(size_t dec) { return *this; }
+ Self& operator+=(size_t) { return *this; }
+ Self& operator-=(size_t) { return *this; }
Self& operator++() { return *this; }
Self operator++(int) { return *this; }
Self& operator--() { return *this; }
Self operator--(int) { return *this; }
size_t size(const Container& c) const { return c.size(); }
- void swap(SizeStorage& other) {}
+ void swap(SizeStorage&) {}
void clear() {}
};
@@ -209,16 +210,17 @@
typedef deque<T> Container;
typedef SizeStorage<Container> Self;
- SizeStorage(size_t size = 0) {}
+ SizeStorage() {}
+ SizeStorage(size_t) {}
- Self& operator+=(size_t inc) { return *this; }
- Self& operator-=(size_t dec) { return *this; }
+ Self& operator+=(size_t) { return *this; }
+ Self& operator-=(size_t) { return *this; }
Self& operator++() { return *this; }
Self operator++(int) { return *this; }
Self& operator--() { return *this; }
Self operator--(int) { return *this; }
size_t size(const Container& c) const { return c.size(); }
- void swap(SizeStorage& other) {}
+ void swap(SizeStorage&) {}
void clear() {}
};