/usr/include/xtensor/xfunction.hpp is in xtensor-dev 0.10.11-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 | /***************************************************************************
* Copyright (c) 2016, Johan Mabille, Sylvain Corlay and Wolf Vollprecht *
* *
* Distributed under the terms of the BSD 3-Clause License. *
* *
* The full license is in the file LICENSE, distributed with this software. *
****************************************************************************/
#ifndef XFUNCTION_HPP
#define XFUNCTION_HPP
#include <algorithm>
#include <cstddef>
#include <iterator>
#include <numeric>
#include <tuple>
#include <type_traits>
#include <utility>
#include "xexpression.hpp"
#include "xiterable.hpp"
#include "xlayout.hpp"
#include "xscalar.hpp"
#include "xutils.hpp"
namespace xt
{
namespace detail
{
/********************
* common_size_type *
********************/
template <class... Args>
struct common_size_type
{
using type = std::common_type_t<typename Args::size_type...>;
};
template <>
struct common_size_type<>
{
using type = std::size_t;
};
template <class... Args>
using common_size_type_t = typename common_size_type<Args...>::type;
/**************************
* common_difference type *
**************************/
template <class... Args>
struct common_difference_type
{
using type = std::common_type_t<typename Args::difference_type...>;
};
template <>
struct common_difference_type<>
{
using type = std::size_t;
};
template <class... Args>
using common_difference_type_t = typename common_difference_type<Args...>::type;
/*********************
* common_value_type *
*********************/
template <class... Args>
struct common_value_type
{
using type = std::common_type_t<xvalue_type_t<Args>...>;
};
template <class... Args>
using common_value_type_t = typename common_value_type<Args...>::type;
}
template <class F, class R, class... CT>
class xfunction_iterator;
template <class F, class R, class... CT>
class xfunction_stepper;
template <class F, class R, class... CT>
class xfunction;
template <class F, class R, class... CT>
struct xiterable_inner_types<xfunction<F, R, CT...>>
{
using inner_shape_type = promote_shape_t<typename std::decay_t<CT>::shape_type...>;
using const_iterator = xfunction_iterator<F, R, CT...>;
using iterator = const_iterator;
using const_stepper = xfunction_stepper<F, R, CT...>;
using stepper = const_stepper;
using const_reverse_iterator = std::reverse_iterator<const_iterator>;
using reverse_iterator = std::reverse_iterator<iterator>;
};
/*************
* xfunction *
*************/
/**
* @class xfunction
* @brief Multidimensional function operating on xexpression.
*
* Th xfunction class implements a multidimensional function
* operating on xexpression.
*
* @tparam F the function type
* @tparam R the return type of the function
* @tparam CT the closure types for arguments of the function
*/
template <class F, class R, class... CT>
class xfunction : public xexpression<xfunction<F, R, CT...>>,
public xconst_iterable<xfunction<F, R, CT...>>
{
public:
using self_type = xfunction<F, R, CT...>;
using functor_type = typename std::remove_reference<F>::type;
using value_type = R;
using reference = value_type;
using const_reference = value_type;
using pointer = value_type*;
using const_pointer = const value_type*;
using size_type = detail::common_size_type_t<std::decay_t<CT>...>;
using difference_type = detail::common_difference_type_t<std::decay_t<CT>...>;
using iterable_base = xconst_iterable<xfunction<F, R, CT...>>;
using inner_shape_type = typename iterable_base::inner_shape_type;
using shape_type = inner_shape_type;
using iterator = typename iterable_base::iterator;
using const_iterator = typename iterable_base::const_iterator;
using stepper = typename iterable_base::stepper;
using const_stepper = typename iterable_base::const_stepper;
using reverse_iterator = typename iterable_base::reverse_iterator;
using const_reverse_iterator = typename iterable_base::const_reverse_iterator;
static constexpr layout_type static_layout = compute_layout(std::decay_t<CT>::static_layout...);
static constexpr bool contiguous_layout = and_c<std::decay_t<CT>::contiguous_layout...>::value;
template <class Func>
xfunction(Func&& f, CT... e) noexcept;
size_type size() const noexcept;
size_type dimension() const noexcept;
const shape_type& shape() const;
layout_type layout() const noexcept;
template <class... Args>
const_reference operator()(Args... args) const;
const_reference operator[](const xindex& index) const;
const_reference operator[](size_type i) const;
template <class It>
const_reference element(It first, It last) const;
template <class S>
bool broadcast_shape(S& shape) const;
template <class S>
bool is_trivial_broadcast(const S& strides) const noexcept;
const_iterator begin() const noexcept;
const_iterator end() const noexcept;
const_iterator cbegin() const noexcept;
const_iterator cend() const noexcept;
const_reverse_iterator rbegin() const noexcept;
const_reverse_iterator rend() const noexcept;
const_reverse_iterator crbegin() const noexcept;
const_reverse_iterator crend() const noexcept;
template <class S>
const_stepper stepper_begin(const S& shape) const noexcept;
template <class S>
const_stepper stepper_end(const S& shape, layout_type l) const noexcept;
const_reference data_element(size_type i) const;
private:
template <std::size_t... I>
layout_type layout_impl(std::index_sequence<I...>) const noexcept;
template <std::size_t... I, class... Args>
const_reference access_impl(std::index_sequence<I...>, Args... args) const;
template <std::size_t... I, class It>
const_reference element_access_impl(std::index_sequence<I...>, It first, It last) const;
template <std::size_t... I>
const_reference data_element_impl(std::index_sequence<I...>, size_type i) const;
template <class Func, std::size_t... I>
const_stepper build_stepper(Func&& f, std::index_sequence<I...>) const noexcept;
template <class Func, std::size_t... I>
const_iterator build_iterator(Func&& f, std::index_sequence<I...>) const noexcept;
size_type compute_dimension() const noexcept;
std::tuple<CT...> m_e;
functor_type m_f;
mutable shape_type m_shape;
mutable bool m_shape_computed;
friend class xfunction_iterator<F, R, CT...>;
friend class xfunction_stepper<F, R, CT...>;
};
/**********************
* xfunction_iterator *
**********************/
template <class CT>
class xscalar;
namespace detail
{
template <class C>
struct get_iterator_impl
{
using type = typename C::iterator;
};
template <class C>
struct get_iterator_impl<const C>
{
using type = typename C::const_iterator;
};
template <class CT>
struct get_iterator_impl<xscalar<CT>>
{
using type = typename xscalar<CT>::dummy_iterator;
};
template <class CT>
struct get_iterator_impl<const xscalar<CT>>
{
using type = typename xscalar<CT>::const_dummy_iterator;
};
}
template <class C>
using get_iterator = typename detail::get_iterator_impl<C>::type;
template <class F, class R, class... CT>
class xfunction_iterator
{
public:
using self_type = xfunction_iterator<F, R, CT...>;
using functor_type = typename std::remove_reference<F>::type;
using xfunction_type = xfunction<F, R, CT...>;
using value_type = typename xfunction_type::value_type;
using reference = typename xfunction_type::value_type;
using pointer = typename xfunction_type::const_pointer;
using difference_type = typename xfunction_type::difference_type;
using iterator_category = std::forward_iterator_tag;
template <class... It>
xfunction_iterator(const xfunction_type* func, It&&... it) noexcept;
self_type& operator++();
self_type operator++(int);
self_type& operator--();
self_type operator--(int);
reference operator*() const;
bool equal(const self_type& rhs) const;
private:
template <std::size_t... I>
reference deref_impl(std::index_sequence<I...>) const;
const xfunction_type* p_f;
std::tuple<get_iterator<const std::decay_t<CT>>...> m_it;
};
template <class F, class R, class... CT>
bool operator==(const xfunction_iterator<F, R, CT...>& it1,
const xfunction_iterator<F, R, CT...>& it2);
template <class F, class R, class... CT>
bool operator!=(const xfunction_iterator<F, R, CT...>& it1,
const xfunction_iterator<F, R, CT...>& it2);
/*********************
* xfunction_stepper *
*********************/
template <class F, class R, class... CT>
class xfunction_stepper
{
public:
using self_type = xfunction_stepper<F, R, CT...>;
using functor_type = typename std::remove_reference<F>::type;
using xfunction_type = xfunction<F, R, CT...>;
using value_type = typename xfunction_type::value_type;
using reference = typename xfunction_type::value_type;
using pointer = typename xfunction_type::const_pointer;
using size_type = typename xfunction_type::size_type;
using difference_type = typename xfunction_type::difference_type;
using shape_type = typename xfunction_type::shape_type;
template <class... It>
xfunction_stepper(const xfunction_type* func, It&&... it) noexcept;
void step(size_type dim, size_type n = 1);
void step_back(size_type dim, size_type n = 1);
void reset(size_type dim);
void reset_back(size_type dim);
void to_begin();
void to_end(layout_type l);
reference operator*() const;
bool equal(const self_type& rhs) const;
private:
template <std::size_t... I>
reference deref_impl(std::index_sequence<I...>) const;
const xfunction_type* p_f;
std::tuple<typename std::decay_t<CT>::const_stepper...> m_it;
};
template <class F, class R, class... CT>
bool operator==(const xfunction_stepper<F, R, CT...>& it1,
const xfunction_stepper<F, R, CT...>& it2);
template <class F, class R, class... CT>
bool operator!=(const xfunction_stepper<F, R, CT...>& it1,
const xfunction_stepper<F, R, CT...>& it2);
/****************************
* xfunction implementation *
****************************/
/**
* @name Constructor
*/
//@{
/**
* Constructs an xfunction applying the specified function to the given
* arguments.
* @param f the function to apply
* @param e the \ref xexpression arguments
*/
template <class F, class R, class... CT>
template <class Func>
inline xfunction<F, R, CT...>::xfunction(Func&& f, CT... e) noexcept
: m_e(e...), m_f(std::forward<Func>(f)), m_shape(make_sequence<shape_type>(0, size_type(1))),
m_shape_computed(false)
{
}
//@}
/**
* @name Size and shape
*/
//@{
/**
* Returns the size of the expression.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::size() const noexcept -> size_type
{
return compute_size(shape());
}
/**
* Returns the number of dimensions of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::dimension() const noexcept -> size_type
{
size_type dimension = m_shape_computed ? m_shape.size() : compute_dimension();
return dimension;
}
/**
* Returns the shape of the xfunction.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::shape() const -> const shape_type&
{
if (!m_shape_computed)
{
m_shape = make_sequence<shape_type>(compute_dimension(), size_type(1));
broadcast_shape(m_shape);
m_shape_computed = true;
}
return m_shape;
}
/**
* Returns the layout_type of the xfunction.
*/
template <class F, class R, class... CT>
inline layout_type xfunction<F, R, CT...>::layout() const noexcept
{
return layout_impl(std::make_index_sequence<sizeof...(CT)>());
}
//@}
/**
* @name Data
*/
/**
* Returns a constant reference to the element at the specified position in the function.
* @param args a list of indices specifying the position in the function. Indices
* must be unsigned integers, the number of indices should be equal or greater than
* the number of dimensions of the function.
*/
template <class F, class R, class... CT>
template <class... Args>
inline auto xfunction<F, R, CT...>::operator()(Args... args) const -> const_reference
{
return access_impl(std::make_index_sequence<sizeof...(CT)>(), args...);
}
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::operator[](const xindex& index) const -> const_reference
{
return element(index.cbegin(), index.cend());
}
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::operator[](size_type i) const -> const_reference
{
return operator()(i);
}
/**
* Returns a constant reference to the element at the specified position in the function.
* @param first iterator starting the sequence of indices
* @param last iterator ending the sequence of indices
* The number of indices in the sequence should be equal to or greater
* than the number of dimensions of the container.
*/
template <class F, class R, class... CT>
template <class It>
inline auto xfunction<F, R, CT...>::element(It first, It last) const -> const_reference
{
return element_access_impl(std::make_index_sequence<sizeof...(CT)>(), first, last);
}
//@}
/**
* @name Broadcasting
*/
//@{
/**
* Broadcast the shape of the function to the specified parameter.
* @param shape the result shape
* @return a boolean indicating whether the broadcasting is trivial
*/
template <class F, class R, class... CT>
template <class S>
inline bool xfunction<F, R, CT...>::broadcast_shape(S& shape) const
{
// e.broadcast_shape must be evaluated even if b is false
auto func = [&shape](bool b, auto&& e) { return e.broadcast_shape(shape) && b; };
return accumulate(func, true, m_e);
}
/**
* Compares the specified strides with those of the container to see whether
* the broadcasting is trivial.
* @return a boolean indicating whether the broadcasting is trivial
*/
template <class F, class R, class... CT>
template <class S>
inline bool xfunction<F, R, CT...>::is_trivial_broadcast(const S& strides) const noexcept
{
auto func = [&strides](bool b, auto&& e) { return b && e.is_trivial_broadcast(strides); };
return accumulate(func, true, m_e);
}
//@}
/**
* @name Iterators
*/
/**
* Returns an iterator to the first element of the buffer
* containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::begin() const noexcept -> const_iterator
{
auto f = [](const auto& e) noexcept { return detail::trivial_begin(e); };
return build_iterator(f, std::make_index_sequence<sizeof...(CT)>());
}
/**
* Returns a constant iterator to the element following the last
* element of the buffer containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::end() const noexcept -> const_iterator
{
auto f = [](const auto& e) noexcept { return detail::trivial_end(e); };
return build_iterator(f, std::make_index_sequence<sizeof...(CT)>());
}
/**
* Returns a constant iterator to the first element of the buffer
* containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::cbegin() const noexcept -> const_iterator
{
return begin();
}
/**
* Returns a constant iterator to the element following the last
* element of the buffer containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::cend() const noexcept -> const_iterator
{
return end();
}
//@}
/**
* @name Reverse iterators
*/
//@{
/**
* Returns an iterator to the first element of the reversed buffer
* containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::rbegin() const noexcept -> const_reverse_iterator
{
return crbegin();
}
/**
* Returns a constant iterator to the element following the last
* element of the reversed buffer containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::rend() const noexcept -> const_reverse_iterator
{
return crend();
}
/**
* Returns an iterator to the first element of the reversed buffer
* containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::crbegin() const noexcept -> const_reverse_iterator
{
return const_reverse_iterator(cend());
}
/**
* Returns a constant iterator to the element following the last
* element of the reversed buffer containing the elements of the function.
*/
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::crend() const noexcept -> const_reverse_iterator
{
return const_reverse_iterator(cbegin());
}
//@}
template <class F, class R, class... CT>
template <class S>
inline auto xfunction<F, R, CT...>::stepper_begin(const S& shape) const noexcept -> const_stepper
{
auto f = [&shape](const auto& e) noexcept { return e.stepper_begin(shape); };
return build_stepper(f, std::make_index_sequence<sizeof...(CT)>());
}
template <class F, class R, class... CT>
template <class S>
inline auto xfunction<F, R, CT...>::stepper_end(const S& shape, layout_type l) const noexcept -> const_stepper
{
auto f = [&shape, l](const auto& e) noexcept { return e.stepper_end(shape, l); };
return build_stepper(f, std::make_index_sequence<sizeof...(CT)>());
}
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::data_element(size_type i) const -> const_reference
{
return data_element_impl(std::make_index_sequence<sizeof...(CT)>(), i);
}
template <class F, class R, class... CT>
template <std::size_t... I>
inline layout_type xfunction<F, R, CT...>::layout_impl(std::index_sequence<I...>) const noexcept
{
return compute_layout(std::get<I>(m_e).layout()...);
}
template <class F, class R, class... CT>
template <std::size_t... I, class... Args>
inline auto xfunction<F, R, CT...>::access_impl(std::index_sequence<I...>, Args... args) const -> const_reference
{
return m_f(detail::get_element(std::get<I>(m_e), args...)...);
}
template <class F, class R, class... CT>
template <std::size_t... I, class It>
inline auto xfunction<F, R, CT...>::element_access_impl(std::index_sequence<I...>, It first, It last) const -> const_reference
{
return m_f((std::get<I>(m_e).element(first, last))...);
}
template <class F, class R, class... CT>
template <std::size_t... I>
inline auto xfunction<F, R, CT...>::data_element_impl(std::index_sequence<I...>, size_type i) const ->const_reference
{
return m_f((std::get<I>(m_e).data_element(i))...);
}
template <class F, class R, class... CT>
template <class Func, std::size_t... I>
inline auto xfunction<F, R, CT...>::build_stepper(Func&& f, std::index_sequence<I...>) const noexcept -> const_stepper
{
return const_stepper(this, f(std::get<I>(m_e))...);
}
template <class F, class R, class... CT>
template <class Func, std::size_t... I>
inline auto xfunction<F, R, CT...>::build_iterator(Func&& f, std::index_sequence<I...>) const noexcept -> const_iterator
{
return const_iterator(this, f(std::get<I>(m_e))...);
}
template <class F, class R, class... CT>
inline auto xfunction<F, R, CT...>::compute_dimension() const noexcept -> size_type
{
auto func = [](size_type d, auto&& e) noexcept { return std::max(d, e.dimension()); };
return accumulate(func, size_type(0), m_e);
}
/*************************************
* xfunction_iterator implementation *
*************************************/
template <class F, class R, class... CT>
template <class... It>
inline xfunction_iterator<F, R, CT...>::xfunction_iterator(const xfunction_type* func, It&&... it) noexcept
: p_f(func), m_it(std::forward<It>(it)...)
{
}
template <class F, class R, class... CT>
inline auto xfunction_iterator<F, R, CT...>::operator++() -> self_type&
{
auto f = [](auto& it) { ++it; };
for_each(f, m_it);
return *this;
}
template <class F, class R, class... CT>
inline auto xfunction_iterator<F, R, CT...>::operator++(int) -> self_type
{
self_type tmp(*this);
++(*this);
return tmp;
}
template <class F, class R, class... CT>
inline auto xfunction_iterator<F, R, CT...>::operator--() -> self_type&
{
auto f = [](auto& it) { return --it; };
for_each(f, m_it);
return *this;
}
template <class F, class R, class... CT>
inline auto xfunction_iterator<F, R, CT...>::operator--(int) -> self_type
{
self_type tmp(*this);
--(*this);
return tmp;
}
template <class F, class R, class... CT>
inline auto xfunction_iterator<F, R, CT...>::operator*() const -> reference
{
return deref_impl(std::make_index_sequence<sizeof...(CT)>());
}
template <class F, class R, class... CT>
inline bool xfunction_iterator<F, R, CT...>::equal(const self_type& rhs) const
{
return p_f == rhs.p_f && m_it == rhs.m_it;
}
template <class F, class R, class... CT>
template <std::size_t... I>
inline auto xfunction_iterator<F, R, CT...>::deref_impl(std::index_sequence<I...>) const -> reference
{
return (p_f->m_f)(*std::get<I>(m_it)...);
}
template <class F, class R, class... CT>
inline bool operator==(const xfunction_iterator<F, R, CT...>& it1,
const xfunction_iterator<F, R, CT...>& it2)
{
return it1.equal(it2);
}
template <class F, class R, class... CT>
inline bool operator!=(const xfunction_iterator<F, R, CT...>& it1,
const xfunction_iterator<F, R, CT...>& it2)
{
return !(it1.equal(it2));
}
/************************************
* xfunction_stepper implementation *
************************************/
template <class F, class R, class... CT>
template <class... It>
inline xfunction_stepper<F, R, CT...>::xfunction_stepper(const xfunction_type* func, It&&... it) noexcept
: p_f(func), m_it(std::forward<It>(it)...)
{
}
template <class F, class R, class... CT>
inline void xfunction_stepper<F, R, CT...>::step(size_type dim, size_type n)
{
auto f = [dim, n](auto& it) { it.step(dim, n); };
for_each(f, m_it);
}
template <class F, class R, class... CT>
inline void xfunction_stepper<F, R, CT...>::step_back(size_type dim, size_type n)
{
auto f = [dim, n](auto& it) { it.step_back(dim, n); };
for_each(f, m_it);
}
template <class F, class R, class... CT>
inline void xfunction_stepper<F, R, CT...>::reset(size_type dim)
{
auto f = [dim](auto& it) { it.reset(dim); };
for_each(f, m_it);
}
template <class F, class R, class... CT>
inline void xfunction_stepper<F, R, CT...>::reset_back(size_type dim)
{
auto f = [dim](auto& it) { it.reset_back(dim); };
for_each(f, m_it);
}
template <class F, class R, class... CT>
inline void xfunction_stepper<F, R, CT...>::to_begin()
{
auto f = [](auto& it) { it.to_begin(); };
for_each(f, m_it);
}
template <class F, class R, class... CT>
inline void xfunction_stepper<F, R, CT...>::to_end(layout_type l)
{
auto f = [l](auto& it) { it.to_end(l); };
for_each(f, m_it);
}
template <class F, class R, class... CT>
inline auto xfunction_stepper<F, R, CT...>::operator*() const -> reference
{
return deref_impl(std::make_index_sequence<sizeof...(CT)>());
}
template <class F, class R, class... CT>
inline bool xfunction_stepper<F, R, CT...>::equal(const self_type& rhs) const
{
return p_f == rhs.p_f && m_it == rhs.m_it;
}
template <class F, class R, class... CT>
template <std::size_t... I>
inline auto xfunction_stepper<F, R, CT...>::deref_impl(std::index_sequence<I...>) const -> reference
{
return (p_f->m_f)(*std::get<I>(m_it)...);
}
template <class F, class R, class... CT>
inline bool operator==(const xfunction_stepper<F, R, CT...>& it1,
const xfunction_stepper<F, R, CT...>& it2)
{
return it1.equal(it2);
}
template <class F, class R, class... CT>
inline bool operator!=(const xfunction_stepper<F, R, CT...>& it1,
const xfunction_stepper<F, R, CT...>& it2)
{
return !(it1.equal(it2));
}
}
#endif
|