* @endcode
* then
* @code
- * std::bind2nd (std::ptr_fun(&level_equal_to<active_cell_iterator>), 3)
+ * std_cxx11::bind (std::ptr_fun(&level_equal_to<active_cell_iterator>), std_cxx11::_1, 3)
* @endcode
* is another valid predicate (here: a function that returns true if either
* the iterator is past the end or the level is equal to the second argument;
- * this second argument is bound to a fixed value using the @p std::bind2nd
+ * this second argument is bound to a fixed value using the @p std::bind
* function).
*
* Finally, classes can be predicates. The following class is one:
return std::count_if(&val[0],
&val[cols->sparsity_pattern.n_nonzero_elements () *
chunk_size * chunk_size],
- std::bind2nd(std::not_equal_to<double>(), 0));
+ std_cxx11::bind(std::not_equal_to<double>(), std_cxx11::_1, 0));
}
* ...
*
* do_loop (mem_fun (&TimeStepBase_Tria<dim>::init_for_refinement),
- * bind2nd (mem_fun1 (&TimeStepBase_Wave<dim>::refine_grid),
- * TimeStepBase_Tria<dim>::RefinementData (top_threshold,
- * bottom_threshold)),
+ * std_cxx11::bind (&TimeStepBase_Wave<dim>::refine_grid,
+ * std_cxx11::_1
+ * TimeStepBase_Tria<dim>::RefinementData (top_threshold,
+ * bottom_threshold)),
* TimeDependent::TimeSteppingData (0,1),
* TimeDependent::forward);
* @endcode
* the TimeStepBase class.
*
* Instead of using the above form, you can equally well use
- * <tt>bind2nd(mem_fun1(&X::unary_function), arg)</tt> which lets the @p
+ * <tt>std_cxx11::bind(&X::unary_function, std_cxx11::_1, arg)</tt> which lets the @p
* do_loop function call the given function with the specified parameter.
* Note that you need to bind the second parameter since the first one
* implicitly contains the object which the function is to be called for.