예스스탁
예스스탁 답변
2020-04-27 16:25:13
안녕하세요
예스스탁입니다.
1 일
input : p1(9),sig(5);
var : TF(0),S1(0),D1(0),TM(0),cnt(0),idx(0);
var : H1(0),L1(0),jh_line(0),sum(0),mav(0);
Array : HH[50](0),LL[50](0),diff[50](999999999);
if Bdate != Bdate[1] Then
{
HH[0] = H;
LL[0] = L;
for cnt = 1 to 49
{
HH[cnt] = HH[cnt-1][1];
LL[cnt] = LL[cnt-1][1];
diff[cnt] = diff[cnt-1][1];
}
}
if HH[0] > 0 and H > HH[0] Then
HH[0] = H;
if LL[0] > 0 and L < LL[0] Then
LL[0] = L;
if HH[p1-1] > 0 and LL[p1-1] > 0 then
{
H1 = HH[0];
L1 = LL[0];
for cnt = 0 to p1-1
{
if HH[cnt] > H1 Then
H1 = HH[cnt];
if LL[cnt] < L1 Then
L1 = LL[cnt];
}
jh_line = (H1 + L1)/2;
diff[0] = C-jh_line;
}
if diff[sig-1] < 999999999 Then
{
sum = 0;
for cnt = 0 to sig-1
{
sum = sum + diff[cnt];
}
mav = sum/sig;
}
2 주
input : p1(9),sig(5);
var : TF(0),S1(0),D1(0),TM(0),cnt(0),idx(0);
var : H1(0),L1(0),jh_line(0),sum(0),mav(0);
Array : HH[50](0),LL[50](0),diff[50](999999999);
if DayOfWeek(bdate) < DayOfWeek(Bdate[1]) Then
{
HH[0] = H;
LL[0] = L;
for cnt = 1 to 49
{
HH[cnt] = HH[cnt-1][1];
LL[cnt] = LL[cnt-1][1];
diff[cnt] = diff[cnt-1][1];
}
}
if HH[0] > 0 and H > HH[0] Then
HH[0] = H;
if LL[0] > 0 and L < LL[0] Then
LL[0] = L;
if HH[p1-1] > 0 and LL[p1-1] > 0 then
{
H1 = HH[0];
L1 = LL[0];
for cnt = 0 to p1-1
{
if HH[cnt] > H1 Then
H1 = HH[cnt];
if LL[cnt] < L1 Then
L1 = LL[cnt];
}
jh_line = (H1 + L1)/2;
diff[0] = C-jh_line;
}
if diff[sig-1] < 999999999 Then
{
sum = 0;
for cnt = 0 to sig-1
{
sum = sum + diff[cnt];
}
mav = sum/sig;
}
3 월
input : p1(9),sig(5);
var : TF(0),S1(0),D1(0),TM(0),cnt(0),idx(0);
var : H1(0),L1(0),jh_line(0),sum(0),mav(0);
Array : HH[50](0),LL[50](0),diff[50](999999999);
if bdate > Bdate[1]+30 Then
{
HH[0] = H;
LL[0] = L;
for cnt = 1 to 49
{
HH[cnt] = HH[cnt-1][1];
LL[cnt] = LL[cnt-1][1];
diff[cnt] = diff[cnt-1][1];
}
}
if HH[0] > 0 and H > HH[0] Then
HH[0] = H;
if LL[0] > 0 and L < LL[0] Then
LL[0] = L;
if HH[p1-1] > 0 and LL[p1-1] > 0 then
{
H1 = HH[0];
L1 = LL[0];
for cnt = 0 to p1-1
{
if HH[cnt] > H1 Then
H1 = HH[cnt];
if LL[cnt] < L1 Then
L1 = LL[cnt];
}
jh_line = (H1 + L1)/2;
diff[0] = C-jh_line;
}
if diff[sig-1] < 999999999 Then
{
sum = 0;
for cnt = 0 to sig-1
{
sum = sum + diff[cnt];
}
mav = sum/sig;
}
즐거운 하루되세요
> 뮬리 님이 쓴 글입니다.
> 제목 : 부탁 드립니다.
> 도움에 감사 드립니다.
타주기(타분봉용) 지표가
1)일봉지표가
2)주봉지표가
3)월봉지표가 분봉에 나타 나도록 부탁 드립니다.
input : Ntime1(60),p1(9),sig(5);
var : TF(0),S1(0),D1(0),TM(0),cnt(0),idx(0);
var : H1(0),L1(0),jh_line(0),sum(0),mav(0);
Array : HH[50](0),LL[50](0),diff[50](999999999);
if Bdate != Bdate[1] Then{
S1 = TimeToMinutes(stime);
D1 = sdate;
}
if D1 > 0 then{
if sdate == D1 Then
TM = TimeToMinutes(stime)-S1;
Else
TM = TimeToMinutes(stime)+1440-S1;
TF = TM%ntime1;
if Bdate != Bdate[1] or (Bdate == Bdate[1] and TF < TF[1]) Then
{
HH[0] = H;
LL[0] = L;
for cnt = 1 to 49
{
HH[cnt] = HH[cnt-1][1];
LL[cnt] = LL[cnt-1][1];
diff[cnt] = diff[cnt-1][1];
}
}
if H > HH[0] Then
HH[0] = H;
if L < LL[0] Then
LL[0] = L;
if HH[p1-1] > 0 and LL[p1-1] > 0 then
{
H1 = HH[0];
L1 = LL[0];
for cnt = 0 to p1-1
{
if HH[cnt] > H1 Then
H1 = HH[cnt];
if LL[cnt] < L1 Then
L1 = LL[cnt];
}
jh_line = (H1 + L1)/2;
diff[0] = C-jh_line;
}
if diff[sig-1] < 999999999 Then
{
sum = 0;
for cnt = 0 to sig-1
{
sum = sum + diff[cnt];
}
mav = sum/sig;
}
}