// Copyright (c) 2012-2017 The Limenka developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.

#ifndef LIMENKA_POLICY_COIN_AGE_PRIORITY_H
#define LIMENKA_POLICY_COIN_AGE_PRIORITY_H

#include <consensus/amount.h>

class CCoinsViewCache;
class CTransaction;

struct CoinAgeCache
{
    uint64_t inputs_coin_age;      //!< Sum coin-age of all confirmed inputs (satoshi-blocks)
    CAmount in_chain_input_value;  //!< Sum value of all confirmed inputs
};

static constexpr CoinAgeCache COIN_AGE_CACHE_ZERO{
    .inputs_coin_age = 0,
    .in_chain_input_value = 0,
};

// Compute modified tx vsize for priority calculation
unsigned int CalculateModifiedSize(const CTransaction& tx, unsigned int nTxSize);

// Compute priority, given sum coin-age of inputs and modified tx vsize
// CAUTION: Original ComputePriority accepted UNMODIFIED tx vsize and did the modification internally
double ComputePriority2(uint64_t inputs_coin_age, unsigned int mod_vsize);
double ReversePriority2(double coin_age_priority, unsigned int mod_vsize);

/**
 * Return sum coin-age of tx inputs at height nHeight. Also calculate the sum of the values of the inputs
 * that are already in the chain.  These are the inputs that will age and increase priority as
 * new blocks are added to the chain.
 * CAUTION: Original GetPriority also called ComputePriority and returned the final coin-age priority
 */
CoinAgeCache GetCoinAge(const CTransaction &tx, const CCoinsViewCache& view, int nHeight);

#endif // LIMENKA_POLICY_COIN_AGE_PRIORITY_H