1 Star 0 Fork 39

15921567819/ChanlunX

forked from rubikplanet/ChanlunX 
加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
Bi.cpp 1.68 KB
一键复制 编辑 原始数据 按行查看 历史
devdevdevdeep 提交于 2019-03-31 10:56 . save
#include <iostream>
#include <fstream>
#include "Bi.h"
#include "KxianChuLi.h"
#include "BiChuLi.h"
using namespace std;
void Bi1(int nCount, float *pOut, float *pHigh, float *pLow, float *pIgnore) {
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;
}
}
void Bi2(int nCount, float *pOut, float *pHigh, float *pLow, float *pIgnore) {
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;
}
}
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/whosb/ChanlunX.git
git@gitee.com:whosb/ChanlunX.git
whosb
ChanlunX
ChanlunX
master

搜索帮助