C++ (Cpp) rect::left Examples

Programming Language: C++ (Cpp)

Class/Type: rect

Method/Function: left

Examples at hotexamples.com: 5

Rect left is a function in the C++ library that returns the x-coordinate of the left edge of a specified rectangle object.

Example 1: Using Rect left to position a rectangle

#include 
#include 

int main()
{
    sf::RenderWindow window(sf::VideoMode(800, 600), "Rect left");
    window.setFramerateLimit(60);

    sf::RectangleShape rect(sf::Vector2f(100, 50));
    rect.setFillColor(sf::Color::Red);
    rect.setPosition(50, 100);

    while (window.isOpen())
    {
        sf::Event event;
        while (window.pollEvent(event))
        {
            if (event.type == sf::Event::Closed)
                window.close();
        }

        std::cout << "Left coordinate: " << rect.getGlobalBounds().left << std::endl;

        window.clear();
        window.draw(rect);
        window.display();
    }

    return 0;
}

In this example, the Rect left function is used to get the x-coordinate of the left edge of a rectangle object created using SFML library. The rectangle is positioned at x = 50, y = 100 and its left coordinate is printed to the console.

Package/library: SFML

Example 2: Using Rect left to create a collision detection function

#include 
#include 

bool isIntersecting(sf::RectangleShape shape1, sf::RectangleShape shape2)
{
    return (shape1.getGlobalBounds().left + shape1.getGlobalBounds().width >= shape2.getGlobalBounds().left
         && shape2.getGlobalBounds().left + shape2.getGlobalBounds().width >= shape1.getGlobalBounds().left
         && shape1.getGlobalBounds().top + shape1.getGlobalBounds().height >= shape2.getGlobalBounds().top
         && shape2.getGlobalBounds().top + shape2.getGlobalBounds().height >= shape1.getGlobalBounds().top);
}

int main()
{
    sf::RenderWindow window(sf::VideoMode(800, 600), "Rect left");
    window.setFramerateLimit(60);

    sf::RectangleShape rect1(sf::Vector2f(100, 50));
    rect1.setFillColor(sf::Color::Red);
    rect1.setPosition(50, 100);

    sf::RectangleShape rect2(sf::Vector2f(100, 50));
    rect2.setFillColor(sf::Color::Green);
    rect2.setPosition(200, 150);

    while (window.isOpen())
    {
        sf::Event event;
        while (window.pollEvent(event))
        {
            if (event.type == sf::Event::Closed)
                window.close();
        }

        if (isIntersecting(rect1, rect2))
            std::cout << "Collision detected" << std::endl;

        window.clear();
        window.draw(rect1);
        window.draw(rect2);
        window.display();
    }

    return 0;
}

In this example, the Rect left function is used along with other functions from the SFML library to create a collision detection function between two rectangle objects. The function checks if the left edge of one rectangle is overlapping with the right edge of the other rectangle to determine if a collision has occurred. Package/library: SFML

C++ (Cpp) rect::left - 5 examples found. These are the top rated real world C++ (Cpp) examples of rect::left from package coding extracted from open source projects. You can rate examples to help us improve the quality of examples.

Frequently Used Methods

Show Hide

x(24)

y(24)

h(20)

w(20)

x2(11)

topleft(7)

contains(6)

width(6)

height(6)

right(5)

bottom(5)

top(5)

left(5)

adjust_to_concept(4)

getX(3)

top_left(3)

y1(3)

getY(3)

getW(3)

x1(3)

getH(3)

getWidth(2)

intersects(2)

bottom_left(2)

bottom_right(2)

shrink(2)

size(2)

top_right(2)

get_rect_absolute(2)

get_parent(2)

normalize(2)

getHeight(2)

origin(2)

translate_to(1)

wcenter(1)

sdl_rect(1)

write(1)

topright(1)

translate_by(1)

radius(1)

position(1)

point_in(1)

Bottom(1)

min(1)

get_corner(1)

Left(1)

Right(1)

Top(1)

area(1)

bottomleft(1)

Example #1

Show file

File: rect.hpp Project: venkatarajasekhar/ssa

  inline pos2<T> clop(const pos2<T>& pos, const rect<T>& r, T resolution=1) {
	pos2<T> cloped(pos);
	if (cloped.x_ >= r.right()) cloped.x_ = r.right() - resolution;
	if (cloped.y_ >= r.bottom()) cloped.y_ = r.bottom() - resolution;
	if (cloped.x_ < r.left()) cloped.x_ = r.left();
	if (cloped.y_ < r.top()) cloped.y_ = r.top();
	return cloped;
  }

Example #2

Show file

File: rect.hpp Project: bebuch/disposer_module

	constexpr bool contains(
		rect< PositionType, SizeType > const& reference,
		rect< PositionType, SizeType > const& test
	){
		return
			test.left()   >= reference.left()  &&
			test.top()    >= reference.top()   &&
			test.right()  <= reference.right() &&
			test.bottom() <= reference.bottom();
	}

Example #3

Show file

File: rect.hpp Project: bebuch/disposer_module

	constexpr rect< PositionType, SizeType > join(
		rect< PositionType, SizeType > const& lhs,
		rect< PositionType, SizeType > const& rhs
	){
		return rect< PositionType, SizeType >(
			point< PositionType >(
				std::min(lhs.left(), rhs.left()),
				std::min(lhs.top(), rhs.top())
			),
			point< PositionType >(
				std::max(lhs.right(), rhs.right()),
				std::max(lhs.bottom(), rhs.bottom())
			)
		);
	}

Example #4

Show file

File: rect.hpp Project: bebuch/disposer_module

	constexpr bool contains(
		rect< PositionType, SizeType > const& rect,
		point< DataType > const& point
	){
		return
			point.x() >= rect.left()  &&
			point.y() >= rect.top()   &&
			point.x() <  rect.right() &&
			point.y() <  rect.bottom();
	}

Example #5

Show file

File: rect.cpp Project: zxiy/gml

	int rect::hit_test(const rect& other) const
	{
		int intersect_other = 0;
		if (other.hit_test(left(),  top()))		intersect_other++;
		if (other.hit_test(left(),  bottom()))	intersect_other++;
		if (other.hit_test(right(), top()))		intersect_other++;
		if (other.hit_test(right(), bottom()))	intersect_other++;

		if (intersect_other == 0)
			return outside;
		else if (intersect_other == 4)
			return inside;

		intersect_other = 0;
		if (hit_test(other.left(),  other.top()))		intersect_other++;
		if (hit_test(other.left(),  other.bottom()))	intersect_other++;
		if (hit_test(other.right(), other.top()))		intersect_other++;
		if (hit_test(other.right(), other.bottom()))	intersect_other++;

		if (intersect_other == 4)
			return contain;
		else //
			return intersect;
	}