diff options
| author | Luke Shumaker <lukeshu@lukeshu.com> | 2022-07-01 00:19:38 -0600 |
|---|---|---|
| committer | Luke Shumaker <lukeshu@lukeshu.com> | 2022-07-01 00:19:38 -0600 |
| commit | 7d2d4ae383e02a03dec6aa60207e3a1dfa8e79a9 (patch) | |
| tree | 5cbe78f32ae384eaae01352a6626bc83461677ff /pkg/btrfs | |
| parent | aee0fa4cf09ef5af90e28441d673ce440e4c2c16 (diff) | |
move dumb map and sort operations to util/generic.go
Also, the optimization of reversing the node list in pass1 isn't relevant
anymore now that I'm using rbtrees
Diffstat (limited to 'pkg/btrfs')
| -rw-r--r-- | pkg/btrfs/btrfsvol/chunk.go | 5 |
1 files changed, 1 insertions, 4 deletions
diff --git a/pkg/btrfs/btrfsvol/chunk.go b/pkg/btrfs/btrfsvol/chunk.go index 146193d..8e5c4db 100644 --- a/pkg/btrfs/btrfsvol/chunk.go +++ b/pkg/btrfs/btrfsvol/chunk.go @@ -74,10 +74,7 @@ func (a chunkMapping) union(rest ...chunkMapping) (chunkMapping, error) { }] = struct{}{} } } - ret.PAddrs = make([]QualifiedPhysicalAddr, 0, len(paddrs)) - for paddr := range paddrs { - ret.PAddrs = append(ret.PAddrs, paddr) - } + ret.PAddrs = util.MapKeys(paddrs) sort.Slice(ret.PAddrs, func(i, j int) bool { return ret.PAddrs[i].Cmp(ret.PAddrs[j]) < 0 }) |