Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

bart

package module

Go to main page

Versions in this module

v0

v0.0.3

Nov 6, 2025

Changes in this version

+ type Fast struct

+ func (f *Fast[V]) Contains(ip netip.Addr) bool

+ func (f *Fast[V]) Insert(pfx netip.Prefix, val V)

+ func (f *Fast[V]) InsertPersist(pfx netip.Prefix, val V) *Fast[V]

+ func (f *Fast[V]) Lookup(ip netip.Addr) (val V, ok bool)

+ func (f *Fast[V]) LookupPrefix(pfx netip.Prefix) (val V, ok bool)

+ func (f *Fast[V]) LookupPrefixLPM(pfx netip.Prefix) (lpmPfx netip.Prefix, val V, ok bool)

+ func (f *Fast[V]) Modify(pfx netip.Prefix, cb func(_ V, ok bool) (_ V, del bool))

+ func (t *Fast[V]) All() iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) All4() iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) All6() iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) AllSorted() iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) AllSorted4() iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) AllSorted6() iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) Clone() *Fast[V]

+ func (t *Fast[V]) Delete(pfx netip.Prefix)

+ func (t *Fast[V]) DeletePersist(pfx netip.Prefix) *Fast[V]

+ func (t *Fast[V]) DumpList4() []DumpListNode[V]

+ func (t *Fast[V]) DumpList6() []DumpListNode[V]

+ func (t *Fast[V]) Equal(o *Fast[V]) bool

+ func (t *Fast[V]) Fprint(w io.Writer) error

+ func (t *Fast[V]) Get(pfx netip.Prefix) (val V, exists bool)

+ func (t *Fast[V]) MarshalJSON() ([]byte, error)

+ func (t *Fast[V]) MarshalText() ([]byte, error)

+ func (t *Fast[V]) ModifyPersist(pfx netip.Prefix, cb func(_ V, ok bool) (_ V, del bool)) *Fast[V]

+ func (t *Fast[V]) Overlaps(o *Fast[V]) bool

+ func (t *Fast[V]) Overlaps4(o *Fast[V]) bool

+ func (t *Fast[V]) Overlaps6(o *Fast[V]) bool

+ func (t *Fast[V]) OverlapsPrefix(pfx netip.Prefix) bool

+ func (t *Fast[V]) Size() int

+ func (t *Fast[V]) Size4() int

+ func (t *Fast[V]) Size6() int

+ func (t *Fast[V]) Subnets(pfx netip.Prefix) iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) Supernets(pfx netip.Prefix) iter.Seq2[netip.Prefix, V]

+ func (t *Fast[V]) Union(o *Fast[V])

+ func (t *Fast[V]) UnionPersist(o *Fast[V]) *Fast[V]

type Lite

+ func (l *Lite) All() iter.Seq[netip.Prefix]

+ func (l *Lite) All4() iter.Seq[netip.Prefix]

+ func (l *Lite) All6() iter.Seq[netip.Prefix]

+ func (l *Lite) AllSorted() iter.Seq[netip.Prefix]

+ func (l *Lite) AllSorted4() iter.Seq[netip.Prefix]

+ func (l *Lite) AllSorted6() iter.Seq[netip.Prefix]

+ func (l *Lite) DumpList4() []DumpListNode[struct{}]

+ func (l *Lite) DumpList6() []DumpListNode[struct{}]

+ func (l *Lite) Equal(o *Lite) bool

+ func (l *Lite) Fprint(w io.Writer) error

+ func (l *Lite) Get(pfx netip.Prefix) bool

+ func (l *Lite) Lookup(ip netip.Addr) bool

+ func (l *Lite) LookupPrefix(pfx netip.Prefix) bool

+ func (l *Lite) LookupPrefixLPM(pfx netip.Prefix) (lpmPfx netip.Prefix, ok bool)

+ func (l *Lite) MarshalJSON() ([]byte, error)

+ func (l *Lite) MarshalText() ([]byte, error)

+ func (l *Lite) Modify(pfx netip.Prefix, cb func(exists bool) (del bool))

+ func (l *Lite) ModifyPersist(pfx netip.Prefix, cb func(exists bool) (del bool)) *Lite

+ func (l *Lite) Subnets(pfx netip.Prefix) iter.Seq[netip.Prefix]

+ func (l *Lite) Supernets(pfx netip.Prefix) iter.Seq[netip.Prefix]

+ func (t *Lite) OverlapsPrefix(pfx netip.Prefix) bool

+ func (t *Lite) Size() int

+ func (t *Lite) Size4() int

+ func (t *Lite) Size6() int

type Table

+ func (t *Table[V]) Equal(o *Table[V]) bool

+ func (t *Table[V]) Modify(pfx netip.Prefix, cb func(_ V, ok bool) (_ V, del bool))

+ func (t *Table[V]) ModifyPersist(pfx netip.Prefix, cb func(_ V, ok bool) (_ V, del bool)) *Table[V]

v0.0.2

Aug 6, 2025

Changes in this version

type Lite

+ func (l *Lite) Contains(ip netip.Addr) bool

+ func (l *Lite) Delete(pfx netip.Prefix)

+ func (l *Lite) UnionPersist(o *Lite) *Lite

type Table

+ func (t *Table[V]) UnionPersist(o *Table[V]) *Table[V]

v0.0.1

May 7, 2025

Changes in this version

+ type Cloner interface

+ Clone func() V

+ type DumpListNode struct

+ CIDR netip.Prefix

+ Subnets []DumpListNode[V]

+ Value V

+ type Lite struct

+ func (l *Lite) Clone() *Lite

+ func (l *Lite) DeletePersist(pfx netip.Prefix) *Lite

+ func (l *Lite) Exists(pfx netip.Prefix) bool

+ func (l *Lite) GetAndDelete()

+ func (l *Lite) GetAndDeletePersist()

+ func (l *Lite) Insert(pfx netip.Prefix)

+ func (l *Lite) InsertPersist(pfx netip.Prefix) *Lite

+ func (l *Lite) Overlaps(o *Lite) bool

+ func (l *Lite) Overlaps4(o *Lite) bool

+ func (l *Lite) Overlaps6(o *Lite) bool

+ func (l *Lite) Union(o *Lite)

+ func (l *Lite) Update()

+ func (l *Lite) UpdatePersist()

+ type Table struct

+ func (t *Table[V]) All() iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) All4() iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) All6() iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) AllSorted() iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) AllSorted4() iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) AllSorted6() iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) Clone() *Table[V]

+ func (t *Table[V]) Contains(ip netip.Addr) bool

+ func (t *Table[V]) Delete(pfx netip.Prefix)

+ func (t *Table[V]) DeletePersist(pfx netip.Prefix) *Table[V]

+ func (t *Table[V]) DumpList4() []DumpListNode[V]

+ func (t *Table[V]) DumpList6() []DumpListNode[V]

+ func (t *Table[V]) Fprint(w io.Writer) error

+ func (t *Table[V]) Get(pfx netip.Prefix) (val V, ok bool)

+ func (t *Table[V]) GetAndDelete(pfx netip.Prefix) (val V, ok bool)

+ func (t *Table[V]) GetAndDeletePersist(pfx netip.Prefix) (pt *Table[V], val V, ok bool)

+ func (t *Table[V]) Insert(pfx netip.Prefix, val V)

+ func (t *Table[V]) InsertPersist(pfx netip.Prefix, val V) *Table[V]

+ func (t *Table[V]) Lookup(ip netip.Addr) (val V, ok bool)

+ func (t *Table[V]) LookupPrefix(pfx netip.Prefix) (val V, ok bool)

+ func (t *Table[V]) LookupPrefixLPM(pfx netip.Prefix) (lpmPfx netip.Prefix, val V, ok bool)

+ func (t *Table[V]) MarshalJSON() ([]byte, error)

+ func (t *Table[V]) MarshalText() ([]byte, error)

+ func (t *Table[V]) Overlaps(o *Table[V]) bool

+ func (t *Table[V]) Overlaps4(o *Table[V]) bool

+ func (t *Table[V]) Overlaps6(o *Table[V]) bool

+ func (t *Table[V]) OverlapsPrefix(pfx netip.Prefix) bool

+ func (t *Table[V]) Size() int

+ func (t *Table[V]) Size4() int

+ func (t *Table[V]) Size6() int

+ func (t *Table[V]) String() string

+ func (t *Table[V]) Subnets(pfx netip.Prefix) iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) Supernets(pfx netip.Prefix) iter.Seq2[netip.Prefix, V]

+ func (t *Table[V]) Union(o *Table[V])

+ func (t *Table[V]) Update(pfx netip.Prefix, cb func(val V, ok bool) V) (newVal V)

+ func (t *Table[V]) UpdatePersist(pfx netip.Prefix, cb func(val V, ok bool) V) (pt *Table[V], newVal V)