|
| 1 | +import { DMI } from '../../src/dmi'; |
| 2 | + |
| 3 | +describe('DMI', () => { |
| 4 | + it('is undefined on first bar', () => { |
| 5 | + const d = new DMI(14, false); |
| 6 | + expect(d.nextValue(10, 8, 9)).toBeUndefined(); |
| 7 | + }); |
| 8 | + |
| 9 | + it('returns plusDI and minusDI as finite numbers when ready', () => { |
| 10 | + const d = new DMI(3, false); |
| 11 | + const highs = [10, 11, 12, 11, 10, 9, 10, 11, 12, 11, 10, 9, 10, 11, 12, 11, 10, 9, 10]; |
| 12 | + const lows = [8, 9, 10, 9, 8, 7, 8, 9, 10, 9, 8, 7, 8, 9, 10, 9, 8, 7, 8]; |
| 13 | + const closes = [9, 10, 11, 10, 9, 8, 9, 10, 11, 10, 9, 8, 9, 10, 11, 10, 9, 8, 9]; |
| 14 | + let last: { plusDI: number; minusDI: number } | undefined; |
| 15 | + for (let i = 0; i < highs.length; i++) { |
| 16 | + const v = d.nextValue(highs[i], lows[i], closes[i]) as |
| 17 | + | { plusDI: number; minusDI: number } |
| 18 | + | undefined; |
| 19 | + if (v) last = v; |
| 20 | + } |
| 21 | + expect(last).toBeDefined(); |
| 22 | + expect(Number.isFinite(last!.plusDI)).toBe(true); |
| 23 | + expect(Number.isFinite(last!.minusDI)).toBe(true); |
| 24 | + }); |
| 25 | + |
| 26 | + it('with ADX includes adx in result', () => { |
| 27 | + const d = new DMI(4, true); |
| 28 | + const h = [10, 12, 11, 10, 12, 11, 10, 12, 11, 10, 12]; |
| 29 | + const l = [8, 9, 8, 7, 9, 8, 7, 9, 8, 7, 9]; |
| 30 | + const c = [9, 11, 9, 8, 11, 9, 8, 11, 9, 8, 11]; |
| 31 | + let last: { adx: number; plusDI: number; minusDI: number } | undefined; |
| 32 | + for (let i = 0; i < h.length; i++) { |
| 33 | + const v = d.nextValue(h[i], l[i], c[i]) as |
| 34 | + | { adx: number; plusDI: number; minusDI: number } |
| 35 | + | undefined; |
| 36 | + if (v && v.adx !== undefined) last = v; |
| 37 | + } |
| 38 | + expect(last).toBeDefined(); |
| 39 | + expect(Number.isFinite(last!.adx)).toBe(true); |
| 40 | + }); |
| 41 | +}); |
0 commit comments