winner binary

1. /*
   
2.    Generated by EX4-TO-MQ4 decompiler V4.0.224.1 []
   
3.    Website: http://purebeam.biz
   
4.    E-mail : purebeam@gmail.com
   
5. */
   
6. #property copyright "joker Inc.-joker"
   
7. #property link      ""
   
8. 
   
9. #property indicator_chart_window
   
10. #property indicator_buffers 2
    
11. #property indicator_color1 Blue
    
12. #property indicator_color2 Red
    
13. 
    
14. extern int NumBars = 500;
    
15. double g_ibuf_80[];
    
16. double g_ibuf_84[];
    
17. double gd_88;
    
18. 
    
19. int init() {
    
20.    SetIndexStyle(0, DRAW_ARROW);
    
21.    SetIndexBuffer(0, g_ibuf_80);
    
22.    SetIndexArrow(0, 233);
    
23.    SetIndexStyle(1, DRAW_ARROW);
    
24.    SetIndexBuffer(1, g_ibuf_84);
    
25.    SetIndexArrow(1, 234);
    
26.    gd_88 = MarketInfo(Symbol(), MODE_SPREAD) * Point;
    
27.    return (0);
    
28. }
    
29. 
    
30. int deinit() {
    
31.    return (0);
    
32. }
    
33. 
    
34. int start() {
    
35.    double lda_60[100];
    
36. /*  if (AccountNumber() != 122660) {
    
37.       Comment("FORBIDDEN!! :" + AccountNumber() + " You are using the software illegally!");
    
38.       return (0);
    
39.    }
    
40.    Comment("Member:  Gregory S. Kennedy   APPROVED");
    
41. */
    
42.    int l_ind_counted_0 = IndicatorCounted();
    
43.    int li_4 = 7;
    
44.    double ld_8 = 7.0;
    
45.    double ld_16 = 0.7;
    
46.    int li_24 = 0;
    
47.    int li_28 = 0;
    
48.    bool li_32 = TRUE;
    
49.    double ld_36 = 0;
    
50.    double ld_44 = 0;
    
51.    double ld_52 = 0;
    
52.    int l_index_64 = 0;
    
53.    double ld_68 = 0;
    
54.    int l_index_76 = 0;
    
55.    double ld_80 = 0;
    
56.    double ld_unused_88 = 0;
    
57.    double ld_96 = 0;
    
58.    int li_104 = 0;
    
59.    int li_108 = 0;
    
60.    double l_iatr_112 = 0;
    
61.    double ld_120 = 2;
    
62.    double ld_unused_128 = 10;
    
63.    double ld_136 = 0;
    
64.    double ld_144 = 0;
    
65.    double ld_unused_152 = 0;
    
66.    double ld_unused_160 = 0;
    
67.    double ld_unused_168 = 0;
    
68.    double ld_unused_176 = 0;
    
69.    double ld_unused_184 = 0;
    
70.    double ld_unused_192 = 0;
    
71.    double ld_unused_200 = 0;
    
72.    double ld_unused_208 = 0;
    
73.    double ld_unused_216 = 0;
    
74.    double ld_unused_224 = 0;
    
75.    double ld_unused_232 = 0;
    
76.    double ld_unused_240 = 0;
    
77.    double ld_unused_248 = 0;
    
78.    double ld_unused_256 = 0;
    
79.    double ld_unused_264 = 0;
    
80.    double ld_unused_272 = 0;
    
81.    double ld_unused_280 = 0;
    
82.    double ld_unused_288 = 0;
    
83.    double ld_unused_296 = 0;
    
84.    double ld_unused_304 = 0;
    
85.    double ld_unused_312 = 0;
    
86.    double ld_unused_320 = 0;
    
87.    double ld_unused_328 = 0;
    
88.    if (Bars < NumBars) li_24 = Bars;
    
89.    else li_24 = NumBars;
    
90.    if (Close[li_24 - 2] > Close[li_24 - 1]) li_32 = TRUE;
    
91.    else li_32 = FALSE;
    
92.    ld_36 = Close[li_24 - 2];
    
93.    for (li_28 = li_24 - 3; li_28 >= 0; li_28--) {
    
94.       ld_52 = gd_88 + High[li_28] - Low[li_28];
    
95.       if (MathAbs(gd_88 + High[li_28] - (Close[li_28 + 1])) > ld_52) ld_52 = MathAbs(gd_88 + High[li_28] - (Close[li_28 + 1]));
    
96.       if (MathAbs(Low[li_28] - (Close[li_28 + 1])) > ld_52) ld_52 = MathAbs(Low[li_28] - (Close[li_28 + 1]));
    
97.       if (li_28 == li_24 - 3) for (l_index_76 = 0; li_28 <= li_4 - 1; l_index_76++) lda_60[l_index_76] = ld_52;
    
98.       lda_60[l_index_64] = ld_52;
    
99.       ld_68 = 0;
    
100.       ld_80 = li_4;
     
101.       li_108 = l_index_64;
     
102.       for (l_index_76 = 0; l_index_76 <= li_4 - 1; l_index_76++) {
     
103.          ld_68 += lda_60[li_108] * ld_80;
     
104.          ld_80 -= 1.0;
     
105.          li_108--;
     
106.          if (li_108 == -1) li_108 = li_4 - 1;
     
107.       }
     
108.       ld_68 = 2.0 * ld_68 / (ld_8 * (ld_8 + 1.0));
     
109.       l_index_64++;
     
110.       if (l_index_64 == li_4) l_index_64 = 0;
     
111.       ld_44 = ld_16 * ld_68;
     
112.       if (li_32 && Low[li_28] < ld_36 - ld_44) {
     
113.          li_32 = FALSE;
     
114.          ld_36 = gd_88 + High[li_28];
     
115.       }
     
116.       if (!li_32 && gd_88 + High[li_28] > ld_36 + ld_44) {
     
117.          li_32 = TRUE;
     
118.          ld_36 = Low[li_28];
     
119.       }
     
120.       if (li_32 && Low[li_28] > ld_36) ld_36 = Low[li_28];
     
121.       if (!li_32 && gd_88 + High[li_28] < ld_36) ld_36 = gd_88 + High[li_28];
     
122.       l_iatr_112 = iATR(NULL, 0, 10, li_28);
     
123.       ld_136 = 0;
     
124.       ld_144 = 0;
     
125.       if (li_32) {
     
126.          if (li_104 != 1) ld_96 = Low[li_28] - l_iatr_112 * ld_120 / 3.0;
     
127.          if (li_104 == 1) ld_96 = -1.0;
     
128.          if (ld_96 > 0.0) {
     
129.             ld_136 = ld_96;
     
130.             ld_144 = 0;
     
131.          } else {
     
132.             ld_136 = 0;
     
133.             ld_144 = 0;
     
134.          }
     
135.          g_ibuf_80[li_28] = ld_136;
     
136.          li_104 = 1;
     
137.       } else {
     
138.          if (li_104 != 2) ld_96 = gd_88 + High[li_28] + l_iatr_112 * ld_120 / 3.0;
     
139.          if (li_104 == 2) ld_96 = -1.0;
     
140.          if (ld_96 > 0.0) {
     
141.             ld_136 = 0;
     
142.             ld_144 = ld_96;
     
143.          } else {
     
144.             ld_136 = 0;
     
145.             ld_144 = 0;
     
146.          }
     
147.          g_ibuf_84[li_28] = ld_144;
     
148.          li_104 = 2;
     
149.       }
     
150.    }
     
151.    return (0);
     
152. }

复制代码

winner binary.mq4

2018-3-8 15:06

点击文件名下载附件

不错不错，很好哦

前排支持下分享

过来看看的

谢谢楼主分享

谢谢楼主分享

谢谢楼主分享

学习了，不错