11 public Left(
int maxDistance)
20 if (
Check(origin.
X - i, origin.
Y))
22 return new Point(origin.
X - i, origin.
Y);
42 if (
Check(origin.
X + i, origin.
Y))
44 return new Point(origin.
X + i, origin.
Y);
55 public Down(
int maxDistance)
64 if (
Check(origin.
X, origin.
Y + i))
66 return new Point(origin.
X, origin.
Y + i);
77 public Up(
int maxDistance)
86 if (
Check(origin.
X, origin.
Y - i))
88 return new Point(origin.
X, origin.
Y - i);
109 for (
int i = 0; i <
_width; i++)
111 for (
int j = 0; j <
_height; j++)
113 if (
Check(origin.
X + i, origin.
Y + j))
115 return new Point(origin.
X + i, origin.
Y + j);
GenSearch Conditions(params GenCondition[] conditions)
override Point Find(Point origin)
override Point Find(Point origin)
override Point Find(Point origin)
Rectangle(int width, int height)
override Point Find(Point origin)
override Point Find(Point origin)
static GenSearch Chain(GenSearch search, params GenCondition[] conditions)