代码拉取完成,页面将自动刷新
同步操作将从 rubikplanet/ChanlunX 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
#include "Main.h"
#include <iostream>
#include <fstream>
using namespace std;
//定义DLL程序的入口函数
BOOL APIENTRY DllMain( HANDLE hModule, DWORD ul_reason_for_call, LPVOID lpReserved)
{
switch (ul_reason_for_call)
{
case DLL_PROCESS_ATTACH:
case DLL_THREAD_ATTACH:
case DLL_THREAD_DETACH:
case DLL_PROCESS_DETACH:
break;
}
return TRUE;
}
//=============================================================================
// 输出函数1号:输出简笔顶底端点
//=============================================================================
void Func1(int nCount, float *pOut, float *pHigh, float *pLow, float *pIgnore)
{
Bi1(nCount, pOut, pHigh, pLow, pIgnore);
}
//=============================================================================
// 输出函数2号:输出标准笔顶底端点
//=============================================================================
void Func2(int nCount, float *pOut, float *pHigh, float *pLow, float *pIgnore)
{
Bi2(nCount, pOut, pHigh, pLow, pIgnore);
}
//=============================================================================
// 输出函数3号:输出段的端点标准画法
//=============================================================================
void Func3(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow)
{
Duan1(nCount, pOut, pIn, pHigh, pLow);
}
//=============================================================================
// 输出函数4号:输出段的端点1+1终结画法
//=============================================================================
void Func4(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow)
{
Duan2(nCount, pOut, pIn, pHigh, pLow);
}
//=============================================================================
// 输出函数5号:中枢高点数据
//=============================================================================
void Func5(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow)
{
ZhongShu ZhongShuOne;
for (int i = 0; i < nCount; i++)
{
if (pIn[i] == 1)
{
// 遇到线段高点,推入中枢算法
if (ZhongShuOne.PushHigh(i, pHigh[i]))
{
bool bValid = true;
float fHighValue;
int nHignIndex;
int nLowIndex;
int nLowIndexTemp;
int nHighCount = 0;
if (ZhongShuOne.nDirection == 1 && ZhongShuOne.nTerminate == -1) // 向上中枢被向下终结
{
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == 1)
{
if (nHighCount == 0)
{
nHighCount++;
fHighValue = pHigh[x];
nHignIndex = x;
}
else
{
nHighCount++;
if (pHigh[x] >= fHighValue)
{
if (nHighCount > 2)
{
bValid = true;
}
fHighValue = pHigh[x];
nHignIndex = x;
nLowIndex = nLowIndexTemp;
}
}
}
else if (pIn[x] == -1)
{
nLowIndexTemp = x;
}
}
if (bValid)
{
ZhongShuOne.nEnd = nLowIndex; // 中枢结束点移到最高点的前一个低点。
}
i = nHignIndex - 1;
}
else
{
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 区段内更新算得的中枢高数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = ZhongShuOne.fHigh;
}
}
ZhongShuOne.Reset();
}
}
else if (pIn[i] == -1)
{
// 遇到线段低点,推入中枢算法
if (ZhongShuOne.PushLow(i, pLow[i]))
{
bool bValid = true;
float fLowValue;
int nLowIndex;
int nHighIndex;
int nHighIndexTemp;
int nLowCount = 0;
if (ZhongShuOne.nDirection == -1 && ZhongShuOne.nTerminate == 1) // 向下中枢被向上终结
{
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == -1)
{
if (nLowCount == 0)
{
nLowCount++;
fLowValue = pLow[x];
nLowIndex = x;
}
else
{
nLowCount++;
if (pLow[x] <= fLowValue)
{
if (nLowCount > 2)
{
bValid = true;
}
fLowValue = pLow[x];
nLowIndex = x;
nHighIndex = nHighIndexTemp;
}
}
}
else if (pIn[x] == 1)
{
nHighIndexTemp = x;
}
}
if (bValid)
{
ZhongShuOne.nEnd = nHighIndex; // 中枢结束点移到最高点的前一个低点。
}
i = nLowIndex - 1;
}
else
{
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 区段内更新算得的中枢高数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = ZhongShuOne.fHigh;
}
}
ZhongShuOne.Reset();
}
}
}
if (ZhongShuOne.bValid) // 最后一个还没有被终结的中枢。
{
// 区段内更新算得的中枢高数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = ZhongShuOne.fHigh;
}
}
}
//=============================================================================
// 输出函数6号:中枢低点数据
//=============================================================================
void Func6(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow)
{
ZhongShu ZhongShuOne;
for (int i = 0; i < nCount; i++)
{
if (pIn[i] == 1)
{
// 遇到线段高点,推入中枢算法
if (ZhongShuOne.PushHigh(i, pHigh[i]))
{
bool bValid = true;
float fHighValue;
int nHignIndex;
int nLowIndex;
int nLowIndexTemp;
int nHighCount = 0;
if (ZhongShuOne.nDirection == 1 && ZhongShuOne.nTerminate == -1) // 向上中枢被向下终结
{
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == 1)
{
if (nHighCount == 0)
{
nHighCount++;
fHighValue = pHigh[x];
nHignIndex = x;
}
else
{
nHighCount++;
if (pHigh[x] >= fHighValue)
{
if (nHighCount > 2)
{
bValid = true;
}
fHighValue = pHigh[x];
nHignIndex = x;
nLowIndex = nLowIndexTemp;
}
}
}
else if (pIn[x] == -1)
{
nLowIndexTemp = x;
}
}
if (bValid)
{
ZhongShuOne.nEnd = nLowIndex; // 中枢结束点移到最高点的前一个低点。
}
i = nHignIndex - 1;
}
else
{
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 区段内更新算得的中枢低数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = ZhongShuOne.fLow;
}
}
ZhongShuOne.Reset();
}
}
else if (pIn[i] == -1)
{
// 遇到线段低点,推入中枢算法
if (ZhongShuOne.PushLow(i, pLow[i]))
{
bool bValid = true;
float fLowValue;
int nLowIndex;
int nHighIndex;
int nHighIndexTemp;
int nLowCount = 0;
if (ZhongShuOne.nDirection == -1 && ZhongShuOne.nTerminate == 1) // 向下中枢被向上终结
{
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == -1)
{
if (nLowCount == 0)
{
nLowCount++;
fLowValue = pLow[x];
nLowIndex = x;
}
else
{
nLowCount++;
if (pLow[x] <= fLowValue)
{
if (nLowCount > 2)
{
bValid = true;
}
fLowValue = pLow[x];
nLowIndex = x;
nHighIndex = nHighIndexTemp;
}
}
}
else if (pIn[x] == 1)
{
nHighIndexTemp = x;
}
}
if (bValid)
{
ZhongShuOne.nEnd = nHighIndex; // 中枢结束点移到最高点的前一个低点。
}
i = nLowIndex - 1;
}
else
{
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 区段内更新算得的中枢低数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = ZhongShuOne.fLow;
}
}
ZhongShuOne.Reset();
}
}
}
if (ZhongShuOne.bValid)
{
// 区段内更新算得的中枢低数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = ZhongShuOne.fLow;
}
}
}
//=============================================================================
// 输出函数7号:中枢起点、终点信号
//=============================================================================
void Func7(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow)
{
//std::ofstream fout;
//fout.open("D:\\CHANLUN.TXT", std::ofstream::out);
ZhongShu ZhongShuOne;
for (int i = 0; i < nCount; i++)
{
if (pIn[i] == 1)
{
// 遇到线段高点,推入中枢算法
if (ZhongShuOne.PushHigh(i, pHigh[i]))
{
//fout<<"中枢终结"<<pHigh[i]<<endl;
bool bValid = true;
float fHighValue;
int nHignIndex;
int nLowIndex;
int nLowIndexTemp;
int nHighCount = 0;
if (ZhongShuOne.nDirection == 1 && ZhongShuOne.nTerminate == -1) // 向上中枢被向下终结
{
//fout<<"向上中枢被向下终结"<<endl;
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == 1)
{
if (nHighCount == 0)
{
nHighCount++;
fHighValue = pHigh[x];
nHignIndex = x;
}
else
{
nHighCount++;
if (pHigh[x] >= fHighValue)
{
if (nHighCount > 2)
{
bValid = true;
}
fHighValue = pHigh[x];
nHignIndex = x;
nLowIndex = nLowIndexTemp;
}
}
}
else if (pIn[x] == -1)
{
nLowIndexTemp = x;
}
}
if (bValid)
{
//fout<<"同级别分解保留最后中枢"<<endl;
//fout<<"中枢结束点移到"<<pLow[nLowIndex]<<endl;
ZhongShuOne.nEnd = nLowIndex; // 中枢结束点移到最高点的前一个低点。
}
else
{
//fout<<"同级别分解最后中枢无效"<<endl;
}
i = nHignIndex - 1;
}
else
{
//fout<<"向下中枢被向下终结"<<endl;
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 进行标记
pOut[ZhongShuOne.nStart + 1] = 1;
pOut[ZhongShuOne.nEnd - 1] = 2;
}
ZhongShuOne.Reset();
}
}
else if (pIn[i] == -1)
{
// 遇到线段低点,推入中枢算法
if (ZhongShuOne.PushLow(i, pLow[i]))
{
//fout<<"中枢终结"<<pHigh[i]<<endl;
bool bValid = true;
float fLowValue;
int nLowIndex;
int nHighIndex;
int nHighIndexTemp;
int nLowCount = 0;
if (ZhongShuOne.nDirection == -1 && ZhongShuOne.nTerminate == 1) // 向下中枢被向上终结
{
//fout<<"向下中枢被向上终结"<<endl;
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == -1)
{
if (nLowCount == 0)
{
nLowCount++;
fLowValue = pLow[x];
nLowIndex = x;
}
else
{
nLowCount++;
if (pLow[x] <= fLowValue)
{
if (nLowCount > 2)
{
bValid = true;
}
fLowValue = pLow[x];
nLowIndex = x;
nHighIndex = nHighIndexTemp;
}
}
//fout<<"低点数量"<<nLowCount<<endl;
}
else if (pIn[x] == 1)
{
nHighIndexTemp = x;
}
}
if (bValid)
{
//fout<<"同级别分解保留最后中枢"<<endl;
//fout<<"中枢结束点移到"<<pHigh[nHighIndex]<<endl;
ZhongShuOne.nEnd = nHighIndex; // 中枢结束点移到最高点的前一个低点。
}
else
{
//fout<<"同级别分解最后中枢无效"<<endl;
}
i = nLowIndex - 1;
}
else
{
//fout<<"向上中枢被向上终结"<<endl;
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 进行标记
pOut[ZhongShuOne.nStart + 1] = 1;
pOut[ZhongShuOne.nEnd - 1] = 2;
}
ZhongShuOne.Reset();
}
}
}
if (ZhongShuOne.bValid)
{
// 进行标记
pOut[ZhongShuOne.nStart + 1] = 1;
pOut[ZhongShuOne.nEnd - 1] = 2;
}
//fout.close();
}
//=============================================================================
// 输出函数8号:中枢方向数据
//=============================================================================
void Func8(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow)
{
ZhongShu ZhongShuOne;
for (int i = 0; i < nCount; i++)
{
if (pIn[i] == 1)
{
// 遇到线段高点,推入中枢算法
if (ZhongShuOne.PushHigh(i, pHigh[i]))
{
bool bValid = true;
float fHighValue;
int nHignIndex;
int nLowIndex;
int nLowIndexTemp;
int nHighCount = 0;
if (ZhongShuOne.nDirection == 1 && ZhongShuOne.nTerminate == -1) // 向上中枢被向下终结
{
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == 1)
{
if (nHighCount == 0)
{
nHighCount++;
fHighValue = pHigh[x];
nHignIndex = x;
}
else
{
nHighCount++;
if (pHigh[x] >= fHighValue)
{
if (nHighCount > 2)
{
bValid = true;
}
fHighValue = pHigh[x];
nHignIndex = x;
nLowIndex = nLowIndexTemp;
}
}
}
else if (pIn[x] == -1)
{
nLowIndexTemp = x;
}
}
if (bValid)
{
ZhongShuOne.nEnd = nLowIndex; // 中枢结束点移到最高点的前一个低点。
}
i = nHignIndex - 1;
}
else
{
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 区段内更新算得的中枢方向数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = (float) ZhongShuOne.nDirection;
}
}
ZhongShuOne.Reset();
}
}
else if (pIn[i] == -1)
{
// 遇到线段低点,推入中枢算法
if (ZhongShuOne.PushLow(i, pLow[i]))
{
bool bValid = true;
float fLowValue;
int nLowIndex;
int nHighIndex;
int nHighIndexTemp;
int nLowCount = 0;
if (ZhongShuOne.nDirection == -1 && ZhongShuOne.nTerminate == 1) // 向下中枢被向上终结
{
bValid = false;
for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++)
{
if (pIn[x] == -1)
{
if (nLowCount == 0)
{
nLowCount++;
fLowValue = pLow[x];
nLowIndex = x;
}
else
{
nLowCount++;
if (pLow[x] <= fLowValue)
{
if (nLowCount > 2)
{
bValid = true;
}
fLowValue = pLow[x];
nLowIndex = x;
nHighIndex = nHighIndexTemp;
}
}
}
else if (pIn[x] == 1)
{
nHighIndexTemp = x;
}
}
if (bValid)
{
ZhongShuOne.nEnd = nHighIndex; // 中枢结束点移到最高点的前一个低点。
}
i = nLowIndex - 1;
}
else
{
i = ZhongShuOne.nEnd - 1;
}
if (bValid)
{
// 区段内更新算得的中枢方向数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = (float) ZhongShuOne.nDirection;
}
}
ZhongShuOne.Reset();
}
}
}
if (ZhongShuOne.bValid)
{
// 区段内更新算得的中枢方向数据
for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++)
{
pOut[j] = (float) ZhongShuOne.nDirection;
}
}
}
static PluginTCalcFuncInfo Info[] =
{
{ 1, &Func1},
{ 2, &Func2},
{ 3, &Func3},
{ 4, &Func4},
{ 5, &Func5},
{ 6, &Func6},
{ 7, &Func7},
{ 8, &Func8},
{ 0, NULL}
};
BOOL RegisterTdxFunc(PluginTCalcFuncInfo **pInfo)
{
if (*pInfo == NULL)
{
*pInfo = Info;
return TRUE;
}
return FALSE;
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。