SYMBOL INDEX (1488 symbols across 471 files) FILE: cache/lfu.go type LFU (line 19) | type LFU struct method Get (line 53) | func (c *LFU) Get(key string) any { method Put (line 67) | func (c *LFU) Put(key string, value any) { method increaseFreq (line 92) | func (c *LFU) increaseFreq(e *list.Element) { method insertMap (line 107) | func (c *LFU) insertMap(obj item) { method eliminate (line 120) | func (c *LFU) eliminate() { function NewLFU (line 33) | func NewLFU(capacity int) LFU { function initItem (line 44) | func initItem(k string, v any, f int) item { FILE: cache/lfu_test.go function TestLFU (line 9) | func TestLFU(t *testing.T) { FILE: cache/lru.go type item (line 14) | type item struct type LRU (line 22) | type LRU struct method Get (line 41) | func (c *LRU) Get(key string) any { method Put (line 52) | func (c *LRU) Put(key string, value any) { function NewLRU (line 30) | func NewLRU(capacity int) LRU { FILE: cache/lru_test.go function TestLRU (line 9) | func TestLRU(t *testing.T) { FILE: checksum/crc8.go type CRCModel (line 17) | type CRCModel struct function CRC8 (line 27) | func CRC8(data []byte, model CRCModel) uint8 { function addBytes (line 38) | func addBytes(data []byte, model CRCModel, crcResult uint8, table []uint... function getTable (line 53) | func getTable(model CRCModel) []uint8 { FILE: checksum/crc8_test.go function TestCalculateCRC8 (line 28) | func TestCalculateCRC8(t *testing.T) { function BenchmarkCalculateCRC8 (line 57) | func BenchmarkCalculateCRC8(b *testing.B) { FILE: checksum/luhn.go function Luhn (line 13) | func Luhn(s []byte) bool { FILE: checksum/luhn_test.go function TestLuhn (line 14) | func TestLuhn(t *testing.T) { function BenchmarkBruteForceFactorial (line 37) | func BenchmarkBruteForceFactorial(b *testing.B) { FILE: cipher/caesar/caesar.go function Encrypt (line 10) | func Encrypt(input string, key int) string { function Decrypt (line 31) | func Decrypt(input string, key int) string { FILE: cipher/caesar/caesar_test.go function TestEncrypt (line 10) | func TestEncrypt(t *testing.T) { function TestDecrypt (line 78) | func TestDecrypt(t *testing.T) { function Example (line 141) | func Example() { function FuzzCaesar (line 158) | func FuzzCaesar(f *testing.F) { FILE: cipher/diffiehellman/diffiehellmankeyexchange.go constant generator (line 10) | generator = 3 constant primeNumber (line 11) | primeNumber int64 = 6700417 function GenerateShareKey (line 17) | func GenerateShareKey(prvKey int64) int64 { function GenerateMutualKey (line 23) | func GenerateMutualKey(prvKey, shareKey int64) int64 { function modularExponentiation (line 28) | func modularExponentiation(b, e, mod int64) int64 { FILE: cipher/diffiehellman/diffiehellmankeyexchange_test.go function TestDiffieHellmanKeyExchange (line 9) | func TestDiffieHellmanKeyExchange(t *testing.T) { FILE: cipher/dsa/dsa.go constant numMRTests (line 16) | numMRTests = 64 constant L (line 17) | L = 1024 constant N (line 18) | N = 160 type parameters (line 23) | type parameters struct type dsa (line 28) | type dsa struct method dsaParameterGeneration (line 50) | func (dsa *dsa) dsaParameterGeneration() { method keyGen (line 108) | func (dsa *dsa) keyGen() { method GetPublicKey (line 184) | func (dsa *dsa) GetPublicKey() *big.Int { method GetParameters (line 189) | func (dsa *dsa) GetParameters() parameters { method GetPrivateKey (line 194) | func (dsa *dsa) GetPrivateKey() *big.Int { function New (line 36) | func New() *dsa { function Sign (line 125) | func Sign(m []byte, p, q, g, x *big.Int) (r, s *big.Int) { function Verify (line 157) | func Verify(m []byte, r, s, p, q, g, y *big.Int) bool { FILE: cipher/dsa/dsa_test.go function TestDSA (line 10) | func TestDSA(t *testing.T) { function BenchmarkDSANew (line 70) | func BenchmarkDSANew(b *testing.B) { function BenchmarkDSASign (line 76) | func BenchmarkDSASign(b *testing.B) { function BenchmarkDSAVerify (line 91) | func BenchmarkDSAVerify(b *testing.B) { FILE: cipher/polybius/polybius.go type Polybius (line 16) | type Polybius struct method Encrypt (line 52) | func (p *Polybius) Encrypt(text string) (string, error) { method Decrypt (line 65) | func (p *Polybius) Decrypt(text string) (string, error) { method encipher (line 78) | func (p *Polybius) encipher(char rune) (string, error) { method decipher (line 89) | func (p *Polybius) decipher(chars []rune) (string, error) { function NewPolybius (line 25) | func NewPolybius(key string, size int, chars string) (*Polybius, error) { FILE: cipher/polybius/polybius_test.go function ExampleNewPolybius (line 10) | func ExampleNewPolybius() { function TestNewPolybius (line 39) | func TestNewPolybius(t *testing.T) { function TestPolybiusEncrypt (line 72) | func TestPolybiusEncrypt(t *testing.T) { function TestPolybiusDecrypt (line 110) | func TestPolybiusDecrypt(t *testing.T) { function FuzzPolybius (line 154) | func FuzzPolybius(f *testing.F) { FILE: cipher/railfence/railfence.go function Encrypt (line 13) | func Encrypt(text string, rails int) string { function Decrypt (line 50) | func Decrypt(cipherText string, rails int) string { FILE: cipher/railfence/railfence_test.go function TestEncrypt (line 7) | func TestEncrypt(t *testing.T) { function TestDecrypt (line 50) | func TestDecrypt(t *testing.T) { FILE: cipher/rot13/rot13.go function rot13 (line 14) | func rot13(input string) string { FILE: cipher/rot13/rot13_test.go function TestRot13Encrypt (line 44) | func TestRot13Encrypt(t *testing.T) { function TestRot13Decrypt (line 54) | func TestRot13Decrypt(t *testing.T) { function assertRot13Output (line 64) | func assertRot13Output(t *testing.T, input, expected string) { function FuzzRot13 (line 72) | func FuzzRot13(f *testing.F) { FILE: cipher/rsa/rsa.go function Encrypt (line 30) | func Encrypt(message []rune, publicExponent, modulus int64) ([]rune, err... function Decrypt (line 45) | func Decrypt(encrypted []rune, privateExponent, modulus int64) (string, ... FILE: cipher/rsa/rsa2.go type rsa (line 24) | type rsa struct method EncryptString (line 63) | func (rsa *rsa) EncryptString(data string) string { method DecryptString (line 80) | func (rsa *rsa) DecryptString(data string) string { method GetPublicKey (line 98) | func (rsa *rsa) GetPublicKey() (uint64, uint64) { method GetPrivateKey (line 103) | func (rsa *rsa) GetPrivateKey() uint64 { function New (line 32) | func New() *rsa { function encryptDecryptInt (line 108) | func encryptDecryptInt(e, n, data uint64) uint64 { function randomPrime (line 114) | func randomPrime() (uint64, uint64) { FILE: cipher/rsa/rsa2_test.go function TestRSA (line 9) | func TestRSA(t *testing.T) { function BenchmarkRSAEncryption (line 36) | func BenchmarkRSAEncryption(b *testing.B) { function BenchmarkRSADecryption (line 43) | func BenchmarkRSADecryption(b *testing.B) { FILE: cipher/rsa/rsa_test.go function testPrecondition (line 38) | func testPrecondition(t *testing.T) (int64, int64, int64) { function TestEncryptDecrypt (line 56) | func TestEncryptDecrypt(t *testing.T) { function FuzzRsa (line 79) | func FuzzRsa(f *testing.F) { FILE: cipher/transposition/transposition.go constant placeholder (line 22) | placeholder = ' ' function getKey (line 24) | func getKey(keyWord string) []int { function getIndex (line 43) | func getIndex(wordSet []rune, subString rune) int { function Encrypt (line 53) | func Encrypt(text []rune, keyWord string) ([]rune, error) { function Decrypt (line 83) | func Decrypt(text []rune, keyWord string) ([]rune, error) { FILE: cipher/transposition/transposition_test.go constant enAlphabet (line 15) | enAlphabet = "abcdefghijklmnopqrstuvwxyz" function getRandomString (line 25) | func getRandomString() string { function TestEncrypt (line 34) | func TestEncrypt(t *testing.T) { function TestDecrypt (line 52) | func TestDecrypt(t *testing.T) { function TestEncryptDecrypt (line 82) | func TestEncryptDecrypt(t *testing.T) { function FuzzTransposition (line 103) | func FuzzTransposition(f *testing.F) { FILE: cipher/xor/xor.go function Encrypt (line 14) | func Encrypt(key byte, plaintext []byte) []byte { function Decrypt (line 23) | func Decrypt(key byte, cipherText []byte) []byte { FILE: cipher/xor/xor_test.go function Example (line 10) | func Example() { function TestXorCipherEncrypt (line 83) | func TestXorCipherEncrypt(t *testing.T) { function TestXorCipherDecrypt (line 95) | func TestXorCipherDecrypt(t *testing.T) { function FuzzXOR (line 108) | func FuzzXOR(f *testing.F) { FILE: compression/huffmancoding.go type Node (line 19) | type Node struct type SymbolFreq (line 27) | type SymbolFreq struct function HuffTree (line 35) | func HuffTree(listfreq []SymbolFreq) (*Node, error) { function least (line 61) | func least(q1 []Node, q2 []Node) (Node, []Node, []Node) { function HuffEncoding (line 78) | func HuffEncoding(node *Node, prefix []bool, codes map[rune][]bool) { function HuffEncode (line 95) | func HuffEncode(codes map[rune][]bool, in string) []bool { function HuffDecode (line 106) | func HuffDecode(root, current *Node, in []bool, out string) string { FILE: compression/huffmancoding_test.go function SymbolCountOrd (line 16) | func SymbolCountOrd(message string) []compression.SymbolFreq { function TestHuffman (line 31) | func TestHuffman(t *testing.T) { FILE: compression/rlecoding.go function RLEncode (line 22) | func RLEncode(data string) string { function RLEdecode (line 37) | func RLEdecode(data string) string { function RLEncodebytes (line 50) | func RLEncodebytes(data []byte) []byte { function RLEdecodebytes (line 67) | func RLEdecodebytes(data []byte) []byte { FILE: compression/rlecoding_test.go function TestCompressionRLEncode (line 10) | func TestCompressionRLEncode(t *testing.T) { function TestCompressionRLEDecode (line 42) | func TestCompressionRLEDecode(t *testing.T) { function TestCompressionRLEncodeBytes (line 74) | func TestCompressionRLEncodeBytes(t *testing.T) { function TestCompressionRLEDecodeBytes (line 106) | func TestCompressionRLEDecodeBytes(t *testing.T) { function BenchmarkRLEncode (line 139) | func BenchmarkRLEncode(b *testing.B) { function BenchmarkRLEDecode (line 145) | func BenchmarkRLEDecode(b *testing.B) { function BenchmarkRLEncodeBytes (line 151) | func BenchmarkRLEncodeBytes(b *testing.B) { function BenchmarkRLEDecodeBytes (line 157) | func BenchmarkRLEDecodeBytes(b *testing.B) { FILE: constraints/constraints.go type Signed (line 8) | type Signed interface type Unsigned (line 13) | type Unsigned interface type Integer (line 18) | type Integer interface type Float (line 23) | type Float interface type Number (line 28) | type Number interface type Ordered (line 38) | type Ordered interface FILE: conversion/base64.go constant Alphabet (line 16) | Alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz01234567... function Base64Encode (line 21) | func Base64Encode(input []byte) string { function Base64Decode (line 59) | func Base64Decode(input string) []byte { FILE: conversion/base64_test.go function TestBase64Encode (line 5) | func TestBase64Encode(t *testing.T) { function BenchmarkBase64Encode (line 26) | func BenchmarkBase64Encode(b *testing.B) { function TestBase64Decode (line 49) | func TestBase64Decode(t *testing.T) { function BenchmarkBase64Decode (line 70) | func BenchmarkBase64Decode(b *testing.B) { function TestBase64EncodeDecodeInverse (line 93) | func TestBase64EncodeDecodeInverse(t *testing.T) { function FuzzBase64Encode (line 113) | func FuzzBase64Encode(f *testing.F) { FILE: conversion/binarytodecimal.go function BinaryToDecimal (line 27) | func BinaryToDecimal(binary string) (int, error) { FILE: conversion/binarytodecimal_test.go function TestBinaryToDecimal (line 29) | func TestBinaryToDecimal(t *testing.T) { function BenchmarkBinaryToDecimal (line 41) | func BenchmarkBinaryToDecimal(b *testing.B) { FILE: conversion/decimaltobinary.go function Reverse (line 24) | func Reverse(str string) string { function DecimalToBinary (line 34) | func DecimalToBinary(num int) (string, error) { FILE: conversion/decimaltobinary_test.go function TestDecimalToBinary (line 29) | func TestDecimalToBinary(t *testing.T) { function BenchmarkDecimalToBinary (line 41) | func BenchmarkDecimalToBinary(b *testing.B) { FILE: conversion/hexadecimaltobinary.go function hexToBinary (line 24) | func hexToBinary(hex string) (string, error) { FILE: conversion/hexadecimaltobinary_test.go function TestHexToBinary (line 7) | func TestHexToBinary(t *testing.T) { function BenchmarkHexToBinary (line 41) | func BenchmarkHexToBinary(b *testing.B) { FILE: conversion/hexadecimaltodecimal.go function hexToDecimal (line 23) | func hexToDecimal(hexStr string) (int64, error) { FILE: conversion/hexadecimaltodecimal_test.go function TestHexToDecimal (line 7) | func TestHexToDecimal(t *testing.T) { function BenchmarkHexToDecimal (line 47) | func BenchmarkHexToDecimal(b *testing.B) { FILE: conversion/inttoroman.go function IntToRoman (line 23) | func IntToRoman(n int) (string, error) { FILE: conversion/inttoroman_test.go function TestIntToRoman (line 5) | func TestIntToRoman(t *testing.T) { function BenchmarkIntToRoman (line 25) | func BenchmarkIntToRoman(b *testing.B) { FILE: conversion/rgbhex.go function HEXToRGB (line 12) | func HEXToRGB(hex uint) (red, green, blue byte) { function RGBToHEX (line 43) | func RGBToHEX(red, green, blue byte) (hex uint) { FILE: conversion/rgbhex_test.go function TestHEXToRGB (line 17) | func TestHEXToRGB(t *testing.T) { function BenchmarkHEXToRGB (line 29) | func BenchmarkHEXToRGB(b *testing.B) { function TestRGBToHEX (line 35) | func TestRGBToHEX(t *testing.T) { function BenchmarkRGBToHEX (line 47) | func BenchmarkRGBToHEX(b *testing.B) { FILE: conversion/romantoint.go type numeral (line 17) | type numeral struct function RomanToInt (line 42) | func RomanToInt(input string) (int, error) { FILE: conversion/romantoint_test.go function TestRomanToInt (line 24) | func TestRomanToInt(t *testing.T) { function BenchmarkRomanToInt (line 48) | func BenchmarkRomanToInt(b *testing.B) { FILE: dynamic/abbreviation.go function Abbreviation (line 26) | func Abbreviation(a string, b string) bool { FILE: dynamic/abbreviation_test.go function TestAbbreviation (line 8) | func TestAbbreviation(t *testing.T) { FILE: dynamic/binomialcoefficient.go function Bin2 (line 26) | func Bin2(n int, k int) int { FILE: dynamic/binomialcoefficient_test.go function TestBin2 (line 10) | func TestBin2(t *testing.T) { FILE: dynamic/burstballoons.go function MaxCoins (line 6) | func MaxCoins(nums []int) int { FILE: dynamic/burstballoons_test.go type testCaseBurstBalloons (line 9) | type testCaseBurstBalloons struct function getBurstBalloonsTestCases (line 14) | func getBurstBalloonsTestCases() []testCaseBurstBalloons { function TestMaxCoins (line 24) | func TestMaxCoins(t *testing.T) { FILE: dynamic/catalan.go function NthCatalanNumber (line 15) | func NthCatalanNumber(n int) (int64, error) { FILE: dynamic/catalan_test.go function TestCatalanNumbers (line 8) | func TestCatalanNumbers(t *testing.T) { FILE: dynamic/coinchange.go function CoinChange (line 11) | func CoinChange(coins []int32, amount int32) int32 { FILE: dynamic/coinchange_test.go function TestCoinChange (line 9) | func TestCoinChange(t *testing.T) { FILE: dynamic/dicethrow.go function DiceThrow (line 10) | func DiceThrow(m, n, sum int) int { FILE: dynamic/dicethrow_test.go type testCaseDiceThrow (line 9) | type testCaseDiceThrow struct function getDiceThrowTestCases (line 17) | func getDiceThrowTestCases() []testCaseDiceThrow { function TestDiceThrow (line 33) | func TestDiceThrow(t *testing.T) { FILE: dynamic/editdistance.go function EditDistanceRecursive (line 12) | func EditDistanceRecursive(first string, second string, pointerFirst int... function EditDistanceDP (line 37) | func EditDistanceDP(first string, second string) int { FILE: dynamic/editdistance_test.go function Test_EditDistance (line 8) | func Test_EditDistance(t *testing.T) { FILE: dynamic/eggdropping.go function EggDropping (line 10) | func EggDropping(eggs, floors int) int { FILE: dynamic/eggdropping_test.go type testCaseEggDropping (line 9) | type testCaseEggDropping struct function getEggDroppingTestCases (line 15) | func getEggDroppingTestCases() []testCaseEggDropping { function TestEggDropping (line 26) | func TestEggDropping(t *testing.T) { FILE: dynamic/fibonacci.go function NthFibonacci (line 10) | func NthFibonacci(n uint) uint { FILE: dynamic/fibonacci_test.go function Test_NthFibonacci (line 8) | func Test_NthFibonacci(t *testing.T) { FILE: dynamic/interleavingstrings.go function IsInterleave (line 10) | func IsInterleave(s1, s2, s3 string) bool { FILE: dynamic/interleavingstrings_test.go type testCaseInterleaving (line 9) | type testCaseInterleaving struct function getInterleavingTestCases (line 14) | func getInterleavingTestCases() []testCaseInterleaving { function TestIsInterleave (line 29) | func TestIsInterleave(t *testing.T) { FILE: dynamic/knapsack.go function Max (line 14) | func Max(a, b int) int { function Knapsack (line 20) | func Knapsack(maxWeight int, weights, values []int) int { FILE: dynamic/knapsack_test.go function TestKnapsack (line 10) | func TestKnapsack(t *testing.T) { function ExampleKnapsack (line 35) | func ExampleKnapsack() { FILE: dynamic/longestarithmeticsubsequence.go function LongestArithmeticSubsequence (line 10) | func LongestArithmeticSubsequence(nums []int) int { FILE: dynamic/longestarithmeticsubsequence_test.go type testCaseLongestArithmeticSubsequence (line 9) | type testCaseLongestArithmeticSubsequence struct function getLongestArithmeticSubsequenceTestCases (line 14) | func getLongestArithmeticSubsequenceTestCases() []testCaseLongestArithme... function TestLongestArithmeticSubsequence (line 29) | func TestLongestArithmeticSubsequence(t *testing.T) { FILE: dynamic/longestcommonsubsequence.go function strToRuneSlice (line 10) | func strToRuneSlice(s string) (r []rune, size int) { function LongestCommonSubsequence (line 16) | func LongestCommonSubsequence(a string, b string) int { FILE: dynamic/longestcommonsubsequence_test.go type testCaseLCS (line 9) | type testCaseLCS struct function getLCSTestCases (line 15) | func getLCSTestCases() []testCaseLCS { function TestLongestCommonSubsequence (line 36) | func TestLongestCommonSubsequence(t *testing.T) { FILE: dynamic/longestincreasingsubsequence.go function LongestIncreasingSubsequence (line 15) | func LongestIncreasingSubsequence(elements []int) int { FILE: dynamic/longestincreasingsubsequence_test.go function longestIncreasingSubsequenceTest (line 10) | func longestIncreasingSubsequenceTest(t *testing.T, algorithm func(nums ... function TestLongestIncreasingSubsequence (line 32) | func TestLongestIncreasingSubsequence(t *testing.T) { function TestLongestIncreasingSubsequenceGreedy (line 36) | func TestLongestIncreasingSubsequenceGreedy(t *testing.T) { FILE: dynamic/longestincreasingsubsequencegreedy.go function LongestIncreasingSubsequenceGreedy (line 9) | func LongestIncreasingSubsequenceGreedy(nums []int) int { function lowerBound (line 29) | func lowerBound(arr []int, val int) int { FILE: dynamic/longestpalindromicsubsequence.go function lpsRec (line 8) | func lpsRec(word string, i, j int) int { function LpsRec (line 22) | func LpsRec(word string) int { function LpsDp (line 27) | func LpsDp(word string) int { FILE: dynamic/longestpalindromicsubsequence_test.go function lpsTestTemplate (line 10) | func lpsTestTemplate(t *testing.T, algorithm func(input string) int) { function TestLpsRec (line 34) | func TestLpsRec(t *testing.T) { function TestLpsDp (line 38) | func TestLpsDp(t *testing.T) { FILE: dynamic/longestpalindromicsubstring.go function LongestPalindromicSubstring (line 10) | func LongestPalindromicSubstring(s string) string { FILE: dynamic/longestpalindromicsubstring_test.go type testCaseLongestPalindromicSubstring (line 9) | type testCaseLongestPalindromicSubstring struct function getLongestPalindromicSubstringTestCases (line 14) | func getLongestPalindromicSubstringTestCases() []testCaseLongestPalindro... function TestLongestPalindromicSubstring (line 28) | func TestLongestPalindromicSubstring(t *testing.T) { FILE: dynamic/matrixmultiplication.go function MatrixChainRec (line 12) | func MatrixChainRec(D []int, i, j int) int { function MatrixChainDp (line 26) | func MatrixChainDp(D []int) int { FILE: dynamic/maxsubarraysum.go function MaxSubArraySum (line 12) | func MaxSubArraySum(nums []int) int { FILE: dynamic/maxsubarraysum_test.go type testCaseMaxSubArraySum (line 9) | type testCaseMaxSubArraySum struct function getMaxSubArraySumTestCases (line 14) | func getMaxSubArraySumTestCases() []testCaseMaxSubArraySum { function TestMaxSubArraySum (line 28) | func TestMaxSubArraySum(t *testing.T) { FILE: dynamic/optimalbst.go function OptimalBST (line 6) | func OptimalBST(keys []int, freq []int, n int) int { function sum (line 55) | func sum(freq []int, i, j int) int { FILE: dynamic/optimalbst_test.go type testCaseOptimalBST (line 9) | type testCaseOptimalBST struct function getOptimalBSTTestCases (line 16) | func getOptimalBSTTestCases() []testCaseOptimalBST { function TestOptimalBST (line 24) | func TestOptimalBST(t *testing.T) { FILE: dynamic/partitionproblem.go function PartitionProblem (line 11) | func PartitionProblem(nums []int) bool { FILE: dynamic/partitionproblem_test.go type testCasePartitionProblem (line 10) | type testCasePartitionProblem struct function getPartitionProblemTestCases (line 16) | func getPartitionProblemTestCases() []testCasePartitionProblem { function TestPartitionProblem (line 30) | func TestPartitionProblem(t *testing.T) { FILE: dynamic/rodcutting.go function CutRodRec (line 10) | func CutRodRec(price []int, length int) int { function CutRodDp (line 23) | func CutRodDp(price []int, length int) int { FILE: dynamic/rodcutting_test.go type rodCuttingTestCase (line 9) | type rodCuttingTestCase struct function getRodCuttingTestCases (line 15) | func getRodCuttingTestCases() []rodCuttingTestCase { function cutRodSolTestFunc (line 24) | func cutRodSolTestFunc(t *testing.T, cutRodSolFunc func([]int, int) int) { function TestCutRodRec (line 33) | func TestCutRodRec(t *testing.T) { function TestCutRodDp (line 37) | func TestCutRodDp(t *testing.T) { FILE: dynamic/subsetsum.go function IsSubsetSum (line 15) | func IsSubsetSum(array []int, sum int) (bool, error) { FILE: dynamic/subsetsum_test.go function TestSubsetSum (line 5) | func TestSubsetSum(t *testing.T) { FILE: dynamic/tilingproblem.go function TilingProblem (line 10) | func TilingProblem(n int) int { FILE: dynamic/tilingproblem_test.go type testCaseTilingProblem (line 9) | type testCaseTilingProblem struct function getTilingProblemTestCases (line 14) | func getTilingProblemTestCases() []testCaseTilingProblem { function TestTilingProblem (line 29) | func TestTilingProblem(t *testing.T) { FILE: dynamic/traprainwater.go function TrapRainWater (line 19) | func TrapRainWater(height []int) int { FILE: dynamic/traprainwater_test.go function TestTrapRainWater (line 10) | func TestTrapRainWater(t *testing.T) { FILE: dynamic/uniquepaths.go function UniquePaths (line 8) | func UniquePaths(m, n int) int { FILE: dynamic/uniquepaths_test.go function TestUniquePaths (line 7) | func TestUniquePaths(t *testing.T) { FILE: dynamic/wildcardmatching.go function IsMatch (line 10) | func IsMatch(s, p string) bool { FILE: dynamic/wildcardmatching_test.go type testCaseWildcardMatching (line 10) | type testCaseWildcardMatching struct function getWildcardMatchingTestCases (line 17) | func getWildcardMatchingTestCases() []testCaseWildcardMatching { function TestIsMatch (line 35) | func TestIsMatch(t *testing.T) { FILE: dynamic/wordbreak.go function WordBreak (line 10) | func WordBreak(s string, wordDict []string) bool { FILE: dynamic/wordbreak_test.go type testCaseWordBreak (line 9) | type testCaseWordBreak struct function getWordBreakTestCases (line 15) | func getWordBreakTestCases() []testCaseWordBreak { function TestWordBreak (line 31) | func TestWordBreak(t *testing.T) { FILE: graph/articulationpoints.go type apHelper (line 7) | type apHelper struct function ArticulationPoint (line 20) | func ArticulationPoint(graph *Graph) []bool { function articulationPointHelper (line 46) | func articulationPointHelper( FILE: graph/articulationpoints_test.go function TestArticulationPoints (line 8) | func TestArticulationPoints(t *testing.T) { FILE: graph/bellmanford.go method BellmanFord (line 16) | func (g *Graph) BellmanFord(start, end int) (isReachable bool, distance ... FILE: graph/bellmanford_test.go function TestBellmanford (line 10) | func TestBellmanford(t *testing.T) { FILE: graph/breadthfirstsearch.go function BreadthFirstSearch (line 9) | func BreadthFirstSearch(start, end, nodes int, edges [][]int) (isConnect... FILE: graph/breadthfirstsearch_test.go function TestBreadthFirstSearch (line 7) | func TestBreadthFirstSearch(t *testing.T) { FILE: graph/coloring/backtracking.go method ColorUsingBacktracking (line 10) | func (g *Graph) ColorUsingBacktracking() (map[int]Color, int) { method colorVertex (line 24) | func (g *Graph) colorVertex(v int, color map[int]Color) bool { FILE: graph/coloring/backtracking_test.go function TestGraphColorUsingBacktracking (line 11) | func TestGraphColorUsingBacktracking(t *testing.T) { FILE: graph/coloring/bfs.go method ColorUsingBFS (line 12) | func (g *Graph) ColorUsingBFS() (map[int]Color, int) { FILE: graph/coloring/bfs_test.go function TestGraphColorUsingBFS (line 11) | func TestGraphColorUsingBFS(t *testing.T) { FILE: graph/coloring/bipartite.go method TryBipartiteColoring (line 9) | func (g *Graph) TryBipartiteColoring() map[int]Color { function BipartiteCheck (line 46) | func BipartiteCheck(N int, edges [][]int) bool { FILE: graph/coloring/bipartite_test.go function TestBipartite (line 23) | func TestBipartite(t *testing.T) { FILE: graph/coloring/graph.go type Color (line 10) | type Color type Graph (line 14) | type Graph struct method AddVertex (line 21) | func (g *Graph) AddVertex(v int) { method AddEdge (line 34) | func (g *Graph) AddEdge(one, two int) { method ValidateColorsOfVertex (line 44) | func (g *Graph) ValidateColorsOfVertex(colors map[int]Color) error { FILE: graph/coloring/graph_test.go type testGraph (line 12) | type testGraph struct function getTestGraphs (line 18) | func getTestGraphs() (list []*testGraph) { function TestGraph_ValidateColorsOfVertex (line 121) | func TestGraph_ValidateColorsOfVertex(t *testing.T) { function getTestGraphsForNegativeTests (line 131) | func getTestGraphsForNegativeTests() (list []*testGraph) { function TestGraphValidateColorsOfVertex_Negative (line 145) | func TestGraphValidateColorsOfVertex_Negative(t *testing.T) { FILE: graph/coloring/greedy.go method ColorUsingGreedyApproach (line 13) | func (g *Graph) ColorUsingGreedyApproach() (map[int]Color, int) { FILE: graph/coloring/greedy_test.go function TestGraphColorUsingGreedyApproach (line 11) | func TestGraphColorUsingGreedyApproach(t *testing.T) { FILE: graph/cycle.go method HasCycle (line 10) | func (g *Graph) HasCycle() bool { method hasCycleHelper (line 30) | func (g Graph) hasCycleHelper(v int, all, visiting, visited map[int]stru... method FindAllCycles (line 50) | func (g *Graph) FindAllCycles() []Graph { method findAllCyclesHelper (line 90) | func (g Graph) findAllCyclesHelper(current int, all, visiting, visited m... FILE: graph/cycle_test.go function TestHasCycle (line 7) | func TestHasCycle(t *testing.T) { function TestFindAllCycles (line 27) | func TestFindAllCycles(t *testing.T) { FILE: graph/depthfirstsearch.go function GetIdx (line 9) | func GetIdx(target int, nodes []int) int { function NotExist (line 18) | func NotExist(target int, slice []int) bool { function DepthFirstSearchHelper (line 27) | func DepthFirstSearchHelper(start, end int, nodes []int, edges [][]bool,... function DepthFirstSearch (line 59) | func DepthFirstSearch(start, end int, nodes []int, edges [][]bool) ([]in... FILE: graph/depthfirstsearch_test.go function TestDfsWhenPathIsFound (line 8) | func TestDfsWhenPathIsFound(t *testing.T) { function TestDfsWhenPathIsNotFound (line 37) | func TestDfsWhenPathIsNotFound(t *testing.T) { FILE: graph/dijkstra.go type Item (line 12) | type Item struct method More (line 17) | func (a Item) More(b any) bool { method Idx (line 21) | func (a Item) Idx() int { method Dijkstra (line 25) | func (g *Graph) Dijkstra(start, end int) (int, bool) { FILE: graph/dijkstra_test.go function TestDijkstra (line 36) | func TestDijkstra(t *testing.T) { FILE: graph/edmondkarp.go function FindPath (line 16) | func FindPath(rGraph WeightedGraph, source int, sink int) map[int]int { function EdmondKarp (line 43) | func EdmondKarp(graph WeightedGraph, source int, sink int) float64 { FILE: graph/edmondkarp_test.go function TestEdmondKarp (line 7) | func TestEdmondKarp(t *testing.T) { FILE: graph/floydwarshall.go type WeightedGraph (line 11) | type WeightedGraph function FloydWarshall (line 17) | func FloydWarshall(graph WeightedGraph) WeightedGraph { FILE: graph/floydwarshall_test.go constant float64EqualityThreshold (line 8) | float64EqualityThreshold = 1e-9 function almostEqual (line 12) | func almostEqual(a, b float64) bool { method IsAlmostEqualTo (line 17) | func (a *WeightedGraph) IsAlmostEqualTo(b WeightedGraph) bool { function TestFloydWarshall (line 41) | func TestFloydWarshall(t *testing.T) { FILE: graph/graph.go type Graph (line 9) | type Graph struct method AddVertex (line 24) | func (g *Graph) AddVertex(v int) { method AddEdge (line 36) | func (g *Graph) AddEdge(one, two int) { method AddWeightedEdge (line 42) | func (g *Graph) AddWeightedEdge(one, two, weight int) { function New (line 16) | func New(v int) *Graph { FILE: graph/graph_test.go function TestDirectedGraph (line 58) | func TestDirectedGraph(t *testing.T) { function TestUndirectedGraph (line 104) | func TestUndirectedGraph(t *testing.T) { FILE: graph/kahn.go function Kahn (line 15) | func Kahn(n int, dependencies [][]int) []int { FILE: graph/kahn_test.go function TestKahn (line 7) | func TestKahn(t *testing.T) { FILE: graph/kosaraju.go method Kosaraju (line 15) | func (g *Graph) Kosaraju() [][]int { method fillOrder (line 50) | func (g *Graph) fillOrder(v int, visited []bool, stack *[]int) { method transpose (line 64) | func (g *Graph) transpose() *Graph { method dfs (line 83) | func (g *Graph) dfs(v int, visited []bool, scc *[]int) { FILE: graph/kosaraju_test.go function TestKosaraju (line 9) | func TestKosaraju(t *testing.T) { function sortSlices (line 96) | func sortSlices(s [][]int) { FILE: graph/kruskal.go type Vertex (line 15) | type Vertex type Edge (line 17) | type Edge struct function KruskalMST (line 23) | func KruskalMST(n int, edges []Edge) ([]Edge, int) { FILE: graph/kruskal_test.go function TestKruskalMST (line 8) | func TestKruskalMST(t *testing.T) { FILE: graph/lowestcommonancestor.go type TreeEdge (line 14) | type TreeEdge struct type ITree (line 19) | type ITree interface type Tree (line 27) | type Tree struct method addEdge (line 37) | func (tree *Tree) addEdge(u, v int) { method dfs (line 42) | func (tree *Tree) dfs(u, par int) { method GetDepth (line 53) | func (tree *Tree) GetDepth(u int) int { method GetDad (line 57) | func (tree *Tree) GetDad(u int) int { method GetLCA (line 61) | func (tree *Tree) GetLCA(u, v int) int { function NewTree (line 86) | func NewTree(numbersVertex, root int, edges []TreeEdge) (tree *Tree) { function LowestCommonAncestor (line 113) | func LowestCommonAncestor(tree *Tree) { FILE: graph/lowestcommonancestor_test.go type Query (line 9) | type Query struct function TestLCA (line 15) | func TestLCA(t *testing.T) { function generateTree (line 149) | func generateTree() *Tree { function generateQuery (line 203) | func generateQuery(tree *Tree) []Query { function TestLCAWithLargeTree (line 233) | func TestLCAWithLargeTree(t *testing.T) { FILE: graph/prim.go type minEdge (line 12) | type minEdge method Len (line 14) | func (h minEdge) Len() int { return len(h) } method Less (line 15) | func (h minEdge) Less(i, j int) bool { return h[i].Weight < h[j].Weight } method Swap (line 16) | func (h minEdge) Swap(i, j int) { h[i], h[j] = h[j], h[i] } method Push (line 18) | func (h *minEdge) Push(x interface{}) { method Pop (line 22) | func (h *minEdge) Pop() interface{} { method PrimMST (line 30) | func (g *Graph) PrimMST(start Vertex) ([]Edge, int) { FILE: graph/prim_test.go function TestPrimMST (line 9) | func TestPrimMST(t *testing.T) { FILE: graph/topological.go function Topological (line 14) | func Topological(N int, constraints [][]int) []int { FILE: graph/topological_test.go function TestTopological (line 36) | func TestTopological(t *testing.T) { FILE: graph/unionfind.go type UnionFind (line 19) | type UnionFind struct method Find (line 37) | func (u *UnionFind) Find(q int) int { method Union (line 46) | func (u *UnionFind) Union(p, q int) { function NewUnionFind (line 25) | func NewUnionFind(s int) UnionFind { FILE: graph/unionfind_test.go function TestUnionFind (line 7) | func TestUnionFind(t *testing.T) { FILE: hashing/md5/md5.go function leftRotate (line 43) | func leftRotate(x, n uint32) uint32 { function pad (line 48) | func pad(message []byte) []byte { function Hash (line 63) | func Hash(message []byte) [16]byte { FILE: hashing/md5/md5_test.go function toHexString (line 13) | func toHexString(hash [16]byte) string { function TestHash (line 32) | func TestHash(t *testing.T) { FILE: hashing/sha1/sha1.go constant h0 (line 15) | h0 uint32 = 0x67452301 constant h1 (line 16) | h1 uint32 = 0xEFCDAB89 constant h2 (line 17) | h2 uint32 = 0x98BADCFE constant h3 (line 18) | h3 uint32 = 0x10325476 constant h4 (line 19) | h4 uint32 = 0xC3D2E1F0 function pad (line 23) | func pad(message []byte) []byte { function leftRotate (line 38) | func leftRotate(x, n uint32) uint32 { function Hash (line 43) | func Hash(message []byte) [20]byte { FILE: hashing/sha1/sha1_test.go function toHexString (line 13) | func toHexString(hash [20]byte) string { function TestHash (line 32) | func TestHash(t *testing.T) { FILE: hashing/sha256/sha256.go constant chunkSize (line 28) | chunkSize = 64 function pad (line 37) | func pad(message []byte) []byte { function Hash (line 52) | func Hash(message []byte) [32]byte { FILE: hashing/sha256/sha256_test.go function TestHash (line 8) | func TestHash(t *testing.T) { function BenchmarkHash (line 29) | func BenchmarkHash(b *testing.B) { FILE: math/abs.go function Abs (line 11) | func Abs(n int) int { FILE: math/abs_test.go function TestAbs (line 9) | func TestAbs(t *testing.T) { function getTests (line 20) | func getTests() []struct { function BenchmarkSimpleAbs (line 40) | func BenchmarkSimpleAbs(b *testing.B) { function BenchmarkBinaryAbs32 (line 45) | func BenchmarkBinaryAbs32(b *testing.B) { function BenchmarkBinaryAbs64 (line 51) | func BenchmarkBinaryAbs64(b *testing.B) { function BenchmarkStdLibAbs (line 57) | func BenchmarkStdLibAbs(b *testing.B) { FILE: math/aliquot_test.go function TestAliquotSum (line 14) | func TestAliquotSum(t *testing.T) { function BenchmarkAliquotSum (line 36) | func BenchmarkAliquotSum(b *testing.B) { FILE: math/aliquotsum.go function AliquotSum (line 16) | func AliquotSum(n int) (int, error) { FILE: math/armstrong/isarmstrong.go function IsArmstrong (line 16) | func IsArmstrong(number int) bool { FILE: math/armstrong/isarmstrong_test.go function TestIsArmstrong (line 44) | func TestIsArmstrong(t *testing.T) { FILE: math/binary/abs.go function Abs (line 15) | func Abs(base, n int) int { FILE: math/binary/abs_test.go function TestAbs (line 5) | func TestAbs(t *testing.T) { function getAbsTests (line 16) | func getAbsTests() []struct { FILE: math/binary/arithmeticmean.go function MeanUsingAndXor (line 14) | func MeanUsingAndXor(a int, b int) int { function MeanUsingRightShift (line 19) | func MeanUsingRightShift(a int, b int) int { FILE: math/binary/arithmeticmean_test.go function TestMeanUsingAndXor (line 10) | func TestMeanUsingAndXor(t *testing.T) { function TestMeanUsingRightShift (line 23) | func TestMeanUsingRightShift(t *testing.T) { function getTests (line 35) | func getTests() []struct { function BenchmarkMeanUsingAndXor (line 55) | func BenchmarkMeanUsingAndXor(b *testing.B) { function BenchmarkMeanUsingRightShift (line 61) | func BenchmarkMeanUsingRightShift(b *testing.B) { FILE: math/binary/bitcounter.go function BitCounter (line 13) | func BitCounter(n uint) int { FILE: math/binary/bitcounter_test.go function TestBitCounter (line 10) | func TestBitCounter(t *testing.T) { FILE: math/binary/checkisnumberpoweroftwo.go function IsPowerOfTwo (line 23) | func IsPowerOfTwo(x int) bool { function IsPowerOfTwoLeftShift (line 30) | func IsPowerOfTwoLeftShift(number uint) bool { FILE: math/binary/checkisnumberpoweroftwo_test.go function getTestsForPowerOfTwo (line 14) | func getTestsForPowerOfTwo() []struct { function TestIsPowerOfTwo (line 38) | func TestIsPowerOfTwo(t *testing.T) { function TestIsPowerOfTwoLeftShift (line 51) | func TestIsPowerOfTwoLeftShift(t *testing.T) { function TestIsPowOfTwoUseLog (line 64) | func TestIsPowOfTwoUseLog(t *testing.T) { function BenchmarkIsPowerOfTwoBinaryMethod (line 77) | func BenchmarkIsPowerOfTwoBinaryMethod(b *testing.B) { function BenchmarkIsPowerOfTwoUseCycleAndLeftShift (line 83) | func BenchmarkIsPowerOfTwoUseCycleAndLeftShift(b *testing.B) { function BenchmarkIsPowerOfTwoUseLog (line 89) | func BenchmarkIsPowerOfTwoUseLog(b *testing.B) { FILE: math/binary/fast_inverse_sqrt.go function FastInverseSqrt (line 17) | func FastInverseSqrt(number float32) float32 { FILE: math/binary/logarithm.go function LogBase2 (line 9) | func LogBase2(n uint32) uint32 { FILE: math/binary/logarithm_test.go function TestLogBase2 (line 13) | func TestLogBase2(t *testing.T) { function BenchmarkBitwiseLogBase2 (line 38) | func BenchmarkBitwiseLogBase2(b *testing.B) { function BenchmarkMathPAckageLogBase2 (line 44) | func BenchmarkMathPAckageLogBase2(b *testing.B) { FILE: math/binary/rbc.go function SequenceGrayCode (line 13) | func SequenceGrayCode(n uint) []uint { FILE: math/binary/rbc_test.go function TestSequenceGrayCode (line 13) | func TestSequenceGrayCode(t *testing.T) { function BenchmarkSequenceGrayCode (line 33) | func BenchmarkSequenceGrayCode(b *testing.B) { FILE: math/binary/reversebits.go function ReverseBits (line 16) | func ReverseBits(number uint) uint { FILE: math/binary/reversebits_test.go function TestReverseBits (line 10) | func TestReverseBits(t *testing.T) { function BenchmarkReverseBits (line 33) | func BenchmarkReverseBits(b *testing.B) { FILE: math/binary/sqrt.go function Sqrt (line 12) | func Sqrt(n float32) float32 { return 1 / FastInverseSqrt(n) } FILE: math/binary/sqrt_test.go constant epsilon (line 13) | epsilon = 0.001 function TestSquareRootCalculation (line 15) | func TestSquareRootCalculation(t *testing.T) { function BenchmarkSquareRootCalculation (line 40) | func BenchmarkSquareRootCalculation(b *testing.B) { function BenchmarkMathSqrt (line 46) | func BenchmarkMathSqrt(b *testing.B) { FILE: math/binary/xorsearch.go function XorSearchMissingNumber (line 13) | func XorSearchMissingNumber(a []int) int { FILE: math/binary/xorsearch_test.go function TestXorSearchMissingNumber (line 12) | func TestXorSearchMissingNumber(t *testing.T) { function BenchmarkTestXorSearchMissingNumber (line 35) | func BenchmarkTestXorSearchMissingNumber(b *testing.B) { FILE: math/binomialcoefficient.go function Combinations (line 22) | func Combinations(n int, k int) (int, error) { FILE: math/binomialcoefficient_test.go function TestCombinations (line 14) | func TestCombinations(t *testing.T) { function BenchmarkCombinations (line 38) | func BenchmarkCombinations(b *testing.B) { FILE: math/catalan/catalannumber.go function factorial (line 17) | func factorial(n int) int { function CatalanNumber (line 26) | func CatalanNumber(n int) int { FILE: math/catalan/catalannumber_test.go function TestCatalanNumber (line 10) | func TestCatalanNumber(t *testing.T) { function BenchmarkCatalanNumber (line 33) | func BenchmarkCatalanNumber(b *testing.B) { FILE: math/checkisnumberpoweroftwo.go function IsPowOfTwoUseLog (line 10) | func IsPowOfTwoUseLog(number float64) bool { FILE: math/checkisnumberpoweroftwo_test.go function getTestsForPowerOfTwo (line 13) | func getTestsForPowerOfTwo() []struct { function TestIsPowOfTwoUseLog (line 37) | func TestIsPowOfTwoUseLog(t *testing.T) { function BenchmarkIsPowerOfTwoUseLog (line 50) | func BenchmarkIsPowerOfTwoUseLog(b *testing.B) { FILE: math/cos.go function Cos (line 10) | func Cos(x float64) float64 { FILE: math/cos_test.go constant epsilon (line 9) | epsilon = 0.001 function TestCos (line 11) | func TestCos(t *testing.T) { function BenchmarkCos (line 35) | func BenchmarkCos(b *testing.B) { function BenchmarkMathCos (line 42) | func BenchmarkMathCos(b *testing.B) { FILE: math/eulertotient.go function Phi (line 5) | func Phi(n int64) int64 { FILE: math/eulertotient_test.go function getTestsForPhi (line 7) | func getTestsForPhi() []struct { function TestPhi (line 28) | func TestPhi(t *testing.T) { function BenchmarkPhi (line 40) | func BenchmarkPhi(b *testing.B) { FILE: math/factorial/factorial.go function Iterative (line 20) | func Iterative(n int) (int, error) { function Recursive (line 32) | func Recursive(n int) (int, error) { function UsingTree (line 44) | func UsingTree(n int) (int, error) { function prodTree (line 57) | func prodTree(l int, r int) int { FILE: math/factorial/factorial_test.go type factorialFun (line 10) | type factorialFun function TestFactorial (line 37) | func TestFactorial(t *testing.T) { function BenchmarkFactorial (line 59) | func BenchmarkFactorial(b *testing.B) { FILE: math/fibonacci/fibonacci.go function Matrix (line 17) | func Matrix(n uint) uint { function Formula (line 44) | func Formula(n uint) uint { function Recursive (line 53) | func Recursive(n uint) uint { FILE: math/fibonacci/fibonacci_test.go function getTests (line 8) | func getTests() []struct { function TestMatrix (line 34) | func TestMatrix(t *testing.T) { function TestNthFibonacci (line 45) | func TestNthFibonacci(t *testing.T) { function TestFormula (line 56) | func TestFormula(t *testing.T) { function TestRecursive (line 67) | func TestRecursive(t *testing.T) { function BenchmarkNthFibonacci (line 80) | func BenchmarkNthFibonacci(b *testing.B) { function BenchmarkMatrix (line 86) | func BenchmarkMatrix(b *testing.B) { function BenchmarkFormula (line 92) | func BenchmarkFormula(b *testing.B) { FILE: math/gcd/extended.go function Extended (line 14) | func Extended(a, b int64) (int64, int64, int64) { FILE: math/gcd/extended_test.go function TestExtended (line 10) | func TestExtended(t *testing.T) { FILE: math/gcd/extendedgcd.go function ExtendedRecursive (line 9) | func ExtendedRecursive(a, b int64) (int64, int64, int64) { FILE: math/gcd/extendedgcd_test.go type testExtendedFunction (line 5) | type testExtendedFunction function TemplateTestExtendedGCD (line 7) | func TemplateTestExtendedGCD(t *testing.T, f testExtendedFunction) { function TestExtendedGCDRecursive (line 36) | func TestExtendedGCDRecursive(t *testing.T) { function TestExtendedGCDIterative (line 40) | func TestExtendedGCDIterative(t *testing.T) { function TemplateBenchmarkExtendedGCD (line 44) | func TemplateBenchmarkExtendedGCD(b *testing.B, f testExtendedFunction) { function BenchmarkExtendedGCDRecursive (line 50) | func BenchmarkExtendedGCDRecursive(b *testing.B) { function BenchmarkExtendedGCDIterative (line 54) | func BenchmarkExtendedGCDIterative(b *testing.B) { FILE: math/gcd/extendedgcditerative.go function ExtendedIterative (line 4) | func ExtendedIterative(a, b int64) (int64, int64, int64) { FILE: math/gcd/gcd.go function Recursive (line 7) | func Recursive(a, b int64) int64 { FILE: math/gcd/gcd_test.go type testFunction (line 5) | type testFunction function TemplateTestGCD (line 18) | func TemplateTestGCD(t *testing.T, f testFunction) { function TestGCDRecursive (line 29) | func TestGCDRecursive(t *testing.T) { function TestGCDIterative (line 33) | func TestGCDIterative(t *testing.T) { function TemplateBenchmarkGCD (line 37) | func TemplateBenchmarkGCD(b *testing.B, f testFunction) { function BenchmarkGCDRecursive (line 43) | func BenchmarkGCDRecursive(b *testing.B) { function BenchmarkGCDIterative (line 47) | func BenchmarkGCDIterative(b *testing.B) { FILE: math/gcd/gcditerative.go function Iterative (line 7) | func Iterative(a, b int64) int64 { FILE: math/geometry/distance.go type EuclideanPoint (line 16) | type EuclideanPoint function EuclideanDistance (line 22) | func EuclideanDistance(p1 EuclideanPoint, p2 EuclideanPoint) (float64, e... FILE: math/geometry/distance_test.go type args (line 10) | type args struct function TestFindDistanceBetweenTwoPoints (line 15) | func TestFindDistanceBetweenTwoPoints(t *testing.T) { function BenchmarkFindDistanceBetweenTwoPoints (line 73) | func BenchmarkFindDistanceBetweenTwoPoints(b *testing.B) { FILE: math/geometry/straightlines.go type Point (line 9) | type Point struct type Line (line 13) | type Line struct function Distance (line 18) | func Distance(a, b *Point) float64 { function Section (line 24) | func Section(p1, p2 *Point, r float64) Point { function Slope (line 32) | func Slope(l *Line) float64 { function YIntercept (line 37) | func YIntercept(p *Point, slope float64) float64 { function IsParallel (line 42) | func IsParallel(l1, l2 *Line) bool { function IsPerpendicular (line 47) | func IsPerpendicular(l1, l2 *Line) bool { function PointDistance (line 53) | func PointDistance(p *Point, equation [3]float64) float64 { FILE: math/geometry/straightlines_test.go function TestDistance (line 7) | func TestDistance(t *testing.T) { function TestSection (line 17) | func TestSection(t *testing.T) { function TestSlope (line 27) | func TestSlope(t *testing.T) { function TestIntercept (line 36) | func TestIntercept(t *testing.T) { function TestIsParallel (line 46) | func TestIsParallel(t *testing.T) { function TestIsPerpendicular (line 54) | func TestIsPerpendicular(t *testing.T) { function TestPointDistance (line 62) | func TestPointDistance(t *testing.T) { FILE: math/isautomorphic.go function IsAutomorphic (line 16) | func IsAutomorphic[T constraints.Integer](n T) bool { FILE: math/isautomorphic_test.go function TestIsAutomorphic (line 49) | func TestIsAutomorphic(t *testing.T) { FILE: math/krishnamurthy.go function IsKrishnamurthyNumber (line 14) | func IsKrishnamurthyNumber[T constraints.Integer](n T) bool { FILE: math/krishnamurthy_test.go function retCases (line 8) | func retCases() []struct { function TestIsKrishnamurthyNumber (line 32) | func TestIsKrishnamurthyNumber(t *testing.T) { function BenchmarkIsKrishnamurthyNumber (line 43) | func BenchmarkIsKrishnamurthyNumber(b *testing.B) { FILE: math/kthnumber.go function FindKthMax (line 11) | func FindKthMax(nums []int, k int) (int, error) { function FindKthMin (line 19) | func FindKthMin(nums []int, k int) (int, error) { function kthNumber (line 25) | func kthNumber(nums []int, k int) (int, error) { FILE: math/kthnumber_test.go function TestFindKthMax (line 8) | func TestFindKthMax(t *testing.T) { function TestFindKthMin (line 57) | func TestFindKthMin(t *testing.T) { FILE: math/lcm/lcm.go function Lcm (line 10) | func Lcm(a, b int64) int64 { FILE: math/lcm/lcm_test.go function TestLcm (line 5) | func TestLcm(t *testing.T) { FILE: math/lerp.go function Lerp (line 5) | func Lerp(v0, v1, t float64) float64 { FILE: math/lerp_test.go function TestLerp (line 9) | func TestLerp(t *testing.T) { FILE: math/liouville.go function LiouvilleLambda (line 26) | func LiouvilleLambda(n int) (int, error) { FILE: math/liouville_test.go function TestLiouvilleLambda (line 14) | func TestLiouvilleLambda(t *testing.T) { function BenchmarkLiouvilleLambda (line 35) | func BenchmarkLiouvilleLambda(b *testing.B) { FILE: math/matrix/add.go method Add (line 15) | func (m1 Matrix[T]) Add(m2 Matrix[T]) (Matrix[T], error) { FILE: math/matrix/add_test.go function TestAdd (line 10) | func TestAdd(t *testing.T) { function BenchmarkAddSmallMatrix (line 39) | func BenchmarkAddSmallMatrix(b *testing.B) { function BenchmarkAddLargeMatrix (line 48) | func BenchmarkAddLargeMatrix(b *testing.B) { FILE: math/matrix/checkequal.go method CheckEqual (line 9) | func (m1 Matrix[T]) CheckEqual(m2 Matrix[T]) bool { FILE: math/matrix/checkequal_test.go function TestCheckEqual (line 9) | func TestCheckEqual(t *testing.T) { function BenchmarkCheckEqualSmallMatrix (line 43) | func BenchmarkCheckEqualSmallMatrix(b *testing.B) { function BenchmarkCheckEqualLargeMatrix (line 52) | func BenchmarkCheckEqualLargeMatrix(b *testing.B) { FILE: math/matrix/copy.go method Copy (line 11) | func (m Matrix[T]) Copy() (Matrix[T], error) { FILE: math/matrix/copy_test.go function TestMatrixCopy (line 9) | func TestMatrixCopy(t *testing.T) { function TestMatrixCopyEmpty (line 45) | func TestMatrixCopyEmpty(t *testing.T) { function TestMatrixCopyWithDefaultValues (line 66) | func TestMatrixCopyWithDefaultValues(t *testing.T) { function BenchmarkCopyMatrix (line 101) | func BenchmarkCopyMatrix(b *testing.B) { FILE: math/matrix/determinant.go method Determinant (line 18) | func (mat Matrix[T]) Determinant() (T, error) { FILE: math/matrix/determinant_test.go function TestMatrixDeterminant (line 13) | func TestMatrixDeterminant(t *testing.T) { function TestEmptyMatrix (line 48) | func TestEmptyMatrix(t *testing.T) { function TestNonSquareMatrix (line 70) | func TestNonSquareMatrix(t *testing.T) { function TestDefaultMatrix (line 99) | func TestDefaultMatrix(t *testing.T) { function BenchmarkSmallMatrixDeterminant (line 117) | func BenchmarkSmallMatrixDeterminant(b *testing.B) { function BenchmarkMatrixDeterminant (line 130) | func BenchmarkMatrixDeterminant(b *testing.B) { FILE: math/matrix/isvalid.go function IsValid (line 6) | func IsValid[T constraints.Integer](elements [][]T) bool { FILE: math/matrix/isvalid_test.go function TestIsValid (line 9) | func TestIsValid(t *testing.T) { function BenchmarkIsValid (line 45) | func BenchmarkIsValid(b *testing.B) { FILE: math/matrix/matchdimensions.go method MatchDimensions (line 4) | func (m Matrix[T]) MatchDimensions(m1 Matrix[T]) bool { FILE: math/matrix/matchdimensions_test.go function TestMatrixMatchDimensions (line 9) | func TestMatrixMatchDimensions(t *testing.T) { function BenchmarkMatchDimensions (line 30) | func BenchmarkMatchDimensions(b *testing.B) { FILE: math/matrix/matrix.go type Matrix (line 10) | type Matrix struct function New (line 17) | func New[T constraints.Integer](rows, columns int, initial T) Matrix[T] { function NewFromElements (line 43) | func NewFromElements[T constraints.Integer](elements [][]T) (Matrix[T], ... method Get (line 66) | func (m Matrix[T]) Get(row, col int) (T, error) { method Set (line 74) | func (m Matrix[T]) Set(row, col int, val T) error { method Rows (line 83) | func (m Matrix[T]) Rows() int { method Columns (line 87) | func (m Matrix[T]) Columns() int { FILE: math/matrix/matrix_test.go function TestNewMatrix (line 10) | func TestNewMatrix(t *testing.T) { function TestNewFromElements (line 24) | func TestNewFromElements(t *testing.T) { function TestMatrixGet (line 71) | func TestMatrixGet(t *testing.T) { function TestMatrixSet (line 101) | func TestMatrixSet(t *testing.T) { function TestMatrixRows (line 132) | func TestMatrixRows(t *testing.T) { function TestMatrixColumns (line 147) | func TestMatrixColumns(t *testing.T) { function TestMatrixEmptyRowsAndColumns (line 162) | func TestMatrixEmptyRowsAndColumns(t *testing.T) { function BenchmarkNew (line 180) | func BenchmarkNew(b *testing.B) { function BenchmarkNewFromElements (line 187) | func BenchmarkNewFromElements(b *testing.B) { function BenchmarkGet (line 205) | func BenchmarkGet(b *testing.B) { function BenchmarkSet (line 217) | func BenchmarkSet(b *testing.B) { function BenchmarkRows (line 229) | func BenchmarkRows(b *testing.B) { function BenchmarkColumns (line 241) | func BenchmarkColumns(b *testing.B) { FILE: math/matrix/multiply.go method Multiply (line 15) | func (m1 Matrix[T]) Multiply(m2 Matrix[T]) (Matrix[T], error) { FILE: math/matrix/multiply_test.go function TestMultiplyMatrix (line 9) | func TestMultiplyMatrix(t *testing.T) { function TestMultiplyIncompatibleMatrix (line 52) | func TestMultiplyIncompatibleMatrix(t *testing.T) { function BenchmarkMatrixMultiply (line 91) | func BenchmarkMatrixMultiply(b *testing.B) { FILE: math/matrix/strassenmatrixmultiply.go method StrassenMatrixMultiply (line 14) | func (A Matrix[T]) StrassenMatrixMultiply(B Matrix[T]) (Matrix[T], error) { FILE: math/matrix/strassenmatrixmultiply_test.go function TestStrassenMatrixMultiply (line 12) | func TestStrassenMatrixMultiply(t *testing.T) { function TestMatrixMultiplication (line 68) | func TestMatrixMultiplication(t *testing.T) { function MakeRandomMatrix (line 105) | func MakeRandomMatrix[T constraints.Integer](rows, columns int) matrix.M... function BenchmarkStrassenMatrixMultiply (line 121) | func BenchmarkStrassenMatrixMultiply(b *testing.B) { FILE: math/matrix/string.go method String (line 6) | func (m Matrix[T]) String() string { FILE: math/matrix/string_test.go function TestMatrixString (line 13) | func TestMatrixString(t *testing.T) { function TestNullMatrixString (line 52) | func TestNullMatrixString(t *testing.T) { function BenchmarkString (line 87) | func BenchmarkString(b *testing.B) { FILE: math/matrix/submatrix.go method SubMatrix (line 10) | func (m Matrix[T]) SubMatrix(rowStart, colStart, numRows, numCols int) (... FILE: math/matrix/submatrix_test.go function TestMatrixSubMatrix (line 9) | func TestMatrixSubMatrix(t *testing.T) { function TestMatrixInvalidSubMatrix (line 51) | func TestMatrixInvalidSubMatrix(t *testing.T) { function BenchmarkSubMatrix (line 74) | func BenchmarkSubMatrix(b *testing.B) { FILE: math/matrix/subtract.go method Subtract (line 10) | func (m1 Matrix[T]) Subtract(m2 Matrix[T]) (Matrix[T], error) { FILE: math/matrix/subtract_test.go function TestSubtract (line 10) | func TestSubtract(t *testing.T) { function BenchmarkSubtract (line 40) | func BenchmarkSubtract(b *testing.B) { FILE: math/max/bitwisemax.go function Bitwise (line 13) | func Bitwise(a int, b int, base int) int { FILE: math/max/bitwisemax_test.go function TestBitwiseMax (line 10) | func TestBitwiseMax(t *testing.T) { FILE: math/max/max.go function Int (line 6) | func Int[T constraints.Integer](values ...T) T { FILE: math/max/max_test.go function TestMax (line 5) | func TestMax(t *testing.T) { function TestMaxOfThree (line 37) | func TestMaxOfThree(t *testing.T) { FILE: math/mean.go function Mean (line 7) | func Mean[T constraints.Number](values []T) float64 { FILE: math/mean_test.go function TestMean (line 8) | func TestMean(t *testing.T) { FILE: math/median.go function Median (line 14) | func Median[T constraints.Number](values []T) float64 { FILE: math/median_test.go function TestMedian (line 13) | func TestMedian(t *testing.T) { FILE: math/min/bitwisemin.go function Bitwise (line 11) | func Bitwise(base int, value int, values ...int) int { FILE: math/min/min.go function Int (line 6) | func Int[T constraints.Integer](values ...T) T { FILE: math/min/min_test.go function getTestCases (line 7) | func getTestCases() []struct { function TestBitwiseMin (line 29) | func TestBitwiseMin(t *testing.T) { function TestMin (line 41) | func TestMin(t *testing.T) { function BenchmarkTestMinInt (line 52) | func BenchmarkTestMinInt(b *testing.B) { function BenchmarkTestBitwiseMin (line 58) | func BenchmarkTestBitwiseMin(b *testing.B) { FILE: math/mobius.go function Mu (line 23) | func Mu(n int) int { FILE: math/mobius_test.go function TestMu (line 14) | func TestMu(t *testing.T) { function BenchmarkMu (line 37) | func BenchmarkMu(b *testing.B) { FILE: math/mode.go function Mode (line 21) | func Mode[T constraints.Number](numbers []T) (T, error) { FILE: math/mode_test.go type testCase (line 15) | type testCase struct function testModeFramework (line 22) | func testModeFramework[T constraints.Number](t *testing.T, testCases []t... function TestMode (line 37) | func TestMode(t *testing.T) { FILE: math/modular/exponentiation.go function Exponentiation (line 24) | func Exponentiation(base, exponent, mod int64) (int64, error) { function Multiply64BitInt (line 53) | func Multiply64BitInt(left, right int64) (int64, error) { FILE: math/modular/exponentiation_test.go type cases (line 10) | type cases struct function TestExponentiation (line 68) | func TestExponentiation(t *testing.T) { function BenchmarkExponentiation (line 85) | func BenchmarkExponentiation(b *testing.B) { FILE: math/modular/inverse.go function Inverse (line 21) | func Inverse(a, m int64) (int64, error) { FILE: math/modular/inverse_test.go function TestInverse (line 11) | func TestInverse(t *testing.T) { FILE: math/moserdebruijnsequence/sequence.go function MoserDeBruijnSequence (line 9) | func MoserDeBruijnSequence(number int) []int { function generateNthTerm (line 20) | func generateNthTerm(num int) int { FILE: math/moserdebruijnsequence/sequence_test.go function TestMoserDeBruijnSequence (line 16) | func TestMoserDeBruijnSequence(t *testing.T) { FILE: math/pascal/pascaltriangle.go function GenerateTriangle (line 26) | func GenerateTriangle(n int) [][]int { FILE: math/pascal/pascaltriangle_test.go function TestGenerateTriangle (line 13) | func TestGenerateTriangle(t *testing.T) { function BenchmarkGenerateTriangle (line 33) | func BenchmarkGenerateTriangle(b *testing.B) { FILE: math/perfectnumber.go function SumOfProperDivisors (line 19) | func SumOfProperDivisors(inNumber uint) uint { function IsPerfectNumber (line 36) | func IsPerfectNumber(inNumber uint) bool { FILE: math/perfectnumber_test.go type testCaseSumOfProperDivisors (line 9) | type testCaseSumOfProperDivisors struct function getSumOfProperDivisorsTestCases (line 18) | func getSumOfProperDivisorsTestCases() []testCaseSumOfProperDivisors { function TestSumOfProperDivisors (line 91) | func TestSumOfProperDivisors(t *testing.T) { function BenchmarkSumOfProperDivisors (line 102) | func BenchmarkSumOfProperDivisors(b *testing.B) { type isPerfectNumberTestCase (line 108) | type isPerfectNumberTestCase struct function getIsPerfectNumberTestCases (line 117) | func getIsPerfectNumberTestCases() []isPerfectNumberTestCase { function TestIsPerfectNumber (line 139) | func TestIsPerfectNumber(t *testing.T) { function BenchmarkIsPerfectNumber (line 147) | func BenchmarkIsPerfectNumber(b *testing.B) { FILE: math/permutation/heaps.go function Heaps (line 13) | func Heaps(out chan []string, n int) { function GenerateElementSet (line 42) | func GenerateElementSet(out chan []string, n int) { FILE: math/permutation/heaps_test.go function TestHeaps (line 9) | func TestHeaps(t *testing.T) { FILE: math/permutation/next_permutation.go function NextPermutation (line 10) | func NextPermutation(nums []int) { FILE: math/permutation/next_permutation_test.go function TestNextPermutation (line 8) | func TestNextPermutation(t *testing.T) { FILE: math/pi/montecarlopi.go function MonteCarloPi (line 19) | func MonteCarloPi(randomPoints int) float64 { function MonteCarloPiConcurrent (line 38) | func MonteCarloPiConcurrent(n int) (float64, error) { function drawPoints (line 61) | func drawPoints(n int, c chan<- int) { function splitInt (line 76) | func splitInt(x int, n int) ([]int, error) { FILE: math/pi/montecarlopi_test.go function TestMonteCarloPi (line 13) | func TestMonteCarloPi(t *testing.T) { function BenchmarkMonteCarloPi (line 23) | func BenchmarkMonteCarloPi(b *testing.B) { function TestSplitInt (line 29) | func TestSplitInt(t *testing.T) { function TestMonteCarloPi2 (line 64) | func TestMonteCarloPi2(t *testing.T) { function BenchmarkMonteCarloPi2 (line 76) | func BenchmarkMonteCarloPi2(b *testing.B) { FILE: math/pi/spigotpi.go function Spigot (line 14) | func Spigot(n int) string { function delChar (line 58) | func delChar(s string, index int) string { FILE: math/pi/spigotpi_test.go function TestSpigot (line 12) | func TestSpigot(t *testing.T) { function BenchmarkPiSpigotN10 (line 44) | func BenchmarkPiSpigotN10(b *testing.B) { function BenchmarkPiSpigotN100 (line 50) | func BenchmarkPiSpigotN100(b *testing.B) { function BenchmarkPiSpigotN1000 (line 56) | func BenchmarkPiSpigotN1000(b *testing.B) { FILE: math/pollard.go function DefaultPolynomial (line 18) | func DefaultPolynomial(n *big.Int) func(*big.Int) *big.Int { function PollardsRhoFactorization (line 31) | func PollardsRhoFactorization(n *big.Int, f func(n *big.Int) func(x *big... FILE: math/pollard_test.go function TestDefaultPolynomial (line 14) | func TestDefaultPolynomial(t *testing.T) { function TestRho (line 35) | func TestRho(t *testing.T) { function BenchmarkDefaultPolynomial (line 66) | func BenchmarkDefaultPolynomial(b *testing.B) { function BenchmarkRho (line 72) | func BenchmarkRho(b *testing.B) { FILE: math/power/fastexponent.go function IterativePower (line 4) | func IterativePower(n uint, power uint) uint { function RecursivePower (line 18) | func RecursivePower(n uint, power uint) uint { function RecursivePower1 (line 30) | func RecursivePower1(n uint, power uint) uint { FILE: math/power/fastexponent_test.go function TestIterativePower (line 18) | func TestIterativePower(t *testing.T) { function TestRecursivePower (line 29) | func TestRecursivePower(t *testing.T) { function TestRecursivePower1 (line 40) | func TestRecursivePower1(t *testing.T) { function BenchmarkIterativePower (line 51) | func BenchmarkIterativePower(b *testing.B) { function BenchmarkRecursivePower (line 57) | func BenchmarkRecursivePower(b *testing.B) { function BenchmarkRecursivePower1 (line 63) | func BenchmarkRecursivePower1(b *testing.B) { FILE: math/power/powvialogarithm.go function UsingLog (line 16) | func UsingLog(a float64, b float64) float64 { FILE: math/power/powvialogarithm_test.go function TestUsingLog (line 10) | func TestUsingLog(t *testing.T) { function BenchmarkUsingLog (line 40) | func BenchmarkUsingLog(b *testing.B) { FILE: math/prime/millerrabintest.go function formatNum (line 21) | func formatNum(num int64) (d int64, s int64) { function isTrivial (line 33) | func isTrivial(num int64) (prime bool, trivial bool) { function MillerTest (line 50) | func MillerTest(num, witness int64) (bool, error) { function MillerRandomTest (line 78) | func MillerRandomTest(num int64) (bool, error) { function MillerTestMultiple (line 85) | func MillerTestMultiple(num int64, witnesses ...int64) (bool, error) { function MillerRabinProbabilistic (line 102) | func MillerRabinProbabilistic(num, rounds int64) (bool, error) { function MillerRabinDeterministic (line 122) | func MillerRabinDeterministic(num int64) (bool, error) { FILE: math/prime/prime_test.go type primalityTest (line 11) | type primalityTest function primalityTestTestingHelper (line 13) | func primalityTestTestingHelper(t *testing.T, name string, f primalityTe... function primalityTestBenchmarkHelper (line 33) | func primalityTestBenchmarkHelper(b *testing.B, f primalityTest) { function millerRabinProbabilisticTester (line 41) | func millerRabinProbabilisticTester(n int64) bool { function TestMillerRabinProbabilistic (line 50) | func TestMillerRabinProbabilistic(t *testing.T) { function BenchmarkMillerRabinProbabilistic (line 54) | func BenchmarkMillerRabinProbabilistic(b *testing.B) { function millerRabinDeterministicTester (line 60) | func millerRabinDeterministicTester(n int64) bool { function TestMillerRabinDeterministic (line 69) | func TestMillerRabinDeterministic(t *testing.T) { function BenchmarkMillerRabinDeterministic (line 73) | func BenchmarkMillerRabinDeterministic(b *testing.B) { function TestTrialDivision (line 79) | func TestTrialDivision(t *testing.T) { function BenchmarkTrialDivision (line 83) | func BenchmarkTrialDivision(b *testing.B) { function TestOptimizedTrialDivision (line 89) | func TestOptimizedTrialDivision(t *testing.T) { function BenchmarkOptimizedTrialDivision (line 93) | func BenchmarkOptimizedTrialDivision(b *testing.B) { FILE: math/prime/primecheck.go function TrialDivision (line 11) | func TrialDivision(n int64) bool { function OptimizedTrialDivision (line 28) | func OptimizedTrialDivision(n int64) bool { FILE: math/prime/primefactorization.go function Factorize (line 10) | func Factorize(n int64) map[int64]int64 { FILE: math/prime/primefactorization_test.go function TestFactorize (line 8) | func TestFactorize(t *testing.T) { function BenchmarkFactorize (line 29) | func BenchmarkFactorize(b *testing.B) { FILE: math/prime/sieve.go function GenerateChannel (line 9) | func GenerateChannel(ch chan<- int) { function Sieve (line 16) | func Sieve(in <-chan int, out chan<- int, prime int) { function Generate (line 26) | func Generate(limit int) []int { FILE: math/prime/sieve2.go function SieveEratosthenes (line 9) | func SieveEratosthenes(limit int) []int { FILE: math/prime/sieve2_test.go function TestSieveEratosthenes (line 10) | func TestSieveEratosthenes(t *testing.T) { function BenchmarkSieveEratosthenes (line 39) | func BenchmarkSieveEratosthenes(b *testing.B) { FILE: math/prime/sieve_test.go function TestSieve (line 13) | func TestSieve(t *testing.T) { function TestGeneratePrimes (line 36) | func TestGeneratePrimes(t *testing.T) { function BenchmarkSieve10 (line 48) | func BenchmarkSieve10(b *testing.B) { FILE: math/prime/twin.go function Twin (line 17) | func Twin(n int) (int, bool) { FILE: math/prime/twin_test.go function TestTwin (line 14) | func TestTwin(t *testing.T) { function BenchmarkTwin (line 35) | func BenchmarkTwin(b *testing.B) { FILE: math/pronicnumber.go function PronicNumber (line 17) | func PronicNumber(n int) bool { FILE: math/pronicnumber_test.go function TestPronicNumber (line 13) | func TestPronicNumber(t *testing.T) { function BenchmarkPronicNumber (line 434) | func BenchmarkPronicNumber(b *testing.B) { FILE: math/pythagoras/pythagoras.go type Vector (line 8) | type Vector struct function Distance (line 15) | func Distance(a, b Vector) float64 { FILE: math/pythagoras/pythagoras_test.go function TestDistance (line 22) | func TestDistance(t *testing.T) { FILE: math/sin.go function Sin (line 9) | func Sin(x float64) float64 { FILE: math/sin_test.go function TestSin (line 9) | func TestSin(t *testing.T) { function BenchmarkSin (line 32) | func BenchmarkSin(b *testing.B) { function BenchmarkMathSin (line 39) | func BenchmarkMathSin(b *testing.B) { FILE: other/maxsubarraysum/maxsubarraysum.go function MaxSubarraySum (line 13) | func MaxSubarraySum(array []int) int { FILE: other/maxsubarraysum/maxsubarraysum_test.go function TestMaxSubarraySum (line 7) | func TestMaxSubarraySum(t *testing.T) { FILE: other/nested/nestedbrackets.go function IsBalanced (line 23) | func IsBalanced(input string) bool { FILE: other/nested/nestedbrackets_test.go function TestIsBalancedSimple (line 7) | func TestIsBalancedSimple(t *testing.T) { function TestIsBalancedFalty (line 18) | func TestIsBalancedFalty(t *testing.T) { function TestIsBalancedHandlesEmpty (line 29) | func TestIsBalancedHandlesEmpty(t *testing.T) { function TestIsBalancedHandlesOneChar (line 40) | func TestIsBalancedHandlesOneChar(t *testing.T) { function TestIsBalancedHandlesNonBracketsCorrectly (line 51) | func TestIsBalancedHandlesNonBracketsCorrectly(t *testing.T) { function TestIsBalancedHandlesOrdering (line 62) | func TestIsBalancedHandlesOrdering(t *testing.T) { function BenchmarkIsBalanced (line 73) | func BenchmarkIsBalanced(b *testing.B) { FILE: other/password/generator.go function Generate (line 18) | func Generate(minLength int, maxLength int) string { FILE: project_euler/problem_1/problem1.go function Problem1 (line 14) | func Problem1(n uint) uint { FILE: project_euler/problem_1/problem1_test.go function TestProblem1_Func (line 6) | func TestProblem1_Func(t *testing.T) { function BenchmarkProblem1 (line 41) | func BenchmarkProblem1(b *testing.B) { FILE: project_euler/problem_10/problem10.go function Problem10 (line 14) | func Problem10(n int) uint { FILE: project_euler/problem_10/problem10_test.go function TestProblem10_Func (line 6) | func TestProblem10_Func(t *testing.T) { function BenchmarkProblem10 (line 36) | func BenchmarkProblem10(b *testing.B) { FILE: project_euler/problem_11/problem11.go function Problem11 (line 39) | func Problem11() uint { FILE: project_euler/problem_11/problem11_test.go function TestProblem11_Func (line 6) | func TestProblem11_Func(t *testing.T) { function BenchmarkProblem11_Func (line 25) | func BenchmarkProblem11_Func(b *testing.B) { FILE: project_euler/problem_12/problem12.go function Problem12 (line 28) | func Problem12(limit uint) uint { function numDivisors (line 38) | func numDivisors(n uint) uint { FILE: project_euler/problem_12/problem12_test.go function TestProblem12_Func (line 5) | func TestProblem12_Func(t *testing.T) { function BenchmarkProblem12_Func (line 27) | func BenchmarkProblem12_Func(b *testing.B) { FILE: project_euler/problem_13/problem13.go function Problem13 (line 114) | func Problem13() string { function add (line 124) | func add(a, b string) string { FILE: project_euler/problem_13/problem13_test.go function TestProblem13_Func (line 5) | func TestProblem13_Func(t *testing.T) { function BenchmarkProblem13_Func (line 23) | func BenchmarkProblem13_Func(b *testing.B) { FILE: project_euler/problem_14/problem14.go type dict (line 20) | type dict function Problem14 (line 26) | func Problem14(limit uint64) uint64 { function weightNextNode (line 42) | func weightNextNode(current uint64) uint64 { FILE: project_euler/problem_14/problem14_test.go function TestProblem14_Func (line 6) | func TestProblem14_Func(t *testing.T) { function BenchmarkProblem14_Func (line 27) | func BenchmarkProblem14_Func(b *testing.B) { FILE: project_euler/problem_15/problem15.go function Problem15 (line 19) | func Problem15(gridSize int) int { FILE: project_euler/problem_15/problem15_test.go function TestProblem15_Func (line 6) | func TestProblem15_Func(t *testing.T) { function BenchmarkProblem15_Func (line 30) | func BenchmarkProblem15_Func(b *testing.B) { FILE: project_euler/problem_16/problem16.go function Problem16 (line 17) | func Problem16(exponent int64) int64 { FILE: project_euler/problem_16/problem16_test.go function TestProblem16_Func (line 6) | func TestProblem16_Func(t *testing.T) { function BenchmarkProblem16_Func (line 26) | func BenchmarkProblem16_Func(b *testing.B) { FILE: project_euler/problem_17/input.go constant INPUT (line 8) | INPUT = "One Two Three Four Five Six Seven Eight Nine Ten Eleven Twelve ... FILE: project_euler/problem_17/problem17.go function Problem17 (line 21) | func Problem17(input string) int { FILE: project_euler/problem_17/problem17_test.go function TestProblem17_Func (line 6) | func TestProblem17_Func(t *testing.T) { function BenchmarkProblem17_Func (line 26) | func BenchmarkProblem17_Func(b *testing.B) { FILE: project_euler/problem_18/edge.go type Edge (line 3) | type Edge struct method Value (line 11) | func (n *Edge) Value() NodeValue { method Left (line 15) | func (n *Edge) Left() Node { method Right (line 19) | func (n *Edge) Right() Node { method Kind (line 23) | func (n *Edge) Kind() string { method CreateChild (line 27) | func (n *Edge) CreateChild(value NodeValue, id int) Node { method GetID (line 59) | func (n *Edge) GetID() int { method Insert (line 63) | func (n *Edge) Insert(node Node) { method HasSpace (line 86) | func (n *Edge) HasSpace() bool { method LeftIsNil (line 90) | func (n *Edge) LeftIsNil() bool { method RightIsNil (line 94) | func (n *Edge) RightIsNil() bool { method SetParent (line 98) | func (n *Edge) SetParent(node Node) { FILE: project_euler/problem_18/input.go constant problem18_input_string (line 5) | problem18_input_string = ` constant problem18_test_string (line 30) | problem18_test_string = ` FILE: project_euler/problem_18/leaf.go type Leaf (line 3) | type Leaf struct method Value (line 11) | func (n *Leaf) Value() NodeValue { method Left (line 15) | func (n *Leaf) Left() Node { method Right (line 23) | func (n *Leaf) Right() Node { method Kind (line 27) | func (n *Leaf) Kind() string { method CreateChild (line 31) | func (n *Leaf) CreateChild(value NodeValue, id int) Node { method GetID (line 42) | func (n *Leaf) GetID() int { method Insert (line 46) | func (n *Leaf) Insert(node Node) { method HasSpace (line 61) | func (n *Leaf) HasSpace() bool { method LeftIsNil (line 65) | func (n *Leaf) LeftIsNil() bool { method RightIsNil (line 69) | func (n *Leaf) RightIsNil() bool { method SetParent (line 73) | func (n *Leaf) SetParent(node Node) { FILE: project_euler/problem_18/problem18.go type NodeValue (line 32) | type NodeValue type NodeType (line 33) | type NodeType type Node (line 35) | type Node interface function Problem18 (line 50) | func Problem18(input []string, deep int) int { FILE: project_euler/problem_18/problem18_test.go function TestProblem18_Func (line 6) | func TestProblem18_Func(t *testing.T) { function BenchmarkProblem18_Func (line 38) | func BenchmarkProblem18_Func(b *testing.B) { FILE: project_euler/problem_18/root.go type Root (line 3) | type Root struct method Value (line 10) | func (n *Root) Value() NodeValue { method Left (line 14) | func (n *Root) Left() Node { method Right (line 18) | func (n *Root) Right() Node { method Kind (line 22) | func (n *Root) Kind() string { method CreateChild (line 26) | func (n *Root) CreateChild(value NodeValue, id int) Node { method GetID (line 36) | func (n *Root) GetID() int { method Insert (line 40) | func (n *Root) Insert(node Node) { method HasSpace (line 48) | func (n *Root) HasSpace() bool { method LeftIsNil (line 52) | func (n *Root) LeftIsNil() bool { method RightIsNil (line 56) | func (n *Root) RightIsNil() bool { method SetParent (line 60) | func (n *Root) SetParent(node Node) { FILE: project_euler/problem_18/tree.go type Tree (line 8) | type Tree struct method BFSInsert (line 14) | func (t *Tree) BFSInsert(value NodeValue) { method MaxPathValueSearch (line 51) | func (r *Tree) MaxPathValueSearch(deep int) int { method PrintReport (line 121) | func (t *Tree) PrintReport() { method PrintPyramid (line 160) | func (t *Tree) PrintPyramid() { method isInQueue (line 222) | func (n *Tree) isInQueue(nv int) bool { FILE: project_euler/problem_19/problem19.go function Problem19 (line 26) | func Problem19() int { function IsLeapYear (line 55) | func IsLeapYear(year int) bool { FILE: project_euler/problem_19/problem19_test.go function TestProblem19_Func (line 6) | func TestProblem19_Func(t *testing.T) { function BenchmarkProblem19_Func (line 25) | func BenchmarkProblem19_Func(b *testing.B) { FILE: project_euler/problem_2/problem2.go function Problem2 (line 17) | func Problem2(n uint) uint { FILE: project_euler/problem_2/problem2_test.go function TestProblem2_Func (line 6) | func TestProblem2_Func(t *testing.T) { function BenchmarkProblem2 (line 41) | func BenchmarkProblem2(b *testing.B) { FILE: project_euler/problem_20/problem20.go function Problem20 (line 18) | func Problem20(input int) int { function bigFactorial (line 29) | func bigFactorial(n int) *big.Int { FILE: project_euler/problem_20/problem20_test.go function TestProblem20_Func (line 6) | func TestProblem20_Func(t *testing.T) { function BenchmarkProblem20_Func (line 27) | func BenchmarkProblem20_Func(b *testing.B) { FILE: project_euler/problem_3/problem3.go function Problem3 (line 12) | func Problem3(n uint) uint { FILE: project_euler/problem_3/problem3_test.go function TestProblem3_Func (line 6) | func TestProblem3_Func(t *testing.T) { function BenchmarkProblem3 (line 36) | func BenchmarkProblem3(b *testing.B) { FILE: project_euler/problem_4/problem4.go function Problem4 (line 19) | func Problem4() uint { FILE: project_euler/problem_4/problem4_test.go function TestProblem4_Func (line 6) | func TestProblem4_Func(t *testing.T) { function BenchmarkProblem4 (line 29) | func BenchmarkProblem4(b *testing.B) { FILE: project_euler/problem_5/problem5.go function Problem5 (line 13) | func Problem5(limit uint) uint { function isDivisible (line 25) | func isDivisible(n, limit uint) bool { FILE: project_euler/problem_5/problem5_test.go function TestProblem5_Func (line 6) | func TestProblem5_Func(t *testing.T) { function BenchmarkProblem5 (line 41) | func BenchmarkProblem5(b *testing.B) { FILE: project_euler/problem_6/problem6.go function Problem6 (line 21) | func Problem6(n uint) uint { FILE: project_euler/problem_6/problem6_test.go function TestProblem6_Func (line 6) | func TestProblem6_Func(t *testing.T) { function BenchmarkProblem6 (line 36) | func BenchmarkProblem6(b *testing.B) { FILE: project_euler/problem_7/problem7.go function Problem7 (line 16) | func Problem7(n uint) int64 { FILE: project_euler/problem_7/problem7_test.go function TestProblem7_Func (line 6) | func TestProblem7_Func(t *testing.T) { function BenchmarkProblem7 (line 36) | func BenchmarkProblem7(b *testing.B) { FILE: project_euler/problem_8/problem8.go constant number (line 14) | number = "73167176531330624919225119674426574742355349194934969835203127... function Problem8 (line 16) | func Problem8(window int) uint { FILE: project_euler/problem_8/problem8_test.go function TestProblem8_Func (line 6) | func TestProblem8_Func(t *testing.T) { function BenchmarkProblem8 (line 36) | func BenchmarkProblem8(b *testing.B) { FILE: project_euler/problem_9/problem9.go function Problem9 (line 17) | func Problem9() uint { FILE: project_euler/problem_9/problem9_test.go function TestProblem9_Func (line 6) | func TestProblem9_Func(t *testing.T) { function BenchmarkProblem9 (line 29) | func BenchmarkProblem9(b *testing.B) { FILE: search/binary.go function Binary (line 6) | func Binary(array []int, target int, lowIndex int, highIndex int) (int, ... function BinaryIterative (line 23) | func BinaryIterative(array []int, target int) (int, error) { function LowerBound (line 42) | func LowerBound(array []int, target int) (int, error) { function UpperBound (line 64) | func UpperBound(array []int, target int) (int, error) { FILE: search/binary_test.go function TestBinary (line 8) | func TestBinary(t *testing.T) { function TestBinaryIterative (line 20) | func TestBinaryIterative(t *testing.T) { function TestLowerBound (line 32) | func TestLowerBound(t *testing.T) { function TestUpperBound (line 44) | func TestUpperBound(t *testing.T) { function BenchmarkBinary (line 56) | func BenchmarkBinary(b *testing.B) { function BenchmarkBinaryIterative (line 64) | func BenchmarkBinaryIterative(b *testing.B) { function BenchmarkLowerBound (line 72) | func BenchmarkLowerBound(b *testing.B) { function BenchmarkUpperBound (line 80) | func BenchmarkUpperBound(b *testing.B) { FILE: search/interpolation.go function Interpolation (line 15) | func Interpolation(sortedData []int, guess int) (int, error) { FILE: search/interpolation_test.go function TestInterpolation (line 5) | func TestInterpolation(t *testing.T) { function BenchmarkInterpolation (line 17) | func BenchmarkInterpolation(b *testing.B) { FILE: search/jump.go function Jump (line 17) | func Jump(array []int, target int) (int, error) { FILE: search/jump2.go function Jump2 (line 5) | func Jump2(arr []int, target int) (int, error) { FILE: search/jump2_test.go function TestJump2 (line 5) | func TestJump2(t *testing.T) { function BenchmarkJump2 (line 17) | func BenchmarkJump2(b *testing.B) { FILE: search/jump_test.go function TestJump (line 5) | func TestJump(t *testing.T) { function BenchmarkJump (line 17) | func BenchmarkJump(b *testing.B) { FILE: search/linear.go function Linear (line 4) | func Linear(array []int, query int) (int, error) { FILE: search/linear_test.go function TestLinear (line 7) | func TestLinear(t *testing.T) { function BenchmarkLinear (line 19) | func BenchmarkLinear(b *testing.B) { FILE: search/selectk.go function SelectK (line 3) | func SelectK(array []int, k int) (int, error) { function selectK (line 11) | func selectK(array []int, l, r, idx int) int { function partition (line 22) | func partition(array []int, l, r int) int { FILE: search/selectk_test.go function TestSelectK (line 7) | func TestSelectK(t *testing.T) { function BenchmarkSelectK (line 33) | func BenchmarkSelectK(b *testing.B) { FILE: search/ternary.go function TernaryMax (line 10) | func TernaryMax(a, b, epsilon float64, f func(x float64) float64) (float... function TernaryMin (line 27) | func TernaryMin(a, b, epsilon float64, f func(x float64) float64) (float... FILE: search/ternary_test.go constant EPS (line 8) | EPS = 1e-6 function equal (line 10) | func equal(a, b float64) bool { function TestTernaryMax (line 14) | func TestTernaryMax(t *testing.T) { function TestTernaryMin (line 36) | func TestTernaryMin(t *testing.T) { FILE: search/testcases.go type searchTest (line 3) | type searchTest struct function generateBenchmarkTestCase (line 61) | func generateBenchmarkTestCase() []int { FILE: sort/binaryinsertionsort.go function BinaryInsertion (line 13) | func BinaryInsertion[T constraints.Ordered](arr []T) []T { FILE: sort/bogosort.go function isSorted (line 16) | func isSorted[T constraints.Number](arr []T) bool { function shuffle (line 26) | func shuffle[T constraints.Number](arr []T) { function Bogo (line 33) | func Bogo[T constraints.Number](arr []T) []T { FILE: sort/bubblesort.go function Bubble (line 9) | func Bubble[T constraints.Ordered](arr []T) []T { FILE: sort/bucketsort.go function Bucket (line 7) | func Bucket[T constraints.Number](arr []T) []T { FILE: sort/circlesort.go function Circle (line 7) | func Circle[T constraints.Ordered](arr []T) []T { function doSort (line 17) | func doSort[T constraints.Ordered](arr []T, left, right int) bool { FILE: sort/cocktailsort.go function Cocktail (line 9) | func Cocktail[T constraints.Ordered](arr []T) []T { FILE: sort/combSort.go function getNextGap (line 11) | func getNextGap(gap int) int { function Comb (line 20) | func Comb[T constraints.Ordered](data []T) []T { FILE: sort/countingsort.go function Count (line 14) | func Count[T constraints.Integer](data []T) []T { FILE: sort/cyclesort.go function Cycle (line 10) | func Cycle[T constraints.Number](arr []T) []T { FILE: sort/exchangesort.go function Exchange (line 11) | func Exchange[T constraints.Ordered](arr []T) []T { FILE: sort/heapsort.go type MaxHeap (line 11) | type MaxHeap struct method Init (line 17) | func (h *MaxHeap) Init(slice []Comparable) { method Heapify (line 28) | func (h MaxHeap) Heapify() { method Pop (line 37) | func (h *MaxHeap) Pop() Comparable { method Push (line 53) | func (h *MaxHeap) Push(i Comparable) { method Size (line 60) | func (h MaxHeap) Size() int { method Update (line 64) | func (h MaxHeap) Update(i Comparable) { method updateidx (line 70) | func (h MaxHeap) updateidx(i int) { method swap (line 74) | func (h *MaxHeap) swap(i, j int) { method more (line 80) | func (h MaxHeap) more(i, j int) bool { method heapifyUp (line 84) | func (h MaxHeap) heapifyUp(i int) { method heapifyDown (line 96) | func (h MaxHeap) heapifyDown(i int) { function heapifyDown (line 100) | func heapifyDown[T any](slice []T, N, i int, moreFunc func(i, j int) boo... type Comparable (line 117) | type Comparable interface function HeapSort (line 122) | func HeapSort[T constraints.Ordered](slice []T) []T { FILE: sort/insertionsort.go function Insertion (line 11) | func Insertion[T constraints.Ordered](arr []T) []T { FILE: sort/mergesort.go function merge (line 15) | func merge[T constraints.Ordered](a []T, b []T) []T { function Merge (line 47) | func Merge[T constraints.Ordered](items []T) []T { function MergeIter (line 61) | func MergeIter[T constraints.Ordered](items []T) []T { function ParallelMerge (line 72) | func ParallelMerge[T constraints.Ordered](items []T) []T { FILE: sort/oddevensort.go function OddEvenSort (line 12) | func OddEvenSort[T constraints.Ordered](arr []T) []T { FILE: sort/pancakesort.go function Pancake (line 8) | func Pancake[T constraints.Ordered](arr []T) []T { function flip (line 38) | func flip[T constraints.Ordered](arr []T, i int) []T { FILE: sort/patiencesort.go function Patience (line 16) | func Patience[T constraints.Ordered](arr []T) []T { function mergePiles (line 44) | func mergePiles[T constraints.Ordered](piles [][]T) []T { FILE: sort/pigeonholesort.go function Pigeonhole (line 17) | func Pigeonhole[T constraints.Integer](arr []T) []T { FILE: sort/quicksort.go function Partition (line 15) | func Partition[T constraints.Ordered](arr []T, low, high int) int { function QuicksortRange (line 29) | func QuicksortRange[T constraints.Ordered](arr []T, low, high int) { function Quicksort (line 42) | func Quicksort[T constraints.Ordered](arr []T) []T { FILE: sort/radixsort.go function countSort (line 16) | func countSort[T constraints.Integer](arr []T, exp T) []T { function unsignedRadixSort (line 35) | func unsignedRadixSort[T constraints.Integer](arr []T) []T { function RadixSort (line 46) | func RadixSort[T constraints.Integer](arr []T) []T { FILE: sort/selectionsort.go function Selection (line 5) | func Selection[T constraints.Ordered](arr []T) []T { FILE: sort/shellsort.go function Shell (line 5) | func Shell[T constraints.Ordered](arr []T) []T { FILE: sort/simplesort.go function Simple (line 16) | func Simple[T constraints.Ordered](arr []T) []T { function ImprovedSimple (line 30) | func ImprovedSimple[T constraints.Ordered](arr []T) []T { FILE: sort/sorts_test.go function testFramework (line 12) | func testFramework(t *testing.T, sortingFunction func([]int) []int) { function TestBinaryInsertion (line 80) | func TestBinaryInsertion(t *testing.T) { function TestBubble (line 84) | func TestBubble(t *testing.T) { function TestBogo (line 88) | func TestBogo(t *testing.T) { function TestBucketSort (line 93) | func TestBucketSort(t *testing.T) { function TestCocktailSort (line 97) | func TestCocktailSort(t *testing.T) { function TestExchange (line 101) | func TestExchange(t *testing.T) { function TestInsertion (line 105) | func TestInsertion(t *testing.T) { function TestMerge (line 109) | func TestMerge(t *testing.T) { function TestMergeIter (line 113) | func TestMergeIter(t *testing.T) { function TestMergeParallel (line 117) | func TestMergeParallel(t *testing.T) { function TestHeap (line 137) | func TestHeap(t *testing.T) { function TestCount (line 141) | func TestCount(t *testing.T) { function TestQuick (line 145) | func TestQuick(t *testing.T) { function TestShell (line 149) | func TestShell(t *testing.T) { function TestRadix (line 153) | func TestRadix(t *testing.T) { function TestSimple (line 157) | func TestSimple(t *testing.T) { function TestImprovedSimple (line 161) | func TestImprovedSimple(t *testing.T) { function TestSelection (line 165) | func TestSelection(t *testing.T) { function TestComb (line 169) | func TestComb(t *testing.T) { function TestPancakeSort (line 173) | func TestPancakeSort(t *testing.T) { function TestPigeonhole (line 177) | func TestPigeonhole(t *testing.T) { function TestPatience (line 181) | func TestPatience(t *testing.T) { function TestCycle (line 185) | func TestCycle(t *testing.T) { function TestTimsort (line 189) | func TestTimsort(t *testing.T) { function TestCircle (line 193) | func TestCircle(t *testing.T) { function TestOddEvenSort (line 197) | func TestOddEvenSort(t *testing.T) { function TestStooge (line 201) | func TestStooge(t *testing.T) { function benchmarkFramework (line 207) | func benchmarkFramework(b *testing.B, f func(arr []int) []int) { function BenchmarkBinaryInsertion (line 246) | func BenchmarkBinaryInsertion(b *testing.B) { function BenchmarkBubble (line 250) | func BenchmarkBubble(b *testing.B) { function BenchmarkBogo (line 254) | func BenchmarkBogo(b *testing.B) { function BenchmarkBucketSort (line 259) | func BenchmarkBucketSort(b *testing.B) { function BenchmarkCocktailSort (line 263) | func BenchmarkCocktailSort(b *testing.B) { function BenchmarkExchange (line 267) | func BenchmarkExchange(b *testing.B) { function BenchmarkInsertion (line 271) | func BenchmarkInsertion(b *testing.B) { function BenchmarkMerge (line 275) | func BenchmarkMerge(b *testing.B) { function BenchmarkMergeIter (line 279) | func BenchmarkMergeIter(b *testing.B) { function BenchmarkMergeParallel (line 283) | func BenchmarkMergeParallel(b *testing.B) { function BenchmarkHeap (line 287) | func BenchmarkHeap(b *testing.B) { function BenchmarkCount (line 291) | func BenchmarkCount(b *testing.B) { function BenchmarkQuick (line 295) | func BenchmarkQuick(b *testing.B) { function BenchmarkShell (line 299) | func BenchmarkShell(b *testing.B) { function BenchmarkRadix (line 303) | func BenchmarkRadix(b *testing.B) { function BenchmarkSimple (line 307) | func BenchmarkSimple(b *testing.B) { function BenchmarkImprovedSimple (line 311) | func BenchmarkImprovedSimple(b *testing.B) { function BenchmarkSelection (line 316) | func BenchmarkSelection(b *testing.B) { function BenchmarkComb (line 320) | func BenchmarkComb(b *testing.B) { function BenchmarkPancakeSort (line 324) | func BenchmarkPancakeSort(b *testing.B) { function BenchmarkPigeonhole (line 328) | func BenchmarkPigeonhole(b *testing.B) { function BenchmarkPatience (line 332) | func BenchmarkPatience(b *testing.B) { function BenchmarkCycle (line 336) | func BenchmarkCycle(b *testing.B) { function BenchmarkTimsort (line 340) | func BenchmarkTimsort(b *testing.B) { function BenchmarkCircle (line 344) | func BenchmarkCircle(b *testing.B) { function BenchmarkStooge (line 348) | func BenchmarkStooge(b *testing.B) { FILE: sort/stooge_sort.go function innerStooge (line 15) | func innerStooge[T constraints.Ordered](arr []T, i int32, j int32) []T { function Stooge (line 28) | func Stooge[T constraints.Ordered](arr []T) []T { FILE: sort/timsort.go constant runSizeThreshold (line 10) | runSizeThreshold = 8 function Timsort (line 13) | func Timsort[T constraints.Ordered](data []T) []T { function calculateRunSize (line 22) | func calculateRunSize(dataLength int) int { function insertionSortRuns (line 36) | func insertionSortRuns[T constraints.Ordered](data []T, runSize int) { function mergeRuns (line 48) | func mergeRuns[T constraints.Ordered](data []T, runSize int) { function mergeRun (line 63) | func mergeRun[T constraints.Ordered](data []T, lower, mid, upper int) { FILE: sqrt/sqrtdecomposition.go type SqrtDecomposition (line 21) | type SqrtDecomposition struct function NewSqrtDecomposition (line 34) | func NewSqrtDecomposition[E any, Q any]( method Query (line 65) | func (s *SqrtDecomposition[E, Q]) Query(start uint64, end uint64) Q { method Update (line 98) | func (s *SqrtDecomposition[E, Q]) Update(index uint64, newElement E) { FILE: sqrt/sqrtdecomposition_test.go type query (line 9) | type query struct type update (line 14) | type update struct function TestSqrtDecomposition (line 19) | func TestSqrtDecomposition(t *testing.T) { FILE: strings/ahocorasick/advancedahocorasick.go function Advanced (line 10) | func Advanced(t string, p []string) Result { function BuildExtendedAc (line 46) | func BuildExtendedAc(p []string) (acToReturn map[int]map[uint8]int, f ma... FILE: strings/ahocorasick/advancedahocorasick_test.go function TestAdvanced (line 51) | func TestAdvanced(t *testing.T) { FILE: strings/ahocorasick/ahocorasick.go type Result (line 9) | type Result struct function AhoCorasick (line 15) | func AhoCorasick(t string, p []string) Result { function BuildAc (line 54) | func BuildAc(p []string) (acToReturn map[int]map[uint8]int, f map[int][]... FILE: strings/ahocorasick/ahocorasick_test.go function TestAhoCorasick (line 10) | func TestAhoCorasick(t *testing.T) { function convertToString (line 24) | func convertToString(res Result) string { FILE: strings/ahocorasick/shared.go function ConstructTrie (line 4) | func ConstructTrie(p []string) (trie map[int]map[uint8]int, stateIsTermi... function Contains (line 39) | func Contains(s []int, e int) bool { function GetWord (line 49) | func GetWord(begin, end int, t string) string { function ComputeAlphabet (line 61) | func ComputeAlphabet(p []string) (s string) { function IntArrayCapUp (line 70) | func IntArrayCapUp(old []int) (new []int) { function BoolArrayCapUp (line 78) | func BoolArrayCapUp(old []bool) (new []bool) { function ArrayUnion (line 86) | func ArrayUnion(to, from []int) (concat []int) { function GetParent (line 99) | func GetParent(state int, at map[int]map[uint8]int) (uint8, int) { function CreateNewState (line 111) | func CreateNewState(state int, at map[int]map[uint8]int) { function CreateTransition (line 116) | func CreateTransition(fromState int, overChar uint8, toState int, at map... function GetTransition (line 121) | func GetTransition(fromState int, overChar uint8, at map[int]map[uint8]i... function StateExists (line 133) | func StateExists(state int, at map[int]map[uint8]int) bool { FILE: strings/charoccurrence.go function CountChars (line 12) | func CountChars(text string) map[rune]int { FILE: strings/charoccurrence_test.go function TestCountChars (line 9) | func TestCountChars(t *testing.T) { FILE: strings/combination/combination.go type Combinations (line 7) | type Combinations struct method Combine (line 22) | func (c *Combinations) Combine(seed int) { function Start (line 13) | func Start(input string) { FILE: strings/generateparentheses/generateparentheses.go function GenerateParenthesis (line 12) | func GenerateParenthesis(n int) []string { FILE: strings/generateparentheses/generateparentheses_test.go function TestGenerateParenthesis (line 10) | func TestGenerateParenthesis(t *testing.T) { FILE: strings/genetic/genetic.go type PopulationItem (line 26) | type PopulationItem struct type Conf (line 32) | type Conf struct type Result (line 52) | type Result struct function GeneticString (line 71) | func GeneticString(target string, charmap []rune, conf *Conf) (*Result, ... FILE: strings/genetic/geneticalgorithm_test.go function TestSimple (line 7) | func TestSimple(t *testing.T) { FILE: strings/guid/guid.go constant pattern (line 24) | pattern string = "xxxxxxxx-xxxx-4xxx-xxxx-xxxxxxxxxxxx" constant versionIndex (line 25) | versionIndex int = 14 function New (line 28) | func New() (string, error) { FILE: strings/guid/guid_test.go function TestNew (line 8) | func TestNew(t *testing.T) { function BenchmarkNew (line 64) | func BenchmarkNew(b *testing.B) { FILE: strings/hamming/hammingdistance.go function Distance (line 18) | func Distance(str1, str2 string) (int, error) { FILE: strings/hamming/hammingdistance_test.go function TestHammingDistance (line 43) | func TestHammingDistance(t *testing.T) { FILE: strings/horspool/horspool.go function Horspool (line 10) | func Horspool(t, p string) (int, error) { function horspool (line 16) | func horspool(t, p []rune) (int, error) { function isMatch (line 43) | func isMatch(pos int, t, p []rune) bool { function computeShiftMap (line 51) | func computeShiftMap(t, p []rune) (res map[rune]int) { FILE: strings/horspool/horspool_test.go function TestLHorspool (line 10) | func TestLHorspool(t *testing.T) { function TestLHorspoolNotExisintPattern (line 43) | func TestLHorspoolNotExisintPattern(t *testing.T) { FILE: strings/isisogram.go type IsogramOrder (line 16) | type IsogramOrder constant First (line 19) | First IsogramOrder = iota + 1 constant Second (line 20) | Second constant Third (line 21) | Third function hasDigit (line 24) | func hasDigit(text string) bool { function hasSymbol (line 29) | func hasSymbol(text string) bool { function IsIsogram (line 34) | func IsIsogram(text string, order IsogramOrder) (bool, error) { FILE: strings/isisogram_test.go function TestIsIsogram (line 117) | func TestIsIsogram(t *testing.T) { FILE: strings/issubsequence.go function IsSubsequence (line 10) | func IsSubsequence(s string, t string) bool { FILE: strings/issubsequence_test.go function TestIsSubsequence (line 10) | func TestIsSubsequence(t *testing.T) { FILE: strings/kmp/kmp.go function Kmp (line 4) | func Kmp(word, text string, patternTable []int) []int { function table (line 36) | func table(w string) []int { FILE: strings/kmp/kmp_test.go function TestKmp (line 8) | func TestKmp(t *testing.T) { function TestTable (line 38) | func TestTable(t *testing.T) { FILE: strings/levenshtein/levenshteindistance.go function Distance (line 10) | func Distance(str1, str2 string, icost, scost, dcost int) int { FILE: strings/levenshtein/levenshteindistance_test.go function TestLevenshteinDistance (line 43) | func TestLevenshteinDistance(t *testing.T) { FILE: strings/manacher/longestpalindrome.go function makeBoundaries (line 15) | func makeBoundaries(s string) string { function nextBoundary (line 27) | func nextBoundary(s string) string { function LongestPalindrome (line 37) | func LongestPalindrome(s string) string { FILE: strings/manacher/longestpalindrome_test.go function getTests (line 10) | func getTests() []struct { function TestLongestPalindrome (line 27) | func TestLongestPalindrome(t *testing.T) { FILE: strings/palindrome/ispalindrome.go function cleanString (line 19) | func cleanString(text string) string { function IsPalindrome (line 26) | func IsPalindrome(text string) bool { function IsPalindromeRecursive (line 39) | func IsPalindromeRecursive(text string) bool { function isPalindromeRecursiveHelper (line 45) | func isPalindromeRecursiveHelper(runes []rune, start int64, end int64) b... FILE: strings/palindrome/ispalindrome_test.go function TestIsPalindrome (line 44) | func TestIsPalindrome(t *testing.T) { function TestIsPalindromeRecursive (line 55) | func TestIsPalindromeRecursive(t *testing.T) { FILE: strings/pangram/ispangram.go function cleanString (line 14) | func cleanString(text string) string { function IsPangram (line 21) | func IsPangram(text string) bool { FILE: strings/pangram/ispangram_test.go function TestIsPangram (line 44) | func TestIsPangram(t *testing.T) { FILE: strings/parenthesis/parenthesis.go function Parenthesis (line 8) | func Parenthesis(text string) bool { FILE: strings/parenthesis/parenthesis_test.go function TestParenthesis (line 44) | func TestParenthesis(t *testing.T) { FILE: strings/search/boyermoore.go function BoyerMoore (line 5) | func BoyerMoore(text string, pattern string) []int { FILE: strings/search/naive.go function Naive (line 5) | func Naive(text string, pattern string) []int { FILE: strings/search/patternsearch_test.go function TestNaive (line 52) | func TestNaive(t *testing.T) { function TestBooyerMoore (line 63) | func TestBooyerMoore(t *testing.T) { FILE: structure/circularqueue/circularqueue_test.go function TestCircularQueue (line 5) | func TestCircularQueue(t *testing.T) { function BenchmarkCircularQueue (line 228) | func BenchmarkCircularQueue(b *testing.B) { FILE: structure/circularqueue/circularqueuearray.go type CircularQueue (line 20) | type CircularQueue struct function NewCircularQueue (line 29) | func NewCircularQueue[T any](size int) (*CircularQueue[T], error) { method Enqueue (line 43) | func (cq *CircularQueue[T]) Enqueue(item T) error { method Dequeue (line 57) | func (cq *CircularQueue[T]) Dequeue() (T, error) { method IsFull (line 73) | func (cq *CircularQueue[T]) IsFull() bool { method IsEmpty (line 78) | func (cq *CircularQueue[T]) IsEmpty() bool { method Peek (line 84) | func (cq *CircularQueue[T]) Peek() (T, error) { method Size (line 94) | func (cq *CircularQueue[T]) Size() int { FILE: structure/deque/deque.go type DoublyEndedQueue (line 17) | type DoublyEndedQueue struct function New (line 22) | func New[T any]() *DoublyEndedQueue[T] { method EnqueueFront (line 27) | func (dq *DoublyEndedQueue[T]) EnqueueFront(item T) { method EnqueueRear (line 32) | func (dq *DoublyEndedQueue[T]) EnqueueRear(item T) { method DequeueFront (line 37) | func (dq *DoublyEndedQueue[T]) DequeueFront() (T, error) { method DequeueRear (line 48) | func (dq *DoublyEndedQueue[T]) DequeueRear() (T, error) { method Front (line 59) | func (dq *DoublyEndedQueue[T]) Front() (T, error) { method Rear (line 68) | func (dq *DoublyEndedQueue[T]) Rear() (T, error) { method IsEmpty (line 77) | func (dq *DoublyEndedQueue[T]) IsEmpty() bool { method Length (line 82) | func (dq *DoublyEndedQueue[T]) Length() int { FILE: structure/deque/deque_test.go type QueryStructure (line 20) | type QueryStructure struct type TestCaseData (line 27) | type TestCaseData struct function TestDeque (line 32) | func TestDeque(t *testing.T) { FILE: structure/dynamicarray/dynamicarray.go type DynamicArray (line 21) | type DynamicArray struct method Put (line 28) | func (da *DynamicArray) Put(index int, element any) error { method Add (line 41) | func (da *DynamicArray) Add(element any) { method Remove (line 51) | func (da *DynamicArray) Remove(index int) error { method Get (line 67) | func (da *DynamicArray) Get(index int) (any, error) { method IsEmpty (line 78) | func (da *DynamicArray) IsEmpty() bool { method GetData (line 83) | func (da *DynamicArray) GetData() []any { method CheckRangeFromIndex (line 88) | func (da *DynamicArray) CheckRangeFromIndex(index int) error { method NewCapacity (line 96) | func (da *DynamicArray) NewCapacity() { FILE: structure/dynamicarray/dynamicarray_test.go function TestDynamicArray (line 8) | func TestDynamicArray(t *testing.T) { FILE: structure/fenwicktree/fenwicktree.go type FenwickTree (line 11) | type FenwickTree struct method PrefixSum (line 37) | func (f *FenwickTree) PrefixSum(pos int) int { method RangeSum (line 50) | func (f *FenwickTree) RangeSum(l int, r int) int { method Add (line 56) | func (f *FenwickTree) Add(pos int, value int) { function NewFenwickTree (line 20) | func NewFenwickTree(array []int) *FenwickTree { FILE: structure/fenwicktree/fenwicktree_test.go type query (line 8) | type query struct type update (line 14) | type update struct function TestFenwickTree (line 19) | func TestFenwickTree(t *testing.T) { FILE: structure/hashmap/hashmap.go type node (line 10) | type node struct type HashMap (line 17) | type HashMap struct method Get (line 41) | func (hm *HashMap) Get(key any) any { method Put (line 50) | func (hm *HashMap) Put(key, value any) { method Contains (line 75) | func (hm *HashMap) Contains(key any) bool { method getNodeByKey (line 80) | func (hm *HashMap) getNodeByKey(key any) *node { method resize (line 93) | func (hm *HashMap) resize() { method hash (line 107) | func (hm *HashMap) hash(key any) uint64 { function DefaultNew (line 24) | func DefaultNew() *HashMap { function New (line 32) | func New(size, capacity uint64) *HashMap { FILE: structure/hashmap/hashmap_test.go function TestHashMap (line 9) | func TestHashMap(t *testing.T) { FILE: structure/heap/heap.go type Heap (line 9) | type Heap struct function New (line 15) | func New[T constraints.Ordered]() *Heap[T] { function NewAny (line 24) | func NewAny[T any](less func(a, b T) bool) (*Heap[T], error) { method Push (line 35) | func (h *Heap[T]) Push(t T) { method Top (line 42) | func (h *Heap[T]) Top() T { method Pop (line 48) | func (h *Heap[T]) Pop() { method Empty (line 59) | func (h *Heap[T]) Empty() bool { method Size (line 64) | func (h *Heap[T]) Size() int { method swap (line 68) | func (h *Heap[T]) swap(i, j int) { method up (line 72) | func (h *Heap[T]) up(child int) { method down (line 84) | func (h *Heap[T]) down(parent int) { FILE: structure/heap/heap_test.go type testInt (line 9) | type testInt method Less (line 11) | func (u testInt) Less(o testInt) bool { type testStudent (line 15) | type testStudent struct method Less (line 20) | func (u testStudent) Less(o testStudent) bool { function TestHeap_Empty (line 27) | func TestHeap_Empty(t *testing.T) { type testOpType (line 44) | type testOpType constant testPush (line 47) | testPush = 1 constant testPop (line 48) | testPop = 2 constant testTop (line 49) | testTop = 3 constant testEmpty (line 50) | testEmpty = 4 type testOp (line 53) | type testOp struct type testStruct (line 59) | type testStruct struct function TestHeapExample1 (line 64) | func TestHeapExample1(t *testing.T) { function TestHeapExample2 (line 98) | func TestHeapExample2(t *testing.T) { function testFunc (line 115) | func testFunc[T any](t *testing.T, tests []testStruct[T], less func(a, b... FILE: structure/linkedlist/cyclic.go type Cyclic (line 6) | type Cyclic struct function NewCyclic (line 12) | func NewCyclic[T any]() *Cyclic[T] { method Add (line 20) | func (cl *Cyclic[T]) Add(val T) { method Rotate (line 49) | func (cl *Cyclic[T]) Rotate(places int) { method Delete (line 74) | func (cl *Cyclic[T]) Delete() bool { method Destroy (line 100) | func (cl *Cyclic[T]) Destroy() { method Walk (line 107) | func (cl *Cyclic[T]) Walk() *Node[T] { function JosephusProblem (line 120) | func JosephusProblem(cl *Cyclic[int], k int) int { FILE: structure/linkedlist/cyclic_test.go function fillList (line 8) | func fillList(list *Cyclic[int], n int) { function TestAdd (line 14) | func TestAdd(t *testing.T) { function TestWalk (line 32) | func TestWalk(t *testing.T) { function TestRotate (line 44) | func TestRotate(t *testing.T) { function TestDelete (line 71) | func TestDelete(t *testing.T) { function TestDestroy (line 87) | func TestDestroy(t *testing.T) { function TestJosephusProblem (line 104) | func TestJosephusProblem(t *testing.T) { FILE: structure/linkedlist/doubly.go type Doubly (line 18) | type Doubly struct method Init (line 23) | func (ll *Doubly[T]) Init() *Doubly[T] { function NewDoubly (line 31) | func NewDoubly[T any]() *Doubly[T] { method lazyInit (line 36) | func (ll *Doubly[T]) lazyInit() { method insert (line 42) | func (ll *Doubly[T]) insert(n, at *Node[T]) *Node[T] { method insertValue (line 51) | func (ll *Doubly[T]) insertValue(val T, at *Node[T]) *Node[T] { method AddAtBeg (line 56) | func (ll *Doubly[T]) AddAtBeg(val T) { method AddAtEnd (line 62) | func (ll *Doubly[T]) AddAtEnd(val T) { method Remove (line 67) | func (ll *Doubly[T]) Remove(n *Node[T]) T { method DelAtBeg (line 77) | func (ll *Doubly[T]) DelAtBeg() (T, bool) { method DelAtEnd (line 91) | func (ll *Doubly[T]) DelAtEnd() (T, bool) { method DelByPos (line 106) | func (ll *Doubly[T]) DelByPos(pos int) (T, bool) { method Count (line 138) | func (ll *Doubly[T]) Count() int { method Reverse (line 153) | func (ll *Doubly[T]) Reverse() { method Display (line 169) | func (ll *Doubly[T]) Display() { method DisplayReverse (line 178) | func (ll *Doubly[T]) DisplayReverse() { method Front (line 190) | func (ll *Doubly[T]) Front() *Node[T] { method Back (line 198) | func (ll *Doubly[T]) Back() *Node[T] { method MoveToBack (line 206) | func (ll *Doubly[T]) MoveToBack(n *Node[T]) { method move (line 214) | func (ll *Doubly[T]) move(n, at *Node[T]) { FILE: structure/linkedlist/doubly_test.go function TestDoubly (line 8) | func TestDoubly(t *testing.T) { FILE: structure/linkedlist/shared.go type Node (line 5) | type Node struct function NewNode (line 12) | func NewNode[T any](val T) *Node[T] { FILE: structure/linkedlist/singlylinkedlist.go type Singly (line 10) | type Singly struct function NewSingly (line 19) | func NewSingly[T any]() *Singly[T] { method AddAtBeg (line 24) | func (ll *Singly[T]) AddAtBeg(val T) { method AddAtEnd (line 32) | func (ll *Singly[T]) AddAtEnd(val T) { method DelAtBeg (line 50) | func (ll *Singly[T]) DelAtBeg() (T, bool) { method DelAtEnd (line 65) | func (ll *Singly[T]) DelAtEnd() (T, bool) { method DelByPos (line 89) | func (ll *Singly[T]) DelByPos(pos int) (T, bool) { method Count (line 122) | func (ll *Singly[T]) Count() int { method Reverse (line 127) | func (ll *Singly[T]) Reverse() { method ReversePartition (line 142) | func (ll *Singly[T]) ReversePartition(left, right int) error { method CheckRangeFromIndex (line 163) | func (ll *Singly[T]) CheckRangeFromIndex(left, right int) error { method Display (line 175) | func (ll *Singly[T]) Display() { FILE: structure/linkedlist/singlylinkedlist_test.go function TestSingly (line 8) | func TestSingly(t *testing.T) { FILE: structure/queue/queue_test.go function TestQueue (line 17) | func TestQueue(t *testing.T) { FILE: structure/queue/queuearray.go function EnQueue (line 15) | func EnQueue(n any) { function DeQueue (line 20) | func DeQueue() any { function FrontQueue (line 27) | func FrontQueue() any { function BackQueue (line 32) | func BackQueue() any { function LenQueue (line 37) | func LenQueue() int { function IsEmptyQueue (line 42) | func IsEmptyQueue() bool { FILE: structure/queue/queuelinkedlist.go type Node (line 13) | type Node struct type Queue (line 19) | type Queue struct method enqueue (line 26) | func (ll *Queue) enqueue(n any) { method dequeue (line 43) | func (ll *Queue) dequeue() any { method isEmpty (line 60) | func (ll *Queue) isEmpty() bool { method len (line 65) | func (ll *Queue) len() int { method frontQueue (line 70) | func (ll *Queue) frontQueue() any { method backQueue (line 75) | func (ll *Queue) backQueue() any { FILE: structure/queue/queuelinklistwithlist.go type LQueue (line 20) | type LQueue struct method Enqueue (line 25) | func (lq *LQueue) Enqueue(value any) { method Dequeue (line 30) | func (lq *LQueue) Dequeue() error { method Front (line 43) | func (lq *LQueue) Front() (any, error) { method Back (line 53) | func (lq *LQueue) Back() (any, error) { method Len (line 63) | func (lq *LQueue) Len() int { method Empty (line 68) | func (lq *LQueue) Empty() bool { FILE: structure/segmenttree/segmenttree.go constant emptyLazyNode (line 14) | emptyLazyNode = 0 type SegmentTree (line 17) | type SegmentTree struct method Propagate (line 24) | func (s *SegmentTree) Propagate(node int, leftNode int, rightNode int) { method Query (line 47) | func (s *SegmentTree) Query(node int, leftNode int, rightNode int, fir... method Update (line 73) | func (s *SegmentTree) Update(node int, leftNode int, rightNode int, fi... method Build (line 100) | func (s *SegmentTree) Build(node int, left int, right int) { function NewSegmentTree (line 117) | func NewSegmentTree(Array []int) *SegmentTree { FILE: structure/segmenttree/segmenttree_test.go type query (line 8) | type query struct type update (line 13) | type update struct function TestSegmentTree (line 19) | func TestSegmentTree(t *testing.T) { FILE: structure/set/set.go function New (line 7) | func New[T comparable](items ...T) Set[T] { type Set (line 18) | type Set interface type set (line 53) | type set struct method Add (line 57) | func (st *set[T]) Add(value T) { method Delete (line 61) | func (st *set[T]) Delete(value T) { method GetItems (line 65) | func (st *set[T]) GetItems() []T { method Len (line 73) | func (st *set[T]) Len() int { method In (line 77) | func (st *set[T]) In(value T) bool { method IsSubsetOf (line 84) | func (st *set[T]) IsSubsetOf(superSet Set[T]) bool { method IsProperSubsetOf (line 97) | func (st *set[T]) IsProperSubsetOf(superSet Set[T]) bool { method IsSupersetOf (line 104) | func (st *set[T]) IsSupersetOf(subSet Set[T]) bool { method IsProperSupersetOf (line 108) | func (st *set[T]) IsProperSupersetOf(subSet Set[T]) bool { method Union (line 115) | func (st *set[T]) Union(st2 Set[T]) Set[T] { method Intersection (line 126) | func (st *set[T]) Intersection(st2 Set[T]) Set[T] { method Difference (line 144) | func (st *set[T]) Difference(st2 Set[T]) Set[T] { method SymmetricDifference (line 154) | func (st *set[T]) SymmetricDifference(st2 Set[T]) Set[T] { FILE: structure/set/set_test.go function TestNew (line 7) | func TestNew(t *testing.T) { function TestAdd (line 22) | func TestAdd(t *testing.T) { function TestDelete (line 47) | func TestDelete(t *testing.T) { function TestIsSubsetOf (line 72) | func TestIsSubsetOf(t *testing.T) { function TestIsProperSubsetOf (line 85) | func TestIsProperSubsetOf(t *testing.T) { function TestIsSupersetOf (line 95) | func TestIsSupersetOf(t *testing.T) { function TestIsProperSupersetOf (line 108) | func TestIsProperSupersetOf(t *testing.T) { function TestUnion (line 118) | func TestUnion(t *testing.T) { function TestIntersection (line 144) | func TestIntersection(t *testing.T) { function TestDifference (line 170) | func TestDifference(t *testing.T) { function TestSymmetricDifference (line 196) | func TestSymmetricDifference(t *testing.T) { FILE: structure/set/setexample_test.go function ExampleSet (line 7) | func ExampleSet() { FILE: structure/stack/stack_test.go function TestStackLinkedList (line 20) | func TestStackLinkedList(t *testing.T) { function TestStackArray (line 70) | func TestStackArray(t *testing.T) { function TestStackLinkedListWithList (line 132) | func TestStackLinkedListWithList(t *testing.T) { FILE: structure/stack/stackarray.go type Array (line 12) | type Array struct function NewStack (line 17) | func NewStack[T any]() *Array[T] { method Push (line 22) | func (s *Array[T]) Push(value T) { method Length (line 27) | func (s *Array[T]) Length() int { method Peek (line 32) | func (s *Array[T]) Peek() T { method IsEmpty (line 41) | func (s *Array[T]) IsEmpty() bool { method Pop (line 46) | func (s *Array[T]) Pop() T { FILE: structure/stack/stacklinkedlist.go type Node (line 13) | type Node struct type Stack (line 19) | type Stack struct method Push (line 25) | func (ll *Stack) Push(n any) { method Pop (line 36) | func (ll *Stack) Pop() any { method IsEmpty (line 49) | func (ll *Stack) IsEmpty() bool { method Length (line 54) | func (ll *Stack) Length() int { method Peek (line 59) | func (ll *Stack) Peek() any { method Show (line 64) | func (ll *Stack) Show() (in []any) { FILE: structure/stack/stacklinkedlistwithlist.go type SList (line 18) | type SList struct method Push (line 23) | func (sl *SList) Push(val any) { method Peek (line 28) | func (sl *SList) Peek() (any, error) { method Pop (line 38) | func (sl *SList) Pop() (any, error) { method Length (line 51) | func (sl *SList) Length() int { method IsEmpty (line 56) | func (sl *SList) IsEmpty() bool { FILE: structure/tree/avl.go type AVLNode (line 18) | type AVLNode struct method Key (line 26) | func (n *AVLNode[T]) Key() T { method Parent (line 30) | func (n *AVLNode[T]) Parent() Node[T] { method Left (line 34) | func (n *AVLNode[T]) Left() Node[T] { method Right (line 38) | func (n *AVLNode[T]) Right() Node[T] { method Height (line 42) | func (n *AVLNode[T]) Height() int { type AVL (line 48) | type AVL struct function NewAVL (line 54) | func NewAVL[T constraints.Ordered]() *AVL[T] { method Empty (line 62) | func (avl *AVL[T]) Empty() bool { method Push (line 67) | func (avl *AVL[T]) Push(keys ...T) { method Delete (line 74) | func (avl *AVL[T]) Delete(key T) bool { method Get (line 84) | func (avl *AVL[T]) Get(key T) (Node[T], bool) { method Has (line 89) | func (avl *AVL[T]) Has(key T) bool { method PreOrder (line 95) | func (avl *AVL[T]) PreOrder() []T { method InOrder (line 102) | func (avl *AVL[T]) InOrder() []T { method PostOrder (line 107) | func (avl *AVL[T]) PostOrder() []T { method LevelOrder (line 114) | func (avl *AVL[T]) LevelOrder() []T { method AccessNodesByLayer (line 121) | func (avl *AVL[T]) AccessNodesByLayer() [][]T { method Depth (line 126) | func (avl *AVL[T]) Depth() int { method Max (line 131) | func (avl *AVL[T]) Max() (T, bool) { method Min (line 141) | func (avl *AVL[T]) Min() (T, bool) { method Predecessor (line 153) | func (avl *AVL[T]) Predecessor(key T) (T, bool) { method Successor (line 165) | func (avl *AVL[T]) Successor(key T) (T, bool) { method pushHelper (line 174) | func (avl *AVL[T]) pushHelper(root *AVLNode[T], key T) *AVLNode[T] { method deleteHelper (line 224) | func (avl *AVL[T]) deleteHelper(root *AVLNode[T], key T) *AVLNode[T] { method height (line 295) | func (avl *AVL[T]) height(root *AVLNode[T]) int { method balanceFactor (line 312) | func (avl *AVL[T]) balanceFactor(root *AVLNode[T]) int { method leftRotate (line 323) | func (avl *AVL[T]) leftRotate(x *AVLNode[T]) *AVLNode[T] { method rightRotate (line 341) | func (avl *AVL[T]) rightRotate(x *AVLNode[T]) *AVLNode[T] { FILE: structure/tree/avl_test.go function TestAVLPush (line 11) | func TestAVLPush(t *testing.T) { function TestAVLDelete (line 124) | func TestAVLDelete(t *testing.T) { FILE: structure/tree/bstree.go type BSNode (line 15) | type BSNode struct method Key (line 22) | func (n *BSNode[T]) Key() T { method Parent (line 26) | func (n *BSNode[T]) Parent() Node[T] { method Left (line 30) | func (n *BSNode[T]) Left() Node[T] { method Right (line 34) | func (n *BSNode[T]) Right() Node[T] { type BinarySearch (line 40) | type BinarySearch struct function NewBinarySearch (line 46) | func NewBinarySearch[T constraints.Ordered]() *BinarySearch[T] { method Empty (line 54) | func (t *BinarySearch[T]) Empty() bool { method Push (line 59) | func (t *BinarySearch[T]) Push(keys ...T) { method Delete (line 66) | func (t *BinarySearch[T]) Delete(val T) bool { method Get (line 76) | func (t *BinarySearch[T]) Get(key T) (Node[T], bool) { method Has (line 81) | func (t *BinarySearch[T]) Has(key T) bool { method PreOrder (line 87) | func (t *BinarySearch[T]) PreOrder() []T { method InOrder (line 94) | func (t *BinarySearch[T]) InOrder() []T { method PostOrder (line 99) | func (t *BinarySearch[T]) PostOrder() []T { method LevelOrder (line 106) | func (t *BinarySearch[T]) LevelOrder() []T { method AccessNodesByLayer (line 113) | func (t *BinarySearch[T]) AccessNodesByLayer() [][]T { method Depth (line 118) | func (t *BinarySearch[T]) Depth() int { method Max (line 123) | func (t *BinarySearch[T]) Max() (T, bool) { method Min (line 133) | func (t *BinarySearch[T]) Min() (T, bool) { method Predecessor (line 145) | func (t *BinarySearch[T]) Predecessor(key T) (T, bool) { method Successor (line 157) | func (t *BinarySearch[T]) Successor(key T) (T, bool) { method pushHelper (line 166) | func (t *BinarySearch[T]) pushHelper(x *BSNode[T], val T) { method deleteHelper (line 195) | func (t *BinarySearch[T]) deleteHelper(z *BSNode[T]) { method transplant (line 215) | func (t *BinarySearch[T]) transplant(u, v *BSNode[T]) { FILE: structure/tree/bstree_test.go function TestPush (line 12) | func TestPush(t *testing.T) { function TestDelete (line 36) | func TestDelete(t *testing.T) { FILE: structure/tree/btree.go type BTreeNode (line 8) | type BTreeNode struct type BTree (line 15) | type BTree struct function minKeys (line 20) | func minKeys(maxKeys int) int { function NewBTreeNode (line 24) | func NewBTreeNode[T constraints.Ordered](maxKeys int, isLeaf bool) *BTre... function NewBTree (line 35) | func NewBTree[T constraints.Ordered](maxKeys int) *BTree[T] { method Verify (line 45) | func (node *BTreeNode[T]) Verify(tree *BTree[T]) { method IsFull (line 54) | func (node *BTreeNode[T]) IsFull(maxKeys int) bool { method Search (line 58) | func (node *BTreeNode[T]) Search(key T) bool { method Search (line 74) | func (tree *BTree[T]) Search(key T) bool { method InsertKeyChild (line 81) | func (node *BTreeNode[T]) InsertKeyChild(key T, child *BTreeNode[T]) { method Append (line 100) | func (node *BTreeNode[T]) Append(key T, child *BTreeNode[T]) { method Concat (line 107) | func (node *BTreeNode[T]) Concat(other *BTreeNode[T], idx int) { method Split (line 128) | func (parent *BTreeNode[T]) Split(idx int, maxKeys int) { method InsertNonFull (line 149) | func (node *BTreeNode[T]) InsertNonFull(tree *BTree[T], key T) { method Insert (line 178) | func (tree *BTree[T]) Insert(key T) { method DeleteIthKey (line 196) | func (node *BTreeNode[T]) DeleteIthKey(i int) { method Merge (line 219) | func (node *BTreeNode[T]) Merge(idx int) { method Min (line 230) | func (node *BTreeNode[T]) Min() T { method Max (line 237) | func (node *BTreeNode[T]) Max() T { method Delete (line 244) | func (node *BTreeNode[T]) Delete(tree *BTree[T], key T) { method Delete (line 347) | func (tree *BTree[T]) Delete(key T) { FILE: structure/tree/btree_test.go function TestBTreeIncreasing (line 9) | func TestBTreeIncreasing(t *testing.T) { function TestBTreeDecreasing (line 45) | func TestBTreeDecreasing(t *testing.T) { function TestBTreeRandom (line 81) | func TestBTreeRandom(t *testing.T) { function TestBTreeDeleteEverything (line 116) | func TestBTreeDeleteEverything(t *testing.T) { FILE: structure/tree/example_test.go type TestTree (line 11) | type TestTree interface function TestBinarySearch (line 38) | func TestBinarySearch(t *testing.T) { function TestAVL (line 83) | func TestAVL(t *testing.T) { function TestRB (line 128) | func TestRB(t *testing.T) { FILE: structure/tree/rbtree.go type Color (line 14) | type Color constant Red (line 17) | Red Color = iota constant Black (line 18) | Black type RBNode (line 25) | type RBNode struct method Key (line 33) | func (n *RBNode[T]) Key() T { method Parent (line 37) | func (n *RBNode[T]) Parent() Node[T] { method Left (line 41) | func (n *RBNode[T]) Left() Node[T] { method Right (line 45) | func (n *RBNode[T]) Right() Node[T] { type RB (line 51) | type RB struct function NewRB (line 57) | func NewRB[T constraints.Ordered]() *RB[T] { method Empty (line 67) | func (t *RB[T]) Empty() bool { method Push (line 72) | func (t *RB[T]) Push(keys ...T) { method Delete (line 80) | func (t *RB[T]) Delete(data T) bool { method Get (line 85) | func (t *RB[T]) Get(key T) (Node[T], bool) { method Has (line 90) | func (t *RB[T]) Has(key T) bool { method PreOrder (line 96) | func (t *RB[T]) PreOrder() []T { method InOrder (line 103) | func (t *RB[T]) InOrder() []T { method PostOrder (line 108) | func (t *RB[T]) PostOrder() []T { method LevelOrder (line 115) | func (t *RB[T]) LevelOrder() []T { method AccessNodesByLayer (line 122) | func (t *RB[T]) AccessNodesByLayer() [][]T { method Depth (line 127) | func (t *RB[T]) Depth() int { method Max (line 132) | func (t *RB[T]) Max() (T, bool) { method Min (line 142) | func (t *RB[T]) Min() (T, bool) { method Predecessor (line 154) | func (t *RB[T]) Predecessor(key T) (T, bool) { method Successor (line 166) | func (t *RB[T]) Successor(key T) (T, bool) { method pushHelper (line 175) | func (t *RB[T]) pushHelper(x *RBNode[T], key T) { method leftRotate (line 216) | func (t *RB[T]) leftRotate(x *RBNode[T]) { method rightRotate (line 237) | func (t *RB[T]) rightRotate(x *RBNode[T]) { method pushFix (line 257) | func (t *RB[T]) pushFix(k *RBNode[T]) { method deleteHelper (line 300) | func (t *RB[T]) deleteHelper(node *RBNode[T], key T) bool { method deleteFix (line 352) | func (t *RB[T]) deleteFix(x *RBNode[T]) { method transplant (line 413) | func (t *RB[T]) transplant(u, v *RBNode[T]) { FILE: structure/tree/rbtree_test.go function TestRBTreePush (line 12) | func TestRBTreePush(t *testing.T) { function TestRBTreeDelete (line 48) | func TestRBTreeDelete(t *testing.T) { function TestRBTree (line 85) | func TestRBTree(t *testing.T) { function TestRBTreeString (line 123) | func TestRBTreeString(t *testing.T) { FILE: structure/tree/tree.go type Node (line 15) | type Node interface function accessNodeByLayerHelper (line 24) | func accessNodeByLayerHelper[T constraints.Ordered](root, nilNode Node[T... function searchTreeHelper (line 52) | func searchTreeHelper[T constraints.Ordered](node, nilNode Node[T], key ... function inOrderHelper (line 66) | func inOrderHelper[T constraints.Ordered](node, nilNode Node[T]) []T { function preOrderRecursive (line 85) | func preOrderRecursive[T constraints.Ordered](n, nilNode Node[T], traver... function postOrderRecursive (line 96) | func postOrderRecursive[T constraints.Ordered](n, nilNode Node[T], trave... function calculateDepth (line 106) | func calculateDepth[T constraints.Ordered](n, nilNode Node[T], depth int... function minimum (line 114) | func minimum[T constraints.Ordered](node, nilNode Node[T]) Node[T] { function maximum (line 125) | func maximum[T constraints.Ordered](node, nilNode Node[T]) Node[T] { function levelOrderHelper (line 136) | func levelOrderHelper[T constraints.Ordered](root, nilNode Node[T], trav... function predecessorHelper (line 155) | func predecessorHelper[T constraints.Ordered](node, nilNode Node[T]) (T,... function successorHelper (line 173) | func successorHelper[T constraints.Ordered](node, nilNode Node[T]) (T, b... FILE: structure/tree/tree_test.go function TestTreeGetOrHas (line 12) | func TestTreeGetOrHas(t *testing.T) { function TestTreePreOrder (line 53) | func TestTreePreOrder(t *testing.T) { function TestTreeInOrder (line 109) | func TestTreeInOrder(t *testing.T) { function TestTreePostOrder (line 140) | func TestTreePostOrder(t *testing.T) { function TestTreeLevelOrder (line 199) | func TestTreeLevelOrder(t *testing.T) { function TestTreeMinAndMax (line 258) | func TestTreeMinAndMax(t *testing.T) { function TestTreeDepth (line 295) | func TestTreeDepth(t *testing.T) { function TestTreeAccessNodesByLayer (line 354) | func TestTreeAccessNodesByLayer(t *testing.T) { function TestTreePredecessorAndSuccessor (line 417) | func TestTreePredecessorAndSuccessor(t *testing.T) { constant testNum (line 493) | testNum = 10_000 function BenchmarkBSTree_Insert (line 495) | func BenchmarkBSTree_Insert(b *testing.B) { function BenchmarkBSTree_Has (line 508) | func BenchmarkBSTree_Has(b *testing.B) { function BenchmarkBSTree_Delete (line 525) | func BenchmarkBSTree_Delete(b *testing.B) { function BenchmarkRBTree_Insert (line 542) | func BenchmarkRBTree_Insert(b *testing.B) { function BenchmarkRBTree_Has (line 555) | func BenchmarkRBTree_Has(b *testing.B) { function BenchmarkRBTree_Delete (line 572) | func BenchmarkRBTree_Delete(b *testing.B) { function BenchmarkAVLTree_Insert (line 589) | func BenchmarkAVLTree_Insert(b *testing.B) { function BenchmarkAVLTree_Has (line 603) | func BenchmarkAVLTree_Has(b *testing.B) { function BenchmarkAVLTree_Delete (line 620) | func BenchmarkAVLTree_Delete(b *testing.B) { FILE: structure/trie/trie.go type Node (line 7) | type Node struct method insert (line 22) | func (n *Node) insert(s string) { method Insert (line 36) | func (n *Node) Insert(s ...string) { method Find (line 43) | func (n *Node) Find(s string) bool { method Capacity (line 55) | func (n *Node) Capacity() int { method Size (line 64) | func (n *Node) Size() int { method remove (line 76) | func (n *Node) remove(s string) { method Remove (line 92) | func (n *Node) Remove(s ...string) { method Compact (line 99) | func (n *Node) Compact() (remove bool) { function NewNode (line 14) | func NewNode() *Node { FILE: structure/trie/trie_bench_test.go function BenchmarkTrie_Insert (line 12) | func BenchmarkTrie_Insert(b *testing.B) { function BenchmarkTrie_Find_non_existent (line 25) | func BenchmarkTrie_Find_non_existent(b *testing.B) { function BenchmarkTrie_Find_existent (line 40) | func BenchmarkTrie_Find_existent(b *testing.B) { function BenchmarkTrie_Remove_lazy (line 54) | func BenchmarkTrie_Remove_lazy(b *testing.B) { function BenchmarkTrie_Remove_and_Compact (line 68) | func BenchmarkTrie_Remove_and_Compact(b *testing.B) { FILE: structure/trie/trie_test.go function TestTrieInsert (line 7) | func TestTrieInsert(t *testing.T) { function TestTrieInsert_substrings (line 27) | func TestTrieInsert_substrings(t *testing.T) { function TestTrieRemove (line 62) | func TestTrieRemove(t *testing.T) { method verify (line 131) | func (n *Node) verify(t *testing.T, checkWords map[string]bool) { method verifySizeCapa (line 150) | func (n *Node) verifySizeCapa(t *testing.T, expectedSize, expectedCapaci... FILE: structure/trie/trieexample_test.go function ExampleNode (line 5) | func ExampleNode() {