2018-08-12 14:03:07 +00:00
|
|
|
package com.boydti.fawe.object.visitor;
|
|
|
|
|
|
|
|
import com.sk89q.worldedit.function.RegionFunction;
|
|
|
|
import com.sk89q.worldedit.function.mask.Mask;
|
|
|
|
import com.sk89q.worldedit.function.visitor.RecursiveVisitor;
|
2018-12-23 16:19:33 +00:00
|
|
|
import com.sk89q.worldedit.math.BlockVector3;
|
2018-08-12 14:03:07 +00:00
|
|
|
|
|
|
|
import static com.google.common.base.Preconditions.checkNotNull;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* An implementation of an {@link com.sk89q.worldedit.function.visitor.BreadthFirstSearch} that uses a mask to
|
|
|
|
* determine where a block should be visited.
|
|
|
|
*/
|
|
|
|
public class DFSRecursiveVisitor extends DFSVisitor {
|
|
|
|
|
|
|
|
private final Mask mask;
|
|
|
|
|
|
|
|
public DFSRecursiveVisitor(final Mask mask, final RegionFunction function) {
|
|
|
|
this(mask, function, Integer.MAX_VALUE, Integer.MAX_VALUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a new recursive visitor.
|
|
|
|
*
|
|
|
|
* @param mask the mask
|
|
|
|
* @param function the function
|
|
|
|
*/
|
|
|
|
public DFSRecursiveVisitor(final Mask mask, final RegionFunction function, int maxDepth, int maxBranching) {
|
|
|
|
super(function, maxDepth, maxBranching);
|
|
|
|
checkNotNull(mask);
|
|
|
|
this.mask = mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2018-12-23 16:19:33 +00:00
|
|
|
public boolean isVisitable(final BlockVector3 from, final BlockVector3 to) {
|
2018-08-12 14:03:07 +00:00
|
|
|
return this.mask.test(to);
|
|
|
|
}
|
|
|
|
}
|