This repo requires the yasnippet package for emacs.
If you dread the tedious nature of reimplementing data structures and their algorithms from scratch for each new application, these snippets are for you.
The initial snippets are in Go and include:
tsort
to rapidly implementsort.Interface
.minq
to quickly build aheap.Interface
for a minimum priority queue.maxq
to quickly build aheap.Interface
for a max priority queue.
More Go snippets, along with those for other languages, will arrive soon.
Want a snippet for a particular data structure and/or algorithm? Submit a PR or file an issue.