Co-authored-by: Dev Ojha <ValarDragon@users.noreply.github.com> Co-authored-by: Julien Robert <julien@rbrt.fr>
This commit is contained in:
parent
52c3db2eae
commit
23b78d9dd1
@ -43,6 +43,7 @@ Ref: https://keepachangelog.com/en/1.0.0/
|
||||
* (x/gov) [#18707](https://github.com/cosmos/cosmos-sdk/pull/18707) Improve genesis validation.
|
||||
* (x/auth/tx) [#18772](https://github.com/cosmos/cosmos-sdk/pull/18772) Remove misleading gas wanted from tx simulation failure log.
|
||||
* (client/tx) [#18852](https://github.com/cosmos/cosmos-sdk/pull/18852) Add `WithFromName` to tx factory.
|
||||
* (types) [#18875](https://github.com/cosmos/cosmos-sdk/pull/18875) Speedup coins.Sort() if len(coins) <= 1
|
||||
|
||||
### Bug Fixes
|
||||
|
||||
|
||||
@ -820,7 +820,12 @@ var _ sort.Interface = Coins{}
|
||||
|
||||
// Sort is a helper function to sort the set of coins in-place
|
||||
func (coins Coins) Sort() Coins {
|
||||
sort.Sort(coins)
|
||||
// sort.Sort(coins) does a costly runtime copy as part of `runtime.convTSlice`
|
||||
// So we avoid this heap allocation if len(coins) <= 1. In the future, we should hopefully find
|
||||
// a strategy to always avoid this.
|
||||
if len(coins) > 1 {
|
||||
sort.Sort(coins)
|
||||
}
|
||||
return coins
|
||||
}
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user