Documentation ¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func GetBlockReward ¶
Types ¶
type Mempool ¶
type Mempool []*MempoolEntry
func (Mempool) PerfectSum ¶
func (Mempool) Pick ¶
Pick Selects transactions semi-optimally
Picking all transactions will result in the base reward penalty Use a heuristic algorithm to pick transactions and get the maximum possible reward Testing has shown that this algorithm is very close to the optimal selection Usually no more than 0.5 micronero away from the optimal discrete knapsack solution Sometimes it even finds the optimal solution
func (Mempool) WeightAndFees ¶
type MempoolEntry ¶
func NewEntryFromRPCData ¶
func NewEntryFromRPCData(id types.Hash, buf []byte, json *daemon.TransactionJSON) *MempoolEntry
func (*MempoolEntry) Compare ¶
func (t *MempoolEntry) Compare(o *MempoolEntry) int
Compare returns -1 if self is preferred over o, 0 if equal, 1 if o is preferred over self
Click to show internal directories.
Click to hide internal directories.