feat(modules): migrate to go modules and bump go version 1.14.4

- migrate to go module
- bump go version 1.14.4

Signed-off-by: prateekpandey14 <prateek.pandey@mayadata.io>

vendor/gonum.org/v1/gonum/graph/internal/linear/doc.go

@@ -0,0 +1,6 @@
+// Copyright ©2017 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Package linear provides common linear data structures.
+package linear // import "gonum.org/v1/gonum/graph/internal/linear"

vendor/gonum.org/v1/gonum/graph/internal/linear/linear.go

@@ -0,0 +1,73 @@
+// Copyright ©2015 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+package linear
+
+import (
+	"gonum.org/v1/gonum/graph"
+)
+
+// NodeStack implements a LIFO stack of graph.Node.
+type NodeStack []graph.Node
+
+// Len returns the number of graph.Nodes on the stack.
+func (s *NodeStack) Len() int { return len(*s) }
+
+// Pop returns the last graph.Node on the stack and removes it
+// from the stack.
+func (s *NodeStack) Pop() graph.Node {
+	v := *s
+	v, n := v[:len(v)-1], v[len(v)-1]
+	*s = v
+	return n
+}
+
+// Push adds the node n to the stack at the last position.
+func (s *NodeStack) Push(n graph.Node) { *s = append(*s, n) }
+
+// NodeQueue implements a FIFO queue.
+type NodeQueue struct {
+	head int
+	data []graph.Node
+}
+
+// Len returns the number of graph.Nodes in the queue.
+func (q *NodeQueue) Len() int { return len(q.data) - q.head }
+
+// Enqueue adds the node n to the back of the queue.
+func (q *NodeQueue) Enqueue(n graph.Node) {
+	if len(q.data) == cap(q.data) && q.head > 0 {
+		l := q.Len()
+		copy(q.data, q.data[q.head:])
+		q.head = 0
+		q.data = append(q.data[:l], n)
+	} else {
+		q.data = append(q.data, n)
+	}
+}
+
+// Dequeue returns the graph.Node at the front of the queue and
+// removes it from the queue.
+func (q *NodeQueue) Dequeue() graph.Node {
+	if q.Len() == 0 {
+		panic("queue: empty queue")
+	}
+
+	var n graph.Node
+	n, q.data[q.head] = q.data[q.head], nil
+	q.head++
+
+	if q.Len() == 0 {
+		q.head = 0
+		q.data = q.data[:0]
+	}
+
+	return n
+}
+
+// Reset clears the queue for reuse.
+func (q *NodeQueue) Reset() {
+	q.head = 0
+	q.data = q.data[:0]
+}

vendor/gonum.org/v1/gonum/graph/internal/ordered/doc.go

@@ -0,0 +1,6 @@
+// Copyright ©2017 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Package ordered provides common sort ordering types.
+package ordered // import "gonum.org/v1/gonum/graph/internal/ordered"

vendor/gonum.org/v1/gonum/graph/internal/ordered/sort.go

@@ -0,0 +1,93 @@
+// Copyright ©2015 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+package ordered
+
+import "gonum.org/v1/gonum/graph"
+
+// ByID implements the sort.Interface sorting a slice of graph.Node
+// by ID.
+type ByID []graph.Node
+
+func (n ByID) Len() int           { return len(n) }
+func (n ByID) Less(i, j int) bool { return n[i].ID() < n[j].ID() }
+func (n ByID) Swap(i, j int)      { n[i], n[j] = n[j], n[i] }
+
+// BySliceValues implements the sort.Interface sorting a slice of
+// []int64 lexically by the values of the []int64.
+type BySliceValues [][]int64
+
+func (c BySliceValues) Len() int { return len(c) }
+func (c BySliceValues) Less(i, j int) bool {
+	a, b := c[i], c[j]
+	l := len(a)
+	if len(b) < l {
+		l = len(b)
+	}
+	for k, v := range a[:l] {
+		if v < b[k] {
+			return true
+		}
+		if v > b[k] {
+			return false
+		}
+	}
+	return len(a) < len(b)
+}
+func (c BySliceValues) Swap(i, j int) { c[i], c[j] = c[j], c[i] }
+
+// BySliceIDs implements the sort.Interface sorting a slice of
+// []graph.Node lexically by the IDs of the []graph.Node.
+type BySliceIDs [][]graph.Node
+
+func (c BySliceIDs) Len() int { return len(c) }
+func (c BySliceIDs) Less(i, j int) bool {
+	a, b := c[i], c[j]
+	l := len(a)
+	if len(b) < l {
+		l = len(b)
+	}
+	for k, v := range a[:l] {
+		if v.ID() < b[k].ID() {
+			return true
+		}
+		if v.ID() > b[k].ID() {
+			return false
+		}
+	}
+	return len(a) < len(b)
+}
+func (c BySliceIDs) Swap(i, j int) { c[i], c[j] = c[j], c[i] }
+
+// Int64s implements the sort.Interface sorting a slice of
+// int64.
+type Int64s []int64
+
+func (s Int64s) Len() int           { return len(s) }
+func (s Int64s) Less(i, j int) bool { return s[i] < s[j] }
+func (s Int64s) Swap(i, j int)      { s[i], s[j] = s[j], s[i] }
+
+// Reverse reverses the order of nodes.
+func Reverse(nodes []graph.Node) {
+	for i, j := 0, len(nodes)-1; i < j; i, j = i+1, j-1 {
+		nodes[i], nodes[j] = nodes[j], nodes[i]
+	}
+}
+
+// LinesByIDs implements the sort.Interface sorting a slice of graph.LinesByIDs
+// lexically by the From IDs, then by the To IDs, finally by the Line IDs.
+type LinesByIDs []graph.Line
+
+func (n LinesByIDs) Len() int { return len(n) }
+func (n LinesByIDs) Less(i, j int) bool {
+	a, b := n[i], n[j]
+	if a.From().ID() != b.From().ID() {
+		return a.From().ID() < b.From().ID()
+	}
+	if a.To().ID() != b.To().ID() {
+		return a.To().ID() < b.To().ID()
+	}
+	return n[i].ID() < n[j].ID()
+}
+func (n LinesByIDs) Swap(i, j int) { n[i], n[j] = n[j], n[i] }

vendor/gonum.org/v1/gonum/graph/internal/set/doc.go

@@ -0,0 +1,6 @@
+// Copyright ©2017 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Package set provides integer and graph.Node sets.
+package set // import "gonum.org/v1/gonum/graph/internal/set"

vendor/gonum.org/v1/gonum/graph/internal/set/same.go

@@ -0,0 +1,36 @@
+// Copyright ©2014 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// +build !appengine,!safe
+
+package set
+
+import "unsafe"
+
+// same determines whether two sets are backed by the same store. In the
+// current implementation using hash maps it makes use of the fact that
+// hash maps are passed as a pointer to a runtime Hmap struct. A map is
+// not seen by the runtime as a pointer though, so we use unsafe to get
+// the maps' pointer values to compare.
+func same(a, b Nodes) bool {
+	return *(*uintptr)(unsafe.Pointer(&a)) == *(*uintptr)(unsafe.Pointer(&b))
+}
+
+// intsSame determines whether two sets are backed by the same store. In the
+// current implementation using hash maps it makes use of the fact that
+// hash maps are passed as a pointer to a runtime Hmap struct. A map is
+// not seen by the runtime as a pointer though, so we use unsafe to get
+// the maps' pointer values to compare.
+func intsSame(a, b Ints) bool {
+	return *(*uintptr)(unsafe.Pointer(&a)) == *(*uintptr)(unsafe.Pointer(&b))
+}
+
+// int64sSame determines whether two sets are backed by the same store. In the
+// current implementation using hash maps it makes use of the fact that
+// hash maps are passed as a pointer to a runtime Hmap struct. A map is
+// not seen by the runtime as a pointer though, so we use unsafe to get
+// the maps' pointer values to compare.
+func int64sSame(a, b Int64s) bool {
+	return *(*uintptr)(unsafe.Pointer(&a)) == *(*uintptr)(unsafe.Pointer(&b))
+}

vendor/gonum.org/v1/gonum/graph/internal/set/same_appengine.go

@@ -0,0 +1,36 @@
+// Copyright ©2014 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// +build appengine safe
+
+package set
+
+import "reflect"
+
+// same determines whether two sets are backed by the same store. In the
+// current implementation using hash maps it makes use of the fact that
+// hash maps are passed as a pointer to a runtime Hmap struct. A map is
+// not seen by the runtime as a pointer though, so we use reflect to get
+// the maps' pointer values to compare.
+func same(a, b Nodes) bool {
+	return reflect.ValueOf(a).Pointer() == reflect.ValueOf(b).Pointer()
+}
+
+// intsSame determines whether two sets are backed by the same store. In the
+// current implementation using hash maps it makes use of the fact that
+// hash maps are passed as a pointer to a runtime Hmap struct. A map is
+// not seen by the runtime as a pointer though, so we use reflect to get
+// the maps' pointer values to compare.
+func intsSame(a, b Ints) bool {
+	return reflect.ValueOf(a).Pointer() == reflect.ValueOf(b).Pointer()
+}
+
+// int64sSame determines whether two sets are backed by the same store. In the
+// current implementation using hash maps it makes use of the fact that
+// hash maps are passed as a pointer to a runtime Hmap struct. A map is
+// not seen by the runtime as a pointer though, so we use reflect to get
+// the maps' pointer values to compare.
+func int64sSame(a, b Int64s) bool {
+	return reflect.ValueOf(a).Pointer() == reflect.ValueOf(b).Pointer()
+}

vendor/gonum.org/v1/gonum/graph/internal/set/set.go

@@ -0,0 +1,228 @@
+// Copyright ©2014 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+package set
+
+import "gonum.org/v1/gonum/graph"
+
+// Ints is a set of int identifiers.
+type Ints map[int]struct{}
+
+// The simple accessor methods for Ints are provided to allow ease of
+// implementation change should the need arise.
+
+// Add inserts an element into the set.
+func (s Ints) Add(e int) {
+	s[e] = struct{}{}
+}
+
+// Has reports the existence of the element in the set.
+func (s Ints) Has(e int) bool {
+	_, ok := s[e]
+	return ok
+}
+
+// Remove deletes the specified element from the set.
+func (s Ints) Remove(e int) {
+	delete(s, e)
+}
+
+// Count reports the number of elements stored in the set.
+func (s Ints) Count() int {
+	return len(s)
+}
+
+// IntsEqual reports set equality between the parameters. Sets are equal if
+// and only if they have the same elements.
+func IntsEqual(a, b Ints) bool {
+	if intsSame(a, b) {
+		return true
+	}
+
+	if len(a) != len(b) {
+		return false
+	}
+
+	for e := range a {
+		if _, ok := b[e]; !ok {
+			return false
+		}
+	}
+
+	return true
+}
+
+// Int64s is a set of int64 identifiers.
+type Int64s map[int64]struct{}
+
+// The simple accessor methods for Ints are provided to allow ease of
+// implementation change should the need arise.
+
+// Add inserts an element into the set.
+func (s Int64s) Add(e int64) {
+	s[e] = struct{}{}
+}
+
+// Has reports the existence of the element in the set.
+func (s Int64s) Has(e int64) bool {
+	_, ok := s[e]
+	return ok
+}
+
+// Remove deletes the specified element from the set.
+func (s Int64s) Remove(e int64) {
+	delete(s, e)
+}
+
+// Count reports the number of elements stored in the set.
+func (s Int64s) Count() int {
+	return len(s)
+}
+
+// Int64sEqual reports set equality between the parameters. Sets are equal if
+// and only if they have the same elements.
+func Int64sEqual(a, b Int64s) bool {
+	if int64sSame(a, b) {
+		return true
+	}
+
+	if len(a) != len(b) {
+		return false
+	}
+
+	for e := range a {
+		if _, ok := b[e]; !ok {
+			return false
+		}
+	}
+
+	return true
+}
+
+// Nodes is a set of nodes keyed in their integer identifiers.
+type Nodes map[int64]graph.Node
+
+// NewNodes returns a new Nodes.
+func NewNodes() Nodes {
+	return make(Nodes)
+}
+
+// NewNodes returns a new Nodes with the given size hint, n.
+func NewNodesSize(n int) Nodes {
+	return make(Nodes, n)
+}
+
+// The simple accessor methods for Nodes are provided to allow ease of
+// implementation change should the need arise.
+
+// Add inserts an element into the set.
+func (s Nodes) Add(n graph.Node) {
+	s[n.ID()] = n
+}
+
+// Remove deletes the specified element from the set.
+func (s Nodes) Remove(e graph.Node) {
+	delete(s, e.ID())
+}
+
+// Count returns the number of element in the set.
+func (s Nodes) Count() int {
+	return len(s)
+}
+
+// Has reports the existence of the elements in the set.
+func (s Nodes) Has(n graph.Node) bool {
+	_, ok := s[n.ID()]
+	return ok
+}
+
+// CloneNodes returns a clone of src.
+func CloneNodes(src Nodes) Nodes {
+	dst := make(Nodes, len(src))
+	for e, n := range src {
+		dst[e] = n
+	}
+	return dst
+}
+
+// Equal reports set equality between the parameters. Sets are equal if
+// and only if they have the same elements.
+func Equal(a, b Nodes) bool {
+	if same(a, b) {
+		return true
+	}
+
+	if len(a) != len(b) {
+		return false
+	}
+
+	for e := range a {
+		if _, ok := b[e]; !ok {
+			return false
+		}
+	}
+
+	return true
+}
+
+// UnionOfNodes returns the union of a and b.
+//
+// The union of two sets, a and b, is the set containing all the
+// elements of each, for instance:
+//
+//     {a,b,c} UNION {d,e,f} = {a,b,c,d,e,f}
+//
+// Since sets may not have repetition, unions of two sets that overlap
+// do not contain repeat elements, that is:
+//
+//     {a,b,c} UNION {b,c,d} = {a,b,c,d}
+//
+func UnionOfNodes(a, b Nodes) Nodes {
+	if same(a, b) {
+		return CloneNodes(a)
+	}
+
+	dst := make(Nodes)
+	for e, n := range a {
+		dst[e] = n
+	}
+	for e, n := range b {
+		dst[e] = n
+	}
+
+	return dst
+}
+
+// IntersectionOfNodes returns the intersection of a and b.
+//
+// The intersection of two sets, a and b, is the set containing all
+// the elements shared between the two sets, for instance:
+//
+//     {a,b,c} INTERSECT {b,c,d} = {b,c}
+//
+// The intersection between a set and itself is itself, and thus
+// effectively a copy operation:
+//
+//     {a,b,c} INTERSECT {a,b,c} = {a,b,c}
+//
+// The intersection between two sets that share no elements is the empty
+// set:
+//
+//     {a,b,c} INTERSECT {d,e,f} = {}
+//
+func IntersectionOfNodes(a, b Nodes) Nodes {
+	if same(a, b) {
+		return CloneNodes(a)
+	}
+	dst := make(Nodes)
+	if len(a) > len(b) {
+		a, b = b, a
+	}
+	for e, n := range a {
+		if _, ok := b[e]; ok {
+			dst[e] = n
+		}
+	}
+	return dst
+}

vendor/gonum.org/v1/gonum/graph/internal/uid/uid.go

@@ -0,0 +1,54 @@
+// Copyright ©2014 The Gonum Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Package uid implements unique ID provision for graphs.
+package uid
+
+import "gonum.org/v1/gonum/graph/internal/set"
+
+// Max is the maximum value of int64.
+const Max = int64(^uint64(0) >> 1)
+
+// Set implements available ID storage.
+type Set struct {
+	maxID      int64
+	used, free set.Int64s
+}
+
+// NewSet returns a new Set. The returned value should not be passed except by pointer.
+func NewSet() Set {
+	return Set{maxID: -1, used: make(set.Int64s), free: make(set.Int64s)}
+}
+
+// NewID returns a new unique ID. The ID returned is not considered used
+// until passed in a call to use.
+func (s *Set) NewID() int64 {
+	for id := range s.free {
+		return id
+	}
+	if s.maxID != Max {
+		return s.maxID + 1
+	}
+	for id := int64(0); id <= s.maxID+1; id++ {
+		if !s.used.Has(id) {
+			return id
+		}
+	}
+	panic("unreachable")
+}
+
+// Use adds the id to the used IDs in the Set.
+func (s *Set) Use(id int64) {
+	s.used.Add(id)
+	s.free.Remove(id)
+	if id > s.maxID {
+		s.maxID = id
+	}
+}
+
+// Release frees the id for reuse.
+func (s *Set) Release(id int64) {
+	s.free.Add(id)
+	s.used.Remove(id)
+}