Atelier is a Go library providing a set of algorithms, data structures, APIs and helpers to resort to when in need.
It is essentially my personal library of Go code, in a single place, easily accessible. Types, tools, helpers, that I use on a recurrent basis, and that I don't want to rewrite every time I need them.
go get github.com/oleiade/atelierThe Trie is a versatile tree-like structure optimized for storing and searching strings. Tries are ideal for operations such as autocomplete, prefix lookup, and spell checking, as they provide efficient means of storing and retrieving words based on their prefixes. This Trie implementation supports insertion, search, autocomplete, and also offers specialized methods to find words that start or end with specific substrings, making it suitable for use cases that require fast and flexible string searching capabilities.
package main
import (
"fmt"
"github.com/oleiade/atelier"
)
func main() {
trie := atelier.NewTrie()
wordsToInsert := []string{"apple", "app", "application", "banana", "band", "bandana"}
for _, word := range wordsToInsert {
trie.Insert(word)
}
fmt.Println("Words inserted into the Trie.")
// Searching for a word
searchWord := "apple"
if trie.Search(searchWord) {
fmt.Println("Word found:", searchWord)
} else {
fmt.Println("Word not found:", searchWord)
}
// Using Autocomplete
prefix := "app"
suggestions := trie.Autocomplete(prefix)
fmt.Println("Autocomplete suggestions for", prefix, ":", suggestions)
// Finding words that start with a specific prefix
prefix = "ba"
wordsWithPrefix := trie.StartsWith(prefix)
fmt.Println("Words starting with", prefix, ":", wordsWithPrefix)
// Finding words that end with a specific suffix
suffix := "ana"
wordsWithSuffix := trie.EndsWith(suffix)
fmt.Println("Words ending with", suffix, ":", wordsWithSuffix)
}Provides a way to map the memory address of a given pointer to a human-readable word. This utility is particularly useful in debugging scenarios, where tracking and identifying pointers by their raw addresses can be cumbersome. By leveraging a hash function, this method calculates an index into a predefined WordList, transforming a numeric memory address into a more memorable and recognizable word. This approach simplifies the process of monitoring and distinguishing different pointer variables during debugging, making it easier to follow their behavior and interactions within the program.