亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? region.cc

?? tools.03b.zip
?? CC
字號:
// Tools Library//// Copyright (C) 2004  Navel Ltd.//// This library is free software; you can redistribute it and/or// modify it under the terms of the GNU Lesser General Public// License as published by the Free Software Foundation; either// version 2.1 of the License, or (at your option) any later version.//// This library is distributed in the hope that it will be useful,// but WITHOUT ANY WARRANTY; without even the implied warranty of// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU// Lesser General Public License for more details.//// You should have received a copy of the GNU Lesser General Public// License along with this library; if not, write to the Free Software// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA//// Contact information://  Mailing address://    Marios Hadjieleftheriou//    University of California, Riverside//    Department of Computer Science//    Surge Building, Room 310//    Riverside, CA 92521////  Email://    marioh@cs.ucr.edu#include <Tools.h>Tools::Geometry::Region::Region()	: m_dimension(0), m_pLow(0), m_pHigh(0){}Tools::Geometry::Region::Region(const double* pLow, const double* pHigh, unsigned long dimension){	initialize(pLow, pHigh, dimension);}Tools::Geometry::Region::Region(const Point& low, const Point& high){	if (low.m_dimension != high.m_dimension) throw IllegalArgumentException("Region::Region: arguments have different number of dimensions.");	initialize(low.m_pCoords, high.m_pCoords, low.m_dimension);}Tools::Geometry::Region::Region(const Region& r){	initialize(r.m_pLow, r.m_pHigh, r.m_dimension);}void Tools::Geometry::Region::initialize(const double* pLow, const double* pHigh, unsigned long dimension){	m_pLow = 0;	m_dimension = dimension;#ifndef NDEBUG	for (unsigned long cDim = 0; cDim < m_dimension; cDim++)	{		if (pLow[cDim] > pHigh[cDim])		{			throw Tools::IllegalArgumentException("Region::Region: Low point has larger coordinates than High point.");		}	}#endif	try	{		m_pLow = new double[m_dimension];		m_pHigh = new double[m_dimension];	}	catch (...)	{		delete[] m_pLow;		throw;	}	memcpy(m_pLow, pLow, m_dimension * sizeof(double));	memcpy(m_pHigh, pHigh, m_dimension * sizeof(double));}Tools::Geometry::Region::~Region(){	delete[] m_pLow;	delete[] m_pHigh;}Tools::Geometry::Region& Tools::Geometry::Region::operator=(const Region& r){	if(this != &r)	{		makeDimension(r.m_dimension);		memcpy(m_pLow, r.m_pLow, m_dimension * sizeof(double));		memcpy(m_pHigh, r.m_pHigh, m_dimension * sizeof(double));	}	return *this;}
bool Tools::Geometry::Region::operator==(const Region& r) const{	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::operator ==: Regions have different number of dimensions.");	for (unsigned long i = 0; i < m_dimension; i++)	{		if (
			m_pLow[i] < r.m_pLow[i] - std::numeric_limits<double>::epsilon() ||			m_pLow[i] > r.m_pLow[i] + std::numeric_limits<double>::epsilon() ||			m_pHigh[i] < r.m_pHigh[i] - std::numeric_limits<double>::epsilon() ||			m_pHigh[i] > r.m_pHigh[i] + std::numeric_limits<double>::epsilon())
			return false;	}	return true;}//// IObject interface//Tools::Geometry::Region* Tools::Geometry::Region::clone() throw (Tools::NotSupportedException){	return new Region(*this);}//// ISerializable interface//unsigned long Tools::Geometry::Region::getByteArraySize(){	return (sizeof(unsigned long) + 2 * m_dimension * sizeof(double));}unsigned long Tools::Geometry::Region::loadFromByteArray(byte* const data){	byte* ptr = data;
	unsigned long dimension;	memcpy(&dimension, ptr, sizeof(unsigned long));
	ptr += sizeof(unsigned long);	makeDimension(dimension);	memcpy(m_pLow, ptr, m_dimension * sizeof(double));	ptr += m_dimension * sizeof(double);	memcpy(m_pHigh, ptr, m_dimension * sizeof(double));	//ptr += m_dimension * sizeof(double);	return getByteArraySize();}void Tools::Geometry::Region::storeToByteArray(unsigned long& len, byte** data){	len = getByteArraySize();	*data = new byte[len];	byte* ptr = *data;	memcpy(ptr, &m_dimension, sizeof(unsigned long));	ptr += sizeof(unsigned long);	memcpy(ptr, m_pLow, m_dimension * sizeof(double));	ptr += m_dimension * sizeof(double);	memcpy(ptr, m_pHigh, m_dimension * sizeof(double));	//ptr += m_dimension * sizeof(double);}//// IShape interface//bool Tools::Geometry::Region::intersectsShape(const IShape& s) const{	const Region* pr = dynamic_cast<const Region*>(&s);	if (pr != 0) return intersectsRegion(*pr);	const Point* ppt = dynamic_cast<const Point*>(&s);	if (ppt != 0) return containsPoint(*ppt);	throw IllegalStateException("intersectsShape: Not implemented yet!");}bool Tools::Geometry::Region::containsShape(const IShape& s) const{	const Region* pr = dynamic_cast<const Region*>(&s);	if (pr != 0) return containsRegion(*pr);	const Point* ppt = dynamic_cast<const Point*>(&s);	if (ppt != 0) return containsPoint(*ppt);	throw IllegalStateException("containsShape: Not implemented yet!");}bool Tools::Geometry::Region::touchesShape(const IShape& s) const{	const Region* pr = dynamic_cast<const Region*>(&s);	if (pr != 0) return touchesRegion(*pr);	const Point* ppt = dynamic_cast<const Point*>(&s);	if (ppt != 0) return touchesPoint(*ppt);	throw IllegalStateException("touchesShape: Not implemented yet!");}void Tools::Geometry::Region::getCenter(Point& out) const{	out.makeDimension(m_dimension);	for (unsigned long i = 0; i < m_dimension; i++)	{		out.m_pCoords[i] = (m_pLow[i] + m_pHigh[i]) / 2.0;	}
}unsigned long Tools::Geometry::Region::getDimension() const
{
	return m_dimension;
}

void Tools::Geometry::Region::getMBR(Region& out) const{	out = *this;}double Tools::Geometry::Region::getArea() const{	double area = 1.0;	for (unsigned long i = 0; i < m_dimension; i++)	{		area *= m_pHigh[i] - m_pLow[i];	}	return area;}double Tools::Geometry::Region::getMinimumDistance(const IShape& s) const{	const Region* pr = dynamic_cast<const Region*>(&s);	if (pr != 0) return getMinimumDistance(*pr);	const Point* ppt = dynamic_cast<const Point*>(&s);	if (ppt != 0) return getMinimumDistance(*ppt);	throw IllegalStateException("getMinimumDistance: Not implemented yet!");}bool Tools::Geometry::Region::intersectsRegion(const Region& r) const{	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::intersectsRegion: Regions have different number of dimensions.");	for (unsigned long i = 0; i < m_dimension; i++)	{		if (m_pLow[i] > r.m_pHigh[i] || m_pHigh[i] < r.m_pLow[i]) return false;	}	return true;}bool Tools::Geometry::Region::containsRegion(const Region& r) const{	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::containsRegion: Regions have different number of dimensions.");	for (unsigned long i = 0; i < m_dimension; i++)	{		if (m_pLow[i] > r.m_pLow[i] || m_pHigh[i] < r.m_pHigh[i]) return false;	}	return true;}bool Tools::Geometry::Region::touchesRegion(const Region& r) const{	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::touchesRegion: Regions have different number of dimensions.");	for (unsigned long i = 0; i < m_dimension; i++)	{		if (
			(m_pLow[i] > r.m_pLow[i] - std::numeric_limits<double>::epsilon() &&			 m_pLow[i] < r.m_pLow[i] + std::numeric_limits<double>::epsilon()) ||			(m_pHigh[i] > r.m_pHigh[i] - std::numeric_limits<double>::epsilon() &&			 m_pHigh[i] < r.m_pHigh[i] + std::numeric_limits<double>::epsilon()))
			return true;	}	return false;}double Tools::Geometry::Region::getMinimumDistance(const Region& r) const{	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::getMinimumDistance: Regions have different number of dimensions.");	double ret = 0.0;	for (unsigned long i = 0; i < m_dimension; i++)	{		double x = 0.0;
		if (r.m_pHigh[i] < m_pLow[i])		{
			x = std::abs(r.m_pHigh[i] - m_pLow[i]);		}
		else if (m_pHigh[i] < r.m_pLow[i])		{
			x = std::abs(r.m_pLow[i] - m_pHigh[i]);		}
		ret += x * x;	}
	return std::sqrt(ret);}bool Tools::Geometry::Region::containsPoint(const Point& p) const{	if (m_dimension != p.m_dimension) throw IllegalArgumentException("Region::containsPoint: Point has different number of dimensions.");	for (unsigned long i = 0; i < m_dimension; i++)	{		if (m_pLow[i] > p.getCoordinate(i) || m_pHigh[i] < p.getCoordinate(i)) return false;	}	return true;}bool Tools::Geometry::Region::touchesPoint(const Point& p) const{	if (m_dimension != p.m_dimension) throw IllegalArgumentException("Region::touchesPoint: Point has different number of dimensions.");	for (unsigned long i = 0; i < m_dimension; i++)	{		if (
			(m_pLow[i] > p.getCoordinate(i) - std::numeric_limits<double>::epsilon() &&			 m_pLow[i] < p.getCoordinate(i) + std::numeric_limits<double>::epsilon()) ||			(m_pHigh[i] > p.getCoordinate(i) - std::numeric_limits<double>::epsilon() &&			 m_pHigh[i] < p.getCoordinate(i) + std::numeric_limits<double>::epsilon()))
			return true;	}	return false;}double Tools::Geometry::Region::getMinimumDistance(const Point& p) const{	if (m_dimension != p.m_dimension) throw IllegalArgumentException("Region::getMinimumDistance: Point has different number of dimensions.");	double ret = 0.0;	for (unsigned long i = 0; i < m_dimension; i++)	{		if (p.getCoordinate(i) < m_pLow[i])		{			ret += std::pow(m_pLow[i] - p.getCoordinate(i), 2.0);		}		else if (p.getCoordinate(i) > m_pHigh[i])		{			ret += std::pow(p.getCoordinate(i) - m_pHigh[i], 2.0);		}	}	return std::sqrt(ret);}Tools::Geometry::Region Tools::Geometry::Region::getIntersectingRegion(const Region& r) const{	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::getIntersectingRegion: Regions have different number of dimensions.");	Region ret;	ret.makeInfinite(m_dimension);	// check for intersection.	// marioh: avoid function call since this is called billions of times.	for (unsigned long cDim = 0; cDim < m_dimension; cDim++)	{		if (m_pLow[cDim] > r.m_pHigh[cDim] || m_pHigh[cDim] < r.m_pLow[cDim]) return ret;	}	for (unsigned long cDim = 0; cDim < m_dimension; cDim++)	{		ret.m_pLow[cDim] = std::max(m_pLow[cDim], r.m_pLow[cDim]);		ret.m_pHigh[cDim] = std::min(m_pHigh[cDim], r.m_pHigh[cDim]);	}	return ret;}double Tools::Geometry::Region::getIntersectingArea(const Region& r) const{	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::getIntersectingArea: Regions have different number of dimensions.");	double ret = 1.0;	double f1, f2;	for (unsigned long cDim = 0; cDim < m_dimension; cDim++)	{		if (m_pLow[cDim] > r.m_pHigh[cDim] || m_pHigh[cDim] < r.m_pLow[cDim]) return 0.0;		f1 = std::max(m_pLow[cDim], r.m_pLow[cDim]);		f2 = std::min(m_pHigh[cDim], r.m_pHigh[cDim]);		ret *= f2 - f1;	}	return ret;}/* * Returns the margin of a region. It is calcuated as the sum of  2^(d-1) * width, in each dimension. * It is actually the sum of all edges, no matter what the dimensionality is.*/double Tools::Geometry::Region::getMargin() const{	double mul = std::pow(2.0, static_cast<double>(m_dimension) - 1.0);	double margin = 0.0;	for (unsigned long i = 0; i < m_dimension; i++)	{		margin += (m_pHigh[i] - m_pLow[i]) * mul;	}	return margin;}void Tools::Geometry::Region::combineRegion(const Region& r){	if (m_dimension != r.m_dimension) throw IllegalArgumentException("Region::combineRegion: Regions have different number of dimensions.");	for (unsigned long cDim = 0; cDim < m_dimension; cDim++)	{		m_pLow[cDim] = std::min(m_pLow[cDim], r.m_pLow[cDim]);		m_pHigh[cDim] = std::max(m_pHigh[cDim], r.m_pHigh[cDim]);	}}void Tools::Geometry::Region::getCombinedRegion(Region& out, const Region& in) const{	if (m_dimension != in.m_dimension) throw IllegalArgumentException("Region::getCombinedRegion: Regions have different number of dimensions.");	out = *this;	out.combineRegion(in);}double Tools::Geometry::Region::getLow(unsigned long index) const throw (IndexOutOfBoundsException){	if (index < 0 || index >= m_dimension) throw IndexOutOfBoundsException(index);

	return m_pLow[index];}double Tools::Geometry::Region::getHigh(unsigned long index) const throw (IndexOutOfBoundsException){
	if (index < 0 || index >= m_dimension) throw IndexOutOfBoundsException(index);
	return m_pHigh[index];}void Tools::Geometry::Region::makeInfinite(unsigned long dimension){	makeDimension(dimension);	for (unsigned long cIndex = 0; cIndex < m_dimension; cIndex++)	{		m_pLow[cIndex] = std::numeric_limits<double>::max();		m_pHigh[cIndex] = -std::numeric_limits<double>::max();	}}void Tools::Geometry::Region::makeDimension(unsigned long dimension){	if (m_dimension != dimension)	{		delete[] m_pLow;		delete[] m_pHigh;		// remember that this is not a constructor. The object will be destructed normally if		// something goes wrong (bad_alloc), so we must take care not to leave the object at an intermediate state.		m_pLow = 0; m_pHigh = 0;		m_dimension = dimension;		m_pLow = new double[m_dimension];		m_pHigh = new double[m_dimension];	}}std::ostream& Tools::Geometry::operator<<(std::ostream& os, const Region& r){	unsigned long i;	os << "Low: ";	for (i = 0; i < r.m_dimension; i++)	{		os << r.m_pLow[i] << " ";	}	os << ", High: ";	for (i = 0; i < r.m_dimension; i++)	{		os << r.m_pHigh[i] << " ";	}	return os;}

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
欧美视频在线不卡| 国产成人免费在线视频| 欧美无乱码久久久免费午夜一区| 亚洲成人在线观看视频| 成人欧美一区二区三区视频网页| 欧美一区二区三区色| 91麻豆自制传媒国产之光| 大胆亚洲人体视频| 国内精品免费**视频| 日本亚洲一区二区| 成人欧美一区二区三区在线播放| 欧美大片在线观看一区| 欧美性淫爽ww久久久久无| 亚洲免费电影在线| 精品国产一区二区在线观看| 丁香啪啪综合成人亚洲小说| 亚洲一区二区精品久久av| 精品久久久久久最新网址| 欧美一区二区三区公司| 国产成人精品三级| 久久激五月天综合精品| 亚洲黄网站在线观看| 国产视频一区二区在线观看| 欧美日韩一级二级三级| 99re视频精品| 九九国产精品视频| 午夜激情久久久| 日韩精品中文字幕在线一区| 国产精品伊人色| 国产精品久久久久aaaa樱花| 色欧美日韩亚洲| 岛国精品在线观看| 91论坛在线播放| 亚洲天堂a在线| 午夜精品免费在线| 国产精品久线观看视频| 18成人在线视频| 亚洲美女电影在线| 中文字幕日韩精品一区| 一区二区三区丝袜| 亚洲一二三区不卡| 亚洲国产精品嫩草影院| 奇米一区二区三区av| 国产精品一区二区久久不卡| 成人性生交大片免费看视频在线| 99国产精品国产精品久久| 欧洲一区二区av| 欧美一区二区视频网站| 久久亚洲一级片| 久久综合99re88久久爱| 亚洲老妇xxxxxx| 欧美韩日一区二区三区四区| 中文字幕av一区二区三区高| 日韩精品一区二区三区在线 | 91福利资源站| 欧美一区二区三区爱爱| 亚洲午夜电影在线观看| 久久福利资源站| 91精品91久久久中77777| 26uuu国产在线精品一区二区| 国产精品国产三级国产三级人妇 | 亚洲人亚洲人成电影网站色| 亚洲www啪成人一区二区麻豆| 久久99国产精品久久99果冻传媒| 国产高清久久久| 日韩免费性生活视频播放| 在线精品亚洲一区二区不卡| 欧美日韩一区不卡| 亚洲一级二级三级| 亚洲特级片在线| 激情图区综合网| 欧美视频三区在线播放| 国产精品少妇自拍| 久久精品999| 欧美日韩午夜精品| 亚洲欧美一区二区久久| 国产福利91精品一区二区三区| 欧美三级电影在线观看| 亚洲视频一区二区在线| 高清不卡一二三区| 777久久久精品| 午夜日韩在线观看| 在线观看区一区二| 五月综合激情网| 日韩一区二区三区视频在线| 亚洲人成人一区二区在线观看| 成人激情av网| 国产精品久久久久久亚洲伦| 不卡的av电影| 亚洲色图在线看| 69堂精品视频| 精品一区二区在线看| 国产色一区二区| 国产福利91精品| 国产亚洲欧美日韩俺去了| 国产成人精品免费一区二区| 亚洲午夜激情网站| 欧美喷潮久久久xxxxx| 免费高清在线视频一区·| 成人免费毛片嘿嘿连载视频| 欧美日韩一区二区三区在线看 | 国产成人欧美日韩在线电影| 亚洲三级在线免费观看| 国产精品亚洲专一区二区三区| 精品国产一区a| 国产一区二区在线视频| 26uuu国产在线精品一区二区| 久久国产精品第一页| 精品久久久网站| 国产二区国产一区在线观看| 久久精品视频一区| 风间由美一区二区三区在线观看| 国产欧美精品一区二区色综合朱莉| 亚洲成av人片在线观看无码| 欧美一区二区三区在线看| 国产91清纯白嫩初高中在线观看| 亚洲国产精品自拍| 国产精品国产a级| 欧美成人一区二区三区在线观看| 91亚洲男人天堂| 天堂成人免费av电影一区| 国产偷国产偷精品高清尤物 | 91年精品国产| 午夜久久久久久久久| 国产午夜亚洲精品不卡| 欧美女孩性生活视频| 大尺度一区二区| 免费久久99精品国产| 亚洲精品视频在线观看免费| 久久久夜色精品亚洲| 欧美一区二区三区公司| 欧美日韩国产综合一区二区三区| 国产精品 欧美精品| 九色综合狠狠综合久久| 日韩精品一二三区| 午夜久久久影院| 亚洲国产三级在线| 亚洲午夜日本在线观看| 亚洲精品国产无天堂网2021| 中文字幕欧美日本乱码一线二线| 国产精品网站在线| 精品日韩一区二区三区 | 亚洲欧美成人一区二区三区| 一区二区三区国产精华| av成人免费在线| 国产性色一区二区| 日韩av电影天堂| 久久美女艺术照精彩视频福利播放| 成人av免费在线观看| 五月激情综合婷婷| 久久九九久精品国产免费直播| 色婷婷精品大在线视频| 美洲天堂一区二卡三卡四卡视频| 国产女人18水真多18精品一级做| 日本福利一区二区| 精品亚洲成a人| 伊人夜夜躁av伊人久久| 精品国产伦一区二区三区免费| 99精品一区二区| 寂寞少妇一区二区三区| 夜夜夜精品看看| 国产欧美精品国产国产专区 | 国产欧美日韩不卡| 欧美伦理视频网站| 成人va在线观看| 蜜桃精品视频在线观看| 亚洲精品中文字幕在线观看| 久久夜色精品国产噜噜av | 中文字幕欧美区| 欧美一区二区三区四区五区| aaa亚洲精品一二三区| 黄色日韩网站视频| 一区二区三区电影在线播| 国产日韩欧美激情| 69久久夜色精品国产69蝌蚪网| 成人av网址在线| 久久成人精品无人区| 亚洲图片自拍偷拍| 亚洲欧洲韩国日本视频| 久久天堂av综合合色蜜桃网| 欧美高清你懂得| 91久久奴性调教| 99久久久免费精品国产一区二区 | 日本二三区不卡| 成人sese在线| 国产传媒一区在线| 青青草91视频| 三级不卡在线观看| 性做久久久久久免费观看 | 国产成人在线免费| 精东粉嫩av免费一区二区三区| 日韩专区在线视频| 五月天一区二区三区| 亚洲欧美激情小说另类| 国产精品国产馆在线真实露脸| 国产欧美日韩亚州综合| 欧美精品一区二| 26uuu精品一区二区三区四区在线 26uuu精品一区二区在线观看 | 中文字幕精品一区二区三区精品 | 精久久久久久久久久久|