代码拉取完成,页面将自动刷新
同步操作将从 rubikplanet/ChanlunX 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
#include <iostream>
#include <fstream>
#include "Bi.h"
#include "KxianChuLi.h"
#include "BiChuLi.h"
using namespace std;
std::vector<float> Bi1(int nCount, std::vector<float> pHigh, std::vector<float> pLow)
{
std::vector<float> pOut(nCount);
KxianChuLi kxianChuLi;
for (int i = 0; i < nCount; i++)
{
kxianChuLi.add(pHigh[i], pLow[i]);
}
for (unsigned int i = 1; i < kxianChuLi.kxianList.size(); i++)
{
if (kxianChuLi.kxianList.at(i - 1).fangXiang != kxianChuLi.kxianList.at(i).fangXiang)
{
if (kxianChuLi.kxianList.at(i - 1).fangXiang == 1)
{
pOut[kxianChuLi.kxianList.at(i - 1).zhongJian] = 1;
}
else if (kxianChuLi.kxianList.at(i - 1).fangXiang == -1)
{
pOut[kxianChuLi.kxianList.at(i - 1).zhongJian] = -1;
}
}
}
if (kxianChuLi.kxianList.back().fangXiang == 1)
{
pOut[kxianChuLi.kxianList.back().zhongJian] = 1;
}
else if (kxianChuLi.kxianList.back().fangXiang == -1)
{
pOut[kxianChuLi.kxianList.back().zhongJian] = -1;
}
return pOut;
}
std::vector<float> Bi2(int nCount, std::vector<float> pHigh, std::vector<float> pLow)
{
std::vector<float> pOut(nCount);
KxianChuLi kxianChuLi;
for (int i = 0; i < nCount; i++)
{
kxianChuLi.add(pHigh[i], pLow[i]);
}
BiChuLi biChuLi;
biChuLi.handle(kxianChuLi.kxianList);
for (vector<Bi>::iterator iter = biChuLi.biList.begin(); iter != biChuLi.biList.end(); iter++)
{
if ((*iter).fangXiang == 1)
{
pOut[(*iter).kxianList.back().zhongJian] = 1;
}
else if ((*iter).fangXiang == -1)
{
pOut[(*iter).kxianList.back().zhongJian] = -1;
}
}
return pOut;
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。