binpack

Documentation

Overview

Package binpack implement a 2D bin packing algorithm.

Index

• type Node
• type Packer
  • func New(rect Rect) *Packer
  • func (p *Packer) Pack(width, height int32) (rect Rect, ok bool)
  • func (p *Packer) Unpack(rect Rect) bool
• type Rect
  • func (rect Rect) H() int32
  • func (rect Rect) W() int32

Types

type Node

type Node struct {
	Rect
	Sub0  *Node // left or top child
	Sub1  *Node // right or bottom child
	Split int32 // split position
	Vert  bool  // split vertically
}

type Packer

type Packer struct {
	Rect
	// contains filtered or unexported fields
}

func New

func New(rect Rect) *Packer

func (*Packer) Pack

func (p *Packer) Pack(width, height int32) (rect Rect, ok bool)

Pack a bin

func (*Packer) Unpack

func (p *Packer) Unpack(rect Rect) bool

Unpack a bin, the rect must be one of the valid rects return by previous Pack call. for minimize fragments, it is recommand to unpack rects in reverse order.

type Rect

type Rect struct{ L, T, R, B int32 }

func (Rect) H

func (rect Rect) H() int32

func (Rect) W

func (rect Rect) W() int32