当前位置:网站首页>About the error of SFML Rect.inl file
About the error of SFML Rect.inl file
2022-07-30 21:06:00 【Zoe_Cpp】
首先因为VC++的max和min宏导致max和minA conflict occurred between the parameter templates of
所以要在前面加上#undef max 和 #undef min取消宏定义
然后Rect模板在sf命名空间下,but the file is notRect前加上sf::
修改后的文件如下
版本SFML 2.5.1
//
// SFML - Simple and Fast Multimedia Library
// Copyright (C) 2007-2018 Laurent Gomila ([email protected])
//
// This software is provided 'as-is', without any express or implied warranty.
// In no event will the authors be held liable for any damages arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it freely,
// subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented;
// you must not claim that you wrote the original software.
// If you use this software in a product, an acknowledgment
// in the product documentation would be appreciated but is not required.
//
// 2. Altered source versions must be plainly marked as such,
// and must not be misrepresented as being the original software.
//
// 3. This notice may not be removed or altered from any source distribution.
//
#undef min
#undef max
template <typename T>
sf::Rect<T>::Rect() :
left (0),
top (0),
width (0),
height(0)
{
}
template <typename T>
sf::Rect<T>::Rect(T rectLeft, T rectTop, T rectWidth, T rectHeight) :
left (rectLeft),
top (rectTop),
width (rectWidth),
height(rectHeight)
{
}
template <typename T>
sf::Rect<T>::Rect(const sf::Vector2<T>& position, const sf::Vector2<T>& size) :
left (position.x),
top (position.y),
width (size.x),
height(size.y)
{
}
template <typename T>
template <typename U>
sf::Rect<T>::Rect(const sf::Rect<U>& rectangle) :
left (static_cast<T>(rectangle.left)),
top (static_cast<T>(rectangle.top)),
width (static_cast<T>(rectangle.width)),
height(static_cast<T>(rectangle.height))
{
}
template <typename T>
bool sf::Rect<T>::contains(T x, T y) const
{
// Rectangles with negative dimensions are allowed, so we must handle them correctly
// Compute the real min and max of the rectangle on both axes
T minX = std::min(left, static_cast<T>(left + width));
T maxX = std::max(left, static_cast<T>(left + width));
T minY = std::min(top, static_cast<T>(top + height));
T maxY = std::max(top, static_cast<T>(top + height));
return (x >= minX) && (x < maxX) && (y >= minY) && (y < maxY);
}
template <typename T>
bool sf::Rect<T>::contains(const sf::Vector2<T>& point) const
{
return contains(point.x, point.y);
}
template <typename T>
bool sf::Rect<T>::intersects(const sf::Rect<T>& rectangle) const
{
Rect<T> intersection;
return intersects(rectangle, intersection);
}
template <typename T>
bool sf::Rect<T>::intersects(const sf::Rect<T>& rectangle, sf::Rect<T>& intersection) const
{
// Rectangles with negative dimensions are allowed, so we must handle them correctly
// Compute the min and max of the first rectangle on both axes
T r1MinX = std::min(left, static_cast<T>(left + width));
T r1MaxX = std::max(left, static_cast<T>(left + width));
T r1MinY = std::min(top, static_cast<T>(top + height));
T r1MaxY = std::max(top, static_cast<T>(top + height));
// Compute the min and max of the second rectangle on both axes
T r2MinX = std::min(rectangle.left, static_cast<T>(rectangle.left + rectangle.width));
T r2MaxX = std::max(rectangle.left, static_cast<T>(rectangle.left + rectangle.width));
T r2MinY = std::min(rectangle.top, static_cast<T>(rectangle.top + rectangle.height));
T r2MaxY = std::max(rectangle.top, static_cast<T>(rectangle.top + rectangle.height));
// Compute the intersection boundaries
T interLeft = std::max(r1MinX, r2MinX);
T interTop = std::max(r1MinY, r2MinY);
T interRight = std::min(r1MaxX, r2MaxX);
T interBottom = std::min(r1MaxY, r2MaxY);
// If the intersection is valid (positive non zero area), then there is an intersection
if ((interLeft < interRight) && (interTop < interBottom))
{
intersection = Rect<T>(interLeft, interTop, interRight - interLeft, interBottom - interTop);
return true;
}
else
{
intersection = Rect<T>(0, 0, 0, 0);
return false;
}
}
template <typename T>
inline bool operator ==(const sf::Rect<T>& left, const sf::Rect<T>& right)
{
return (left.left == right.left) && (left.width == right.width) &&
(left.top == right.top) && (left.height == right.height);
}
template <typename T>
inline bool operator !=(const sf::Rect<T>& left, const sf::Rect<T>& right)
{
return !(left == right);
}
边栏推荐
- Generate OOM records in a production environment. Conclusion: Don't be lazy to query useless fields unless you are completely sure.
- 【深度学习】对迁移学习中域适应的理解和3种技术的介绍
- DPW-SDNet: Dual Pixel-Wavelet Domain Deep CNNs for Soft Decoding of JPEG-Compressed Images
- awk notes
- 转义字符笔记记录
- 这本记述40年前历史的游戏书,预言的却是当下的事
- MySQL group_concat()详解
- 导航栏----个人中心 Dropdown
- tcp协议传输中的粘包问题
- KingbaseES V8R6备份恢复案例之---同一数据库创建不同stanza备份
猜你喜欢
随机推荐
C语言中指针没那么难~ (1)【文章结尾有资料】
flowable工作流所有业务概念
牛客网——业务分析-提取值
KingbaseES V8R6备份恢复案例之---同一数据库创建不同stanza备份
Image Restoration by Estimating Frequency Distribution of Local Patches
啊?现在初级测试招聘都要求会自动化了?
转义字符笔记记录
【软件工程之美 - 专栏笔记】31 | 软件测试要为产品质量负责吗?
软考 --- 数据库(6)数据仓库、分布式数据库
使用map函数,对list中的每个元素进行操作 好像不用map
GPGGA NTRIP RTCM 笔记
深入浅出边缘云 | 3. 资源配置
Outsourcing worked for three years, it was abolished...
巴比特 | 元宇宙每日必读:洗牌将至,数藏行业下半场是否会迎来新一批领头羊?是否会出现新玩法?...
新书上市 |《谁在掷骰子?》在“不确定性时代”中确定前行
Oblique document scanning and character recognition (opencv, coordinate transformation analysis)
JSESSIONID description in cookie
关于MySQL主从复制的数据同步延迟问题
对List集合中每个对象元素按时间顺序排序
What is the common factor