Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating material.
Please try to avoid dependencies to third-party libraries and frameworks.
int isInsideRect(double x1, double y1, double x2, double y2, double px, double py){
return px >= x1 && px <= x2 && py >= y1 && py <= y2;
}
bool b = x1<x && x<x2 && y1<y && y<y2;
isInsideRect(X1, Y1, X2, Y2, PX, PY) when X1 =< PX andalso PX =< X2 andalso Y1 =< PY andalso PY =< Y2 -> true;
isInsideRect(_, _, _, _, _, _) -> false.
logical :: b
b = (x1 < x) .and. (x < x2) .and. (y1 < y) .and. (y < y2)
b = x >= x1 && x <= x2 && y >= y1 && y <= y2
const pointInRect = ({x1, y1, x2, y2}, {x, y}) => (
(x > x1 && x < x2) && (y > y1 && y < y2)
)
boolean b = x <= x2 && x >= x1 && y <= y2 && y >= y1;
(setf b (and (< x1 x x2)
(< y1 y y2)))
b = (x1 < x < x2) and (y1 < y < y2)
class Rectangle:
def __init__(self, x, y, w, h):
self.x, self.y = x, y
self.w, self.h = w, h
def contains(self, x, y):
a, b = self.x, self.y
w, h = self.w, self.h
return a <= x <= (a + w) and \
b <= y <= (b + h)
w, h = x2 - x1, y2 - y1
r = Rectangle(x1, y1, w, h)
b = r.contains(x, y)
Point = Struct.new(:x, :y)
Rect = Struct.new(:x1, :y1, :x2, :y2) do
def contains?(point)
point.x.between?(x1,x2) && point.y.between?(y1,y2)
end
end
b = Rect.new(0,0,2,5).contains?(Point.new(0,0))
struct Rect {
x1: i32,
x2: i32,
y1: i32,
y2: i32,
}
impl Rect {
fn contains(&self, x: i32, y: i32) -> bool {
return self.x1 < x && x < self.x2 && self.y1 < y && y < self.y2;
}
}