Berbagi strategi & kode & ide & template untuk membalas dengan komunitas di platform FMZ
Kisahnya: Indikator fungsi yang terbungkus, dapat dipanggil langsung Analisis garis K berdasarkan akar Hal ini dilakukan dengan membandingkan posisi penutupan garis K sendiri dengan hubungan dua garis K terbaru.
Dalam kebanyakan kasus, kita hanya melihat pergerakan harga dengan memperhatikan bentuk harga penutupan atau garis K dasar, bagaimana cara membaca garis K dan memahami kekuatan dari ruang-luas yang lebih dalam adalah arah penelitian yang lebih dalam. Penelitian ini menawarkan solusi untuk mengkode kekuatan ruang-luas dengan membandingkan jenis garis K sendiri dengan garis K dasar dan posisi garis K atas dan bawah, seperti yang ditunjukkan pada gambar. Penelitian ini mendefinisikan garis K menjadi 18 jenis. Secara keseluruhan, perbandingan antara 6 hubungan K-line closure dengan 3 hubungan K-line closure menghasilkan total 18 hubungan K-line strength/weakness, dengan kode K-line terkuat multi-headed menjadi 9 dan kode K-line terlemah menjadi -9, dan sisanya berturut-turut dikodekan berdasarkan hubungan kuat/weakness, hasilnya adalah sebagai berikut:
Selamat berkolaborasi, bertukar pengetahuan, belajar bersama untuk maju~ v:haiyanyydss
$.getClosezhubang = function(rds){ var arrclose = []; var arropen = []; var arrhigh = []; var arrlow = []; var arrzhubang = []; for(var i in rds){ arrclose[i] = rds[i].Close; arropen[i] = rds[i].Open; arrhigh[i] = rds[i].High; arrlow[i] = rds[i].Low; if(i>1){ if(arrclose[i] >= arrhigh[i-1]){ if(arrclose[i] >= (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*1.09; }else if(arrclose[i] >= (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*1.08; }else if(arrclose[i] > (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*1.07; }else if(arrclose[i] > (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*1.06; }else if(arrclose[i] <= (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*1.05; }else if(arrclose[i] <= (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*1.04; } } else if(arrclose[i] < arrhigh[i-1] && arrclose[i] > arrlow[i-1]){ if(arrclose[i] >= (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*1.03; }else if(arrclose[i] >= (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*1.02; }else if(arrclose[i] > (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*1.01; }else if(arrclose[i] > (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*0.99; }else if(arrclose[i] <= (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*0.98; }else if(arrclose[i] <= (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*0.97; } } else if(arrclose[i] <= arrlow[i-1]){ if(arrclose[i] >= (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*0.96; }else if(arrclose[i] >= (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*0.95; }else if(arrclose[i] > (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*0.94; }else if(arrclose[i] > (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < (arrhigh[i]-(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*0.93; }else if(arrclose[i] <= (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] >= arropen[i]){ arrzhubang[i] = arrclose[i]*0.92; }else if(arrclose[i] <= (arrlow[i]+(arrhigh[i]-arrlow[i])/3) && arrclose[i] < arropen[i]){ arrzhubang[i] = arrclose[i]*0.91; } } }else{ arrzhubang[i] = arrclose[i]; } } return arrzhubang; }
WuhuanBagaimana caranya?