<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[koilin的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/koilin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; koilin]]></copyright><item><title><![CDATA[OneAPI安装]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/123842362</link><guid>https://blog.youkuaiyun.com/koilin/article/details/123842362</guid><author>koilin</author><pubDate>Wed, 30 Mar 2022 11:38:29 +0800</pubDate><description><![CDATA[在windows下如何安装MKL和TBB]]></description><category></category></item><item><title><![CDATA[SikuliX的使用]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/122418360</link><guid>https://blog.youkuaiyun.com/koilin/article/details/122418360</guid><author>koilin</author><pubDate>Mon, 10 Jan 2022 20:14:39 +0800</pubDate><description><![CDATA[SikuliX自动化测试环境配置]]></description><category></category></item><item><title><![CDATA[C++的工程说是找不到#include ＜Python.h＞的头文件]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/115917613</link><guid>https://blog.youkuaiyun.com/koilin/article/details/115917613</guid><author>koilin</author><pubDate>Tue, 20 Apr 2021 20:06:33 +0800</pubDate><description><![CDATA[这种情况一般发生在python调用C++的代码中，也就是C++的代码要支持python的调用。

我的解决方案是，去python的官网，下载python流行版本的安装包。

然后把python安装目录下的include的路径C:\Users\Administrator\AppData\Local\Programs\Python\Python38\include，填入c/c++-常规-附加包含目录
...]]></description><category></category></item><item><title><![CDATA[geogram库在windows下的cmake编译]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/115488026</link><guid>https://blog.youkuaiyun.com/koilin/article/details/115488026</guid><author>koilin</author><pubDate>Wed, 07 Apr 2021 16:05:10 +0800</pubDate><description><![CDATA[geogram编译要成功有两个关键的点要注意：

1）cmake时候，source目录和binary目录的成功设置，注意到binary目录设置为source目录下的build/window

2) 需要手动增加一个Entry，名字为VORPALINE_PLATFORM，类型为STRING，值为你编译的platform和VS版本，例如，我准备编译windows64位版本，VS版本是2017，可以设置变量的值为Win64-vs2015。注意到为什么明明是vs2017版本，还要把变量的值里面出现了vs2015呢？]]></description><category></category></item><item><title><![CDATA[如何设置QT的QToolBar里面的按钮互斥]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/107288632</link><guid>https://blog.youkuaiyun.com/koilin/article/details/107288632</guid><author>koilin</author><pubDate>Sat, 11 Jul 2020 18:08:04 +0800</pubDate><description><![CDATA[一个ToolBar里面的按钮都是button，如果有时候这些button用来表示同一件事情的不同状态，那就需要做到这个bar里面的所有button互斥，也就是同一个时间里，只有一个是处于按下的状态。如果另外一个按钮被按下了，这个按钮就要弹起来。那么，我们的做法就是把这些需要互斥的action组成一个group，并设置一个初始的被按下的按钮。

以下就是一个例子，大家可以参考。


	QActionGroup *agViewGroup = new QActionGroup(this);
	agViewGrou]]></description><category></category></item><item><title><![CDATA[OSG更新几何节点的方法]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/107264571</link><guid>https://blog.youkuaiyun.com/koilin/article/details/107264571</guid><author>koilin</author><pubDate>Fri, 10 Jul 2020 19:49:26 +0800</pubDate><description><![CDATA[std::vector&lt;glm::dvec3&gt; pts;
	std::vector&lt;glm::dvec3&gt; normals;
	std::vector&lt;glm::ivec3&gt; triangles;

	_mesh.GetMeshGeometry(pts, normals, triangles);
	int nV = pts.size();
	int nF = triangles.size();
	int nFacePt = nF * 3;

	osg::ref_ptr&.]]></description><category></category></item><item><title><![CDATA[Anaconda启动的时候一直停在loading applications不动的解决方案]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/106682648</link><guid>https://blog.youkuaiyun.com/koilin/article/details/106682648</guid><author>koilin</author><pubDate>Thu, 11 Jun 2020 10:34:12 +0800</pubDate><description><![CDATA[今天是抽风了，觉得Pycharm的版本不够高，于是更新了Pycharm的版本，只是等我更新了之后才发现了噩梦的开始。Pycharm的环境又得重新开始配置，numpy，pandas这些包又得重新装。于是乎，想到了我们的法宝Anaconda，但是启动的时候就一直在loading applications不动了。。。。。。



怎么办？

我首先想到了，可能是Pycharm更新了的原因。最好的办法首先想到了重装，但是，还是没有解决问题。网上说的那些reset的方法肯定也是没有用的。

怎么办？

再搜，执行up]]></description><category></category></item><item><title><![CDATA[4. 寻找两个有序数组的中位数]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85134209</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85134209</guid><author>koilin</author><pubDate>Thu, 20 Dec 2018 19:16:36 +0800</pubDate><description><![CDATA[
double Algorithm::findMedianSortedArrays(vector&amp;lt;int&amp;gt;&amp;amp; nums1, vector&amp;lt;int&amp;gt;&amp;amp; nums2)
{
	int m = nums1.size();
	int n = nums2.size();
	int nCount = (m + n) / 2;
	int nLast = (m + n) % ...]]></description><category></category></item><item><title><![CDATA[14. 最长公共前缀]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85060692</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85060692</guid><author>koilin</author><pubDate>Tue, 18 Dec 2018 10:15:42 +0800</pubDate><description><![CDATA[

std::string Algorithm::longestCommonPrefix(vector&amp;lt;string&amp;gt;&amp;amp; strs)
{
	std::string strCommon;
	int iSz = strs.size();
	if (iSz &amp;gt;= 1)
	{
		strCommon = strs.at(0);
	}

	for (int i = 0; i &amp;lt...]]></description><category></category></item><item><title><![CDATA[94. 二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85060310</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85060310</guid><author>koilin</author><pubDate>Tue, 18 Dec 2018 09:54:23 +0800</pubDate><description><![CDATA[
std::vector&amp;lt;int&amp;gt; Algorithm::inorderTraversal(TreeNode* root)
{
	std::vector&amp;lt;int&amp;gt; vecVals;
	
	TreeNode* pCur = root;
	std::stack&amp;lt;TreeNode*&amp;gt; stTree;
	
	while (pCur != NULL || !stTree....]]></description><category></category></item><item><title><![CDATA[763. 划分字母区间]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85054646</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85054646</guid><author>koilin</author><pubDate>Mon, 17 Dec 2018 19:29:05 +0800</pubDate><description><![CDATA[
std::vector&amp;lt;int&amp;gt; Algorithm::partitionLabels(string S)
{
	std::vector&amp;lt;int&amp;gt; vecMins;
	std::vector&amp;lt;int&amp;gt; vecMaxs;
	bool arrayBFirst[26];
	for (int i = 0; i &amp;lt; 26; i++)
	{
		arrayBFirs...]]></description><category></category></item><item><title><![CDATA[814. 二叉树剪枝]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85052314</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85052314</guid><author>koilin</author><pubDate>Mon, 17 Dec 2018 17:08:40 +0800</pubDate><description><![CDATA[
TreeNode* Algorithm::pruneTree(TreeNode* root)
{
	bool bCut = true;

	while (bCut)
	{
		std::stack&amp;lt;TreeNode*&amp;gt; stRoot;
		TreeNode* pCur = root;
		TreeNode* pPre = nullptr;
		stRoot.push(root);

...]]></description><category></category></item><item><title><![CDATA[657. 机器人能否返回原点]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85050094</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85050094</guid><author>koilin</author><pubDate>Mon, 17 Dec 2018 15:23:57 +0800</pubDate><description><![CDATA[
bool Algorithm::judgeCircle(string moves)
{
	int px = 0;
	int py = 0;
	int nLen = moves.length();
	for (int i = 0; i &amp;lt; nLen; i++)
	{
		char ch = moves.at(i);
		switch (ch)
		{
		case 'L':
			px -=...]]></description><category></category></item><item><title><![CDATA[13. 罗马数字转整数]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85049456</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85049456</guid><author>koilin</author><pubDate>Mon, 17 Dec 2018 14:52:20 +0800</pubDate><description><![CDATA[
int nLen = s.length();
	bool bAtEnd = false;
	bool bAhead = false;
	int nSum = 0;
	for (int i = 0; i &amp;lt; nLen; i++)
	{
		char ch = s.at(i);
		char chN = 'a';
		if (i == nLen - 1)
		{
			bAtEnd = tru...]]></description><category></category></item><item><title><![CDATA[9. 回文数]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/85002894</link><guid>https://blog.youkuaiyun.com/koilin/article/details/85002894</guid><author>koilin</author><pubDate>Fri, 14 Dec 2018 14:12:41 +0800</pubDate><description><![CDATA[

bool Algorithm::isPalindrome(int x)
{
	if (x &amp;lt; 0)
		return false;
	else if (x == 0)
	{
		return true;
	}

	int resX = 0;
	int iLast = 0;
	int iDev = 10;
	int iCount = 0;
	std::vector&amp;lt;int&amp;gt; v...]]></description><category></category></item><item><title><![CDATA[832. 翻转图像]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/84977977</link><guid>https://blog.youkuaiyun.com/koilin/article/details/84977977</guid><author>koilin</author><pubDate>Wed, 12 Dec 2018 19:21:35 +0800</pubDate><description><![CDATA[
std::vector&amp;lt;std::vector&amp;lt;int&amp;gt;&amp;gt; Algorithm::flipAndInvertImage(vector&amp;lt;vector&amp;lt;int&amp;gt;&amp;gt;&amp;amp; A)
{
	vector&amp;lt;vector&amp;lt;int&amp;gt;&amp;gt;::iterator itorArray = A.begin();
	for (; itorArray !...]]></description><category></category></item><item><title><![CDATA[595. 大的国家]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/84977508</link><guid>https://blog.youkuaiyun.com/koilin/article/details/84977508</guid><author>koilin</author><pubDate>Wed, 12 Dec 2018 18:41:56 +0800</pubDate><description><![CDATA[
select name, population, area from World where area &amp;gt; 3000000 or population &amp;gt; 25000000;

 ]]></description><category></category></item><item><title><![CDATA[905. 按奇偶排序数组]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/84977324</link><guid>https://blog.youkuaiyun.com/koilin/article/details/84977324</guid><author>koilin</author><pubDate>Wed, 12 Dec 2018 18:24:55 +0800</pubDate><description><![CDATA[
std::vector&amp;lt;int&amp;gt; Algorithm::sortArrayByParity(vector&amp;lt;int&amp;gt;&amp;amp; A)
{
	vector&amp;lt;int&amp;gt;::iterator itor = A.begin();
	vector&amp;lt;int&amp;gt; vecOdd;
	vector&amp;lt;int&amp;gt; vecEven;
	vector&amp;lt;int&amp;gt...]]></description><category></category></item><item><title><![CDATA[709. 转换成小写字母]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/84976367</link><guid>https://blog.youkuaiyun.com/koilin/article/details/84976367</guid><author>koilin</author><pubDate>Wed, 12 Dec 2018 17:22:35 +0800</pubDate><description><![CDATA[
std::string Algorithm::toLowerCase(string str)
{
	string strNew;
	int nStr = str.length();
	for (int iStr = 0; iStr &amp;lt; nStr; iStr++)
	{
		char ch = str[iStr];
		if (ch &amp;gt;= 'A' &amp;amp;&amp;amp; ch &amp;lt;=...]]></description><category></category></item><item><title><![CDATA[929. 独特的电子邮件地址]]></title><link>https://blog.youkuaiyun.com/koilin/article/details/84966021</link><guid>https://blog.youkuaiyun.com/koilin/article/details/84966021</guid><author>koilin</author><pubDate>Wed, 12 Dec 2018 10:21:39 +0800</pubDate><description><![CDATA[
int Algorithm::numUniqueEmails(vector&amp;lt;string&amp;gt;&amp;amp; emails)
{
	map&amp;lt;string, bool&amp;gt; mapEmail;
	vector&amp;lt;string&amp;gt;::iterator itorEmail = emails.begin();
	for (; itorEmail != emails.end(); it...]]></description><category></category></item></channel></rss>