Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/kevinpollet/go-datastructures
Data structures implementations in Go
https://github.com/kevinpollet/go-datastructures
abstract-data-types binary-search-tree data-structures datastructures dequeue go golang list queue stack union-find
Last synced: about 1 month ago
JSON representation
Data structures implementations in Go
- Host: GitHub
- URL: https://github.com/kevinpollet/go-datastructures
- Owner: kevinpollet
- License: mit
- Created: 2019-07-02T09:32:53.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2021-12-23T08:32:26.000Z (about 3 years ago)
- Last Synced: 2024-10-14T12:42:49.351Z (3 months ago)
- Topics: abstract-data-types, binary-search-tree, data-structures, datastructures, dequeue, go, golang, list, queue, stack, union-find
- Language: Go
- Homepage:
- Size: 77.1 KB
- Stars: 3
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
# Go Data Structures
[](https://godoc.org/github.com/kevinpollet/go-datastructures) [](https://goreportcard.com/report/github.com/kevinpollet/go-datastructures)
Project to keep track of my learnings and experiments while learning the Go programming language and reviewing the common Abstract Data Types (ADT), data structures, and algorithms.
## Installation
```shell
$ go get github.com/kevinpollet/go-datastructures
```
## Abstract Data Types & Data Structures
### List
```go
type List interface {
Add(value interface{})
Clear()
Get(index int) (interface{}, error)
IndexOf(value interface{}) int
Insert(index int, value interface{}) error
IsEmpty() bool
Remove(index int) (interface{}, error)
Size() int
}
```
### Stack
```go
type Stack interface {
Clear()
IsEmpty() bool
Peek() (interface{}, error)
Pop() (interface{}, error)
Push(value interface{})
Size() int
}
```
### Queue
```go
type Queue interface {
Clear()
IsEmpty() bool
Offer(value interface{})
Peek() (interface{}, error)
Poll() (interface{}, error)
Size() int
}
```
### Dequeue / Double-ended Queue
```go
type Dequeue interface {
Clear()
IsEmpty() bool
OfferFirst(value interface{})
OfferLast(value interface{})
PeekFirst() (interface{}, error)
PeekLast() (interface{}, error)
PollFirst() (interface{}, error)
PollLast() (interface{}, error)
Size() int
}
```
### PriorityQueue
```go
type PriorityQueue interface {
Clear()
IsEmpty() bool
Offer(value interface{}, priority int)
Peek() (interface{}, error)
Poll() (interface{}, error)
Size() int
}
```
## Readings & Lectures
- [Abstract Data Types](https://brilliant.org/wiki/abstract-data-types/)
- [Easy to Advanced Data Structures](https://www.udemy.com/introduction-to-data-structures/)
## License
[MIT](./LICENSE)