本文整理汇总了C++中std::multiset::empty方法的典型用法代码示例。如果您正苦于以下问题：C++ multiset::empty方法的具体用法？C++ multiset::empty怎么用？C++ multiset::empty使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类std::multiset的用法示例。
在下文中一共展示了multiset::empty方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main()
{
typedef test_compare<std::less<int> > C;
const std::multiset<int, C> m(C(3));
assert(m.empty());
assert(m.begin() == m.end());
assert(m.key_comp() == C(3));
assert(m.value_comp() == C(3));
}示例2: operator
void operator()(clmdep_msgpack::object::with_zone& o, const std::multiset<T, Compare, Alloc>& v) const {
o.type = clmdep_msgpack::type::ARRAY;
if (v.empty()) {
o.via.array.ptr = nullptr;
o.via.array.size = 0;
} else {
uint32_t size = checked_get_container_size(v.size());
clmdep_msgpack::object* p = static_cast<clmdep_msgpack::object*>(o.zone.allocate_align(sizeof(clmdep_msgpack::object)*size));
clmdep_msgpack::object* const pend = p + size;
o.via.array.ptr = p;
o.via.array.size = size;
typename std::multiset<T, Compare, Alloc>::const_iterator it(v.begin());
do {
*p = clmdep_msgpack::object(*it, o.zone);
++p;
++it;
} while(p < pend);
}
}示例3: IsBefore
/**
* Does the specified time stamp occur before the first scheduled
* timer? If this returns true, then adding a timer at the
* specified time stamp will require adjusting the poll timeout,
* i.e. the event thread must be woken up.
*/
bool IsBefore(uint64_t t) const {
return timers.empty() || t < timers.begin()->due_us;
}示例4: visualizeDebug
void GridFitter::visualizeDebug(std::multiset<candidate_t> const& grids, const cv::Mat& roi, const cv::Size2i roiSize, const cv::Mat& edgeRoiX, const cv::Mat& edgeRoiY, const Tag &tag, cv::Mat const& binarizedROI, std::string winName, const size_t numBest)
{
cv::Mat binarizedROICpy;
cv::cvtColor(binarizedROI, binarizedROICpy, CV_GRAY2BGR);
cv::Mat edgeX;
cv::cvtColor(edgeRoiX, edgeX, CV_GRAY2BGR);
cv::Mat edgeY;
cv::cvtColor(edgeRoiY, edgeY, CV_GRAY2BGR);
cv::Mat roiCpy;
cv::cvtColor(roi, roiCpy, CV_GRAY2BGR);
const size_t to = std::min(grids.size(), numBest);
size_t idx = 0;
for (candidate_t const& candidate : grids) {
std::vector<cv::Mat> images;
PipelineGrid grid(candidate.config);
images.push_back(tag.getRepresentations().orig);
images.push_back(roiCpy);
cv::Mat origCopy;
roiCpy.copyTo(origCopy);
pipeline::Ellipse const& ell = tag.getCandidatesConst().front().getEllipse();
cv::ellipse(origCopy, ell.getCen(), ell.getAxis(), ell.getAngle(), 0, 360, cv::Scalar(0, 255, 0), 2);
images.push_back(origCopy);
images.push_back(edgeX);
images.push_back(edgeY);
images.push_back(binarizedROICpy);
images.push_back(grid.getProjectedImage(roiSize));
cv::Mat blendedBin;
cv::addWeighted(binarizedROICpy, 0.6, grid.getProjectedImage(roiSize), 0.4, 0.0, blendedBin);
images.push_back(blendedBin);
cv::Mat blended;
cv::addWeighted(tag.getRepresentations().orig, 0.8, grid.getProjectedImage(roiSize), 0.2, 0.0, blended);
images.push_back(blended);
cv::Mat cannyBlendedX;
edgeX.copyTo(cannyBlendedX);
grid.drawContours(cannyBlendedX, 0.9, cv::Vec3b(150, 200, 170));
images.push_back(cannyBlendedX);
cv::Mat cannyBlendedY;
edgeY.copyTo(cannyBlendedY);
grid.drawContours(cannyBlendedY, 0.9, cv::Vec3b(150, 200, 170));
images.push_back(cannyBlendedY);
cv::Mat origCopyOverlay;
roiCpy.copyTo(origCopyOverlay);
grid.drawContours(origCopyOverlay, 0.5);
images.push_back(origCopyOverlay);
const auto canvas = CvHelper::makeCanvas(images, images[0].rows + 10, 1);
std::string title(winName + " " + std::to_string(idx) + " (error: " + std::to_string(candidate.error) + ")");
cv::namedWindow(title);
cv::imshow(title, canvas);
++idx;
if (idx == to) break;
}
if (!grids.empty()) {
bool cont = true;
while (cont) {
const char c = cv::waitKey();
if (c == 'd') {
cv::destroyAllWindows();
cont = false;
} else if (c == 'c') {
cont = false;
}
}
}
}