change name org migration

README.md

@@ -1,8 +1,8 @@
 # go-libdht
 
 [![ProbeLab](https://img.shields.io/badge/made%20by-ProbeLab-blue.svg)](https://probelab.io)
-[![GoDoc](https://pkg.go.dev/badge/github.com/plprobelab/go-libdht)](https://pkg.go.dev/github.com/plprobelab/go-libdht)
-[![Build status](https://img.shields.io/github/actions/workflow/status/plprobelab/go-libdht/go-test.yml?branch=main)](https://github.com/plprobelab/go-libdht/actions)
+[![GoDoc](https://pkg.go.dev/badge/github.com/probe-lab/go-libdht)](https://pkg.go.dev/github.com/probe-lab/go-libdht)
+[![Build status](https://img.shields.io/github/actions/workflow/status/probe-lab/go-libdht/go-test.yml?branch=main)](https://github.com/probe-lab/go-libdht/actions)
 
 `go-libdht` is a generic toolbox designed for the implementation and experimentation of Distributed Hash Tables (DHT) in Go. It establishes foundational types and interfaces applicable across a broad spectrum of DHTs, especially those sharing a similar topology. By offering reusable components like keys and routing tables, `go-libdht` streamlines the DHT implementation process. Using `go-libdht`, developers can seamlessly craft their own DHTs using the provided modular components.
 
@@ -51,11 +51,11 @@ Generic Kademlia interfaces can be found in [`kad.go`](kad/kad.go), and include
 
 It's enouraged to review other DHT implementations for guidance. Certain components, while not sufficiently generic for inclusion in go-libdht, can be reused from existing DHT solutions.
 
-* [**`zikade`**](https://github.com/plprobelab/zikade): Most recent Go implementation of [libp2p Kademlia DHT specification](https://github.com/libp2p/specs/tree/master/kad-dht)
+* [**`zikade`**](https://github.com/probe-lab/zikade): Most recent Go implementation of [libp2p Kademlia DHT specification](https://github.com/libp2p/specs/tree/master/kad-dht)
 
 ## Future work
 
-* Import more generic Kademlia building blocks from [`zikade`](https://github.com/plprobelab/zikade)
+* Import more generic Kademlia building blocks from [`zikade`](https://github.com/probe-lab/zikade)
 * Add interfaces and building blocks other DHT topologies (e.g Chord, CAN, etc.)
 * Define generic interfaces for all DHTs (e.g Point in topology, Distance function, lookup algorithms etc.)
 

go.mod

@@ -1,4 +1,4 @@
-module github.com/plprobelab/go-libdht
+module github.com/probe-lab/go-libdht
 
 go 1.20
 

kad/kadtest/ids.go

@@ -3,9 +3,9 @@ package kadtest
 import (
 	"crypto/sha256"
 
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/key"
-	"github.com/plprobelab/go-libdht/kad/key/bit256"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/key"
+	"github.com/probe-lab/go-libdht/kad/key/bit256"
 )
 
 // ID is a concrete implementation of the NodeID interface.

kad/kadtest/key.go

@@ -3,7 +3,7 @@ package kadtest
 import (
 	"fmt"
 
-	"github.com/plprobelab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad"
 )
 
 const bitPanicMsg = "bit index out of range"

kad/kadtest/key_test.go

@@ -3,7 +3,7 @@ package kadtest
 import (
 	"testing"
 
-	"github.com/plprobelab/go-libdht/kad/key/test"
+	"github.com/probe-lab/go-libdht/kad/key/test"
 )
 
 func TestKey32(t *testing.T) {

kad/kadtest/rand.go

@@ -4,7 +4,7 @@ import (
 	"math/rand"
 	"strconv"
 
-	"github.com/plprobelab/go-libdht/kad/key/bit256"
+	"github.com/probe-lab/go-libdht/kad/key/bit256"
 )
 
 var rng = rand.New(rand.NewSource(299792458))

kad/key/bit256/key.go

@@ -5,8 +5,8 @@ import (
 	"encoding/hex"
 	"math"
 
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/key"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/key"
 )
 
 // Key is a 256-bit Kademlia key.

kad/key/bit256/key_test.go

@@ -3,7 +3,7 @@ package bit256
 import (
 	"testing"
 
-	"github.com/plprobelab/go-libdht/kad/key/test"
+	"github.com/probe-lab/go-libdht/kad/key/test"
 )
 
 func TestKey(t *testing.T) {

kad/key/bitstr/key.go

@@ -1,8 +1,8 @@
 package bitstr
 
 import (
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/key"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/key"
 )
 
 // Key is a binary key represented by a string of 1's and 0's

kad/key/bitstr/key_test.go

@@ -3,7 +3,7 @@ package bitstr
 import (
 	"testing"
 
-	"github.com/plprobelab/go-libdht/kad/key/test"
+	"github.com/probe-lab/go-libdht/kad/key/test"
 )
 
 // TestBitStrKey7 tests a strange 7-bit Kademlia key

kad/key/test/keytest.go

@@ -5,8 +5,8 @@ import (
 	"strconv"
 	"testing"
 
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/key"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/key"
 
 	"github.com/stretchr/testify/require"
 )

kad/key/util.go

@@ -5,7 +5,7 @@ import (
 	"sort"
 	"strings"
 
-	"github.com/plprobelab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad"
 )
 
 // ErrInvalidDataLength is the error returned when attempting to construct a key from binary data of the wrong length.

kad/trie/trie.go

@@ -2,8 +2,8 @@
 package trie
 
 import (
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/key"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/key"
 )
 
 // Trie is a trie for equal-length bit vectors, which stores values only in the leaves.

kad/trie/trie_test.go

@@ -4,9 +4,9 @@ import (
 	"math/rand"
 	"testing"
 
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/kadtest"
-	"github.com/plprobelab/go-libdht/kad/key"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/kadtest"
+	"github.com/probe-lab/go-libdht/kad/key"
 
 	"github.com/stretchr/testify/require"
 )

kad/triert/config.go

@@ -1,7 +1,7 @@
 package triert
 
 import (
-	"github.com/plprobelab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad"
 )
 
 // Config holds configuration options for a TrieRT.

kad/triert/filter.go

@@ -1,6 +1,6 @@
 package triert
 
-import "github.com/plprobelab/go-libdht/kad"
+import "github.com/probe-lab/go-libdht/kad"
 
 // KeyFilterFunc is a function that is applied before a key is added to the table.
 // Return false to prevent the key from being added.

kad/triert/filter_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/plprobelab/go-libdht/kad/kadtest"
+	"github.com/probe-lab/go-libdht/kad/kadtest"
 	"github.com/stretchr/testify/require"
 )
 

kad/triert/table.go

@@ -5,10 +5,10 @@ import (
 	"sync"
 	"sync/atomic"
 
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/kadtest"
-	"github.com/plprobelab/go-libdht/kad/key/bit256"
-	"github.com/plprobelab/go-libdht/kad/trie"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/kadtest"
+	"github.com/probe-lab/go-libdht/kad/key/bit256"
+	"github.com/probe-lab/go-libdht/kad/trie"
 )
 
 // TrieRT is a routing table backed by a XOR Trie which offers good scalablity and performance

kad/triert/table_test.go

@@ -5,9 +5,9 @@ import (
 	"sync"
 	"testing"
 
-	"github.com/plprobelab/go-libdht/kad"
-	"github.com/plprobelab/go-libdht/kad/kadtest"
-	"github.com/plprobelab/go-libdht/kad/key"
+	"github.com/probe-lab/go-libdht/kad"
+	"github.com/probe-lab/go-libdht/kad/kadtest"
+	"github.com/probe-lab/go-libdht/kad/key"
 	"github.com/stretchr/testify/require"
 )