// Matrix Construct // // Copyright (C) Matrix Construct Developers, Authors & Contributors // Copyright (C) 2016-2018 Jason Volk // // Permission to use, copy, modify, and/or distribute this software for any // purpose with or without fee is hereby granted, provided that the above // copyright notice and this permission notice is present in all copies. The // full license for this software is available in the LICENSE file. #pragma once #define HAVE_IRCD_UTIL_UNIQUE_ITERATOR_H namespace ircd { inline namespace util { template struct unique_iterator; template struct unique_const_iterator; }} // // For objects using the pattern of adding their own instance to a container // in their constructor, storing an iterator as a member, and then removing // themselves using the iterator in their destructor. It is unsafe to do that. // Use this instead; or better, use ircd::instance_list<> // template struct ircd::util::unique_iterator { container *c {nullptr}; iterator it; operator const iterator &() const; decltype(auto) operator->() const; decltype(auto) operator*() const; operator iterator &(); decltype(auto) operator->(); decltype(auto) operator*(); unique_iterator(container &c, iterator it); unique_iterator() = default; unique_iterator(unique_iterator &&o) noexcept; unique_iterator(const unique_iterator &) = delete; unique_iterator &operator=(unique_iterator &&o) noexcept; unique_iterator &operator=(const unique_iterator &) = delete; ~unique_iterator() noexcept; }; template struct ircd::util::unique_const_iterator :unique_iterator { using iterator_type = typename container::const_iterator; using unique_iterator::unique_iterator; }; template inline ircd::util::unique_iterator::unique_iterator(container &c, iterator it) :c{&c} ,it{std::move(it)} {} template inline ircd::util::unique_iterator::unique_iterator(unique_iterator &&o) noexcept :c{std::move(o.c)} ,it{std::move(o.it)} { o.c = nullptr; } template inline ircd::util::unique_iterator & ircd::util::unique_iterator::operator=(unique_iterator &&o) noexcept { this->~unique_iterator(); c = std::move(o.c); it = std::move(o.it); o.c = nullptr; return *this; } template inline ircd::util::unique_iterator::~unique_iterator() noexcept { if(c) c->erase(it); } template inline decltype(auto) ircd::util::unique_iterator::operator*() { return it.operator*(); } template inline decltype(auto) ircd::util::unique_iterator::operator->() { return it.operator->(); } template inline decltype(auto) ircd::util::unique_iterator::operator*() const { return it.operator*(); } template inline decltype(auto) ircd::util::unique_iterator::operator->() const { return it.operator->(); } template inline ircd::util::unique_iterator::operator const iterator &() const { return it; }