mth/ebiten
1
0
Fork 0
mirror of https://github.com/hajimehoshi/ebiten.git synced 2024-09-20 05:12:18 +02:00
Code Issues Packages Projects Releases Wiki Activity

graphics: Refactoring: Use map in mipmap

Browse Source
This commit is contained in:
Hajime Hoshi 2019-07-30 17:50:37 +09:00
parent d25d184ed7
commit 69ef9eb184
1 changed files with 38 additions and 37 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

75
mipmap.go
View File

@ -23,15 +23,17 @@ import (
"github.com/hajimehoshi/ebiten/internal/shareable" "github.com/hajimehoshi/ebiten/internal/shareable"
) )
type levelToImage map[int]*shareable.Image
type mipmap struct { type mipmap struct {
orig *shareable.Image orig *shareable.Image
imgs map[image.Rectangle][]*shareable.Image imgs map[image.Rectangle]levelToImage
} }
func newMipmap(s *shareable.Image) *mipmap { func newMipmap(s *shareable.Image) *mipmap {
return &mipmap{ return &mipmap{
orig: s, orig: s,
imgs: map[image.Rectangle][]*shareable.Image{}, imgs: map[image.Rectangle]levelToImage{},
} }
} }
@ -44,51 +46,50 @@ func (m *mipmap) level(r image.Rectangle, level int) *shareable.Image {
panic("ebiten: level must be positive at level") panic("ebiten: level must be positive at level")
} }
imgs, ok := m.imgs[r] if m.orig.IsVolatile() {
if !ok { panic("ebiten: mipmap images for a volatile image is not implemented yet")
imgs = []*shareable.Image{} }
m.imgs[r] = imgs
if _, ok := m.imgs[r]; !ok {
m.imgs[r] = levelToImage{}
}
imgs := m.imgs[r]
if img, ok := imgs[level]; ok {
return img
} }
idx := level - 1
size := r.Size() size := r.Size()
w, h := size.X, size.Y w, h := size.X, size.Y
if len(imgs) > 0 {
w, h = imgs[len(imgs)-1].Size()
}
for len(imgs) < idx+1 { w2, h2 := w, h
if m.orig.IsVolatile() { for i := 0; i < level; i++ {
panic("ebiten: mipmap images for a volatile image is not implemented yet") w2 /= 2
} h2 /= 2
if w == 0 || h == 0 {
w2 := w / 2 imgs[level] = nil
h2 := h / 2
if w2 == 0 || h2 == 0 {
return nil return nil
} }
s := shareable.NewImage(w2, h2) }
var src *shareable.Image s := shareable.NewImage(w2, h2)
vs := vertexSlice(4) var src *shareable.Image
if l := len(imgs); l == 0 { vs := vertexSlice(4)
src = m.orig if level == 1 {
graphics.PutQuadVertices(vs, src, r.Min.X, r.Min.Y, r.Max.X, r.Max.Y, 0.5, 0, 0, 0.5, 0, 0, 1, 1, 1, 1) src = m.orig
} else { graphics.PutQuadVertices(vs, src, r.Min.X, r.Min.Y, r.Max.X, r.Max.Y, 0.5, 0, 0, 0.5, 0, 0, 1, 1, 1, 1)
src = m.level(r, l) } else {
graphics.PutQuadVertices(vs, src, 0, 0, w, h, 0.5, 0, 0, 0.5, 0, 0, 1, 1, 1, 1) src = m.level(r, level-1)
if src == nil {
imgs[level] = nil
return nil
} }
is := graphics.QuadIndices() graphics.PutQuadVertices(vs, src, 0, 0, w, h, 0.5, 0, 0, 0.5, 0, 0, 1, 1, 1, 1)
s.DrawTriangles(src, vs, is, nil, driver.CompositeModeCopy, driver.FilterLinear, driver.AddressClampToZero)
imgs = append(imgs, s)
w = w2
h = h2
} }
m.imgs[r] = imgs is := graphics.QuadIndices()
s.DrawTriangles(src, vs, is, nil, driver.CompositeModeCopy, driver.FilterLinear, driver.AddressClampToZero)
imgs[level] = s
if len(imgs) <= idx { return imgs[level]
return nil
}
return imgs[idx]
} }
func (m *mipmap) isDisposed() bool { func (m *mipmap) isDisposed() bool {