Struct cardano_serialization_lib::Assets
source · pub struct Assets(_);
Implementations§
source§impl Assets
impl Assets
pub fn from_bytes(bytes: Vec<u8>) -> Result<Assets, DeserializeError>
source§impl Assets
impl Assets
sourcepub fn new() -> Self
pub fn new() -> Self
Examples found in repository?
src/lib.rs (line 3589)
3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606
fn as_multiasset(&self, is_positive: bool) -> MultiAsset {
self.0.iter().fold(MultiAsset::new(), |res, e : &(PolicyID, MintAssets) | {
let assets: Assets = (e.1).0.iter().fold(Assets::new(), |res, e| {
let mut assets = res;
if e.1.is_positive() == is_positive {
let amount = match is_positive {
true => e.1.as_positive(),
false => e.1.as_negative(),
};
assets.insert(&e.0, &amount.unwrap());
}
assets
});
let mut ma = res;
if !assets.0.is_empty() {
ma.insert(&e.0, &assets);
}
ma
})
}
More examples
src/utils.rs (line 455)
431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472
pub fn checked_add(&self, rhs: &Value) -> Result<Value, JsError> {
use std::collections::btree_map::Entry;
let coin = self.coin.checked_add(&rhs.coin)?;
let multiasset = match (&self.multiasset, &rhs.multiasset) {
(Some(lhs_multiasset), Some(rhs_multiasset)) => {
let mut multiasset = MultiAsset::new();
for ma in &[lhs_multiasset, rhs_multiasset] {
for (policy, assets) in &ma.0 {
for (asset_name, amount) in &assets.0 {
match multiasset.0.entry(policy.clone()) {
Entry::Occupied(mut assets) => {
match assets.get_mut().0.entry(asset_name.clone()) {
Entry::Occupied(mut assets) => {
let current = assets.get_mut();
*current = current.checked_add(&amount)?;
}
Entry::Vacant(vacant_entry) => {
vacant_entry.insert(amount.clone());
}
}
}
Entry::Vacant(entry) => {
let mut assets = Assets::new();
assets.0.insert(asset_name.clone(), amount.clone());
entry.insert(assets);
}
}
}
}
}
Some(multiasset)
}
(None, None) => None,
(Some(ma), None) => Some(ma.clone()),
(None, Some(ma)) => Some(ma.clone()),
};
Ok(Value { coin, multiasset })
}
src/tx_builder.rs (line 1447)
1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
fn pack_nfts_for_change(
max_value_size: u32,
data_cost: &DataCost,
change_address: &Address,
change_estimator: &Value,
plutus_data: &Option<DataOption>,
script_ref: &Option<ScriptRef>,
) -> Result<Vec<MultiAsset>, JsError> {
// we insert the entire available ADA temporarily here since that could potentially impact the size
// as it could be 1, 2 3 or 4 bytes for Coin.
let mut change_assets: Vec<MultiAsset> = Vec::new();
let mut base_coin = Value::new(&change_estimator.coin());
base_coin.set_multiasset(&MultiAsset::new());
let mut output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// If this becomes slow on large TXs we can optimize it like the following
// to avoid cloning + reserializing the entire output.
// This would probably be more relevant if we use a smarter packing algorithm
// which might need to compare more size differences than greedy
//let mut bytes_used = output.to_bytes().len();
// a greedy packing is done here to avoid an exponential bin-packing
// which in most cases likely shouldn't be the difference between
// having an extra change output or not unless there are gigantic
// differences in NFT policy sizes
for (policy, assets) in change_estimator.multiasset().unwrap().0.iter() {
// for simplicity we also don't split assets within a single policy since
// you would need to have a very high amoun of assets (which add 1-36 bytes each)
// in a single policy to make a difference. In the future if this becomes an issue
// we can change that here.
// this is the other part of the optimization but we need to take into account
// the difference between CBOR encoding which can change which happens in two places:
// a) length within assets of one policy id
// b) length of the entire multiasset
// so for simplicity we will just do it the safe, naive way unless
// performance becomes an issue.
//let extra_bytes = policy.to_bytes().len() + assets.to_bytes().len() + 2 + cbor_len_diff;
//if bytes_used + extra_bytes <= max_value_size as usize {
let mut old_amount = output.amount.clone();
let mut val = Value::new(&Coin::zero());
let mut next_nft = MultiAsset::new();
let asset_names = assets.keys();
let mut rebuilt_assets = Assets::new();
for n in 0..asset_names.len() {
let asset_name = asset_names.get(n);
let value = assets.get(&asset_name).unwrap();
if will_adding_asset_make_output_overflow(
&output,
&rebuilt_assets,
(policy.clone(), asset_name.clone(), value),
max_value_size,
data_cost,
)? {
// if we got here, this means we will run into a overflow error,
// so we want to split into multiple outputs, for that we...
// 1. insert the current assets as they are, as this won't overflow
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
change_assets.push(output.amount.multiasset().unwrap());
// 2. create a new output with the base coin value as zero
base_coin = Value::new(&Coin::zero());
base_coin.set_multiasset(&MultiAsset::new());
output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// 3. continue building the new output from the asset we stopped
old_amount = output.amount.clone();
val = Value::new(&Coin::zero());
next_nft = MultiAsset::new();
rebuilt_assets = Assets::new();
}
rebuilt_assets.insert(&asset_name, &value);
}
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
// calculate minADA for more precise max value size
let mut amount_clone = output.amount.clone();
let mut calc = MinOutputAdaCalculator::new_empty(data_cost)?;
calc.set_amount(&val);
let min_ada = calc.calculate_ada()?;
amount_clone.set_coin(&min_ada);
if amount_clone.to_bytes().len() > max_value_size as usize {
output.amount = old_amount;
break;
}
}
change_assets.push(output.amount.multiasset().unwrap());
Ok(change_assets)
}
pub fn len(&self) -> usize
sourcepub fn insert(&mut self, key: &AssetName, value: &BigNum) -> Option<BigNum>
pub fn insert(&mut self, key: &AssetName, value: &BigNum) -> Option<BigNum>
Examples found in repository?
src/lib.rs (line 3360)
3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606
pub fn set_asset(
&mut self,
policy_id: &PolicyID,
asset_name: &AssetName,
value: BigNum,
) -> Option<BigNum> {
self.0
.entry(policy_id.clone())
.or_default()
.insert(asset_name, &value)
}
/// returns the amount of asset {asset_name} under policy {policy_id}
/// If such an asset does not exist, 0 is returned.
pub fn get_asset(&self, policy_id: &PolicyID, asset_name: &AssetName) -> BigNum {
(|| self.0.get(policy_id)?.get(asset_name))().unwrap_or(BigNum::zero())
}
/// returns all policy IDs used by assets in this multiasset
pub fn keys(&self) -> PolicyIDs {
ScriptHashes(
self.0
.iter()
.map(|(k, _v)| k.clone())
.collect::<Vec<PolicyID>>(),
)
}
/// removes an asset from the list if the result is 0 or less
/// does not modify this object, instead the result is returned
pub fn sub(&self, rhs_ma: &MultiAsset) -> MultiAsset {
let mut lhs_ma = self.clone();
for (policy, assets) in &rhs_ma.0 {
for (asset_name, amount) in &assets.0 {
match lhs_ma.0.get_mut(policy) {
Some(assets) => match assets.0.get_mut(asset_name) {
Some(current) => match current.checked_sub(&amount) {
Ok(new) => match new.compare(&to_bignum(0)) {
0 => {
assets.0.remove(asset_name);
match assets.0.len() {
0 => {
lhs_ma.0.remove(policy);
}
_ => {}
}
}
_ => *current = new,
},
Err(_) => {
assets.0.remove(asset_name);
match assets.0.len() {
0 => {
lhs_ma.0.remove(policy);
}
_ => {}
}
}
},
None => {
// asset name is missing from left hand side
}
},
None => {
// policy id missing from left hand side
}
}
}
}
lhs_ma
}
}
// deriving PartialOrd doesn't work in a way that's useful , as the
// implementation of PartialOrd for BTreeMap compares keys by their order,
// i.e, is equivalent to comparing the iterators of (pid, Assets).
// that would mean that: v1 < v2 if the min_pid(v1) < min_pid(v2)
// this function instead compares amounts, assuming that if a pair (pid, aname)
// is not in the MultiAsset then it has an amount of 0
impl PartialOrd for MultiAsset {
fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
fn amount_or_zero(ma: &MultiAsset, pid: &PolicyID, aname: &AssetName) -> Coin {
ma.get(&pid)
.and_then(|assets| assets.get(aname))
.unwrap_or(to_bignum(0u64)) // assume 0 if asset not present
}
// idea: if (a-b) > 0 for some asset, then a > b for at least some asset
fn is_all_zeros(lhs: &MultiAsset, rhs: &MultiAsset) -> bool {
for (pid, assets) in lhs.0.iter() {
for (aname, amount) in assets.0.iter() {
match amount
.clamped_sub(&amount_or_zero(&rhs, pid, aname))
.cmp(&to_bignum(0))
{
std::cmp::Ordering::Equal => (),
_ => return false,
}
}
}
true
}
match (is_all_zeros(self, other), is_all_zeros(other, self)) {
(true, true) => Some(std::cmp::Ordering::Equal),
(true, false) => Some(std::cmp::Ordering::Less),
(false, true) => Some(std::cmp::Ordering::Greater),
(false, false) => None,
}
}
}
#[wasm_bindgen]
pub struct MintsAssets(Vec<MintAssets>);
impl MintsAssets {
pub fn new() -> Self {
Self(Vec::new())
}
pub fn add(&mut self, mint_assets: MintAssets) {
self.0.push(mint_assets)
}
pub fn get(&self, index: usize) -> Option<MintAssets> {
self.0.get(index).map(|v| v.clone())
}
}
#[wasm_bindgen]
#[derive(
Clone, Debug, Eq, Ord, PartialEq, PartialOrd, serde::Serialize, serde::Deserialize, JsonSchema,
)]
pub struct MintAssets(std::collections::BTreeMap<AssetName, Int>);
#[wasm_bindgen]
impl MintAssets {
pub fn new() -> Self {
Self(std::collections::BTreeMap::new())
}
pub fn new_from_entry(key: &AssetName, value: Int) -> Self {
let mut ma = MintAssets::new();
ma.insert(key, value);
ma
}
pub fn len(&self) -> usize {
self.0.len()
}
pub fn insert(&mut self, key: &AssetName, value: Int) -> Option<Int> {
self.0.insert(key.clone(), value)
}
pub fn get(&self, key: &AssetName) -> Option<Int> {
self.0.get(key).map(|v| v.clone())
}
pub fn keys(&self) -> AssetNames {
AssetNames(
self.0
.iter()
.map(|(k, _v)| k.clone())
.collect::<Vec<AssetName>>(),
)
}
}
#[wasm_bindgen]
#[derive(
Clone, Debug, Eq, Ord, PartialEq, PartialOrd, serde::Serialize, serde::Deserialize, JsonSchema,
)]
pub struct Mint(Vec<(PolicyID, MintAssets)>);
impl_to_from!(Mint);
#[wasm_bindgen]
impl Mint {
pub fn new() -> Self {
Self(Vec::new())
}
pub fn new_from_entry(key: &PolicyID, value: &MintAssets) -> Self {
let mut m = Mint::new();
m.insert(key, value);
m
}
pub fn len(&self) -> usize {
self.0.len()
}
//always returns None, because insert doesn't replace an old value
pub fn insert(&mut self, key: &PolicyID, value: &MintAssets) -> Option<MintAssets> {
self.0.push((key.clone(), value.clone()));
None
}
/// !!! DEPRECATED !!!
/// Mint can store multiple entries for the same policy id.
/// Use `.get_all` instead.
#[deprecated(
since = "11.2.0",
note = "Mint can store multiple entries for the same policy id. Use `.get_all` instead."
)]
pub fn get(&self, key: &PolicyID) -> Option<MintAssets> {
self.0
.iter()
.filter(|(k, _)| k.eq(key))
.next()
.map(|(_k, v)| v.clone())
}
pub fn get_all(&self, key: &PolicyID) -> Option<MintsAssets> {
let mints : Vec<MintAssets> = self.0
.iter()
.filter(|(k, _)| k.eq(key))
.map(|(_k, v)| v.clone())
.collect();
if mints.is_empty() {
None
} else {
Some(MintsAssets(mints))
}
}
pub fn keys(&self) -> PolicyIDs {
ScriptHashes(
self.0
.iter()
.map(|(k, _)| k.clone())
.collect::<Vec<ScriptHash>>(),
)
}
fn as_multiasset(&self, is_positive: bool) -> MultiAsset {
self.0.iter().fold(MultiAsset::new(), |res, e : &(PolicyID, MintAssets) | {
let assets: Assets = (e.1).0.iter().fold(Assets::new(), |res, e| {
let mut assets = res;
if e.1.is_positive() == is_positive {
let amount = match is_positive {
true => e.1.as_positive(),
false => e.1.as_negative(),
};
assets.insert(&e.0, &amount.unwrap());
}
assets
});
let mut ma = res;
if !assets.0.is_empty() {
ma.insert(&e.0, &assets);
}
ma
})
}
More examples
src/tx_builder.rs (line 1381)
1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
fn will_adding_asset_make_output_overflow(
output: &TransactionOutput,
current_assets: &Assets,
asset_to_add: (PolicyID, AssetName, BigNum),
max_value_size: u32,
data_cost: &DataCost,
) -> Result<bool, JsError> {
let (policy, asset_name, value) = asset_to_add;
let mut current_assets_clone = current_assets.clone();
current_assets_clone.insert(&asset_name, &value);
let mut amount_clone = output.amount.clone();
let mut val = Value::new(&Coin::zero());
let mut ma = MultiAsset::new();
ma.insert(&policy, ¤t_assets_clone);
val.set_multiasset(&ma);
amount_clone = amount_clone.checked_add(&val)?;
// calculate minADA for more precise max value size
let mut calc = MinOutputAdaCalculator::new_empty(data_cost)?;
calc.set_amount(&val);
let min_ada = calc.calculate_ada()?;
amount_clone.set_coin(&min_ada);
Ok(amount_clone.to_bytes().len() > max_value_size as usize)
}
fn pack_nfts_for_change(
max_value_size: u32,
data_cost: &DataCost,
change_address: &Address,
change_estimator: &Value,
plutus_data: &Option<DataOption>,
script_ref: &Option<ScriptRef>,
) -> Result<Vec<MultiAsset>, JsError> {
// we insert the entire available ADA temporarily here since that could potentially impact the size
// as it could be 1, 2 3 or 4 bytes for Coin.
let mut change_assets: Vec<MultiAsset> = Vec::new();
let mut base_coin = Value::new(&change_estimator.coin());
base_coin.set_multiasset(&MultiAsset::new());
let mut output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// If this becomes slow on large TXs we can optimize it like the following
// to avoid cloning + reserializing the entire output.
// This would probably be more relevant if we use a smarter packing algorithm
// which might need to compare more size differences than greedy
//let mut bytes_used = output.to_bytes().len();
// a greedy packing is done here to avoid an exponential bin-packing
// which in most cases likely shouldn't be the difference between
// having an extra change output or not unless there are gigantic
// differences in NFT policy sizes
for (policy, assets) in change_estimator.multiasset().unwrap().0.iter() {
// for simplicity we also don't split assets within a single policy since
// you would need to have a very high amoun of assets (which add 1-36 bytes each)
// in a single policy to make a difference. In the future if this becomes an issue
// we can change that here.
// this is the other part of the optimization but we need to take into account
// the difference between CBOR encoding which can change which happens in two places:
// a) length within assets of one policy id
// b) length of the entire multiasset
// so for simplicity we will just do it the safe, naive way unless
// performance becomes an issue.
//let extra_bytes = policy.to_bytes().len() + assets.to_bytes().len() + 2 + cbor_len_diff;
//if bytes_used + extra_bytes <= max_value_size as usize {
let mut old_amount = output.amount.clone();
let mut val = Value::new(&Coin::zero());
let mut next_nft = MultiAsset::new();
let asset_names = assets.keys();
let mut rebuilt_assets = Assets::new();
for n in 0..asset_names.len() {
let asset_name = asset_names.get(n);
let value = assets.get(&asset_name).unwrap();
if will_adding_asset_make_output_overflow(
&output,
&rebuilt_assets,
(policy.clone(), asset_name.clone(), value),
max_value_size,
data_cost,
)? {
// if we got here, this means we will run into a overflow error,
// so we want to split into multiple outputs, for that we...
// 1. insert the current assets as they are, as this won't overflow
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
change_assets.push(output.amount.multiasset().unwrap());
// 2. create a new output with the base coin value as zero
base_coin = Value::new(&Coin::zero());
base_coin.set_multiasset(&MultiAsset::new());
output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// 3. continue building the new output from the asset we stopped
old_amount = output.amount.clone();
val = Value::new(&Coin::zero());
next_nft = MultiAsset::new();
rebuilt_assets = Assets::new();
}
rebuilt_assets.insert(&asset_name, &value);
}
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
// calculate minADA for more precise max value size
let mut amount_clone = output.amount.clone();
let mut calc = MinOutputAdaCalculator::new_empty(data_cost)?;
calc.set_amount(&val);
let min_ada = calc.calculate_ada()?;
amount_clone.set_coin(&min_ada);
if amount_clone.to_bytes().len() > max_value_size as usize {
output.amount = old_amount;
break;
}
}
change_assets.push(output.amount.multiasset().unwrap());
Ok(change_assets)
}
sourcepub fn get(&self, key: &AssetName) -> Option<BigNum>
pub fn get(&self, key: &AssetName) -> Option<BigNum>
Examples found in repository?
src/lib.rs (line 3366)
3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436
pub fn get_asset(&self, policy_id: &PolicyID, asset_name: &AssetName) -> BigNum {
(|| self.0.get(policy_id)?.get(asset_name))().unwrap_or(BigNum::zero())
}
/// returns all policy IDs used by assets in this multiasset
pub fn keys(&self) -> PolicyIDs {
ScriptHashes(
self.0
.iter()
.map(|(k, _v)| k.clone())
.collect::<Vec<PolicyID>>(),
)
}
/// removes an asset from the list if the result is 0 or less
/// does not modify this object, instead the result is returned
pub fn sub(&self, rhs_ma: &MultiAsset) -> MultiAsset {
let mut lhs_ma = self.clone();
for (policy, assets) in &rhs_ma.0 {
for (asset_name, amount) in &assets.0 {
match lhs_ma.0.get_mut(policy) {
Some(assets) => match assets.0.get_mut(asset_name) {
Some(current) => match current.checked_sub(&amount) {
Ok(new) => match new.compare(&to_bignum(0)) {
0 => {
assets.0.remove(asset_name);
match assets.0.len() {
0 => {
lhs_ma.0.remove(policy);
}
_ => {}
}
}
_ => *current = new,
},
Err(_) => {
assets.0.remove(asset_name);
match assets.0.len() {
0 => {
lhs_ma.0.remove(policy);
}
_ => {}
}
}
},
None => {
// asset name is missing from left hand side
}
},
None => {
// policy id missing from left hand side
}
}
}
}
lhs_ma
}
}
// deriving PartialOrd doesn't work in a way that's useful , as the
// implementation of PartialOrd for BTreeMap compares keys by their order,
// i.e, is equivalent to comparing the iterators of (pid, Assets).
// that would mean that: v1 < v2 if the min_pid(v1) < min_pid(v2)
// this function instead compares amounts, assuming that if a pair (pid, aname)
// is not in the MultiAsset then it has an amount of 0
impl PartialOrd for MultiAsset {
fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
fn amount_or_zero(ma: &MultiAsset, pid: &PolicyID, aname: &AssetName) -> Coin {
ma.get(&pid)
.and_then(|assets| assets.get(aname))
.unwrap_or(to_bignum(0u64)) // assume 0 if asset not present
}
More examples
src/tx_builder.rs (line 461)
376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
pub fn add_inputs_from(
&mut self,
inputs: &TransactionUnspentOutputs,
strategy: CoinSelectionStrategyCIP2,
) -> Result<(), JsError> {
let available_inputs = &inputs.0.clone();
let mut input_total = self.get_total_input()?;
let mut output_total = self
.get_total_output()?
.checked_add(&Value::new(&self.min_fee()?))?;
match strategy {
CoinSelectionStrategyCIP2::LargestFirst => {
if self
.outputs
.0
.iter()
.any(|output| output.amount.multiasset.is_some())
{
return Err(JsError::from_str("Multiasset values not supported by LargestFirst. Please use LargestFirstMultiAsset"));
}
self.cip2_largest_first_by(
available_inputs,
&mut (0..available_inputs.len()).collect(),
&mut input_total,
&mut output_total,
|value| Some(value.coin),
)?;
}
CoinSelectionStrategyCIP2::RandomImprove => {
if self
.outputs
.0
.iter()
.any(|output| output.amount.multiasset.is_some())
{
return Err(JsError::from_str("Multiasset values not supported by RandomImprove. Please use RandomImproveMultiAsset"));
}
use rand::Rng;
let mut rng = rand::thread_rng();
let mut available_indices =
(0..available_inputs.len()).collect::<BTreeSet<usize>>();
self.cip2_random_improve_by(
available_inputs,
&mut available_indices,
&mut input_total,
&mut output_total,
|value| Some(value.coin),
&mut rng,
true,
)?;
// Phase 3: add extra inputs needed for fees (not covered by CIP-2)
// We do this at the end because this new inputs won't be associated with
// a specific output, so the improvement algorithm we do above does not apply here.
while input_total.coin < output_total.coin {
if available_indices.is_empty() {
return Err(JsError::from_str("UTxO Balance Insufficient[x]"));
}
let i = *available_indices
.iter()
.nth(rng.gen_range(0..available_indices.len()))
.unwrap();
available_indices.remove(&i);
let input = &available_inputs[i];
let input_fee = self.fee_for_input(
&input.output.address,
&input.input,
&input.output.amount,
)?;
self.add_input(&input.output.address, &input.input, &input.output.amount);
input_total = input_total.checked_add(&input.output.amount)?;
output_total = output_total.checked_add(&Value::new(&input_fee))?;
}
}
CoinSelectionStrategyCIP2::LargestFirstMultiAsset => {
// indices into {available_inputs} for inputs that contain {policy_id}:{asset_name}
let mut available_indices = (0..available_inputs.len()).collect::<Vec<usize>>();
// run largest-fist by each asset type
if let Some(ma) = output_total.multiasset.clone() {
for (policy_id, assets) in ma.0.iter() {
for (asset_name, _) in assets.0.iter() {
self.cip2_largest_first_by(
available_inputs,
&mut available_indices,
&mut input_total,
&mut output_total,
|value| value.multiasset.as_ref()?.get(policy_id)?.get(asset_name),
)?;
}
}
}
// add in remaining ADA
self.cip2_largest_first_by(
available_inputs,
&mut available_indices,
&mut input_total,
&mut output_total,
|value| Some(value.coin),
)?;
}
CoinSelectionStrategyCIP2::RandomImproveMultiAsset => {
use rand::Rng;
let mut rng = rand::thread_rng();
let mut available_indices =
(0..available_inputs.len()).collect::<BTreeSet<usize>>();
// run random-improve by each asset type
if let Some(ma) = output_total.multiasset.clone() {
for (policy_id, assets) in ma.0.iter() {
for (asset_name, _) in assets.0.iter() {
self.cip2_random_improve_by(
available_inputs,
&mut available_indices,
&mut input_total,
&mut output_total,
|value| value.multiasset.as_ref()?.get(policy_id)?.get(asset_name),
&mut rng,
false,
)?;
}
}
}
// add in remaining ADA
self.cip2_random_improve_by(
available_inputs,
&mut available_indices,
&mut input_total,
&mut output_total,
|value| Some(value.coin),
&mut rng,
false,
)?;
// Phase 3: add extra inputs needed for fees (not covered by CIP-2)
// We do this at the end because this new inputs won't be associated with
// a specific output, so the improvement algorithm we do above does not apply here.
while input_total.coin < output_total.coin {
if available_indices.is_empty() {
return Err(JsError::from_str("UTxO Balance Insufficient[x]"));
}
let i = *available_indices
.iter()
.nth(rng.gen_range(0..available_indices.len()))
.unwrap();
available_indices.remove(&i);
let input = &available_inputs[i];
let input_fee = self.fee_for_input(
&input.output.address,
&input.input,
&input.output.amount,
)?;
self.add_input(&input.output.address, &input.input, &input.output.amount);
input_total = input_total.checked_add(&input.output.amount)?;
output_total = output_total.checked_add(&Value::new(&input_fee))?;
}
}
}
Ok(())
}
fn cip2_largest_first_by<F>(
&mut self,
available_inputs: &Vec<TransactionUnspentOutput>,
available_indices: &mut Vec<usize>,
input_total: &mut Value,
output_total: &mut Value,
by: F,
) -> Result<(), JsError>
where
F: Fn(&Value) -> Option<BigNum>,
{
let mut relevant_indices = available_indices.clone();
relevant_indices.retain(|i| by(&available_inputs[*i].output.amount).is_some());
// ordered in ascending order by predicate {by}
relevant_indices
.sort_by_key(|i| by(&available_inputs[*i].output.amount).expect("filtered above"));
// iterate in decreasing order for predicate {by}
for i in relevant_indices.iter().rev() {
if by(input_total).unwrap_or(BigNum::zero())
>= by(output_total).expect("do not call on asset types that aren't in the output")
{
break;
}
let input = &available_inputs[*i];
// differing from CIP2, we include the needed fees in the targets instead of just output values
let input_fee =
self.fee_for_input(&input.output.address, &input.input, &input.output.amount)?;
self.add_input(&input.output.address, &input.input, &input.output.amount);
*input_total = input_total.checked_add(&input.output.amount)?;
*output_total = output_total.checked_add(&Value::new(&input_fee))?;
available_indices.swap_remove(available_indices.iter().position(|j| i == j).unwrap());
}
if by(input_total).unwrap_or(BigNum::zero())
< by(output_total).expect("do not call on asset types that aren't in the output")
{
return Err(JsError::from_str("UTxO Balance Insufficient"));
}
Ok(())
}
fn cip2_random_improve_by<F>(
&mut self,
available_inputs: &Vec<TransactionUnspentOutput>,
available_indices: &mut BTreeSet<usize>,
input_total: &mut Value,
output_total: &mut Value,
by: F,
rng: &mut rand::rngs::ThreadRng,
pure_ada: bool,
) -> Result<(), JsError>
where
F: Fn(&Value) -> Option<BigNum>,
{
use rand::Rng;
// Phase 1: Random Selection
let mut relevant_indices = available_indices
.iter()
.filter(|i| by(&available_inputs[**i].output.amount).is_some())
.cloned()
.collect::<Vec<usize>>();
let mut associated_indices: BTreeMap<TransactionOutput, Vec<usize>> = BTreeMap::new();
let mut outputs = self
.outputs
.0
.iter()
.filter(|output| by(&output.amount).is_some())
.cloned()
.collect::<Vec<TransactionOutput>>();
outputs.sort_by_key(|output| by(&output.amount).expect("filtered above"));
let mut available_coins = by(input_total).unwrap_or(BigNum::zero());
for output in outputs.iter().rev() {
// TODO: how should we adapt this to inputs being associated when running for other assets?
// if we do these two phases for each asset and don't take into account the other runs for other assets
// then we over-add (and potentially fail if we don't have plenty of inputs)
// On the other hand, the improvement phase it difficult to determine if a change is an improvement
// if we're trying to improve for multiple assets at a time without knowing how important each input is
// e.g. maybe we have lots of asset A but not much of B
// For now I will just have this be entirely separarte per-asset but we might want to in a later commit
// consider the improvements separately and have it take some kind of dot product / distance for assets
// during the improvement phase and have the improvement phase target multiple asset types at once.
// One issue with that is how to scale in between differnet assets. We could maybe normalize them by
// dividing each asset type by the sum of the required asset type in all outputs.
// Another possibility for adapting this to multiasstes is when associating an input x for asset type a
// we try and subtract all other assets b != a from the outputs we're trying to cover.
// It might make sense to diverge further and not consider it per-output and to instead just match against
// the sum of all outputs as one single value.
let mut added = available_coins.clone();
let needed = by(&output.amount).unwrap();
while added < needed {
if relevant_indices.is_empty() {
return Err(JsError::from_str("UTxO Balance Insufficient"));
}
let random_index = rng.gen_range(0..relevant_indices.len());
let i = relevant_indices.swap_remove(random_index);
available_indices.remove(&i);
let input = &available_inputs[i];
added = added.checked_add(
&by(&input.output.amount)
.expect("do not call on asset types that aren't in the output"),
)?;
associated_indices
.entry(output.clone())
.or_default()
.push(i);
}
available_coins = added.checked_sub(&needed)?;
}
if !relevant_indices.is_empty() && pure_ada {
// Phase 2: Improvement
for output in outputs.iter_mut() {
let associated = associated_indices.get_mut(output).unwrap();
for i in associated.iter_mut() {
let random_index = rng.gen_range(0..relevant_indices.len());
let j: &mut usize = relevant_indices.get_mut(random_index).unwrap();
let input = &available_inputs[*i];
let new_input = &available_inputs[*j];
let cur = from_bignum(&by(&input.output.amount).unwrap_or(BigNum::zero()));
let new = from_bignum(&by(&new_input.output.amount).unwrap_or(BigNum::zero()));
let min = from_bignum(&by(&output.amount).unwrap_or(BigNum::zero()));
let ideal = 2 * min;
let max = 3 * min;
let move_closer =
(ideal as i128 - new as i128).abs() < (ideal as i128 - cur as i128).abs();
let not_exceed_max = new < max;
if move_closer && not_exceed_max {
std::mem::swap(i, j);
available_indices.insert(*i);
available_indices.remove(j);
}
}
}
}
// after finalizing the improvement we need to actually add these results to the builder
for output in outputs.iter() {
if let Some(associated) = associated_indices.get(output) {
for i in associated.iter() {
let input = &available_inputs[*i];
let input_fee =
self.fee_for_input(&input.output.address, &input.input, &input.output.amount)?;
self.add_input(&input.output.address, &input.input, &input.output.amount);
*input_total = input_total.checked_add(&input.output.amount)?;
*output_total = output_total.checked_add(&Value::new(&input_fee))?;
}
}
}
Ok(())
}
pub fn set_inputs(&mut self, inputs: &TxInputsBuilder) {
self.inputs = inputs.clone();
}
pub fn set_collateral(&mut self, collateral: &TxInputsBuilder) {
self.collateral = collateral.clone();
}
pub fn set_collateral_return(&mut self, collateral_return: &TransactionOutput) {
self.collateral_return = Some(collateral_return.clone());
}
/// This function will set the collateral-return value and then auto-calculate and assign
/// the total collateral coin value. Will raise an error in case no collateral inputs are set
/// or in case the total collateral value will have any assets in it except coin.
pub fn set_collateral_return_and_total(
&mut self,
collateral_return: &TransactionOutput,
) -> Result<(), JsError> {
let collateral = &self.collateral;
if collateral.len() == 0 {
return Err(JsError::from_str(
"Cannot calculate total collateral value when collateral inputs are missing",
));
}
let col_input_value: Value = collateral.total_value()?;
let total_col: Value = col_input_value.checked_sub(&collateral_return.amount())?;
if total_col.multiasset.is_some() {
return Err(JsError::from_str(
"Total collateral value cannot contain assets!",
));
}
let min_ada = min_ada_for_output(&collateral_return, &self.config.utxo_cost())?;
if min_ada > collateral_return.amount.coin {
return Err(JsError::from_str(&format!(
"Not enough coin to make return on the collateral value!\
Increase amount of return coins. \
Min ada for return {}, but was {}",
min_ada, collateral_return.amount.coin
)));
}
self.set_collateral_return(collateral_return);
self.total_collateral = Some(total_col.coin);
Ok(())
}
pub fn set_total_collateral(&mut self, total_collateral: &Coin) {
self.total_collateral = Some(total_collateral.clone());
}
/// This function will set the total-collateral coin and then auto-calculate and assign
/// the collateral return value. Will raise an error in case no collateral inputs are set.
/// The specified address will be the received of the collateral return
pub fn set_total_collateral_and_return(
&mut self,
total_collateral: &Coin,
return_address: &Address,
) -> Result<(), JsError> {
let collateral = &self.collateral;
if collateral.len() == 0 {
return Err(JsError::from_str(
"Cannot calculate collateral return when collateral inputs are missing",
));
}
let col_input_value: Value = collateral.total_value()?;
let col_return: Value = col_input_value.checked_sub(&Value::new(&total_collateral))?;
if col_return.multiasset.is_some() || col_return.coin > BigNum::zero() {
let return_output = TransactionOutput::new(return_address, &col_return);
let min_ada = min_ada_for_output(&return_output, &self.config.utxo_cost())?;
if min_ada > col_return.coin {
return Err(JsError::from_str(&format!(
"Not enough coin to make return on the collateral value!\
Decrease the total collateral value or add more collateral inputs. \
Min ada for return {}, but was {}",
min_ada, col_return.coin
)));
}
self.collateral_return = Some(return_output);
}
self.set_total_collateral(total_collateral);
Ok(())
}
pub fn add_reference_input(&mut self, reference_input: &TransactionInput) {
self.reference_inputs.insert(reference_input.clone());
}
/// We have to know what kind of inputs these are to know what kind of mock witnesses to create since
/// 1) mock witnesses have different lengths depending on the type which changes the expecting fee
/// 2) Witnesses are a set so we need to get rid of duplicates to avoid over-estimating the fee
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_key_input(
&mut self,
hash: &Ed25519KeyHash,
input: &TransactionInput,
amount: &Value,
) {
self.inputs.add_key_input(hash, input, amount);
}
/// This method adds the input to the builder BUT leaves a missing spot for the witness native script
///
/// After adding the input with this method, use `.add_required_native_input_scripts`
/// and `.add_required_plutus_input_scripts` to add the witness scripts
///
/// Or instead use `.add_native_script_input` and `.add_plutus_script_input`
/// to add inputs right along with the script, instead of the script hash
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_script_input(
&mut self,
hash: &ScriptHash,
input: &TransactionInput,
amount: &Value,
) {
self.inputs.add_script_input(hash, input, amount);
}
/// This method will add the input to the builder and also register the required native script witness
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_native_script_input(
&mut self,
script: &NativeScript,
input: &TransactionInput,
amount: &Value,
) {
self.inputs.add_native_script_input(script, input, amount);
}
/// This method will add the input to the builder and also register the required plutus witness
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_plutus_script_input(
&mut self,
witness: &PlutusWitness,
input: &TransactionInput,
amount: &Value,
) {
self.inputs.add_plutus_script_input(witness, input, amount);
}
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_bootstrap_input(
&mut self,
hash: &ByronAddress,
input: &TransactionInput,
amount: &Value,
) {
self.inputs.add_bootstrap_input(hash, input, amount);
}
/// Note that for script inputs this method will use underlying generic `.add_script_input`
/// which leaves a required empty spot for the script witness (or witnesses in case of Plutus).
/// You can use `.add_native_script_input` or `.add_plutus_script_input` directly to register the input along with the witness.
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_input(&mut self, address: &Address, input: &TransactionInput, amount: &Value) {
self.inputs.add_input(address, input, amount);
}
/// Returns the number of still missing input scripts (either native or plutus)
/// Use `.add_required_native_input_scripts` or `.add_required_plutus_input_scripts` to add the missing scripts
#[deprecated(since = "10.2.0", note = "Use `.count_missing_input_scripts` from `TxInputsBuilder`")]
pub fn count_missing_input_scripts(&self) -> usize {
self.inputs.count_missing_input_scripts()
}
/// Try adding the specified scripts as witnesses for ALREADY ADDED script inputs
/// Any scripts that don't match any of the previously added inputs will be ignored
/// Returns the number of remaining required missing witness scripts
/// Use `.count_missing_input_scripts` to find the number of still missing scripts
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_required_native_input_scripts(&mut self, scripts: &NativeScripts) -> usize {
self.inputs.add_required_native_input_scripts(scripts)
}
/// Try adding the specified scripts as witnesses for ALREADY ADDED script inputs
/// Any scripts that don't match any of the previously added inputs will be ignored
/// Returns the number of remaining required missing witness scripts
/// Use `.count_missing_input_scripts` to find the number of still missing scripts
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn add_required_plutus_input_scripts(&mut self, scripts: &PlutusWitnesses) -> usize {
self.inputs.add_required_plutus_input_scripts(scripts)
}
/// Returns a copy of the current script input witness scripts in the builder
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn get_native_input_scripts(&self) -> Option<NativeScripts> {
self.inputs.get_native_input_scripts()
}
/// Returns a copy of the current plutus input witness scripts in the builder.
/// NOTE: each plutus witness will be cloned with a specific corresponding input index
#[deprecated(since = "10.2.0", note = "Use `.set_inputs`")]
pub fn get_plutus_input_scripts(&self) -> Option<PlutusWitnesses> {
self.inputs.get_plutus_input_scripts()
}
/// calculates how much the fee would increase if you added a given output
pub fn fee_for_input(
&self,
address: &Address,
input: &TransactionInput,
amount: &Value,
) -> Result<Coin, JsError> {
let mut self_copy = self.clone();
// we need some value for these for it to be a a valid transaction
// but since we're only calculating the difference between the fee of two transactions
// it doesn't matter what these are set as, since it cancels out
self_copy.set_fee(&to_bignum(0));
let fee_before = min_fee(&self_copy)?;
self_copy.add_input(&address, &input, &amount);
let fee_after = min_fee(&self_copy)?;
fee_after.checked_sub(&fee_before)
}
/// Add explicit output via a TransactionOutput object
pub fn add_output(&mut self, output: &TransactionOutput) -> Result<(), JsError> {
let value_size = output.amount.to_bytes().len();
if value_size > self.config.max_value_size as usize {
return Err(JsError::from_str(&format!(
"Maximum value size of {} exceeded. Found: {}",
self.config.max_value_size, value_size
)));
}
let min_ada = min_ada_for_output(&output, &self.config.utxo_cost())?;
if output.amount().coin() < min_ada {
Err(JsError::from_str(&format!(
"Value {} less than the minimum UTXO value {}",
from_bignum(&output.amount().coin()),
from_bignum(&min_ada)
)))
} else {
self.outputs.add(output);
Ok(())
}
}
/// calculates how much the fee would increase if you added a given output
pub fn fee_for_output(&self, output: &TransactionOutput) -> Result<Coin, JsError> {
let mut self_copy = self.clone();
// we need some value for these for it to be a a valid transaction
// but since we're only calculating the different between the fee of two transactions
// it doesn't matter what these are set as, since it cancels out
self_copy.set_fee(&to_bignum(0));
let fee_before = min_fee(&self_copy)?;
self_copy.add_output(&output)?;
let fee_after = min_fee(&self_copy)?;
fee_after.checked_sub(&fee_before)
}
pub fn set_fee(&mut self, fee: &Coin) {
self.fee = Some(fee.clone())
}
/// !!! DEPRECATED !!!
/// Set ttl value.
#[deprecated(
since = "10.1.0",
note = "Underlying value capacity of ttl (BigNum u64) bigger then Slot32. Use set_ttl_bignum instead."
)]
pub fn set_ttl(&mut self, ttl: Slot32) {
self.ttl = Some(ttl.into())
}
pub fn set_ttl_bignum(&mut self, ttl: &SlotBigNum) {
self.ttl = Some(ttl.clone())
}
/// !!! DEPRECATED !!!
/// Uses outdated slot number format.
#[deprecated(
since = "10.1.0",
note = "Underlying value capacity of validity_start_interval (BigNum u64) bigger then Slot32. Use set_validity_start_interval_bignum instead."
)]
pub fn set_validity_start_interval(&mut self, validity_start_interval: Slot32) {
self.validity_start_interval = Some(validity_start_interval.into())
}
pub fn set_validity_start_interval_bignum(&mut self, validity_start_interval: SlotBigNum) {
self.validity_start_interval = Some(validity_start_interval.clone())
}
pub fn set_certs(&mut self, certs: &Certificates) {
self.certs = Some(certs.clone());
for cert in &certs.0 {
self.inputs
.add_required_signers(&witness_keys_for_cert(cert))
}
}
pub fn set_withdrawals(&mut self, withdrawals: &Withdrawals) {
self.withdrawals = Some(withdrawals.clone());
for (withdrawal, _coin) in &withdrawals.0 {
self.inputs
.add_required_signer(&withdrawal.payment_cred().to_keyhash().unwrap())
}
}
pub fn get_auxiliary_data(&self) -> Option<AuxiliaryData> {
self.auxiliary_data.clone()
}
/// Set explicit auxiliary data via an AuxiliaryData object
/// It might contain some metadata plus native or Plutus scripts
pub fn set_auxiliary_data(&mut self, auxiliary_data: &AuxiliaryData) {
self.auxiliary_data = Some(auxiliary_data.clone())
}
/// Set metadata using a GeneralTransactionMetadata object
/// It will be set to the existing or new auxiliary data in this builder
pub fn set_metadata(&mut self, metadata: &GeneralTransactionMetadata) {
let mut aux = self
.auxiliary_data
.as_ref()
.cloned()
.unwrap_or(AuxiliaryData::new());
aux.set_metadata(metadata);
self.set_auxiliary_data(&aux);
}
/// Add a single metadatum using TransactionMetadatumLabel and TransactionMetadatum objects
/// It will be securely added to existing or new metadata in this builder
pub fn add_metadatum(&mut self, key: &TransactionMetadatumLabel, val: &TransactionMetadatum) {
let mut metadata = self
.auxiliary_data
.as_ref()
.map(|aux| aux.metadata().as_ref().cloned())
.unwrap_or(None)
.unwrap_or(GeneralTransactionMetadata::new());
metadata.insert(key, val);
self.set_metadata(&metadata);
}
/// Add a single JSON metadatum using a TransactionMetadatumLabel and a String
/// It will be securely added to existing or new metadata in this builder
pub fn add_json_metadatum(
&mut self,
key: &TransactionMetadatumLabel,
val: String,
) -> Result<(), JsError> {
self.add_json_metadatum_with_schema(key, val, MetadataJsonSchema::NoConversions)
}
/// Add a single JSON metadatum using a TransactionMetadatumLabel, a String, and a MetadataJsonSchema object
/// It will be securely added to existing or new metadata in this builder
pub fn add_json_metadatum_with_schema(
&mut self,
key: &TransactionMetadatumLabel,
val: String,
schema: MetadataJsonSchema,
) -> Result<(), JsError> {
let metadatum = encode_json_str_to_metadatum(val, schema)?;
self.add_metadatum(key, &metadatum);
Ok(())
}
pub fn set_mint_builder(&mut self, mint_builder: &MintBuilder) {
self.mint = Some(mint_builder.clone());
}
pub fn get_mint_builder(&self) -> Option<MintBuilder> {
self.mint.clone()
}
/// !!! DEPRECATED !!!
/// Mints are defining by MintBuilder now.
/// Use `.set_mint_builder()` and `MintBuilder` instead.
#[deprecated(
since = "11.2.0",
note = "Mints are defining by MintBuilder now. Use `.set_mint_builder()` and `MintBuilder` instead."
)]
/// Set explicit Mint object and the required witnesses to this builder
/// it will replace any previously existing mint and mint scripts
/// NOTE! Error will be returned in case a mint policy does not have a matching script
pub fn set_mint(&mut self, mint: &Mint, mint_scripts: &NativeScripts) -> Result<(), JsError> {
assert_required_mint_scripts(mint, Some(mint_scripts))?;
let mut scripts_policies = HashMap::new();
for scipt in &mint_scripts.0 {
scripts_policies.insert(scipt.hash(), scipt.clone());
}
let mut mint_builder = MintBuilder::new();
for (policy_id, asset_map) in &mint.0 {
for (asset_name, amount) in &asset_map.0 {
if let Some(script) = scripts_policies.get(policy_id) {
let mint_witness = MintWitness::new_native_script(script);
mint_builder.set_asset(&mint_witness, asset_name, amount);
} else {
return Err(JsError::from_str("Mint policy does not have a matching script"));
}
}
}
self.mint = Some(mint_builder);
Ok(())
}
/// !!! DEPRECATED !!!
/// Mints are defining by MintBuilder now.
/// Use `.get_mint_builder()` and `.build()` instead.
#[deprecated(
since = "11.2.0",
note = "Mints are defining by MintBuilder now. Use `.get_mint_builder()` and `.build()` instead."
)]
/// Returns a copy of the current mint state in the builder
pub fn get_mint(&self) -> Option<Mint> {
match &self.mint {
Some(mint) => Some(mint.build()),
None => None,
}
}
/// Returns a copy of the current mint witness scripts in the builder
pub fn get_mint_scripts(&self) -> Option<NativeScripts> {
match &self.mint {
Some(mint) => Some(mint.get_native_scripts()),
None => None,
}
}
/// !!! DEPRECATED !!!
/// Mints are defining by MintBuilder now.
/// Use `.set_mint_builder()` and `MintBuilder` instead.
#[deprecated(
since = "11.2.0",
note = "Mints are defining by MintBuilder now. Use `.set_mint_builder()` and `MintBuilder` instead."
)]
/// Add a mint entry to this builder using a PolicyID and MintAssets object
/// It will be securely added to existing or new Mint in this builder
/// It will replace any existing mint assets with the same PolicyID
pub fn set_mint_asset(&mut self, policy_script: &NativeScript, mint_assets: &MintAssets) {
let mint_witness = MintWitness::new_native_script(policy_script);
if let Some(mint) = &mut self.mint {
for (asset, amount) in mint_assets.0.iter() {
mint.set_asset(&mint_witness, asset, amount);
}
} else {
let mut mint = MintBuilder::new();
for (asset, amount) in mint_assets.0.iter() {
mint.set_asset(&mint_witness, asset, amount);
}
self.mint = Some(mint);
}
}
/// !!! DEPRECATED !!!
/// Mints are defining by MintBuilder now.
/// Use `.set_mint_builder()` and `MintBuilder` instead.
#[deprecated(
since = "11.2.0",
note = "Mints are defining by MintBuilder now. Use `.set_mint_builder()` and `MintBuilder` instead."
)]
/// Add a mint entry to this builder using a PolicyID, AssetName, and Int object for amount
/// It will be securely added to existing or new Mint in this builder
/// It will replace any previous existing amount same PolicyID and AssetName
pub fn add_mint_asset(
&mut self,
policy_script: &NativeScript,
asset_name: &AssetName,
amount: Int,
) {
let mint_witness = MintWitness::new_native_script(policy_script);
if let Some(mint) = &mut self.mint {
mint.add_asset(&mint_witness, asset_name, &amount);
} else {
let mut mint = MintBuilder::new();
mint.add_asset(&mint_witness, asset_name, &amount);
self.mint = Some(mint);
}
}
/// Add a mint entry together with an output to this builder
/// Using a PolicyID, AssetName, Int for amount, Address, and Coin (BigNum) objects
/// The asset will be securely added to existing or new Mint in this builder
/// A new output will be added with the specified Address, the Coin value, and the minted asset
pub fn add_mint_asset_and_output(
&mut self,
policy_script: &NativeScript,
asset_name: &AssetName,
amount: Int,
output_builder: &TransactionOutputAmountBuilder,
output_coin: &Coin,
) -> Result<(), JsError> {
if !amount.is_positive() {
return Err(JsError::from_str("Output value must be positive!"));
}
let policy_id: PolicyID = policy_script.hash();
self.add_mint_asset(policy_script, asset_name, amount.clone());
let multiasset = Mint::new_from_entry(
&policy_id,
&MintAssets::new_from_entry(asset_name, amount.clone()),
)
.as_positive_multiasset();
self.add_output(
&output_builder
.with_coin_and_asset(&output_coin, &multiasset)
.build()?,
)
}
/// Add a mint entry together with an output to this builder
/// Using a PolicyID, AssetName, Int for amount, and Address objects
/// The asset will be securely added to existing or new Mint in this builder
/// A new output will be added with the specified Address and the minted asset
/// The output will be set to contain the minimum required amount of Coin
pub fn add_mint_asset_and_output_min_required_coin(
&mut self,
policy_script: &NativeScript,
asset_name: &AssetName,
amount: Int,
output_builder: &TransactionOutputAmountBuilder,
) -> Result<(), JsError> {
if !amount.is_positive() {
return Err(JsError::from_str("Output value must be positive!"));
}
let policy_id: PolicyID = policy_script.hash();
self.add_mint_asset(policy_script, asset_name, amount.clone());
let multiasset = Mint::new_from_entry(
&policy_id,
&MintAssets::new_from_entry(asset_name, amount.clone()),
)
.as_positive_multiasset();
self.add_output(
&output_builder
.with_asset_and_min_required_coin_by_utxo_cost(
&multiasset,
&self.config.utxo_cost(),
)?
.build()?,
)
}
pub fn new(cfg: &TransactionBuilderConfig) -> Self {
Self {
config: cfg.clone(),
inputs: TxInputsBuilder::new(),
collateral: TxInputsBuilder::new(),
outputs: TransactionOutputs::new(),
fee: None,
ttl: None,
certs: None,
withdrawals: None,
auxiliary_data: None,
validity_start_interval: None,
mint: None,
script_data_hash: None,
required_signers: Ed25519KeyHashes::new(),
collateral_return: None,
total_collateral: None,
reference_inputs: HashSet::new(),
}
}
pub fn get_reference_inputs(&self) -> TransactionInputs {
let mut inputs = self.reference_inputs.clone();
for input in self.inputs.get_ref_inputs().0 {
inputs.insert(input);
}
let vec_inputs = inputs.into_iter().collect();
TransactionInputs(vec_inputs)
}
/// does not include refunds or withdrawals
pub fn get_explicit_input(&self) -> Result<Value, JsError> {
self.inputs
.iter()
.try_fold(Value::zero(), |acc, ref tx_builder_input| {
acc.checked_add(&tx_builder_input.amount)
})
}
/// withdrawals and refunds
pub fn get_implicit_input(&self) -> Result<Value, JsError> {
internal_get_implicit_input(
&self.withdrawals,
&self.certs,
&self.config.pool_deposit,
&self.config.key_deposit,
)
}
/// Returns mint as tuple of (mint_value, burn_value) or two zero values
fn get_mint_as_values(&self) -> (Value, Value) {
self.mint
.as_ref()
.map(|m| {
(
Value::new_from_assets(&m.build().as_positive_multiasset()),
Value::new_from_assets(&m.build().as_negative_multiasset()),
)
})
.unwrap_or((Value::zero(), Value::zero()))
}
/// Return explicit input plus implicit input plus mint
pub fn get_total_input(&self) -> Result<Value, JsError> {
let (mint_value, _) = self.get_mint_as_values();
self.get_explicit_input()?
.checked_add(&self.get_implicit_input()?)?
.checked_add(&mint_value)
}
/// Return explicit output plus deposit plus burn
pub fn get_total_output(&self) -> Result<Value, JsError> {
let (_, burn_value) = self.get_mint_as_values();
self.get_explicit_output()?
.checked_add(&Value::new(&self.get_deposit()?))?
.checked_add(&burn_value)
}
/// does not include fee
pub fn get_explicit_output(&self) -> Result<Value, JsError> {
self.outputs
.0
.iter()
.try_fold(Value::new(&to_bignum(0)), |acc, ref output| {
acc.checked_add(&output.amount())
})
}
pub fn get_deposit(&self) -> Result<Coin, JsError> {
internal_get_deposit(
&self.certs,
&self.config.pool_deposit,
&self.config.key_deposit,
)
}
pub fn get_fee_if_set(&self) -> Option<Coin> {
self.fee.clone()
}
/// Warning: this function will mutate the /fee/ field
/// Make sure to call this function last after setting all other tx-body properties
/// Editing inputs, outputs, mint, etc. after change been calculated
/// might cause a mismatch in calculated fee versus the required fee
pub fn add_change_if_needed(&mut self, address: &Address) -> Result<bool, JsError> {
let fee = match &self.fee {
None => self.min_fee(),
// generating the change output involves changing the fee
Some(_x) => {
return Err(JsError::from_str(
"Cannot calculate change if fee was explicitly specified",
))
}
}?;
// note: can't add plutus data or data hash and script to change
// because we don't know how many change outputs will need to be created
let plutus_data: Option<DataOption> = None;
let script_ref: Option<ScriptRef> = None;
let input_total = self.get_total_input()?;
let output_total = self.get_total_output()?;
let shortage = get_input_shortage(&input_total, &output_total, &fee)?;
if let Some(shortage) = shortage {
return Err(JsError::from_str(&format!("Insufficient input in transaction. {}", shortage)));
}
use std::cmp::Ordering;
match &input_total.partial_cmp(&output_total.checked_add(&Value::new(&fee))?) {
Some(Ordering::Equal) => {
// recall: min_fee assumed the fee was the maximum possible so we definitely have enough input to cover whatever fee it ends up being
self.set_fee(&input_total.checked_sub(&output_total)?.coin());
Ok(false)
}
Some(Ordering::Less) => Err(JsError::from_str("Insufficient input in transaction")),
Some(Ordering::Greater) => {
fn has_assets(ma: Option<MultiAsset>) -> bool {
ma.map(|assets| assets.len() > 0).unwrap_or(false)
}
let change_estimator = input_total.checked_sub(&output_total)?;
if has_assets(change_estimator.multiasset()) {
fn will_adding_asset_make_output_overflow(
output: &TransactionOutput,
current_assets: &Assets,
asset_to_add: (PolicyID, AssetName, BigNum),
max_value_size: u32,
data_cost: &DataCost,
) -> Result<bool, JsError> {
let (policy, asset_name, value) = asset_to_add;
let mut current_assets_clone = current_assets.clone();
current_assets_clone.insert(&asset_name, &value);
let mut amount_clone = output.amount.clone();
let mut val = Value::new(&Coin::zero());
let mut ma = MultiAsset::new();
ma.insert(&policy, ¤t_assets_clone);
val.set_multiasset(&ma);
amount_clone = amount_clone.checked_add(&val)?;
// calculate minADA for more precise max value size
let mut calc = MinOutputAdaCalculator::new_empty(data_cost)?;
calc.set_amount(&val);
let min_ada = calc.calculate_ada()?;
amount_clone.set_coin(&min_ada);
Ok(amount_clone.to_bytes().len() > max_value_size as usize)
}
fn pack_nfts_for_change(
max_value_size: u32,
data_cost: &DataCost,
change_address: &Address,
change_estimator: &Value,
plutus_data: &Option<DataOption>,
script_ref: &Option<ScriptRef>,
) -> Result<Vec<MultiAsset>, JsError> {
// we insert the entire available ADA temporarily here since that could potentially impact the size
// as it could be 1, 2 3 or 4 bytes for Coin.
let mut change_assets: Vec<MultiAsset> = Vec::new();
let mut base_coin = Value::new(&change_estimator.coin());
base_coin.set_multiasset(&MultiAsset::new());
let mut output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// If this becomes slow on large TXs we can optimize it like the following
// to avoid cloning + reserializing the entire output.
// This would probably be more relevant if we use a smarter packing algorithm
// which might need to compare more size differences than greedy
//let mut bytes_used = output.to_bytes().len();
// a greedy packing is done here to avoid an exponential bin-packing
// which in most cases likely shouldn't be the difference between
// having an extra change output or not unless there are gigantic
// differences in NFT policy sizes
for (policy, assets) in change_estimator.multiasset().unwrap().0.iter() {
// for simplicity we also don't split assets within a single policy since
// you would need to have a very high amoun of assets (which add 1-36 bytes each)
// in a single policy to make a difference. In the future if this becomes an issue
// we can change that here.
// this is the other part of the optimization but we need to take into account
// the difference between CBOR encoding which can change which happens in two places:
// a) length within assets of one policy id
// b) length of the entire multiasset
// so for simplicity we will just do it the safe, naive way unless
// performance becomes an issue.
//let extra_bytes = policy.to_bytes().len() + assets.to_bytes().len() + 2 + cbor_len_diff;
//if bytes_used + extra_bytes <= max_value_size as usize {
let mut old_amount = output.amount.clone();
let mut val = Value::new(&Coin::zero());
let mut next_nft = MultiAsset::new();
let asset_names = assets.keys();
let mut rebuilt_assets = Assets::new();
for n in 0..asset_names.len() {
let asset_name = asset_names.get(n);
let value = assets.get(&asset_name).unwrap();
if will_adding_asset_make_output_overflow(
&output,
&rebuilt_assets,
(policy.clone(), asset_name.clone(), value),
max_value_size,
data_cost,
)? {
// if we got here, this means we will run into a overflow error,
// so we want to split into multiple outputs, for that we...
// 1. insert the current assets as they are, as this won't overflow
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
change_assets.push(output.amount.multiasset().unwrap());
// 2. create a new output with the base coin value as zero
base_coin = Value::new(&Coin::zero());
base_coin.set_multiasset(&MultiAsset::new());
output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// 3. continue building the new output from the asset we stopped
old_amount = output.amount.clone();
val = Value::new(&Coin::zero());
next_nft = MultiAsset::new();
rebuilt_assets = Assets::new();
}
rebuilt_assets.insert(&asset_name, &value);
}
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
// calculate minADA for more precise max value size
let mut amount_clone = output.amount.clone();
let mut calc = MinOutputAdaCalculator::new_empty(data_cost)?;
calc.set_amount(&val);
let min_ada = calc.calculate_ada()?;
amount_clone.set_coin(&min_ada);
if amount_clone.to_bytes().len() > max_value_size as usize {
output.amount = old_amount;
break;
}
}
change_assets.push(output.amount.multiasset().unwrap());
Ok(change_assets)
}
sourcepub fn keys(&self) -> AssetNames
pub fn keys(&self) -> AssetNames
Examples found in repository?
src/tx_builder.rs (line 1446)
1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
fn pack_nfts_for_change(
max_value_size: u32,
data_cost: &DataCost,
change_address: &Address,
change_estimator: &Value,
plutus_data: &Option<DataOption>,
script_ref: &Option<ScriptRef>,
) -> Result<Vec<MultiAsset>, JsError> {
// we insert the entire available ADA temporarily here since that could potentially impact the size
// as it could be 1, 2 3 or 4 bytes for Coin.
let mut change_assets: Vec<MultiAsset> = Vec::new();
let mut base_coin = Value::new(&change_estimator.coin());
base_coin.set_multiasset(&MultiAsset::new());
let mut output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// If this becomes slow on large TXs we can optimize it like the following
// to avoid cloning + reserializing the entire output.
// This would probably be more relevant if we use a smarter packing algorithm
// which might need to compare more size differences than greedy
//let mut bytes_used = output.to_bytes().len();
// a greedy packing is done here to avoid an exponential bin-packing
// which in most cases likely shouldn't be the difference between
// having an extra change output or not unless there are gigantic
// differences in NFT policy sizes
for (policy, assets) in change_estimator.multiasset().unwrap().0.iter() {
// for simplicity we also don't split assets within a single policy since
// you would need to have a very high amoun of assets (which add 1-36 bytes each)
// in a single policy to make a difference. In the future if this becomes an issue
// we can change that here.
// this is the other part of the optimization but we need to take into account
// the difference between CBOR encoding which can change which happens in two places:
// a) length within assets of one policy id
// b) length of the entire multiasset
// so for simplicity we will just do it the safe, naive way unless
// performance becomes an issue.
//let extra_bytes = policy.to_bytes().len() + assets.to_bytes().len() + 2 + cbor_len_diff;
//if bytes_used + extra_bytes <= max_value_size as usize {
let mut old_amount = output.amount.clone();
let mut val = Value::new(&Coin::zero());
let mut next_nft = MultiAsset::new();
let asset_names = assets.keys();
let mut rebuilt_assets = Assets::new();
for n in 0..asset_names.len() {
let asset_name = asset_names.get(n);
let value = assets.get(&asset_name).unwrap();
if will_adding_asset_make_output_overflow(
&output,
&rebuilt_assets,
(policy.clone(), asset_name.clone(), value),
max_value_size,
data_cost,
)? {
// if we got here, this means we will run into a overflow error,
// so we want to split into multiple outputs, for that we...
// 1. insert the current assets as they are, as this won't overflow
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
change_assets.push(output.amount.multiasset().unwrap());
// 2. create a new output with the base coin value as zero
base_coin = Value::new(&Coin::zero());
base_coin.set_multiasset(&MultiAsset::new());
output = TransactionOutput {
address: change_address.clone(),
amount: base_coin.clone(),
plutus_data: plutus_data.clone(),
script_ref: script_ref.clone(),
};
// 3. continue building the new output from the asset we stopped
old_amount = output.amount.clone();
val = Value::new(&Coin::zero());
next_nft = MultiAsset::new();
rebuilt_assets = Assets::new();
}
rebuilt_assets.insert(&asset_name, &value);
}
next_nft.insert(policy, &rebuilt_assets);
val.set_multiasset(&next_nft);
output.amount = output.amount.checked_add(&val)?;
// calculate minADA for more precise max value size
let mut amount_clone = output.amount.clone();
let mut calc = MinOutputAdaCalculator::new_empty(data_cost)?;
calc.set_amount(&val);
let min_ada = calc.calculate_ada()?;
amount_clone.set_coin(&min_ada);
if amount_clone.to_bytes().len() > max_value_size as usize {
output.amount = old_amount;
break;
}
}
change_assets.push(output.amount.multiasset().unwrap());
Ok(change_assets)
}
Trait Implementations§
source§impl<'de> Deserialize<'de> for Assets
impl<'de> Deserialize<'de> for Assets
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Deserialize for Assets
impl Deserialize for Assets
fn deserialize<R: BufRead + Seek>(
raw: &mut Deserializer<R>
) -> Result<Self, DeserializeError>
source§impl JsonSchema for Assets
impl JsonSchema for Assets
source§fn schema_name() -> String
fn schema_name() -> String
The name of the generated JSON Schema. Read more
source§fn json_schema(gen: &mut SchemaGenerator) -> Schema
fn json_schema(gen: &mut SchemaGenerator) -> Schema
Generates a JSON Schema for this type. Read more
source§fn is_referenceable() -> bool
fn is_referenceable() -> bool
Whether JSON Schemas generated for this type should be re-used where possible using the
$ref
keyword. Read moresource§impl Ord for Assets
impl Ord for Assets
source§impl PartialEq<Assets> for Assets
impl PartialEq<Assets> for Assets
source§impl PartialOrd<Assets> for Assets
impl PartialOrd<Assets> for Assets
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl Serialize for Assets
impl Serialize for Assets
fn serialize<'se, W: Write>(
&self,
serializer: &'se mut Serializer<W>
) -> Result<&'se mut Serializer<W>>
impl Eq for Assets
impl StructuralEq for Assets
impl StructuralPartialEq for Assets
Auto Trait Implementations§
impl RefUnwindSafe for Assets
impl Send for Assets
impl Sync for Assets
impl Unpin for Assets
impl UnwindSafe for Assets
Blanket Implementations§
source§impl<T> Clear for Twhere
T: InitializableFromZeroed + ?Sized,
impl<T> Clear for Twhere
T: InitializableFromZeroed + ?Sized,
source§impl<T> InitializableFromZeroed for Twhere
T: Default,
impl<T> InitializableFromZeroed for Twhere
T: Default,
source§unsafe fn initialize(place: *mut T)
unsafe fn initialize(place: *mut T)
Called to initialize a place to a valid value, after it is set
to all-bits-zero. Read more