aoc

Dec 4, 2024

Changes in this version

type Board

+ func NewBoardFromReader[T any](input io.Reader, f func(r rune) T) Board[T]

Dec 3, 2024

Changes in this version

+ func FindStringIndices(s string, search string) []int

+ func RegexpFindAll(s string, re *regexp.Regexp) []string

+ func SliceCount[T comparable](in []T) map[T]int

+ type CapturingGroup struct

+ End int

+ Start int

+ func RegexpFindIndices(s string, re *regexp.Regexp) []CapturingGroup

+ type Submatch struct

+ CapturingGroups []CapturingGroup

+ End int

+ Start int

+ func RegexpFindSubmatches(s string, re *regexp.Regexp) []Submatch

Dec 2, 2024

Changes in this version

+ func FilterSliceIndices[T any](in []T, indices []int) []T

+ func IsSliceSorted[T constraints.Ordered](in []T, comp func(a T, b T) bool) bool

+ func SliceToSet[T comparable](s []T) map[T]bool

Dec 2, 2024

Changes in this version

+ func CountSliceOccurrence[T comparable](in []T) map[T]int

+ func IsSliceMonotonicallyDecreasing[T constraints.Ordered](in []T) bool

+ func IsSliceMonotonicallyIncreasing[T constraints.Ordered](in []T) bool

+ func IsSliceSortedFunc[T constraints.Ordered](in []T, f func(a T, b T) bool) bool

+ func IsSliceStrictlyDecreasing[T constraints.Ordered](in []T) bool

+ func IsSliceStrictlyIncreasing[T constraints.Ordered](in []T) bool

+ func SliceCopy[T any](in []T) []T

+ func SliceWithoutIndex[T any](in []T, idx int) []T

Dec 20, 2023

Changes in this version

+ func MapKeysToSlice[K comparable, V any](m map[K]V) []K

+ func MapValuesToSlice[K comparable, V any](m map[K]V) []V

+ func SliceToMap[K comparable, V any](s []K, f func(K) V) map[K]V

+ func TopologicalSort[K comparable](vertices []K, edgesFunc func(K) []K) []K

+ type DAG struct

+ func NewDAG[K comparable, V any]() DAG[K, V]

+ func (g DAG[K, V]) AddEdge(from, to DAGNode[K, V])

+ func (g DAG[K, V]) AddSimpleEdge(from, to K)

+ func (g DAG[K, V]) Edges(id K) []DAGNode[K, V]

+ func (g DAG[K, V]) Node(id K) (DAGNode[K, V], bool)

+ func (g DAG[K, V]) TopologicalSort() []K

+ type DAGNode struct

+ Data V

+ Id K

Dec 18, 2023

Changes in this version

type Board

+ func (b Board[T]) String(f func(T) rune, missing rune) string

Dec 18, 2023

Changes in this version

type Board

+ MaxCols int

+ MaxRows int

+ MinCols int

+ MinRows int

+ func NewBoard[T comparable](positions map[Position]T) Board[T]

+ func (b Board[T]) Contains(position Position) bool

+ func (b Board[T]) Print(mapping map[T]rune)

Dec 17, 2023

Changes in this version

+ type Node struct

+ Data T

+ Next *Node[T]

+ Previous *Node[T]

+ func NewNode[T any](data T) *Node[T]

+ func (n *Node[T]) Head() *Node[T]

+ func (n *Node[T]) InsertAfter(data T)

+ func (n *Node[T]) InsertHead(data T) *Node[T]

+ func (n *Node[T]) InsertTail(data T) *Node[T]

+ func (n *Node[T]) String() string

+ func (n *Node[T]) Tail() *Node[T]

Dec 17, 2023

Changes in this version

type Board

+ func (b Board[T]) Get(pos Position) T

type Position

+ func (p Position) IsInside(b Board[int]) bool

Dec 17, 2023

Changes in this version

+ type Board struct

+ Cols int

+ Positions map[Position]T

+ Rows int

+ func (b Board[T]) IsInside(p Position) bool

Dec 17, 2023

Changes in this version

type PriorityQueue

+ func (pq *PriorityQueue[T]) Len() int

Dec 17, 2023

Changes in this version

+ type PriorityQueue struct

+ func NewPriorityQueue[T comparable](comparator func(a, b T) int) PriorityQueue[T]

+ func (p PriorityQueue[T]) IsEmpty() bool

+ func (p PriorityQueue[T]) Peek() (T, bool)

+ func (p PriorityQueue[T]) Pop() (T, bool)

+ func (p PriorityQueue[T]) Push(t T)

+ func (p PriorityQueue[T]) Size() int

Dec 17, 2023

Changes in this version

+ func ParseBoard[T any](input io.Reader, fn func(r rune) T) map[Position]T

Dec 17, 2023

Changes in this version

type Location

+ func NewLocation(row, col int, dir Direction) Location

type Position

+ func NewPosition(row, col int) Position

Dec 17, 2023

Changes in this version

type Direction

+ func (d Direction) Rev() Direction

+ func (d Direction) String() string

+ type Location struct

+ Dir Direction

+ Pos Position

+ func (l Location) Move(d Direction, moves int) Location

+ func (l Location) Rev(moves int) Location

+ func (l Location) Straight(moves int) Location

+ func (l Location) String() string

+ func (l Location) Turn(d Direction, moves int) Location

Dec 4, 2023

Changes in this version

+ func Abs(a int) int

+ func GreatestCommonDivisor(a, b int) int

+ func IndexAll(s string, search string) []int

+ func IntToRune(i int) rune

+ func IsRuneDecimal(r rune) bool

+ func LeastCommonMultiple(numbers []int) int

+ func ManhattanDistance(row, col int) int

+ func Mod(d, m int) int

+ func ReaderToInts(input io.Reader) []int

+ func ReaderToString(input io.Reader) string

+ func ReaderToStrings(input io.Reader) []string

+ func RuneToInt(r rune) int

+ func StringGroups(lines []string) [][]string

+ func StringToInt(s string) int

+ func StringsToInts(s []string) []int

+ func Substring(s string, del string) string

+ func TryStringToInt(s string) (int, bool)

+ type Delimiter struct

+ Ind []int

+ func NewDelimiter(s, del string, opts ...DelimiterOption) Delimiter

+ func (d Delimiter) GetInt(i int) int

+ func (d Delimiter) GetInts() []int

+ func (d Delimiter) GetString(i int) string

+ func (d Delimiter) GetStrings() []string

+ func (d Delimiter) IsInt(i int) bool

+ func (d Delimiter) TryGetInt(i int) (int, bool)

+ type DelimiterOption func(options *delimiterOptions)

+ func WithTrimSpace() DelimiterOption

+ type Direction int

+ const Down

+ const DownLeft

+ const DownRight

+ const Left

+ const Right

+ const Up

+ const UpLeft

+ const UpRight

+ func (d Direction) Opposite() Direction

+ func (d Direction) Turn(turn Direction) Direction

+ type Position struct

+ Col int

+ Row int

+ func (p Position) Delta(row, col int) Position

+ func (p Position) Manhattan(p2 Position) int

+ func (p Position) ManhattanZero() int

+ func (p Position) Move(direction Direction, moves int) Position

+ func (p Position) String() string