update algirothm_updateiss c++-优快云博客

本文链接：https://blog.youkuaiyun.com/boyxiaolong/article/details/8707869

本文探讨了一段长时间开发过程中的挫折与成长，通过详细解析一个复杂算法的实现，揭示了从初识到理解的艰难历程。从数据结构设计到算法优化，作者分享了其学习与实践的心得，旨在为读者提供一种深入思考问题、克服技术障碍的方法。

搞了这么久，今天才被逼出这个弱智算法，之前大脑去干吗了？

#include <iostream>
#include <map>

using namespace std;

struct Tss
{
	Tss():m_StateNum(0),m_Level(0)
	{
	}
	Tss(int aStateNum, int aLevel):m_StateNum(aStateNum),m_Level(aLevel)
	{
	}
	int m_StateNum;
	int m_Level;
};

std::map<int,Tss> TssMap;
std::map<int,int> IssMap;

int GetPRI(int aState)
{
	//ToDo
	return aState;
}

int GetIssState(int aID)
{
	std::map<int,int>::iterator lIter = IssMap.find(aID);
	if ( lIter != IssMap.end())
	{
		return lIter->second;
	}
	return 0;
}

int GetTssState(int aID)
{
	std::map<int,Tss>::iterator lIter = TssMap.find(aID);
	if ( lIter != TssMap.end())
	{
		return lIter->second.m_StateNum;
	}
	return 0;
}

void UpdateFromTSS(int aID, int aState, int aLevel)
{
	std::map<int,Tss>::iterator lIter = TssMap.find(aID);

	if (lIter != TssMap.end() && lIter->first < aLevel)
	{
		return;
	}

	Tss lTss(aState,aLevel);
	TssMap.insert(std::make_pair(aID,lTss));

	int lActiveState = aState;
	
	int lIssState = GetIssState(aID);
	if (GetPRI(lActiveState) < GetPRI(lIssState))
	{
		lActiveState = lIssState;
	}
	//DoUpdate(lActiveState);
}



void UpdateIss(int aID, int aState, int aLevel)
{
	std::map<int,int>::iterator lIter = IssMap.find(aID);
	if (lIter != IssMap.end() && GetPRI(aState) < GetPRI(lIter->second))
	{
		return;
	}

	IssMap.insert(std::make_pair(aID,aState));

	int lActiveState = aState;

	int lTssState = GetTssState(aID);
	if (GetPRI(lActiveState) < GetPRI(lTssState))
	{
		lActiveState = lTssState;
	}
	//DoUpdate(lActiveState);
}
int main()
{

}