mirror of
https://github.com/Dadido3/noita-mapcap.git
synced 2024-11-18 17:17:31 +00:00
David Vogel
65f7cb4e60
- Use QuickSelect algorithm for median filtering - Use lists of uint8 instead of int for median filtering - Fix GridifyRectangle - Remove HilbertifyRectangle - Add profiling.go - Remove Profile.bat - Add median blend tile-limit flag - Print stitch duration - Reduce StitchedImage cache image height - Reduce StitchedImageCacheGridSize - Improve StitchedImage caching - Improve ImageTile caching - Separate entity and entities - Update stitcher README.md - Add comments
99 lines
2.2 KiB
Go
99 lines
2.2 KiB
Go
// Copyright (c) 2019-2022 David Vogel
|
|
//
|
|
// This software is released under the MIT License.
|
|
// https://opensource.org/licenses/MIT
|
|
|
|
package main
|
|
|
|
import (
|
|
"fmt"
|
|
"image"
|
|
"os"
|
|
)
|
|
|
|
// QuickSelect returns the kth smallest element of the given unsorted list.
|
|
// This is faster than sorting the list and then selecting the wanted element.
|
|
//
|
|
// Source: https://rosettacode.org/wiki/Quickselect_algorithm#Go
|
|
func QuickSelectUInt8(list []uint8, k int) uint8 {
|
|
for {
|
|
// Partition.
|
|
px := len(list) / 2
|
|
pv := list[px]
|
|
last := len(list) - 1
|
|
list[px], list[last] = list[last], list[px]
|
|
|
|
i := 0
|
|
for j := 0; j < last; j++ {
|
|
if list[j] < pv {
|
|
list[i], list[j] = list[j], list[i]
|
|
i++
|
|
}
|
|
}
|
|
|
|
// Select.
|
|
if i == k {
|
|
return pv
|
|
}
|
|
if k < i {
|
|
list = list[:i]
|
|
} else {
|
|
list[i], list[last] = list[last], list[i]
|
|
list = list[i+1:]
|
|
k -= i + 1
|
|
}
|
|
}
|
|
}
|
|
|
|
// Source: https://gist.github.com/sergiotapia/7882944
|
|
func GetImageFileDimension(imagePath string) (int, int, error) {
|
|
file, err := os.Open(imagePath)
|
|
if err != nil {
|
|
return 0, 0, fmt.Errorf("can't open file %v: %w", imagePath, err)
|
|
}
|
|
defer file.Close()
|
|
|
|
image, _, err := image.DecodeConfig(file)
|
|
if err != nil {
|
|
return 0, 0, fmt.Errorf("error decoding config of image file %v: %w", imagePath, err)
|
|
}
|
|
|
|
return image.Width, image.Height, nil
|
|
}
|
|
|
|
func GridifyRectangle(rect image.Rectangle, gridSize int) (result []image.Rectangle) {
|
|
for y := DivideFloor(rect.Min.Y, gridSize); y <= DivideCeil(rect.Max.Y-1, gridSize); y++ {
|
|
for x := DivideFloor(rect.Min.X, gridSize); x <= DivideCeil(rect.Max.X-1, gridSize); x++ {
|
|
tempRect := image.Rect(x*gridSize, y*gridSize, (x+1)*gridSize, (y+1)*gridSize)
|
|
intersection := tempRect.Intersect(rect)
|
|
if !intersection.Empty() {
|
|
result = append(result, intersection)
|
|
}
|
|
}
|
|
}
|
|
|
|
return
|
|
}
|
|
|
|
// Integer division that rounds to the next integer towards negative infinity.
|
|
func DivideFloor(a, b int) int {
|
|
temp := a / b
|
|
|
|
if ((a ^ b) < 0) && (a%b != 0) {
|
|
return temp - 1
|
|
}
|
|
|
|
return temp
|
|
}
|
|
|
|
// Integer division that rounds to the next integer towards positive infinity.
|
|
func DivideCeil(a, b int) int {
|
|
temp := a / b
|
|
|
|
if ((a ^ b) >= 0) && (a%b != 0) {
|
|
return temp + 1
|
|
}
|
|
|
|
return temp
|
|
}
|