gaissmai Goto Github PK

bart

The Balanced Routing Table is an adaptation of D. Knuth's ART algorithm combined with popcount level compression and backtracking. It is somewhat slower than ART, but requires considerably less memory.

cidrtree

fast IP to CIDR lookup, longest prefix match in golang

config-any

config-any-tt2

Config::Any plugin for Config::TT2

config-tt2

Parse config files in TT2 syntax, returns the stash

extnetip

Package extnetip extends the stdlib with a few missing but important auxiliary functions for converting IP-prefixes to IP-ranges and vice versa.

futro-s740

go-inet

A Go library for reading, formatting, sorting, lookup and converting IP-addresses and IP-blocks

gollrb

A Left-Leaning Red-Black (LLRB) implementation of balanced binary search trees for Google Go

grammar

package grammar allows defining regexp rules with comments, whitespace and string interpolation.

interval

generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.

ipcritbit

critbit-tree in golang for net/netip based routing table

iprange

package iprange is an extension to net/netip. Not all IP address ranges in the wild are CIDRs, very often you have to deal with ranges not representable as a prefix. This library handels IP ranges and CIDRs transparently.

iprbench

benchmarks for some golang IP routing table implementations

passage

A fork of password-store (https://www.passwordstore.org) that uses age (https://age-encryption.org) as backend.