31 lines
1.2 KiB
Diff
31 lines
1.2 KiB
Diff
--- foo/foo/foo/boost/math/special_functions/fpclassify.hpp
|
|
+++ foo/foo/foo/boost/math/special_functions/fpclassify.hpp
|
|
@@ -100,6 +100,7 @@
|
|
#ifdef isnan
|
|
return isnan(t);
|
|
#elif defined(BOOST_MATH_DISABLE_STD_FPCLASSIFY) || !defined(BOOST_HAS_FPCLASSIFY)
|
|
+ (void) t;
|
|
return false;
|
|
#else // BOOST_HAS_FPCLASSIFY
|
|
return (BOOST_FPCLASSIFY_PREFIX fpclassify(t) == (int)FP_NAN);
|
|
--- foo/foo/foo/boost/multi_array/base.hpp
|
|
+++ foo/foo/foo/boost/multi_array/base.hpp
|
|
@@ -501,6 +501,7 @@
|
|
// the "far side" of the range (the top if stride is positive, the bottom
|
|
// if stride is negative).
|
|
index bound_adjustment = stride < 0 ? 1 : 0;
|
|
+ (void) bound_adjustment;
|
|
BOOST_ASSERT(((index_bases[n] - bound_adjustment) <= finish) &&
|
|
(finish <= (index_bases[n] + index(extents[n]) - bound_adjustment)));
|
|
#endif // BOOST_DISABLE_ASSERTS
|
|
--- foo/foo/foo/boost/unordered/detail/table.hpp
|
|
+++ foo/foo/foo/boost/unordered/detail/table.hpp
|
|
@@ -458,6 +458,7 @@
|
|
// According to 23.2.1.8, if propagate_on_container_swap is
|
|
// false the behaviour is undefined unless the allocators
|
|
// are equal.
|
|
+ (void) other;
|
|
BOOST_ASSERT(node_alloc() == other.node_alloc());
|
|
}
|
|
|