mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
Conflicts: src/ripple/app/TODO.md src/ripple/app/ledger/Ledger.h src/ripple/protocol/Protocol.h
188 lines
4.9 KiB
C++
188 lines
4.9 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/STAmount.h>
|
|
#include <beast/utility/noexcept.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.
|
|
*/
|
|
struct Amounts
|
|
{
|
|
Amounts() = default;
|
|
|
|
Amounts (STAmount const& in_, STAmount const& out_)
|
|
: in (in_)
|
|
, out (out_)
|
|
{
|
|
}
|
|
|
|
/** Returns `true` if either quantity is not positive. */
|
|
bool
|
|
empty() const noexcept
|
|
{
|
|
return in <= zero || out <= zero;
|
|
}
|
|
|
|
STAmount in;
|
|
STAmount out;
|
|
};
|
|
|
|
inline
|
|
bool
|
|
operator== (Amounts const& lhs, Amounts const& rhs) noexcept
|
|
{
|
|
return lhs.in == rhs.in && lhs.out == rhs.out;
|
|
}
|
|
|
|
inline
|
|
bool
|
|
operator!= (Amounts const& lhs, Amounts const& rhs) noexcept
|
|
{
|
|
return ! (lhs == rhs);
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
// Ripple specific constant used for parsing qualities and other things
|
|
#define QUALITY_ONE 1000000000 // 10e9
|
|
|
|
/** 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);
|
|
|
|
/** 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;
|
|
|
|
/** 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;
|
|
|
|
/** 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 == 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
|