revert sync.Pool experiment

Author: gaissmai

README.md

@@ -59,8 +59,8 @@ Readers can access the table always lock-free, while writers may synchronize usi
 that only one writer can modify the table persistent at a time, not using Compare-and-Swap (CAS)
 with all the known problems for multiple long-running writers.
 
-The combination of lock-free concurrency, fast lookup and update times, low memory consumption,
-and optional internal data structure pooling provides clear advantages for any routing daemon.
+The combination of lock-free concurrency, fast lookup and update times and low memory consumption
+provides clear advantages for any routing daemon.
 
 But as always, it depends on the specific use case.
 
@@ -88,8 +88,6 @@ are used.
     //
     // A Table must not be copied by value; always pass by pointer.
 
-  func (t *Table[V]) WithPool() *Table[V]
-
   func (t *Table[V]) Contains(ip netip.Addr) bool
   func (t *Table[V]) Lookup(ip netip.Addr) (val V, ok bool)
 
@@ -155,8 +153,6 @@ Some delegated methods are pointless without a payload.
      Table[struct{}]
    }
 
-   func (l *Lite) WithPool() *Lite
-
    func (l *Lite) Exists(pfx netip.Prefix) bool
    func (l *Lite) Contains(pfx netip.Prefix) bool
 

internal/sparse/array256.go

@@ -60,14 +60,6 @@ func (a *Array256[T]) Clear(uint) {
 	panic("forbidden, use DeleteAt")
 }
 
-// Reset clears the Array256 by resetting the internal BitSet and item slice.
-// The capacity of the Items slice is retained to avoid reallocations.
-func (a *Array256[T]) Reset() {
-	a.BitSet256 = bitset.BitSet256{}
-	clear(a.Items)        // zero all elements in the current slice
-	a.Items = a.Items[:0] // reset length to zero but keep allocated capacity
-}
-
 // Get returns the value at index i and whether it exists.
 //
 // If the bit for i is not set, ok is false and value is the zero-value of T.

lite.go

@@ -23,13 +23,6 @@ type Lite struct {
 	Table[struct{}]
 }
 
-// WithPool is an adapter for the underlying table.
-func (l *Lite) WithPool() *Lite {
-	tbl := l.Table.WithPool()
-	//nolint:govet // copy of *tbl is here by intention
-	return &Lite{*tbl}
-}
-
 // Exists returns true if the prefix exists in the table.
 // It's an adapter to [Table.Get].
 func (l *Lite) Exists(pfx netip.Prefix) bool {