JavaFX 27 · com.sun.javafx.geom.DirtyRegionContainer

Modifier and Type	Field and Description
private RectBounds[]	dirtyRegions
public static final int	DTR_CONTAINS_CLIP
public static final int	DTR_OK
private int	emptyIndex
private int[][]	heap Shared for all compressing algorithms
private int	heapSize
private long	invalidMask

Access	Constructor and Description
public	DirtyRegionContainer(int count)

Method Summary

Modifier and Type	Method and Description
public void	addDirtyRegion(final RectBounds the dirty region. region) Adds new dirty region to the array.
public boolean	checkAndClearRegion(int index)
private RectBounds	compress(final RectBounds region)
private void	compress_heap() Heap-based compressing algorithm
public DirtyRegionContainer	copy()
public DirtyRegionContainer	deriveWithNewContainer(DirtyRegionContainer other)
public DirtyRegionContainer	deriveWithNewRegion(RectBounds region)
public DirtyRegionContainer	deriveWithNewRegions(RectBounds[] regions)
public boolean	equals(Object obj) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public RectBounds	Returns: dirty region at given index getDirtyRegion(int the index of requested dirty region index) Gets the dirty region at given index.
public void	grow(int horizontal, int vertical)
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for this object.
private boolean	Returns: true if there is empty region in the array; false otherwise hasSpace() If there are empty regions in the dirty regions array.
private void	heapCompress()
private void	heapify()
private void	initDirtyRegions(int count)
public int	maxSpace()
public void	merge(DirtyRegionContainer other)
private void	regioncopy(RectBounds[] src, int from, RectBounds[] dest, int to, int length)
public void	reset()
private int	resolveMap(int[] map, int idx)
public void	roundOut()
public void	setDirtyRegion(int index, RectBounds region)
private void	siftDown(int i)
public int	size()
private int[]	takeMin()
private int[]	takeMinWithMap(int[] map)
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.
private int	unifiedRegionArea(int i0, int i1)

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll wait wait wait

dirtyRegions	back to summary
private RectBounds[] dirtyRegions

DTR_CONTAINS_CLIP	back to summary
public static final int DTR_CONTAINS_CLIP

DTR_OK	back to summary
public static final int DTR_OK

emptyIndex	back to summary
private int emptyIndex

heap	back to summary
private int[][] heap Shared for all compressing algorithms

heapSize	back to summary
private int heapSize

invalidMask	back to summary
private long invalidMask

DirtyRegionContainer	back to summary
public DirtyRegionContainer(int count)

Method Detail

addDirtyRegion	back to summary
public void addDirtyRegion(final RectBounds region) Adds new dirty region to the array. Parameters region:RectBounds the dirty region.

addDirtyRegion

back to summary

public void addDirtyRegion(final RectBounds region)

Adds new dirty region to the array.

Parameters

region:RectBounds: the dirty region.

checkAndClearRegion	back to summary
public boolean checkAndClearRegion(int index)

compress	back to summary
private RectBounds compress(final RectBounds region)

compress_heap	back to summary
private void compress_heap() Heap-based compressing algorithm

copy	back to summary
public DirtyRegionContainer copy()

deriveWithNewContainer	back to summary
public DirtyRegionContainer deriveWithNewContainer(DirtyRegionContainer other)

deriveWithNewRegion	back to summary
public DirtyRegionContainer deriveWithNewRegion(RectBounds region)

deriveWithNewRegions	back to summary
public DirtyRegionContainer deriveWithNewRegions(RectBounds[] regions)

equals back to summary

equals	back to summary
public boolean equals(Object obj) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes. Annotations @Override

public boolean equals(Object obj)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

Annotations

@Override

getDirtyRegion	back to summary
public RectBounds getDirtyRegion(int index) Gets the dirty region at given index. Parameters index:int the index of requested dirty region Returns:RectBounds dirty region at given index

getDirtyRegion

back to summary

public RectBounds getDirtyRegion(int index)

Gets the dirty region at given index.

Parameters

index:int: the index of requested dirty region

Returns:RectBounds

dirty region at given index

grow	back to summary
public void grow(int horizontal, int vertical)

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Doc from java.lang.Object.hashCode. Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by `java.util.HashMap`. The general contract of `hashCode` is: Whenever it is invoked on the same object more than once during an execution of a Java application, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables. Annotations @Override

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Annotations

@Override

hasSpace	back to summary
private boolean hasSpace() If there are empty regions in the dirty regions array. Returns:boolean true if there is empty region in the array; false otherwise

hasSpace

back to summary

private boolean hasSpace()

If there are empty regions in the dirty regions array.

Returns:boolean: true if there is empty region in the array; false otherwise

heapCompress	back to summary
private void heapCompress()

heapify	back to summary
private void heapify()

initDirtyRegions	back to summary
private void initDirtyRegions(int count)

maxSpace	back to summary
public int maxSpace()

merge	back to summary
public void merge(DirtyRegionContainer other)

regioncopy	back to summary
private void regioncopy(RectBounds[] src, int from, RectBounds[] dest, int to, int length)

reset	back to summary
public void reset()

resolveMap	back to summary
private int resolveMap(int[] map, int idx)

roundOut	back to summary
public void roundOut()

setDirtyRegion	back to summary
public void setDirtyRegion(int index, RectBounds region)

siftDown	back to summary
private void siftDown(int i)

size	back to summary
public int size()

takeMin	back to summary
private int[] takeMin()

takeMinWithMap	back to summary
private int[] takeMinWithMap(int[] map)

toString back to summary

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Satisfying this method's contract implies a non-`null` result must be returned. Annotations @Override

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Annotations

@Override

unifiedRegionArea	back to summary
private int unifiedRegionArea(int i0, int i1)

public final Class DirtyRegionContainer

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail