Add LICENSE notices

This commit is contained in:
kortschak
2014-04-07 16:30:00 +09:30
parent 325c2a27ab
commit 398e5b91bd
19 changed files with 76 additions and 0 deletions

View File

@@ -1,3 +1,7 @@
// 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 concrete package concrete
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 concrete_test package concrete_test
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 concrete package concrete
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 concrete_test package concrete_test
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 concrete package concrete
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 concrete_test package concrete_test
import ( import (

4
doc.go
View File

@@ -1,3 +1,7 @@
// 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 graph implements functions and interfaces to deal with formal discrete graphs. It aims to Package graph implements functions and interfaces to deal with formal discrete graphs. It aims to
be first and foremost flexible, with speed as a strong second priority. be first and foremost flexible, with speed as a strong second priority.

View File

@@ -1,3 +1,7 @@
// 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 graph package graph
// All a node needs to do is identify itself. This allows the user to pass in nodes more // All a node needs to do is identify itself. This allows the user to pass in nodes more

View File

@@ -1,3 +1,7 @@
// 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 search_test package search_test
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 search package search
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 search package search
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 search package search
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 search_test package search_test
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 package set
// A disjoint set is a collection of non-overlapping sets. That is, for any two sets in the // A disjoint set is a collection of non-overlapping sets. That is, for any two sets in the

View File

@@ -1,3 +1,7 @@
// 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 package set
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 package set
import () import ()

View File

@@ -1,3 +1,7 @@
// 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_test package set_test
import ( import (

View File

@@ -1,3 +1,7 @@
// 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 xifo package xifo
import () import ()

View File

@@ -1,3 +1,7 @@
// 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 xifo_test package xifo_test
import ( import (