mygo

package module

v0.0.0-...-1bf82e4 Latest Latest Go to latest Published: Mar 8, 2024 License: MIT Imports: 4 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/ARinera/mygo

Links

Open Source Insights

README ¶

mygo

Some data structures for Go

Documentation ¶

Index ¶

func PrintLinkList(head *LinkNode) error
type ArrayQueue
- func (q *ArrayQueue) Add(v int)
- func (q *ArrayQueue) Remove() (int, error)
type ArrayStack
type Item
type LinkNode
- func NewLinkList(nums []int) (*LinkNode, error)
type LinkQueue
- func (q *LinkQueue) Add(v int)
- func (q *LinkQueue) Remove() (int, error)
type LinkStack
type PriorityQueue

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func PrintLinkList ¶

func PrintLinkList(head *LinkNode) error

PrintLinkList 打印链表

Types ¶

type ArrayQueue ¶

type ArrayQueue struct {
	// contains filtered or unexported fields
}

ArrayQueue 数组队列

func (*ArrayQueue) Add ¶

func (q *ArrayQueue) Add(v int)

Add 数组队列入队

func (*ArrayQueue) Remove ¶

func (q *ArrayQueue) Remove() (int, error)

Remove 数组队列出队

type ArrayStack ¶

type ArrayStack struct {
	// contains filtered or unexported fields
}

ArrayStack 数组栈

func (*ArrayStack) IsEmpty ¶

func (s *ArrayStack) IsEmpty() bool

IsEmpty 数组栈判断是否为空

func (*ArrayStack) Peek ¶

func (s *ArrayStack) Peek() (int, error)

Peek 数组栈查看栈顶元素

func (*ArrayStack) Pop ¶

func (s *ArrayStack) Pop() (int, error)

Pop 数组栈出栈

func (*ArrayStack) Push ¶

func (s *ArrayStack) Push(v int)

Push 数组栈入栈

func (*ArrayStack) Size ¶

func (s *ArrayStack) Size() int

Size 数组栈查看栈大小

type Item ¶

type Item struct {
	Value    int // 值
	Priority int // 优先级
	Index    int // 索引
}

Item 实现优先队列中的一个元素(一项).

type LinkNode ¶

type LinkNode struct {
	Val  int
	Next *LinkNode
}

LinkNode 定义链表节点结构体

func NewLinkList ¶

func NewLinkList(nums []int) (*LinkNode, error)

NewLinkList NewListList 通过[]int创建一个链表

type LinkQueue ¶

type LinkQueue struct {
	// contains filtered or unexported fields
}

LinkQueue 链表队列

func (*LinkQueue) Add ¶

func (q *LinkQueue) Add(v int)

Add 链表队列入队

func (*LinkQueue) Remove ¶

func (q *LinkQueue) Remove() (int, error)

Remove 链表队列出队

type LinkStack ¶

type LinkStack struct {
	// contains filtered or unexported fields
}

LinkStack 链表栈

func (*LinkStack) IsEmpty ¶

func (s *LinkStack) IsEmpty() bool

IsEmpty 链表栈判断是否为空

func (*LinkStack) Peek ¶

func (s *LinkStack) Peek() (int, error)

Peek 链表栈查看栈顶元素

func (*LinkStack) Pop ¶

func (s *LinkStack) Pop() (int, error)

Pop 链表栈出栈

func (*LinkStack) Push ¶

func (s *LinkStack) Push(v int)

Push 链表栈入栈

func (*LinkStack) Size ¶

func (s *LinkStack) Size() int

Size 链表栈查看栈大小

type PriorityQueue ¶

type PriorityQueue []*Item

PriorityQueue 实现接口.

func (*PriorityQueue) Len ¶

func (pq *PriorityQueue) Len() int

Len 返回优先队列长度.

func (*PriorityQueue) Less ¶

func (pq *PriorityQueue) Less(i, j int) bool

Less 比较两个项优先级.

func (*PriorityQueue) Pop ¶

func (pq *PriorityQueue) Pop() interface{}

Pop 移除并返回优先级最高的项.

func (*PriorityQueue) Push ¶

func (pq *PriorityQueue) Push(x interface{})

Push 向优先队列中添加项.

func (*PriorityQueue) Swap ¶

func (pq *PriorityQueue) Swap(i, j int)

Swap 交换两个项.

func (*PriorityQueue) Update ¶

func (pq *PriorityQueue) Update(item *Item, value int, priority int)

Update 修改优先级和值的item在优先级队列中的位置.

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL