/* * Copyright (C) 2016 Charybdis Development Team * Copyright (C) 2016 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. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. * */ #pragma once #define HAVE_IRCD_DB_DELTA_H namespace ircd::db { struct delta; } /// Update a database cell without `cell`, `column` or row `references`. /// /// The cell is found by name string. This is the least efficient of the deltas /// for many updates to the same column or cell when a reference to those can /// be pre-resolved. This delta has to resolve those references every single /// time it's iterated over; but that's okay for some transactions. /// struct ircd::db::delta :std::tuple { enum // for use with std::get(delta) { OP, COL, KEY, VAL, }; delta(const enum op &op, const string_view &col, const string_view &key, const string_view &val = {}) :std::tuple { op, col, key, val }{} delta(const string_view &col, const string_view &key, const string_view &val = {}, const enum op &op = op::SET) :std::tuple { op, col, key, val }{} delta() = default; };