org.deegree.rendering.r3d.opengl.rendering.dem.texturing
Class TextureRequest
java.lang.Object
org.deegree.rendering.r3d.opengl.rendering.dem.texturing.TextureTileRequest
org.deegree.rendering.r3d.opengl.rendering.dem.texturing.TextureRequest
public class TextureRequest
- extends TextureTileRequest
Represents the request for a FragmentTexture
for a RenderMeshFragment
.
- Version:
- $Revision: 29127 $, $Date: 2011-01-10 16:13:35 +0100 (Mon, 10 Jan 2011) $
- Author:
- Markus Schneider, last edited by: $Author: aschmitz $
Methods inherited from class org.deegree.rendering.r3d.opengl.rendering.dem.texturing.TextureTileRequest |
getMaxX, getMaxY, getMinX, getMinY, getUnitsPerPixel, isFullfilled, isFullfilled, merge, shareCorner, shareCornerNE, shareCornerNW, shareCornerSE, shareCornerSW, supersedes, toString |
TextureRequest
public TextureRequest(RenderMeshFragment fragment,
double minX,
double minY,
double maxX,
double maxY,
float metersPerPixel)
- Init a request
- Parameters:
fragment
- minX
- minY
- maxX
- maxY
- metersPerPixel
-
getFragment
public RenderMeshFragment getFragment()
- Returns:
- the fragment this request is generated for.
equals
public boolean equals(Object o)
- Overrides:
equals
in class TextureTileRequest
hashCode
public int hashCode()
- Implementation as proposed by Joshua Block in Effective Java (Addison-Wesley 2001), which supplies an even
distribution and is relatively fast. It is created from field f as follows:
- boolean -- code = (f ? 0 : 1)
- byte, char, short, int -- code = (int)f
- long -- code = (int)(f ^ (f >>>32))
- float -- code = Float.floatToIntBits(f);
- double -- long l = Double.doubleToLongBits(f); code = (int)(l ^ (l >>> 32))
- all Objects, (where equals( ) calls equals( ) for this field) -- code = f.hashCode( )
- Array -- Apply above rules to each element
Combining the hash code(s) computed above: result = 37 * result + code;
- Overrides:
hashCode
in class TextureTileRequest
- Returns:
- (int) ( result >>> 32 ) ^ (int) result;
- See Also:
Object.hashCode()
Copyright © 2011. All Rights Reserved.