ReplaceCompactCollectBoxSelector
Related Docs:
object ReplaceCompactCollectBoxSelector
| package boxes
- maximum number of inputs a transaction can have
- optimal number of inputs, when transaction is still not expensive. The box selector is trying to add dust if a transaction has less inputs than this.
- re-emission settings. If provided, re-emission tokens are considered by box selector
Helper method to construct change outputs
Helper method to construct change outputs
- ERG balance of boxes collected (spendable only, so after possibly deducting re-emission tokens)
- ERG amount to be transferred to recipients
- assets balances of boxes
- assets amounts to be transferred to recipients
- amount of re-emission tokens in collected boxes
Helper method to get total amount of re-emission tokens stored in input boxes.
Helper method to get total amount of re-emission tokens stored in input boxes.
- re-emission settings.
- re-emission settings. If provided, re-emission tokens are considered by box selector
A method which is selecting boxes to spend in order to collect needed amounts of ergo tokens and assets.
A method which is selecting boxes to spend in order to collect needed amounts of ergo tokens and assets.
- unspent boxes to choose from.
- user-provided filter function for boxes. From inputBoxes, only ones to be chosen for which filterFn(box) returns true
- ergo balance to be met
- assets balances to be met
Left(error) if select() is failing to pick appropriate boxes, otherwise Right(res), where res contains boxes to spend as well as monetary values and assets for boxes containing change (wrapped in a special BoxSelectionResult class).
A box selector which is parameterized by maximum number of inputs a transaction can have, and optimal number of inputs.
Say, the selector is given boxes denoted by their values (1,2,3,4,...10). Then the selector is working as follows:
1) the selector first picking up boxes in given order (1,2,3,4,...) by using DefaultBoxSelector 2) if number of inputs exceeds the limit, the selector is sorting remaining boxes(actually, only 10*maximum boxes) by value in descending order and replaces small-value boxes in the inputs by big-value from the tail (1,2,3,4 => 10) 3) if the number of inputs still exceeds the limit, the selector is trying to throw away the dust if possible. E.g. if inputs are (100, 200, 1, 2, 1000), target value is 1300 and maximum number of inputs is 3, the selector kicks out (1, 2) 4) if number of inputs after the previous steps is below optimal, the selector is trying to append the dust, by sorting remaining boxes in ascending order and appending them till optimal number of inputs.