rename Tree to RadixTree

internal/origins/corpus.go

@@ -10,7 +10,7 @@ import (
 // The keys in this map correspond to origin schemes.
 //
 // [Web origins]: https://developer.mozilla.org/en-US/docs/Glossary/Origin
-type Corpus map[string]radix.Tree
+type Corpus map[string]radix.RadixTree
 
 // Add augments c with all Web origins encompassed by pattern.
 func (c Corpus) Add(pattern *Pattern) {

internal/origins/radix/radix.go

@@ -10,18 +10,18 @@ import (
 	"github.com/jub0bs/cors/internal/util"
 )
 
-// A Tree is radix tree whose edges are each labeled by a byte,
+// A RadixTree is radix tree whose edges are each labeled by a byte,
 // and whose conceptual leaf nodes each contain a set of ints.
-// The zero value of a Tree is an empty tree.
-type Tree struct {
+// The zero value of a RadixTree is an empty tree.
+type RadixTree struct {
 	root node
 }
 
 // Insert inserts v in the tree according to keyPattern.
 // A leading * byte (0x2a) denotes a wildcard for any non-empty byte sequence.
 // A non-leading * has no special meaning and is treated as any other byte.
 // Sentinel value -1 represents a wildcard value that subsumes all others.
-func (t *Tree) Insert(keyPattern string, v int) {
+func (t *RadixTree) Insert(keyPattern string, v int) {
 	var hasLeadingAsterisk bool
 	// check for a leading asterisk
 	if b, rest, ok := splitAfterFirstByte(keyPattern); ok && b == '*' {
@@ -89,7 +89,7 @@ func (t *Tree) Insert(keyPattern string, v int) {
 }
 
 // Contains reports whether t contains key-value pair (k,v).
-func (t *Tree) Contains(k string, v int) bool {
+func (t *RadixTree) Contains(k string, v int) bool {
 	n := &t.root
 	for {
 		label, ok := lastByte(k)
@@ -149,7 +149,7 @@ func splitAtCommonSuffix(a, b string) (string, string, string) {
 }
 
 // Elems returns a slice containing textual representations of t's elements.
-func (t *Tree) Elems() []string {
+func (t *RadixTree) Elems() []string {
 	var res []string
 	t.root.Elems(&res, "")
 	slices.Sort(res)

internal/origins/radix/radix_test.go

@@ -428,7 +428,7 @@ func TestRadix(t *testing.T) {
 	}
 	for _, tc := range cases {
 		f := func(t *testing.T) {
-			var tree radix.Tree
+			var tree radix.RadixTree
 			for _, pair := range tc.patterns {
 				tree.Insert(pair.key, pair.value)
 			}