Files
rippled/src/ripple/protocol/Quality.h
seelabs 122a5cdf89 Add V2 implementation of payments:
Add a new algorithm for finding the liquidity in a payment path. There
is still a reverse and forward pass, but the forward pass starts at the
limiting step rather than the payment source. This insures the limiting
step is completely consumed rather than potentially leaving a 'dust'
amount in the forward pass.

Each step in a payment is either a book step, a direct step (account to
account step), or an xrp endpoint. Each step in the existing
implementation is a triple, where each element in the triple is either
an account of a book, for a total of eight step types.

Since accounts are considered in pairs, rather than triples, transfer
fees are handled differently. In V1 of payments, in the payment path
A -> gw ->B, if A redeems to gw, and gw issues to B, a transfer fee is
changed. In the new code, a transfer fee is changed even if A issues to
gw.
2016-03-17 17:34:37 -04:00

268 lines
7.1 KiB
C++

//------------------------------------------------------------------------------
/*
This file is part of rippled: https://github.com/ripple/rippled
Copyright (c) 2012, 2013 Ripple Labs Inc.
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 appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
//==============================================================================
#ifndef RIPPLE_PROTOCOL_QUALITY_H_INCLUDED
#define RIPPLE_PROTOCOL_QUALITY_H_INCLUDED
#include <ripple/protocol/AmountConversions.h>
#include <ripple/protocol/IOUAmount.h>
#include <ripple/protocol/STAmount.h>
#include <ripple/protocol/XRPAmount.h>
#include <cstdint>
#include <ostream>
namespace ripple {
/** Represents a pair of input and output currencies.
The input currency can be converted to the output
currency by multiplying by the rate, represented by
Quality.
For offers, "in" is always TakerPays and "out" is
always TakerGets.
*/
template<class In, class Out>
struct TAmounts
{
TAmounts() = default;
TAmounts (beast::Zero, beast::Zero)
: in (beast::zero)
, out (beast::zero)
{
}
TAmounts (In const& in_, Out const& out_)
: in (in_)
, out (out_)
{
}
/** Returns `true` if either quantity is not positive. */
bool
empty() const noexcept
{
return in <= zero || out <= zero;
}
TAmounts& operator+=(TAmounts const& rhs)
{
in += rhs.in;
out += rhs.out;
return *this;
}
TAmounts& operator-=(TAmounts const& rhs)
{
in -= rhs.in;
out -= rhs.out;
return *this;
}
In in;
Out out;
};
template<class In, class Out>
TAmounts<In, Out> make_Amounts(In const& in, Out const& out)
{
return TAmounts<In, Out>(in, out);
}
using Amounts = TAmounts<STAmount, STAmount>;
template<class In, class Out>
bool
operator== (
TAmounts<In, Out> const& lhs,
TAmounts<In, Out> const& rhs) noexcept
{
return lhs.in == rhs.in && lhs.out == rhs.out;
}
template<class In, class Out>
bool
operator!= (
TAmounts<In, Out> const& lhs,
TAmounts<In, Out> const& rhs) noexcept
{
return ! (lhs == rhs);
}
//------------------------------------------------------------------------------
// Ripple specific constant used for parsing qualities and other things
#define QUALITY_ONE 1000000000
/** Represents the logical ratio of output currency to input currency.
Internally this is stored using a custom floating point representation,
as the inverse of the ratio, so that quality will be descending in
a sequence of actual values that represent qualities.
*/
class Quality
{
public:
// Type of the internal representation. Higher qualities
// have lower unsigned integer representations.
using value_type = std::uint64_t;
private:
value_type m_value;
public:
Quality() = default;
/** Create a quality from the integer encoding of an STAmount */
explicit
Quality (std::uint64_t value);
/** Create a quality from the ratio of two amounts. */
explicit
Quality (Amounts const& amount);
/** Create a quality from the ratio of two amounts. */
template<class In, class Out>
Quality (Out const& out, In const& in)
: Quality (Amounts (toSTAmount (in),
toSTAmount (out)))
{}
/** Advances to the next higher quality level. */
/** @{ */
Quality&
operator++();
Quality
operator++ (int);
/** @} */
/** Advances to the next lower quality level. */
/** @{ */
Quality&
operator--();
Quality
operator-- (int);
/** @} */
/** Returns the quality as STAmount. */
STAmount
rate () const
{
return amountFromQuality (m_value);
}
/** Returns the scaled amount with in capped.
Math is avoided if the result is exact. The output is clamped
to prevent money creation.
*/
Amounts
ceil_in (Amounts const& amount, STAmount const& limit) const;
template<class In, class Out>
TAmounts<In, Out>
ceil_in (TAmounts<In, Out> const& amount, In const& limit) const
{
if (amount.in <= limit)
return amount;
// Use the existing STAmount implementation for now, but consider
// replacing with code specific to IOUAMount and XRPAmount
Amounts stAmt (toSTAmount (amount.in), toSTAmount (amount.out));
STAmount stLim (toSTAmount (limit));
auto const stRes = ceil_in (stAmt, stLim);
return TAmounts<In, Out> (toAmount<In> (stRes.in), toAmount<Out> (stRes.out));
}
/** Returns the scaled amount with out capped.
Math is avoided if the result is exact. The input is clamped
to prevent money creation.
*/
Amounts
ceil_out (Amounts const& amount, STAmount const& limit) const;
template<class In, class Out>
TAmounts<In, Out>
ceil_out (TAmounts<In, Out> const& amount, Out const& limit) const
{
if (amount.out <= limit)
return amount;
// Use the existing STAmount implementation for now, but consider
// replacing with code specific to IOUAMount and XRPAmount
Amounts stAmt (toSTAmount (amount.in), toSTAmount (amount.out));
STAmount stLim (toSTAmount (limit));
auto const stRes = ceil_out (stAmt, stLim);
return TAmounts<In, Out> (toAmount<In> (stRes.in), toAmount<Out> (stRes.out));
}
/** Returns `true` if lhs is lower quality than `rhs`.
Lower quality means the taker receives a worse deal.
Higher quality is better for the taker.
*/
friend
bool
operator< (Quality const& lhs, Quality const& rhs) noexcept
{
return lhs.m_value > rhs.m_value;
}
friend
bool
operator> (Quality const& lhs, Quality const& rhs) noexcept
{
return lhs.m_value < rhs.m_value;
}
friend
bool
operator== (Quality const& lhs, Quality const& rhs) noexcept
{
return lhs.m_value == rhs.m_value;
}
friend
bool
operator!= (Quality const& lhs, Quality const& rhs) noexcept
{
return ! (lhs == rhs);
}
friend
std::ostream&
operator<< (std::ostream& os, Quality const& quality)
{
os << quality.m_value;
return os;
}
};
/** Calculate the quality of a two-hop path given the two hops.
@param lhs The first leg of the path: input to intermediate.
@param rhs The second leg of the path: intermediate to output.
*/
Quality
composed_quality (Quality const& lhs, Quality const& rhs);
}
#endif