Programming candlestick patterns can be exceptionally finicky. If you consider that on any bar there are four data "items", OHLC, so there are 'X' combinations which could result in candle formations. Things just get more compliciated if you assume >, >=, =, <= < comparative possibilities too; then there are the "rules" to be incorporated too...

O > H {illegal}
O >= H {illegal if O>H}
O = H
O <= H
O < H

O > L
O >= L
O = L
O <= L {same as O=L}
O < L {illegal}

O > C
O >= C
O = C
O <= C
O < C

H > L
H >= L {if H=L, then O=H=L=C}
H = L {as above}
H <= L {same as H=L}
H < L {illegal}

etc etc and it just goes on from there!


Add another candle and its 'X' possibilities and multiply this with the previous candle possibilities, leaving a massive matrix of possibilities in a two-bar pattern. There are three-bar and more-bar patterns too! Very few candle patterns have specific defintions; some definitions include vague terms too, like "long body". How long is long? Over what time period is long determined?


Here is a website explaining some of the patterns Nison uses. Look carefully at the required patterns and see if you can code them for yourself: http://solar.murty.net/~murty/candles/