org.apache.batik.ext.awt.image.rendered.TileBlock Maven / Gradle / Ivy
/*
Licensed to the Apache Software Foundation (ASF) under one or more
contributor license agreements. See the NOTICE file distributed with
this work for additional information regarding copyright ownership.
The ASF licenses this file to You under the Apache License, Version 2.0
(the "License"); you may not use this file except in compliance with
the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package org.apache.batik.ext.awt.image.rendered;
import java.util.List;
import java.util.ArrayList;
/**
* This class is responsible for breaking up a block of tiles into
* a set of smaller requests that are as large as possible without
* rerequesting significant numbers of tiles that are already
* available.
*
* @version $Id: TileBlock.java 1831630 2018-05-15 12:56:55Z ssteiner $
*/
public class TileBlock {
int occX, occY, occW, occH;
int xOff, yOff, w, h, benefit;
boolean [] occupied;
/**
* Construct a tile block this represents a block of contigous
* tiles.
* @param xOff The x index of left edge of the tile block.
* @param yOff The y index of top edge of the tile block.
* @param w The number of tiles across in the block
* @param h The number of tiles down the block
* @param occupied Which entries in the block are already
* computed.
*/
TileBlock(int occX, int occY, int occW, int occH, boolean [] occupied,
int xOff, int yOff, int w, int h) {
this.occX = occX;
this.occY = occY;
this.occW = occW;
this.occH = occH;
this.xOff = xOff;
this.yOff = yOff;
this.w = w ;
this.h = h ;
this.occupied = occupied;
// System.out.println("Block: [" +
// xloc + "," + yloc + "," +
// w + "," + h + "]");
for (int y=0; yyOff) && (y xOff) && (x < xOff+w))
ret += "-";
else if ((y==yOff+h-1) && (x> xOff) && (x < xOff+w))
ret += "_";
else
ret += " ";
if (x== occW)
continue;
if (occupied[x+y*occW])
ret += "*";
else
ret += ".";
}
ret += "\n";
}
return ret;
}
/**
* Return the x location of this block of tiles
*/
int getXLoc() { return occX+xOff; }
/**
* Return the y location of this block of tiles
*/
int getYLoc() { return occY+yOff; }
/**
* Return the width of this block of tiles
*/
int getWidth() { return w; }
/**
* Return the height of this block of tiles
*/
int getHeight() { return h; }
/**
* Return the number of new tiles computed.
*/
int getBenefit() { return benefit; }
/**
* Return the approximate amount of work required to compute
* those tiles.
*/
int getWork() { return w*h+1; }
/**
* Returns the total amount of work for the array of tile blocks
*/
static int getWork(TileBlock [] blocks) {
int ret=0;
for (TileBlock block : blocks) ret += block.getWork();
return ret;
}
/**
* Returnes an optimized list of TileBlocks to generate that
* tries to minimize the work to benefit ratio, for the set of
* blocks defined by this block.
*/
TileBlock [] getBestSplit() {
if (simplify())
return null;
// Optimal split already...
if (benefit == w*h)
return new TileBlock [] { this };
return splitOneGo();
}
public TileBlock [] splitOneGo() {
boolean [] filled = occupied.clone();
List items = new ArrayList();
for (int y=yOff; y=0; y--) {
int x;
for (x=0; x=0; x--) {
int y;
for (y=0; y