Function Prototype
/* Vector Tangent */
/* Type: simple */
/* Input arrays: 1 Options: 0 Output arrays: 1 */
/* Inputs: real */
/* Options: none */
/* Outputs: tan */
int ti_tan_start(TI_REAL const *options);
int ti_tan(int size,
TI_REAL const *const *inputs,
TI_REAL const *options,
TI_REAL *const *outputs);
Description
This documentation is still a work in progress. It has omissions, and it probably has errors too. If you see any issues, or have any general feedback, please get in touch.
Vector Tangent calculates the Trigonometric tangent of each element in the input array.
$$tan_{t} = \tan{input_{t}}$$
This is sometimes useful as a building block to more complex functions.
See Also
References
Example Usage
Calling From C
/* Example usage of Vector Tangent */
/* Assuming that 'input' is a pre-loaded array of size 'in_size'. */
TI_REAL *inputs[] = {input};
TI_REAL options[] = {}; /* No options */
TI_REAL *outputs[1]; /* tan */
/* Determine how large the output size is for our options. */
const int out_size = in_size - ti_tan_start(options);
/* Allocate memory for output. */
outputs[0] = malloc(sizeof(TI_REAL) * out_size); assert(outputs[0] != 0); /* tan */
/* Run the actual calculation. */
const int ret = ti_tan(in_size, inputs, options, outputs);
assert(ret == TI_OKAY);
Calling From Lua (with Tulip Chart bindings)
-- Example usage of Vector Tangent
tan = ti.tan(input)
Example Calculation
date | input | tan |
---|---|---|
2005-11-01 | 81.59 | -0.09 |
2005-11-02 | 81.06 | -0.72 |
2005-11-03 | 82.87 | 2.49 |
2005-11-04 | 83.00 | 3.88 |
2005-11-07 | 83.61 | -2.68 |
2005-11-08 | 83.15 | 9.75 |
2005-11-09 | 82.84 | 2.29 |
2005-11-10 | 83.99 | -1.10 |
2005-11-11 | 84.55 | -0.28 |
2005-11-14 | 84.36 | -0.50 |
2005-11-15 | 85.53 | 0.85 |
2005-11-16 | 86.54 | -6.79 |
2005-11-17 | 86.89 | -1.85 |
2005-11-18 | 87.77 | -0.20 |
2005-11-21 | 87.29 | -0.80 |
Chart
Other Indicators
Previous indicator: Sum Over Period
Next indicator: Vector Hyperbolic Tangent
Random indicator: Rate of Change
Copyright © 2016-2024 Tulip Charts LLC. All Rights Reserved.