MCPcopy Create free account

hub / github.com/bom-d-van/binpacking / functions

Functions31 in github.com/bom-d-van/binpacking

⨍ Functions 31◇ Types & classes 6
↓ 12 callersMethodGetDepth
unit: mm
binpacking.go:195
↓ 12 callersMethodGetHeight
()
binpacking.go:193
↓ 12 callersMethodGetWidth
unit: mm
binpacking.go:194
↓ 3 callersMethodDimensions
()
binpacking.go:174
↓ 3 callersMethodGetWeight
unit: mm
binpacking.go:196
↓ 3 callersMethodIsValid
()
binpacking.go:78
↓ 3 callersFunctiongetBiggerBox
(box Box)
binpacking.go:336
↓ 3 callersFunctionintersect
O------X-------+ | | Y * | | | +--------------+ intersect checks if two rectangles overlap
binpacking.go:155
↓ 3 callersMethodplace
(item Item, pos [3]int)
binpacking.go:300
↓ 3 callersMethodvolume
()
binpacking.go:82
↓ 2 callersFunctionPack
Original Algorithm: https://github.com/bom-d-van/binpacking/blob/master/erick_dube_507-034.pdf The current implementation is based on it, but with som
binpacking.go:220
↓ 2 callersFunctionprintBoxes
(boxes []Box)
binpacking_test.go:84
↓ 1 callersMethodintersect
+-----------------+ | /| | / | | / | +-----------------+ | | | | | | | |
binpacking.go:140
↓ 1 callersMethodnonBoxItems
()
binpacking.go:98
↓ 1 callersFunctionpack
(currentBin *Box, toPack []Item, replaceBin bool)
binpacking.go:248
↓ 1 callersFunctionpickBox
(item Item)
binpacking.go:325
FunctionBenchmarkPack
(b *testing.B)
binpacking_test.go:10
MethodGetDepth
()
binpacking_test.go:45
MethodGetHeight
()
binpacking_test.go:41
MethodGetWeight
()
binpacking_test.go:49
MethodGetWidth
()
binpacking_test.go:37
MethodLen
()
binpacking.go:201
MethodLess
(i int, j int)
binpacking.go:205
MethodString
()
binpacking.go:38
MethodString
()
binpacking.go:67
MethodString
()
binpacking.go:111
MethodSwap
(i int, j int)
binpacking.go:209
FunctionTestPack
(t *testing.T)
binpacking_test.go:53
MethodTotalWeight
()
binpacking.go:86
Methodsize
()
binpacking.go:94
Methodvolume
()
binpacking.go:120