diff options
| author | 2019-09-23 14:33:09 -0700 | |
|---|---|---|
| committer | 2019-09-29 23:26:37 -0700 | |
| commit | 0a2f719bcaad397f27bcf52cd6604df6b5cec03b (patch) | |
| tree | 9800973e04508e6440026f8e56fd876f7fc33807 /android/util.go | |
| parent | 852116a061d8a339d0bca72744941537bcdba7ca (diff) | |
Move sharding functions for reuse
Move shardPaths and shardTests to android.ShardPaths and
android.ShardStrings for reuse in other packages.
Test: m checkbuild
Change-Id: I868802872c73616b80f56cbf11f959c01a8b793a
Diffstat (limited to 'android/util.go')
| -rw-r--r-- | android/util.go | 33 |
1 files changed, 33 insertions, 0 deletions
diff --git a/android/util.go b/android/util.go index 010244209..71ded5e07 100644 --- a/android/util.go +++ b/android/util.go @@ -319,3 +319,36 @@ func SplitFileExt(name string) (string, string, string) { return root, suffix, ext } + +// ShardPaths takes a Paths, and returns a slice of Paths where each one has at most shardSize paths. +func ShardPaths(paths Paths, shardSize int) []Paths { + if len(paths) == 0 { + return nil + } + ret := make([]Paths, 0, (len(paths)+shardSize-1)/shardSize) + for len(paths) > shardSize { + ret = append(ret, paths[0:shardSize]) + paths = paths[shardSize:] + } + if len(paths) > 0 { + ret = append(ret, paths) + } + return ret +} + +// ShardStrings takes a slice of strings, and returns a slice of slices of strings where each one has at most shardSize +// elements. +func ShardStrings(s []string, shardSize int) [][]string { + if len(s) == 0 { + return nil + } + ret := make([][]string, 0, (len(s)+shardSize-1)/shardSize) + for len(s) > shardSize { + ret = append(ret, s[0:shardSize]) + s = s[shardSize:] + } + if len(s) > 0 { + ret = append(ret, s) + } + return ret +} |