equal
deleted
inserted
replaced
137 } else { |
137 } else { |
138 // heuristics: use both bbox area and complexity |
138 // heuristics: use both bbox area and complexity |
139 // ie number of primitives: |
139 // ie number of primitives: |
140 |
140 |
141 // fast check min and max width (maxx < 23bits): |
141 // fast check min and max width (maxx < 23bits): |
142 if (width <= RLE_MIN_WIDTH || width >= RLE_MAX_WIDTH) { |
142 useRLE = (width > RLE_MIN_WIDTH && width < RLE_MAX_WIDTH); |
143 useRLE = false; |
|
144 } else { |
|
145 useRLE = true; |
|
146 } |
|
147 } |
143 } |
148 |
144 |
149 // the ceiling of (maxy - miny + 1) / TILE_SIZE; |
145 // the ceiling of (maxy - miny + 1) / TILE_SIZE; |
150 final int nxTiles = (width + TILE_W) >> TILE_W_LG; |
146 final int nxTiles = (width + TILE_W) >> TILE_W_LG; |
151 |
147 |