Share strategies & codes & ideas & templates to give back to the FMZ platform and community
This is my life story. Packed function pointers that can be called directly Analysis by K-line The market overbought is measured by comparing the closing position of the K-line itself with the relationship between the two most recent K-lines.
In most cases, we observe price movements only in the form of the closing price or the root K line, how to read the K line and understand the strengths of the multi-spaces in a better way is more in-depth research direction, this study proposes a solution to the problem of the type of K line itself compared with the root K line and the position of the upper and lower K line, as shown in the figure, this study defines the K line into 18 types. There are two main classifications, one is the closing position helps to determine the single K line view, and the second is the closing position comparison helps to determine the related K line view. Combining the six K-line closure relationships with the three K-line closure relationships, a total of 18 K-line strength-to-weakness relationships are obtained. The strongest K-line with multiple heads is coded as 9 and the weakest K-line is coded as -9.
Welcome to cooperate, exchange, learn and progress together~ 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; }
wuhuoyanHow does this work?