gogigu

package

v0.0.0-...-3472b94 Latest Latest Go to latest Published: Nov 21, 2021 License: MIT Imports: 8 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/lusingander/fynegit

Links

Open Source Insights

Documentation ¶

Index ¶

type Edge
type EdgeType
type Edges
type Node
type NodePriorityQueue
- func NewQueue() *NodePriorityQueue
type Nodes
type Option
type Repository
- func Calculate(src *git.Repository, opt *Option) (*Repository, error)
type Sort

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type Edge ¶

type Edge struct {
	EdgeType
	PosX int
}

type EdgeType ¶

type EdgeType int

const (
	EdgeStraight EdgeType = iota
	EdgeUp
	EdgeDown
	EdgeBranch
	EdgeMerge
)

type Edges ¶

type Edges []*Edge

type Node ¶

type Node struct {
	Commit *object.Commit
	// contains filtered or unexported fields
}

func (*Node) Hash ¶

func (n *Node) Hash() string

func (*Node) PosX ¶

func (n *Node) PosX() int

func (*Node) PosY ¶

func (n *Node) PosY() int

func (*Node) ShortHash ¶

func (n *Node) ShortHash() string

type NodePriorityQueue ¶

type NodePriorityQueue []*Node

func NewQueue ¶

func NewQueue() *NodePriorityQueue

func (*NodePriorityQueue) Dequeue ¶

func (q *NodePriorityQueue) Dequeue() *Node

func (*NodePriorityQueue) Enqueue ¶

func (q *NodePriorityQueue) Enqueue(n *Node)

func (NodePriorityQueue) Len ¶

func (q NodePriorityQueue) Len() int

func (NodePriorityQueue) Less ¶

func (q NodePriorityQueue) Less(i, j int) bool

func (*NodePriorityQueue) Pop ¶

func (q *NodePriorityQueue) Pop() interface{}

func (*NodePriorityQueue) Push ¶

func (q *NodePriorityQueue) Push(x interface{})

func (NodePriorityQueue) Swap ¶

func (q NodePriorityQueue) Swap(i, j int)

type Nodes ¶

type Nodes []*Node

type Option ¶

type Option struct {
	Sort
}

type Repository ¶

type Repository struct {
	Nodes Nodes
	// contains filtered or unexported fields
}

func Calculate ¶

func Calculate(src *git.Repository, opt *Option) (*Repository, error)

func (*Repository) Children ¶

func (r *Repository) Children(hash string) Nodes

func (*Repository) ChildrenHashes ¶

func (r *Repository) ChildrenHashes(hash string) []string

func (*Repository) Edges ¶

func (r *Repository) Edges(posY int) []*Edge

func (*Repository) MaxPosX ¶

func (r *Repository) MaxPosX() int

func (*Repository) Node ¶

func (r *Repository) Node(hash string) *Node

func (*Repository) Parents ¶

func (r *Repository) Parents(hash string) Nodes

func (*Repository) ParentsHashes ¶

func (r *Repository) ParentsHashes(hash string) []string

type Sort ¶

type Sort int

const (
	Topological Sort = iota
	CommitDate
)

Source Files ¶

View all Source files

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