|
Boost Users : |
Subject: [Boost-users] [multi-index] using std::distance() with ordered indices
From: dv (dv_at_[hidden])
Date: 2011-06-22 16:29:22
Hello,
I need to find out the size of a range defined by two ordered_non_unique
iterators . Right now I just use std::distance() for this, however, the
time complexity in this case is O(n). Is there some special way for
calculating distances between multi-index container iterators?
regards
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net