https://github.com/thrimbda/dune
Dune of data-structures
https://github.com/thrimbda/dune
data-structures dune
Last synced: 2 months ago
JSON representation
Dune of data-structures
- Host: GitHub
- URL: https://github.com/thrimbda/dune
- Owner: Thrimbda
- License: mit
- Created: 2016-09-26T03:18:46.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2018-01-29T14:33:38.000Z (about 8 years ago)
- Last Synced: 2025-09-05T00:25:36.341Z (7 months ago)
- Topics: data-structures, dune
- Language: Go
- Homepage:
- Size: 131 KB
- Stars: 2
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# DUNE-沙丘
> 聚沙成塔
[](https://travis-ci.org/Thrimbda/dune)
[](https://coveralls.io/github/Thrimbda/dune?branch=master)
[](https://goreportcard.com/report/github.com/Thrimbda/dune)
一个用 `Golang`实现的基础数据结构集.
## 数据结构
基础的元数据均为实现了以下接口的任意数据结构。
```go
type Elem interface {
LessComparator(b Elem) bool
//return true if a < b
}
```
### 基本数据结构
#### 线性表
线性表接口如下
```go
//List interface which doesn't support resize yet.
type List interface {
Insert(index int, items ...interface{})
Append(items ...interface{})
Remove(index int) interface{}
Length() int
Get(index int) interface{}
SetValue(index int, value interface{})
Contains(value interface{}) bool
IndexOf(value interface{}) int
Clear()
IsEmpty() bool
}
```
拥有链表与顺序表两种实现方式。
#### 栈
```go
//Stack interface
type Stack interface {
Clear()
Push(item interface{})
Pop() interface{}
Peek() interface{}
IsEmpty() bool
}
```
#### 队列
```go
//Queue interface.
type Queue interface {
Clear()
Enqueue(item interface{})
Dequeue() interface{}
Peek() interface{}
IsEmpty() bool
}
```
### 二叉树
二叉树节点接口
```go
type BinNode interface {
Element() Elem
SetElement(element Elem)
Left() BinNode
SetLeft(node BinNode)
Right() BinNode
SetRight(node BinNode)
SetParent(node BinNode)
Parent() BinNode
IsLeaf() bool
}
```
#### 二叉搜索树 (BST)
```go
type BST interface {
Insert(value Elem)
Search(key int) BST
Delete(key int)
Predecessor() BST //寻找前驱节点
Successor() BST //寻找后继
Minimum() BST
Maximum() BST
InorderWalk() //中序遍历
}
```
二叉搜索树除基本实现以外，还有许多平衡树实现。
目前实现了红黑树。
#### 堆
由于堆为满二叉树，因此使用数组实现，故并未使用上述二叉树结点。
```go
type Heap interface {
setup(size int)
heapSize() int
isLeaf(pos int) bool
buildHeap()
leftChild(pos int) int
rightChile(pos int) int
parent(pos int) int
shiftDown(pos int)
insert(val Elem)
removeMax() Elem
remove(pos int) Elem
}
```