当前位置: 首页>>代码示例>>C++>>正文


C++ ImageList::insert方法代码示例

本文整理汇总了C++中ImageList::insert方法的典型用法代码示例。如果您正苦于以下问题:C++ ImageList::insert方法的具体用法?C++ ImageList::insert怎么用?C++ ImageList::insert使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在ImageList的用法示例。


在下文中一共展示了ImageList::insert方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: spLeafBoxIntersection

//Return a subpaving representing intersection of subpavings.
SPMinimalnode* SPMinimalnode::spLeafBoxIntersection(const SPMinimalnode * const spn1,
								const SPMinimalnode * const spn2)
{
	SPMinimalnode* interSP = NULL;
	
	try {
		BoxVec interBoxes;
		interBoxes = vecLeafBoxIntersection(interBoxes,
						spn1, spn2);
		if (!interBoxes.empty()) {

			ImageList listBoxes;
			listBoxes.insert(listBoxes.end(), interBoxes.begin(),
												interBoxes.end());
			ivector root = spn1->getBox();

			interSP = makeTreeFromLeaves(root, listBoxes);

			if (interSP != NULL) {
				interSP->setNodeName("X");
				interSP->recursiveRename();
			}
		}

		return interSP;
	}
	catch(std::exception const& e) {
		delete interSP;
		interSP = NULL;
		throw;
	}
	
}
开发者ID:raazesh-sainudiin,项目名称:mrs2,代码行数:34,代码来源:spminimalnode.cpp

示例2: spLeafBoxDifference

//Return a subpaving representing the difference between subpavings.
SPMinimalnode* SPMinimalnode::spLeafBoxDifference(const SPMinimalnode * const spn1,
								const SPMinimalnode * const spn2)
{
	SPMinimalnode* diffSP = NULL;
	
	try {
		BoxVec diffBoxes;
		diffBoxes = vecLeafBoxDifference(diffBoxes, spn1, spn2);
		if (!diffBoxes.empty()) {

			ImageList listBoxes;
			listBoxes.insert(listBoxes.end(), diffBoxes.begin(),
												diffBoxes.end());
			ivector root = spn1->getBox();

			diffSP = makeTreeFromLeaves(root, listBoxes);

			if (diffSP != NULL) {
				diffSP->setNodeName("X");
				diffSP->recursiveRename();
			}
		}

		return diffSP;
	}
	catch(std::exception const& e) {
		delete diffSP;
		diffSP = NULL;
		throw;
	}
}
开发者ID:raazesh-sainudiin,项目名称:mrs2,代码行数:32,代码来源:spminimalnode.cpp

示例3: spLeafBoxOuterJacket

// Return a minimal subpaving representing the finest common
// level of nodes between two subpavings.
// ie the 'outer jacket' that is the finest subpaving that fits
// both of the inner subpavings
SPMinimalnode* SPMinimalnode::spLeafBoxOuterJacket(const SPMinimalnode * const spn1,
								const SPMinimalnode * const spn2)
{
	SPMinimalnode* jacketSP = NULL;
	try {
		
		BoxVec jacketBoxes;
		jacketBoxes = vecLeafBoxOuterJacket(jacketBoxes,
						spn1, spn2);
		if (!jacketBoxes.empty()) {

			ImageList listBoxes;
			listBoxes.insert(listBoxes.end(), jacketBoxes.begin(),
												jacketBoxes.end());
			ivector root = spn1->getBox();

			jacketSP = makeTreeFromLeaves(root, listBoxes);

			if (jacketSP != NULL) {
				jacketSP->setNodeName("X");
				jacketSP->recursiveRename();
			}

		}

		return jacketSP;
	}
	catch(std::exception const& e) {
		delete jacketSP;
		jacketSP = NULL;
		throw;
	}
}
开发者ID:raazesh-sainudiin,项目名称:mrs2,代码行数:37,代码来源:spminimalnode.cpp


注:本文中的ImageList::insert方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。