Homing Pigeon (CDLHOMINGPIGEON)

Summary

Two-candle pattern: a long black candle followed by a small black candle whose real body sits inside the prior body. A hit signals a bullish reversal, most meaningful in a downtrend, which the code does not verify.

Chart

Reference data (CSV) · Chart (SVG)

Chart metadata i

Outputs

• outInteger: pattern_bull_bear · zero · positive

Formula

Two candles at i-1 and i. Both black: close[i-1] < open[i-1] and close[i] < open[i]. First body long: realbody[i-1] > BodyLong average. Second body short: realbody[i] <= BodyShort average. Second body contained by first: open[i] < open[i-1] and close[i] > close[i-1].

Notes

• Does not verify the preceding downtrend that the bullish reversal classically assumes.
• Despite the bullish-reversal label, Bulkowski's testing found this behaves as a bearish continuation 56% of the time — "near random" by his own description — though its overall post-breakout performance rank (21st of 103) is comparatively strong. (thepatternsite.com)

Inputs

• inOpen — Open price of each bar
• inHigh — High price of each bar
• inLow — Low price of each bar
• inClose — Close price of each bar

Outputs

• outInteger — +100 when the pattern is detected, 0 otherwise. Never emits -100 (always bullish)

Output Values

What candlestick values mean: Candlestick Outputs. The function's flags declare which values it can return: rW7.

Value	Meaning
0	No pattern
100	Homing Pigeon detected — a bullish reversal signal, most meaningful after a downtrend (unverified by the function)

Properties

Numerical Stability: Start-Independent

☐ Overlap Input
✅ Independent Y-Axis i
✅ Candlestick i
☐ Display Shift

☐ Can Output NaN or ±Inf
☐ Identity at Period 1
☐ Uses Transcendental
☐ Input Must Be Positive

Example

C

#include <stdio.h>
#include <ta_libc.h>

int n = 252;
double open[252]; /* your data, oldest first */
double high[252]; /* your data, oldest first */
double low[252]; /* your data, oldest first */
double close[252]; /* your data, oldest first */
int out[252];
int outBegIdx, outNBElement;

TA_Initialize();
TA_CDLHOMINGPIGEON( 0, n - 1, open, high, low, close, &outBegIdx, &outNBElement, out );
printf( "%d values from bar %d; last out = %d\n", outNBElement, outBegIdx, out[outNBElement - 1] );

Rust

use ta_lib::Core;

let open = vec![0.0; 252]; // your data, oldest first
let high = vec![0.0; 252]; // your data, oldest first
let low = vec![0.0; 252]; // your data, oldest first
let close = vec![0.0; 252]; // your data, oldest first
let mut out = vec![0i32; 252];

let core = Core::new();
let range = core.cdlhomingpigeon(0, open.len() - 1, &open, &high, &low, &close, &mut out)?;
println!("{} values from bar {}; last out = {}", range.count, range.beg_idx, out[range.count - 1]);

Java

import io.github.talib.Core;
import io.github.talib.OutRange;

double[] open = new double[252]; // your data, oldest first
double[] high = new double[252]; // your data, oldest first
double[] low = new double[252]; // your data, oldest first
double[] close = new double[252]; // your data, oldest first
int[] out = new int[252];

Core core = Core.DEFAULT;
OutRange r = core.cdlhomingpigeon(0, open.length - 1, open, high, low, close, out);
System.out.println(r.count() + " values from bar " + r.begIdx() + "; last out = " + out[r.count() - 1]);

C#

using System;
using TALib;

var open = new double[252]; // your data, oldest first
var high = new double[252]; // your data, oldest first
var low = new double[252]; // your data, oldest first
var close = new double[252]; // your data, oldest first
var outInteger = new int[252];

var core = Core.Default;
OutRange r = core.Cdlhomingpigeon(0, open.Length - 1, open, high, low, close, outInteger);
Console.WriteLine($"{r.Count} values from bar {r.BegIdx}; last outInteger = {outInteger[r.Count - 1]}");

TypeScript

import { cdlhomingpigeon } from 'ta-lib';

const open = new Float64Array(252); // your data, oldest first
const high = new Float64Array(252); // your data, oldest first
const low = new Float64Array(252); // your data, oldest first
const close = new Float64Array(252); // your data, oldest first

const { begIdx, values } = cdlhomingpigeon({ open, high, low, close });
console.log(values.length + ' values from bar ' + begIdx + '; last values = ' + values[values.length - 1]);

Implementation

Added in 0.4.0.

TA-Lib Definition: cdlhomingpigeon.c · cdlhomingpigeon.yaml

Native	File
C	ta_CDLHOMINGPIGEON.c
Rust	cdlhomingpigeon.rs
Java	Core_CDLHOMINGPIGEON.java
C#	Core_CDLHOMINGPIGEON.cs
TypeScript	cdlhomingpigeon.ts

Python: talib.CDLHOMINGPIGEON, see ta-lib-python.

TA-Lib is also available for R and more using a wrapper.

Aliases

Homing Pigeon

See Also

CDLHARAMI · CDLMATCHINGLOW