diff --git a/include/boost/container/experimental/segmented_partition.hpp b/include/boost/container/experimental/segmented_partition.hpp
index f0a4cb4..32b9454 100644
--- a/include/boost/container/experimental/segmented_partition.hpp
+++ b/include/boost/container/experimental/segmented_partition.hpp
@@ -54,8 +54,8 @@ OutIter partition_scan(FwdIt first, Sent last, OutIter result, Pred pred, non_se
 // Bidirectional (Hoare-style) partition
 //////////////////////////////////////////////
 
-template <class BidirIt, class Pred>
-BidirIt partition_scan(BidirIt first, BidirIt last, Pred pred, non_segmented_iterator_tag, const std::bidirectional_iterator_tag&)
+template <class BidirIt, class Pred, class Cat>
+BidirIt partition_scan(BidirIt first, BidirIt last, Pred pred, non_segmented_iterator_tag, const Cat&)
 {
    while(true) {
       bool cond = true;
diff --git a/include/boost/container/experimental/segmented_reverse.hpp b/include/boost/container/experimental/segmented_reverse.hpp
index 210d26e..88c123e 100644
--- a/include/boost/container/experimental/segmented_reverse.hpp
+++ b/include/boost/container/experimental/segmented_reverse.hpp
@@ -30,8 +30,8 @@ namespace container {
 namespace detail_algo {
 
 //Same-segment reverse: simply a reverse loop with move-swaps. No segmentation
-template <class BidirIt>
-void segmented_reverse_dispatch(BidirIt first, BidirIt last, non_segmented_iterator_tag, const std::bidirectional_iterator_tag &)
+template <class BidirIt, class Cat>
+void segmented_reverse_dispatch(BidirIt first, BidirIt last, non_segmented_iterator_tag, const Cat &)
 {
    while(first != last && first != --last) {
       boost::adl_move_swap(*first, *last);
@@ -79,9 +79,9 @@ void segmented_reverse_dispatch(RAIter first, RAIter last, non_segmented_iterato
 // At least one side is fully consumed on return.
 //////////////////////////////////////////////
 
-template <class It>
+template <class It, class Cat>
 void segmented_reverse_disjoint_ranges
-   (It& f_out, It const f_end, It const l_beg, It& l_out, non_segmented_iterator_tag, const std::bidirectional_iterator_tag &)
+   (It& f_out, It const f_end, It const l_beg, It& l_out, non_segmented_iterator_tag, const Cat &)
 {
    It f = f_out;
    It l = l_out;
diff --git a/include/boost/container/experimental/segmented_reverse_copy.hpp b/include/boost/container/experimental/segmented_reverse_copy.hpp
index e374bb8..f34e42e 100644
--- a/include/boost/container/experimental/segmented_reverse_copy.hpp
+++ b/include/boost/container/experimental/segmented_reverse_copy.hpp
@@ -31,9 +31,9 @@ OutIter segmented_reverse_copy(BidirIter first, BidirIter last, OutIter result);
 
 namespace detail_algo {
 
-template <class BidirIter, class OutIter>
+template <class BidirIter, class OutIter, class Cat>
 OutIter segmented_reverse_copy_dispatch
-   (BidirIter first, BidirIter last, OutIter result, non_segmented_iterator_tag, const std::bidirectional_iterator_tag &)
+   (BidirIter first, BidirIter last, OutIter result, non_segmented_iterator_tag, const Cat &)
 {
    while(first != last) {
       --last;