Function Prototype
/* Vector Round */
/* Type: simple */
/* Input arrays: 1 Options: 0 Output arrays: 1 */
/* Inputs: real */
/* Options: none */
/* Outputs: round */
int ti_round_start(TI_REAL const *options);
int ti_round(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 Round returns the closest integer for each element in the input array. Ties are resolved by taking the largest number.
$$round_{t} = \lfloor input_{t} + 0.5 \rfloor$$
See Also
References
Example Usage
Calling From C
/* Example usage of Vector Round */
/* 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]; /* round */
/* Determine how large the output size is for our options. */
const int out_size = in_size - ti_round_start(options);
/* Allocate memory for output. */
outputs[0] = malloc(sizeof(TI_REAL) * out_size); assert(outputs[0] != 0); /* round */
/* Run the actual calculation. */
const int ret = ti_round(in_size, inputs, options, outputs);
assert(ret == TI_OKAY);
Calling From Lua (with Tulip Chart bindings)
-- Example usage of Vector Round
round = ti.round(input)
Example Calculation
date | input | round |
---|---|---|
2005-11-01 | 81.59 | 82.00 |
2005-11-02 | 81.06 | 81.00 |
2005-11-03 | 82.87 | 83.00 |
2005-11-04 | 83.00 | 83.00 |
2005-11-07 | 83.61 | 84.00 |
2005-11-08 | 83.15 | 83.00 |
2005-11-09 | 82.84 | 83.00 |
2005-11-10 | 83.99 | 84.00 |
2005-11-11 | 84.55 | 85.00 |
2005-11-14 | 84.36 | 84.00 |
2005-11-15 | 85.53 | 86.00 |
2005-11-16 | 86.54 | 87.00 |
2005-11-17 | 86.89 | 87.00 |
2005-11-18 | 87.77 | 88.00 |
2005-11-21 | 87.29 | 87.00 |
Chart
Other Indicators
Previous indicator: Rate of Change Ratio
Next indicator: Relative Strength Index
Random indicator: Average Price
Copyright © 2016-2024 Tulip Charts LLC. All Rights Reserved.