From af5af041018cd0c8b89fde3f8684fe00290b386d Mon Sep 17 00:00:00 2001

From: Jan Chaloupka <jchaloup@redhat.com>

Date: Wed, 30 Sep 2015 09:57:57 +0200

Subject: [PATCH] internal to inteernal

---

 .../src/github.com/gonum/blas/native/dgemm.go      |   2 +-

 .../github.com/gonum/blas/native/level1double.go   |   2 +-

 .../gonum/blas/native/level1double_ddot.go         |   2 +-

 .../github.com/gonum/blas/native/level1single.go   |   2 +-

 .../gonum/blas/native/level1single_dsdot.go        |   2 +-

 .../gonum/blas/native/level1single_sdot.go         |   2 +-

 .../gonum/blas/native/level1single_sdsdot.go       |   2 +-

 .../github.com/gonum/blas/native/level2double.go   |   2 +-

 .../github.com/gonum/blas/native/level2single.go   |   2 +-

 .../github.com/gonum/blas/native/level3double.go   |   2 +-

 .../github.com/gonum/blas/native/level3single.go   |   2 +-

 .../src/github.com/gonum/blas/native/sgemm.go      |   2 +-

 .../src/github.com/gonum/graph/inteernal/linear.go |  73 ++++

 .../src/github.com/gonum/graph/inteernal/set.go    | 211 +++++++++++

 .../github.com/gonum/graph/inteernal/set_test.go   | 413 +++++++++++++++++++++

 .../src/github.com/gonum/graph/inteernal/sort.go   |  28 ++

 .../src/github.com/gonum/graph/internal/linear.go  |  73 ----

 .../src/github.com/gonum/graph/internal/set.go     | 211 -----------

 .../github.com/gonum/graph/internal/set_test.go    | 413 ---------------------

 .../src/github.com/gonum/graph/internal/sort.go    |  28 --

 .../github.com/gonum/graph/network/betweenness.go  |   2 +-

 .../src/github.com/gonum/graph/path/a_star.go      |   2 +-

 .../github.com/gonum/graph/path/control_flow.go    |   2 +-

 .../github.com/gonum/graph/path/dijkstra_test.go   |   2 +-

 .../gonum/graph/path/floydwarshall_test.go         |   2 +-

 .../gonum/graph/path/johnson_apsp_test.go          |   2 +-

 .../github.com/gonum/graph/path/spanning_tree.go   |   2 +-

 .../github.com/gonum/graph/topo/bron_kerbosch.go   |   2 +-

 .../gonum/graph/topo/bron_kerbosch_test.go         |   2 +-

 .../github.com/gonum/graph/topo/johnson_cycles.go  |   2 +-

 .../gonum/graph/topo/johnson_cycles_test.go        |   2 +-

 .../src/github.com/gonum/graph/topo/tarjan.go      |   2 +-

 .../src/github.com/gonum/graph/topo/tarjan_test.go |   2 +-

 .../src/github.com/gonum/graph/topo/topo_test.go   |   2 +-

 .../github.com/gonum/graph/traverse/traverse.go    |   2 +-

 .../gonum/graph/traverse/traverse_test.go          |   2 +-

 .../src/github.com/gonum/inteernal/asm/caxpy.go    |  22 ++

 .../src/github.com/gonum/inteernal/asm/cdotc.go    |  23 ++

 .../src/github.com/gonum/inteernal/asm/cdotu.go    |  23 ++

 .../src/github.com/gonum/inteernal/asm/complex     |  58 +++

 .../src/github.com/gonum/inteernal/asm/conj.go     |   7 +

 .../src/github.com/gonum/inteernal/asm/daxpy.go    |  22 ++

 .../github.com/gonum/inteernal/asm/daxpy_amd64.go  |  12 +

 .../github.com/gonum/inteernal/asm/daxpy_amd64.s   | 140 +++++++

 .../src/github.com/gonum/inteernal/asm/ddot.go     |  23 ++

 .../github.com/gonum/inteernal/asm/ddot_amd64.go   |  10 +

 .../github.com/gonum/inteernal/asm/ddot_amd64.s    | 140 +++++++

 .../src/github.com/gonum/inteernal/asm/dsdot.go    |  23 ++

 .../src/github.com/gonum/inteernal/asm/generate.go |   8 +

 .../src/github.com/gonum/inteernal/asm/saxpy.go    |  22 ++

 .../src/github.com/gonum/inteernal/asm/sdot.go     |  23 ++

 .../gonum/inteernal/asm/single_precision           |  30 ++

 .../src/github.com/gonum/inteernal/asm/zaxpy.go    |  22 ++

 .../src/github.com/gonum/inteernal/asm/zdotc.go    |  25 ++

 .../src/github.com/gonum/inteernal/asm/zdotu.go    |  23 ++

 .../src/github.com/gonum/internal/asm/caxpy.go     |  22 --

 .../src/github.com/gonum/internal/asm/cdotc.go     |  23 --

 .../src/github.com/gonum/internal/asm/cdotu.go     |  23 --

 .../src/github.com/gonum/internal/asm/complex      |  58 ---

 .../src/github.com/gonum/internal/asm/conj.go      |   7 -

 .../src/github.com/gonum/internal/asm/daxpy.go     |  22 --

 .../github.com/gonum/internal/asm/daxpy_amd64.go   |  12 -

 .../github.com/gonum/internal/asm/daxpy_amd64.s    | 140 -------

 .../src/github.com/gonum/internal/asm/ddot.go      |  23 --

 .../github.com/gonum/internal/asm/ddot_amd64.go    |  10 -

 .../src/github.com/gonum/internal/asm/ddot_amd64.s | 140 -------

 .../src/github.com/gonum/internal/asm/dsdot.go     |  23 --

 .../src/github.com/gonum/internal/asm/generate.go  |   8 -

 .../src/github.com/gonum/internal/asm/saxpy.go     |  22 --

 .../src/github.com/gonum/internal/asm/sdot.go      |  23 --

 .../github.com/gonum/internal/asm/single_precision |  30 --

 .../src/github.com/gonum/internal/asm/zaxpy.go     |  22 --

 .../src/github.com/gonum/internal/asm/zdotc.go     |  25 --

 .../src/github.com/gonum/internal/asm/zdotu.go     |  23 --

 .../src/github.com/gonum/matrix/mat64/inner.go     |   2 +-

 pkg/cmd/cli/describe/chaindescriber.go             |   2 +-

 76 files changed, 1411 insertions(+), 1411 deletions(-)

 create mode 100644 Godeps/_workspace/src/github.com/gonum/graph/inteernal/linear.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/graph/inteernal/set.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/graph/inteernal/set_test.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/graph/inteernal/sort.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/graph/internal/linear.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/graph/internal/set.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/graph/internal/set_test.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/graph/internal/sort.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/caxpy.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/cdotc.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/cdotu.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/complex

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/conj.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/daxpy.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/daxpy_amd64.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/daxpy_amd64.s

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/ddot.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/ddot_amd64.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/ddot_amd64.s

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/dsdot.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/generate.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/saxpy.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/sdot.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/single_precision

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/zaxpy.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/zdotc.go

 create mode 100644 Godeps/_workspace/src/github.com/gonum/inteernal/asm/zdotu.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/caxpy.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/cdotc.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/cdotu.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/complex

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/conj.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/daxpy.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/daxpy_amd64.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/daxpy_amd64.s

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/ddot.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/ddot_amd64.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/ddot_amd64.s

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/dsdot.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/generate.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/saxpy.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/sdot.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/single_precision

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/zaxpy.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/zdotc.go

 delete mode 100644 Godeps/_workspace/src/github.com/gonum/internal/asm/zdotu.go

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/dgemm.go b/Godeps/_workspace/src/github.com/gonum/blas/native/dgemm.go

index 850f62c..8dc9920 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/dgemm.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/dgemm.go

@@ -10,7 +10,7 @@ import (

 	"sync"

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 // Dgemm computes

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level1double.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level1double.go

index 0d77243..65f2972 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level1double.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level1double.go

@@ -8,7 +8,7 @@ import (

 	"math"

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 var _ blas.Float64Level1 = Implementation{}

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level1double_ddot.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level1double_ddot.go

index 7af4e04..84a16ed 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level1double_ddot.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level1double_ddot.go

@@ -5,7 +5,7 @@

 package native

 import (

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 // Ddot computes the dot product of the two vectors

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single.go

index 6bcba83..ca82629 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single.go

@@ -10,7 +10,7 @@ import (

 	math "github.com/gonum/blas/native/internal/math32"

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 var _ blas.Float32Level1 = Implementation{}

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_dsdot.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_dsdot.go

index 4665a01..a438155 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_dsdot.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_dsdot.go

@@ -7,7 +7,7 @@

 package native

 import (

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 // Dsdot computes the dot product of the two vectors

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdot.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdot.go

index 1e5b565..7d96b74 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdot.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdot.go

@@ -7,7 +7,7 @@

 package native

 import (

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 // Sdot computes the dot product of the two vectors

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdsdot.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdsdot.go

index d58be3d..79543d4 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdsdot.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level1single_sdsdot.go

@@ -7,7 +7,7 @@

 package native

 import (

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 // Sdsdot computes the dot product of the two vectors plus a constant

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level2double.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level2double.go

index 6d59559..af62cd1 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level2double.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level2double.go

@@ -6,7 +6,7 @@ package native

 import (

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 var _ blas.Float64Level2 = Implementation{}

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level2single.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level2single.go

index b213ad6..6720c0e 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level2single.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level2single.go

@@ -8,7 +8,7 @@ package native

 import (

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 var _ blas.Float32Level2 = Implementation{}

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level3double.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level3double.go

index 5a19652..47d5d15 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level3double.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level3double.go

@@ -6,7 +6,7 @@ package native

 import (

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 var _ blas.Float64Level3 = Implementation{}

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/level3single.go b/Godeps/_workspace/src/github.com/gonum/blas/native/level3single.go

index 6bc9a56..82212a0 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/level3single.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/level3single.go

@@ -8,7 +8,7 @@ package native

 import (

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 var _ blas.Float32Level3 = Implementation{}

diff --git a/Godeps/_workspace/src/github.com/gonum/blas/native/sgemm.go b/Godeps/_workspace/src/github.com/gonum/blas/native/sgemm.go

index 047d4e5..0387945 100644

--- a/Godeps/_workspace/src/github.com/gonum/blas/native/sgemm.go

+++ b/Godeps/_workspace/src/github.com/gonum/blas/native/sgemm.go

@@ -12,7 +12,7 @@ import (

 	"sync"

 	"github.com/gonum/blas"

-	"github.com/gonum/internal/asm"

+	"github.com/gonum/inteernal/asm"

 )

 // Sgemm computes

diff --git a/Godeps/_workspace/src/github.com/gonum/graph/inteernal/linear.go b/Godeps/_workspace/src/github.com/gonum/graph/inteernal/linear.go

new file mode 100644

index 0000000..3d64de9

--- /dev/null

+++ b/Godeps/_workspace/src/github.com/gonum/graph/inteernal/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 internal

+

+import (

+	"github.com/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]

+}

diff --git a/Godeps/_workspace/src/github.com/gonum/graph/inteernal/set.go b/Godeps/_workspace/src/github.com/gonum/graph/inteernal/set.go

new file mode 100644

index 0000000..3ad1bc8

--- /dev/null

+++ b/Godeps/_workspace/src/github.com/gonum/graph/inteernal/set.go

@@ -0,0 +1,211 @@

+// 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 internal

+

+import (

+	"unsafe"

+

+	"github.com/gonum/graph"

+)

+

+// IntSet is a set of integer identifiers.

+type IntSet map[int]struct{}

+

+// The simple accessor methods for Set are provided to allow ease of

+// implementation change should the need arise.

+

+// Add inserts an element into the set.

+func (s IntSet) Add(e int) {

+	s[e] = struct{}{}

+}

+

+// Has reports the existence of the element in the set.

+func (s IntSet) Has(e int) bool {

+	_, ok := s[e]

+	return ok

+}

+

+// Remove deletes the specified element from the set.

+func (s IntSet) Remove(e int) {

+	delete(s, e)

+}

+

+// Count reports the number of elements stored in the set.

+func (s IntSet) Count() int {

+	return len(s)

+}

+

+// 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 (at least in the gc implementation) are passed as a pointer

+// to a runtime Hmap struct.

+//

+// A map is not seen by the runtime as a pointer though, so we cannot

+// directly compare the sets converted to unsafe.Pointer and need to take

+// the sets' addressed and dereference them as pointers to some comparable

+// type.

+func Same(s1, s2 Set) bool {

+	return *(*uintptr)(unsafe.Pointer(&s1)) == *(*uintptr)(unsafe.Pointer(&s2))

+}

+

+// A set is a set of nodes keyed in their integer identifiers.

+type Set map[int]graph.Node

+

+// The simple accessor methods for Set are provided to allow ease of

+// implementation change should the need arise.

+

+// Add inserts an element into the set.

+func (s Set) Add(n graph.Node) {

+	s[n.ID()] = n

+}

+

+// Remove deletes the specified element from the set.

+func (s Set) Remove(e graph.Node) {

+	delete(s, e.ID())

+}

+

+// Has reports the existence of the element in the set.

+func (s Set) Has(n graph.Node) bool {

+	_, ok := s[n.ID()]

+	return ok

+}

+

+// Clear returns an empty set, possibly using the same backing store.

+// Clear is not provided as a method since there is no way to replace

+// the calling value if clearing is performed by a make(set). Clear

+// should never be called without keeping the returned value.

+func Clear(s Set) Set {

+	if len(s) == 0 {

+		return s

+	}

+

+	return make(Set)

+}

+

+// Copy performs a perfect copy from s1 to dst (meaning the sets will

+// be equal).

+func (dst Set) Copy(src Set) Set {

+	if Same(src, dst) {

+		return dst

+	}

+

+	if len(dst) > 0 {

+		dst = make(Set, 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(s1, s2 Set) bool {

+	if Same(s1, s2) {

+		return true

+	}

+

+	if len(s1) != len(s2) {

+		return false

+	}

+

+	for e := range s1 {

+		if _, ok := s2[e]; !ok {

+			return false

+		}

+	}

+

+	return true

+}

+

+// Union takes the union of s1 and s2, and stores it in dst.

+//

+// The union of two sets, s1 and s2, 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 (dst Set) Union(s1, s2 Set) Set {

+	if Same(s1, s2) {

+		return dst.Copy(s1)

+	}

+

+	if !Same(s1, dst) && !Same(s2, dst) {

+		dst = Clear(dst)

+	}

+

+	if !Same(dst, s1) {

+		for e, n := range s1 {

+			dst[e] = n

+		}

+	}

+

+	if !Same(dst, s2) {

+		for e, n := range s2 {

+			dst[e] = n

+		}

+	}

+

+	return dst

+}

+

+// Intersect takes the intersection of s1 and s2, and stores it in dst.

+//

+// The intersection of two sets, s1 and s2, 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 (dst Set) Intersect(s1, s2 Set) Set {

+	var swap Set

+

+	if Same(s1, s2) {

+		return dst.Copy(s1)

+	}

+	if Same(s1, dst) {

+		swap = s2

+	} else if Same(s2, dst) {

+		swap = s1

+	} else {

+		dst = Clear(dst)

+

+		if len(s1) > len(s2) {

+			s1, s2 = s2, s1

+		}

+

+		for e, n := range s1 {

+			if _, ok := s2[e]; ok {

+				dst[e] = n

+			}

+		}

+

+		return dst

+	}

+

+	for e := range dst {

+		if _, ok := swap[e]; !ok {

+			delete(dst, e)

+		}

+	}

+

+	return dst

+}

diff --git a/Godeps/_workspace/src/github.com/gonum/graph/inteernal/set_test.go b/Godeps/_workspace/src/github.com/gonum/graph/inteernal/set_test.go

new file mode 100644

index 0000000..fb39620

--- /dev/null

+++ b/Godeps/_workspace/src/github.com/gonum/graph/inteernal/set_test.go

@@ -0,0 +1,413 @@

+// 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 internal

+

+import "testing"

+

+type node int

+

+func (n node) ID() int { return int(n) }

+

+// count reports the number of elements stored in the set.

+func (s Set) count() int {

+	return len(s)

+}

+

+// TestSame tests the assumption that pointer equality via unsafe conversion

+// of a map[int]struct{} to uintptr is a valid test for perfect identity between

+// set values. If any of the tests in TestSame fail, the package is broken and same

+// must be reimplemented to conform to the runtime map implementation. The relevant

+// code to look at (at least for gc) is in runtime/hashmap.{h,goc}.

+func TestSame(t *testing.T) {

+	var (

+		a = make(Set)

+		b = make(Set)

+		c = a

+	)

+

+	if Same(a, b) {

+		t.Error("Independently created sets test as same")

+	}

+	if !Same(a, c) {

+		t.Error("Set copy and original test as not same.")

+	}

+	a.Add(node(1))

+	if !Same(a, c) {

+		t.Error("Set copy and original test as not same after addition.")

+	}

+	if !Same(nil, nil) {

+		t.Error("nil sets test as not same.")

+	}

+	if Same(b, nil) {

+		t.Error("nil and empty sets test as same.")

+	}

+}

+

+func TestAdd(t *testing.T) {

+	s := make(Set)

+	if s == nil {

+		t.Fatal("Set cannot be created successfully")

+	}

+

+	if s.count() != 0 {

+		t.Error("Set somehow contains new elements upon creation")

+	}

+

+	s.Add(node(1))

+	s.Add(node(3))

+	s.Add(node(5))

+

+	if s.count() != 3 {

+		t.Error("Incorrect number of set elements after adding")

+	}

+

+	if !s.Has(node(1)) || !s.Has(node(3)) || !s.Has(node(5)) {

+		t.Error("Set doesn't contain element that was added")

+	}

+

+	s.Add(node(1))

+

+	if s.count() > 3 {

+		t.Error("Set double-adds element (element not unique)")

+	} else if s.count() < 3 {

+		t.Error("Set double-add lowered len")

+	}

+

+	if !s.Has(node(1)) {

+		t.Error("Set doesn't contain double-added element")

+	}

+

+	if !s.Has(node(3)) || !s.Has(node(5)) {

+		t.Error("Set removes element on double-add")

+	}

+

+	for e, n := range s {

+		if e != n.ID() {

+			t.Error("Element ID did not match key: %d != %d", e, n.ID())

+		}

+	}

+}

+

+func TestRemove(t *testing.T) {

+	s := make(Set)

+

+	s.Add(node(1))

+	s.Add(node(3))

+	s.Add(node(5))

+

+	s.Remove(node(1))

+

+	if s.count() != 2 {

+		t.Error("Incorrect number of set elements after removing an element")

+	}

+

+	if s.Has(node(1)) {

+		t.Error("Element present after removal")

+	}

+

+	if !s.Has(node(3)) || !s.Has(node(5)) {

+		t.Error("Set remove removed wrong element")

+	}

+

+	s.Remove(node(1))

+

+	if s.count() != 2 || s.Has(node(1)) {

+		t.Error("Double set remove does something strange")

+	}

+

+	s.Add(node(1))

+

+	if s.count() != 3 || !s.Has(node(1)) {

+		t.Error("Cannot add element after removal")

+	}

+}

+

+func TestClear(t *testing.T) {

+	s := make(Set)

+

+	s.Add(node(8))

+	s.Add(node(9))

+	s.Add(node(10))