grim/convey

Remove util/product.go and its tests as they're no longer used

2019-10-26, Gary Kramlich
30c421b637ed
Parents 5b36866f1634
Children 6ae333e6277f
Remove util/product.go and its tests as they're no longer used
2 files changed, 0 insertions(+), 139 deletions(-)
  • +0 -89
    util/product.go
  • +0 -50
    util/product_test.go
    • --- a/util/product.go Sat Oct 26 14:33:19 2019 -0500
    +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
    @@ -1,89 +0,0 @@
    -// Convey
    -// Copyright 2016-2018 Gary Kramlich <grim@reaperworld.com>
    -//
    -// This program is free software: you can redistribute it and/or modify
    -// it under the terms of the GNU General Public License as published by
    -// the Free Software Foundation, either version 3 of the License, or
    -// (at your option) any later version.
    -//
    -// This program is distributed in the hope that it will be useful,
    -// but WITHOUT ANY WARRANTY; without even the implied warranty of
    -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    -// GNU General Public License for more details.
    -//
    -// You should have received a copy of the GNU General Public License
    -// along with this program. If not, see <http://www.gnu.org/licenses/>.
    -
    -// Package util contains utility functions.
    -package util
    -
    -// CartesianProduct will return the cartesian product of the input map. For
    -// example, if the input map is A => 1, 2, 3; B => 4, 5, 6, then
    -// the list of outputs will contain the following:
    -// - A => 1; B => 4
    -// - A => 1; B => 5
    -// - A => 1; B => 6
    -// - A => 2; B => 4
    -// - A => 2; B => 5
    -// - A => 2; B => 6
    -// - A => 3; B => 4
    -// - A => 3; B => 5
    -// - A => 3; B => 6
    -func CartesianProduct(expansions map[string][]string) []map[string]string {
    - var (
    - order = []string{}
    - indices = make([]int, len(expansions))
    - maps = []map[string]string{}
    - )
    -
    - if len(expansions) == 0 {
    - return nil
    - }
    -
    - // Create a stable order of keys - this will determine our
    - // iteration order (in the above [A B] is the list as the
    - // index for B will increase more frequently than A).
    - for key := range expansions {
    - order = append(order, key)
    - }
    -
    - // The index map starts out as [0 0 ... 0] and will increase
    - // in the following order:
    - // - [0 0 ... 0 1]
    - // - [0 0 ... 0 2]
    - // - [0 0 ... 0 (n-1)]
    - // - ...
    - // - [0 0 ... 1 0]
    - //
    - // Once the first index (which increases the most slowly)
    - // exceeds the length of that slice, we've seen everything.
    -
    - for indices[0] < len(expansions[order[0]]) {
    - // Create a single element from the current state
    - // of the index map.
    -
    - snapshot := map[string]string{}
    - for i, j := range indices {
    - snapshot[order[i]] = expansions[order[i]][j]
    - }
    -
    - maps = append(maps, snapshot)
    -
    - // Advance the index map. Start from the end of the
    - // index map and increment by one. If we end up rolling
    - // over from n - 1 to 0 (where n is the length of the
    - // associated slice), then we also flip the index
    - // immediately to the left.
    -
    - for j := len(indices) - 1; j >= 0; j-- {
    - indices[j]++
    - if j == 0 || indices[j] < len(expansions[order[j]]) {
    - break
    - }
    -
    - indices[j] = 0
    - }
    - }
    -
    - return maps
    -}
    --- a/util/product_test.go Sat Oct 26 14:33:19 2019 -0500
    +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
    @@ -1,50 +0,0 @@
    -// Convey
    -// Copyright 2016-2018 Gary Kramlich <grim@reaperworld.com>
    -//
    -// This program is free software: you can redistribute it and/or modify
    -// it under the terms of the GNU General Public License as published by
    -// the Free Software Foundation, either version 3 of the License, or
    -// (at your option) any later version.
    -//
    -// This program is distributed in the hope that it will be useful,
    -// but WITHOUT ANY WARRANTY; without even the implied warranty of
    -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    -// GNU General Public License for more details.
    -//
    -// You should have received a copy of the GNU General Public License
    -// along with this program. If not, see <http://www.gnu.org/licenses/>.
    -
    -package util
    -
    -import (
    - "testing"
    -
    - "github.com/stretchr/testify/assert"
    -)
    -
    -func TestProduct(t *testing.T) {
    - p := CartesianProduct(map[string][]string{
    - "a": {"1", "2", "3"},
    - "b": {"4", "5"},
    - "c": {"6", "7"},
    - })
    -
    - assert.ElementsMatch(
    - t,
    - p,
    - []map[string]string{
    - {"a": "1", "b": "4", "c": "6"},
    - {"a": "1", "b": "4", "c": "7"},
    - {"a": "1", "b": "5", "c": "6"},
    - {"a": "1", "b": "5", "c": "7"},
    - {"a": "2", "b": "4", "c": "6"},
    - {"a": "2", "b": "4", "c": "7"},
    - {"a": "2", "b": "5", "c": "6"},
    - {"a": "2", "b": "5", "c": "7"},
    - {"a": "3", "b": "4", "c": "6"},
    - {"a": "3", "b": "4", "c": "7"},
    - {"a": "3", "b": "5", "c": "6"},
    - {"a": "3", "b": "5", "c": "7"},
    - },
    - )
    -}