README
¶
Go Basics
Algorithms, data-structures, patterns and various techniques written in golang.
Contributing
Contributions appreciated and accepted in form of:
- Suggestions for improvement (code, style, tests etc.)
- Grammar corrections
- Bugfixes
- Problem definitions w/o solution
Directories
¶
| Path | Synopsis |
|---|---|
|
algorithms
|
|
|
gonuts
|
|
|
ctxvaluetype
Package ctxvaluetype shows that context key type is checked when we are trying to retrieve it later.
|
Package ctxvaluetype shows that context key type is checked when we are trying to retrieve it later. |
|
nilnotnil
Package nilnotnil demonstrates that nil can have a underlying type.
|
Package nilnotnil demonstrates that nil can have a underlying type. |
|
structalloc
Package structalloc demonstrates that order of fields in a structure directly affects how much memory will be allocated for an instance of this structure.
|
Package structalloc demonstrates that order of fields in a structure directly affects how much memory will be allocated for an instance of this structure. |
|
unsafepkg
Package unsafepkg demonstrates usage of unsafe package.
|
Package unsafepkg demonstrates usage of unsafe package. |
|
principles
|
|
|
solid
Package solid provides examples of SOLID principles applied in golang.
|
Package solid provides examples of SOLID principles applied in golang. |
|
solid/dip
Package dip shows how Dependency Inversion Principle can be applied in Go.
|
Package dip shows how Dependency Inversion Principle can be applied in Go. |
|
solid/isp
Package isp shows how Interface Segregation Principle can be applied in Go.
|
Package isp shows how Interface Segregation Principle can be applied in Go. |
|
solid/lsp
Package lsp shows how Liskov Substitution Principle can be applied in Go.
|
Package lsp shows how Liskov Substitution Principle can be applied in Go. |
|
solid/ocp
Package ocp shows how Open-Closed Principle can be applied in Go.
|
Package ocp shows how Open-Closed Principle can be applied in Go. |
|
solid/srp
Package srp shows how Single Responsibility Principle can be applied in Go.
|
Package srp shows how Single Responsibility Principle can be applied in Go. |
|
structures
|
|
|
binarytree
Package binarytree is implementation of binary tree data structure.
|
Package binarytree is implementation of binary tree data structure. |
|
cache
Package cache is implements number of caching techniques.
|
Package cache is implements number of caching techniques. |
|
cache/lru
Package lru is a very simple implementation of LRU Cache structure.
|
Package lru is a very simple implementation of LRU Cache structure. |
|
graph
Package graph implements graph data structure and basic operations with it.
|
Package graph implements graph data structure and basic operations with it. |
|
heap
Package heap implements heap data structure.
|
Package heap implements heap data structure. |
|
linkedlist
Package linkedlist implements doubly-linked list.
|
Package linkedlist implements doubly-linked list. |
|
queue
Package queue implements queue data structure.
|
Package queue implements queue data structure. |
|
stack
Package stack implements stack data structure.
|
Package stack implements stack data structure. |
|
trie
Package trie implements Trie (suffix tree) data structure.
|
Package trie implements Trie (suffix tree) data structure. |
|
techniques
|
|
|
bithacks
Package bithacks is a study based on https://graphics.stanford.edu/~seander/bithacks.html
|
Package bithacks is a study based on https://graphics.stanford.edu/~seander/bithacks.html |
|
bitmask
Package bitmask is simple example how bitmask works in golang.
|
Package bitmask is simple example how bitmask works in golang. |
Click to show internal directories.
Click to hide internal directories.