안녕하세요 예스스탁입니다. input:left(5),right(5),구분(1); var:j(0),prehv(0),prelv(0),prehb(0),prelb(0),tmpv(0),tmpb(0), ovr(0),반등(1),반락(-1); array:hv[10](0),lv[10](0),hb[10](0),lb[10](0), r[8](0),fr[8](0); r[0] = 0; r[1] = 0.236; r[2] = 0.382; r[3] = 0.50; r[4] = 0.618; r[5] = 0.764; r[6] = 1; r[7] = 1.618; #==============================================================================# # 변곡점 계산 #==============================================================================# //파동선 작성 설명은 자주 했으므로 생략 if highest(h[1],left) <= h then { prehv = h; prehb = 0; } else prehb = prehb + 1; if lowest(l[1],left) >= l then { prelv = l; prelb = 0; } else prelb = prelb + 1; for j = 1 to 9 begin hb[j] = hb[j] + 1; lb[j] = lb[j] + 1; end; if prehb == right and highest(h,right) <= h[right] then { for j = 9 downto 2 { hv[j] = hv[j-1]; hb[j] = hb[j-1]; } hv[1] = prehv; hb[1] = prehb; if lb[1] > hb[2] then { for j = 9 downto 2 { lv[j] = lv[j-1]; lb[j] = lb[j-1]; } tmpv = 0; for j = hb[1] + 1 to hb[2] - 1 { if tmpv > l[j] or tmpv ==0 then { tmpv = l[j]; tmpb = j; } } lv[1] = tmpv; lb[1] = tmpb; } } if prelb == right and lowest(l,right) >= l[right] then { for j = 9 downto 2 { lv[j] = lv[j-1]; lb[j] = lb[j-1]; } lv[1] = prelv; lb[1] = prelb; if hb[1] > lb[2] then { for j = 9 downto 2 { hv[j] = hv[j-1]; hb[j] = hb[j-1]; } tmpv = 0; for j = lb[1] + 1 to lb[2] - 1 { if tmpv < h[j] or tmpv ==0 then { tmpv = h[j]; tmpb = j; } } hv[1] = tmpv; hb[1] = tmpb; } } #==============================================================================# # Fibonacci Retracements 계산 #==============================================================================# //반등과 반락을 모두 표시하게 되면 복잡해지므로 한 방향만 표시하는 것이 옳음 if 구분 == 반등 then { if crossup(lb[1],hb[1]) then { for j = 0 to 7 begin fr[j] = hv[1] - (hv[1] - lv[1]) * r[j]; end; ovr = 0; } if fr[6]>l then ovr = 1; } if 구분 == 반락 then { if crossup(hb[1],lb[1]) then { for j = 0 to 7 begin fr[j] = lv[1] + (hv[1] - lv[1]) * r[j]; end; ovr = 0; } if fr[6]>l then ovr = 1; } #==============================================================================# # 지표출력 #==============================================================================# if hb[1]==right then plot1(hv[1],"파동선",GREEN); if crossup(c,fr[0]) or crossup(c,fr[1]) or crossup(c,fr[2]) or crossup(c,fr[3]) or crossup(c,fr[4]) or crossup(c,fr[5]) or crossup(c,fr[6]) Then buy(); if crossdown(c,fr[0]) or CrossDown(c,fr[1]) or CrossDown(c,fr[2]) or CrossDown(c,fr[3]) or CrossDown(c,fr[4]) or CrossDown(c,fr[5]) or CrossDown(c,fr[6]) Then sell(); 즐거운 하루되세요 > yang오뚜기 님이 쓴 글입니다. > 제목 : 시스템 으로하면? > 안녕하세요 질문1 아래수식은&nbsp;SwingHigh와&nbsp;SwingLow에&nbsp;의해&nbsp;파동선이&nbsp;그려지고&nbsp;그&nbsp;파동&nbsp;높이를&nbsp;근간으로&nbsp;피보나치&nbsp;라인을&nbsp;그리는&nbsp;지표식입니다. 반등과&nbsp;반락을&nbsp;하나의&nbsp;차트에&nbsp;모두&nbsp;표시하게&nbsp;되면&nbsp;복잡해서&nbsp;알아볼&nbsp;수&nbsp;없으므로&nbsp;구분자를&nbsp;통해&nbsp;한방향만&nbsp;지표로&nbsp;출력토록&nbsp;해&nbsp;보았습니다.&nbsp; ##. 지표식 input:left(5),right(5),구분(1); var:j(0),prehv(0),prelv(0),prehb(0),prelb(0),tmpv(0),tmpb(0), &nbsp;&nbsp;&nbsp;&nbsp;ovr(0),반등(1),반락(-1); array:hv[10](0),lv[10](0),hb[10](0),lb[10](0), &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;r[8](0),fr[8](0); &nbsp; r[0]&nbsp;=&nbsp;0; r[1]&nbsp;=&nbsp;0.236; r[2]&nbsp;=&nbsp;0.382; r[3]&nbsp;=&nbsp;0.50; r[4]&nbsp;=&nbsp;0.618; r[5]&nbsp;=&nbsp;0.764; r[6]&nbsp;=&nbsp;1; r[7]&nbsp;=&nbsp;1.618; &nbsp; #==============================================================================# #&nbsp;변곡점&nbsp;계산 #==============================================================================# &nbsp; //파동선&nbsp;작성&nbsp;설명은&nbsp;자주&nbsp;했으므로&nbsp;생략 &nbsp; if&nbsp;highest(h[1],left)&nbsp;<=&nbsp;h&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;prehv&nbsp;=&nbsp;h; &nbsp;&nbsp;&nbsp;prehb&nbsp;=&nbsp;0; &nbsp;&nbsp;&nbsp;} else &nbsp;&nbsp;&nbsp;prehb&nbsp;=&nbsp;prehb&nbsp;+&nbsp;1;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; if&nbsp;lowest(l[1],left)&nbsp;>=&nbsp;l&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;prelv&nbsp;=&nbsp;l; &nbsp;&nbsp;&nbsp;prelb&nbsp;=&nbsp;0; &nbsp;&nbsp;&nbsp;} else &nbsp;&nbsp;&nbsp;prelb&nbsp;=&nbsp;prelb&nbsp;+&nbsp;1;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; for&nbsp;j&nbsp;=&nbsp;1&nbsp;to&nbsp;9&nbsp;begin &nbsp;&nbsp;&nbsp;&nbsp;hb[j]&nbsp;=&nbsp;hb[j]&nbsp;+&nbsp;1; &nbsp;&nbsp;&nbsp;&nbsp;lb[j]&nbsp;=&nbsp;lb[j]&nbsp;+&nbsp;1; end; &nbsp; if&nbsp;prehb&nbsp;==&nbsp;right&nbsp;and&nbsp;highest(h,right)&nbsp;<=&nbsp;h[right]&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;9&nbsp;downto&nbsp;2&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hv[j]&nbsp;=&nbsp;hv[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hb[j]&nbsp;=&nbsp;hb[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;hv[1]&nbsp;=&nbsp;prehv; &nbsp;&nbsp;&nbsp;hb[1]&nbsp;=&nbsp;prehb; &nbsp; &nbsp;&nbsp;&nbsp;if&nbsp;lb[1]&nbsp;>&nbsp;hb[2]&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;9&nbsp;downto&nbsp;2&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;lv[j]&nbsp;=&nbsp;lv[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;lb[j]&nbsp;=&nbsp;lb[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpv&nbsp;=&nbsp;0; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;hb[1]&nbsp;+&nbsp;1&nbsp;to&nbsp;hb[2]&nbsp;-&nbsp;1&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;tmpv&nbsp;>&nbsp;l[j]&nbsp;or&nbsp;tmpv&nbsp;==0&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;tmpv&nbsp;=&nbsp;l[j]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpb&nbsp;=&nbsp;j; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;lv[1]&nbsp;=&nbsp;tmpv; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;lb[1]&nbsp;=&nbsp;tmpb; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;} &nbsp; if&nbsp;prelb&nbsp;==&nbsp;right&nbsp;and&nbsp;lowest(l,right)&nbsp;>=&nbsp;l[right]&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;9&nbsp;downto&nbsp;2&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;lv[j]&nbsp;=&nbsp;lv[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;lb[j]&nbsp;=&nbsp;lb[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;lv[1]&nbsp;=&nbsp;prelv; &nbsp;&nbsp;&nbsp;lb[1]&nbsp;=&nbsp;prelb; &nbsp; &nbsp;&nbsp;&nbsp;if&nbsp;hb[1]&nbsp;>&nbsp;lb[2]&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;9&nbsp;downto&nbsp;2&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hv[j]&nbsp;=&nbsp;hv[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hb[j]&nbsp;=&nbsp;hb[j-1]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpv&nbsp;=&nbsp;0; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;lb[1]&nbsp;+&nbsp;1&nbsp;to&nbsp;lb[2]&nbsp;-&nbsp;1&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;tmpv&nbsp;<&nbsp;h[j]&nbsp;or&nbsp;tmpv&nbsp;==0&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;tmpv&nbsp;=&nbsp;h[j]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpb&nbsp;=&nbsp;j; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hv[1]&nbsp;=&nbsp;tmpv; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hb[1]&nbsp;=&nbsp;tmpb; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;} &nbsp; #==============================================================================# #&nbsp;Fibonacci&nbsp;Retracements&nbsp;계산 #==============================================================================# //반등과&nbsp;반락을&nbsp;모두&nbsp;표시하게&nbsp;되면&nbsp;복잡해지므로&nbsp;한&nbsp;방향만&nbsp;표시하는&nbsp;것이&nbsp;옳음 &nbsp; if&nbsp;구분&nbsp;==&nbsp;반등&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;if&nbsp;crossup(lb[1],hb[1])&nbsp;then &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;0&nbsp;to&nbsp;7&nbsp;begin &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;fr[j]&nbsp;=&nbsp;hv[1]&nbsp;-&nbsp;(hv[1]&nbsp;-&nbsp;lv[1])&nbsp;*&nbsp;r[j]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;end; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ovr&nbsp;=&nbsp;0; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;if&nbsp;fr[6]>l&nbsp;then&nbsp;ovr&nbsp;=&nbsp;1; &nbsp;&nbsp;&nbsp;} &nbsp; if&nbsp;구분&nbsp;==&nbsp;반락&nbsp;then&nbsp;{ &nbsp;&nbsp;&nbsp;if&nbsp;crossup(hb[1],lb[1])&nbsp;then &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;j&nbsp;=&nbsp;0&nbsp;to&nbsp;7&nbsp;begin &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;fr[j]&nbsp;=&nbsp;lv[1]&nbsp;+&nbsp;(hv[1]&nbsp;-&nbsp;lv[1])&nbsp;*&nbsp;r[j]; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;end; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ovr&nbsp;=&nbsp;0; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;if&nbsp;fr[6]>l&nbsp;then&nbsp;ovr&nbsp;=&nbsp;1; &nbsp;&nbsp;&nbsp;} &nbsp; #==============================================================================# #&nbsp;지표출력 #==============================================================================# if&nbsp;hb[1]==right&nbsp;then&nbsp;plot1(hv[1],"파동선",GREEN); if&nbsp;lb[1]==right&nbsp;then&nbsp;plot1(lv[1],"파동선",GREEN); &nbsp; plot2(fr[0],"0%",BLUE); plot3(fr[1],"23.6%",RED); plot4(fr[2],"38.2%",MAGENTA); plot5(fr[3],"50%",GRAY); plot6(fr[4],"61.8%",LBLUE); plot7(fr[5],"76.4%",LGREEN); plot8(fr[6],"100%",PINK); if&nbsp;ovr&nbsp;then&nbsp;plot9(fr[7],"161.8%",LMAGENTA);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//점&nbsp;그래프로&nbsp;표시 위. 지표 를 시스템식으로.요청 방법은. 아래와같이 부탁해요 plot1 ,plot2 , plot3, plot4, plot5, plot6, plot7, plot8, plot9, 가.있습니다. 각각. 어느한개가. 상승돌파 하면. 매수 각각. 어느한개가. 하락 돌파하면. 매도 감사^^