8a103ef920
* feat(data-layer): TickAggregator in Node, WASM, Python + C ABI hub First data-layer feature (F2): roll trade ticks up into fixed-timeframe OHLCV candles, exposed natively and over the C ABI. - wickra-data wired as a binding dependency (workspace dep; its wickra-core dep is default-features=false so it never forces rayon into the rayon-free WASM build — native bindings re-enable parallel through their own dependency). - Node `TickAggregator(bucket, gapFill?)` -> `push(price, size, ts): Candle[]`; WASM the same (array of objects); Python `push(...) -> list[tuple]`. - C ABI: `WickraCandle` struct + `wickra_tick_aggregator_new/push/free` (push writes candles into a caller buffer and returns the count), generated via the capi generator's new DATA_LAYER section; cbindgen now parses wickra-data so `TickAggregator` is a forward-declared opaque; header vendored to bindings/go. Verified bit-identical across Node/WASM/Python/C/C++ (o=100 h=101 l=100 c=101 v=3 ts=0 for the shared 3-tick probe). WIP: Go/C#/Java/R generated bindings and the cross-language golden are still pending. * feat(data-layer): TickAggregator in Go, C#, Java, R (lossless push/drain) Complete F2 across all 10 languages: the C-ABI tick aggregator now uses a two-step push/drain so gap-fill candles are never lost, and the four generated bindings expose it idiomatically. - C ABI redesigned: opaque TickAggregator handle (inner aggregator + pending buffer); push consumes a tick and returns the closed-candle count, drain copies them into a count-sized caller buffer. - Go: NewTickAggregator + Push(price,size,ts) []Candle; C#: TickAggregator + Candle[] Push(...); Java: TickAggregator + Candle[] push(...); R: TickAggregator constructor + push() S3 generic returning an (n x 6) numeric matrix. - Candle output record generated per language from WickraCandle. Verified bit-identical to the native bindings (o=100 h=101 l=100 c=101 v=3 ts=0) in Go, C#, Java, and R at runtime; R passes R CMD check (pre-existing doc warnings only). WIP: cross-language data-layer golden + CHANGELOG still pending. * test(data-layer): cross-language golden for the tick aggregator + CHANGELOG gen_golden emits a deterministic tick stream (testdata/golden/data_ticks.csv) and the reference candle streams with and without gap filling (data_candles.csv, data_candles_gap.csv). Every binding replays the shared ticks through its TickAggregator and checks the candles bit-for-bit (fp tolerance) against the Rust reference: - Node / WASM / Python / Go / C# / Java / R: a dedicated parity test each. - C / C++: data_layer_test.c (compiled as both, run as ctest). The gap-fill fixture closes several candles from a single push, exercising the lossless push/drain path. Records the feature under CHANGELOG [Unreleased]. * fix(examples): rename the CSV-loader candle to WickraBar The example CSV helper (wickra_csv.h) defined its own struct WickraCandle, which now collides with the public C ABI WickraCandle (the tick aggregator output) in any example that includes both headers (backtest, multi_timeframe, the strategy examples). The public type owns the name; rename the example loader's bar to WickraBar. The generated golden_test.c is untouched (its only match was the unrelated WickraCandleVolumeOutput).
108 lines
3.3 KiB
C
108 lines
3.3 KiB
C
/* Cross-language data-layer parity for the C / C++ binding: replay the shared
|
|
* golden tick stream through the TickAggregator (push/drain) and check the
|
|
* candles against the Rust reference, with and without gap filling. The same
|
|
* source compiles under both a C and a C++ compiler. Fixtures are generated by
|
|
* `cargo run -p wickra-examples --bin gen_golden`; the golden dir is argv[1].
|
|
*/
|
|
#include <math.h>
|
|
#include <stdbool.h>
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "wickra.h"
|
|
|
|
#define MAXROWS 256
|
|
|
|
static const char *GDIR;
|
|
|
|
static int read_csv(const char *name, double *rows, int ncol) {
|
|
char path[1024];
|
|
snprintf(path, sizeof(path), "%s/%s.csv", GDIR, name);
|
|
FILE *f = fopen(path, "r");
|
|
if (!f) {
|
|
fprintf(stderr, "cannot open %s\n", path);
|
|
exit(2);
|
|
}
|
|
char line[4096];
|
|
int n = 0, first = 1;
|
|
while (fgets(line, sizeof(line), f)) {
|
|
line[strcspn(line, "\r\n")] = '\0';
|
|
if (first) {
|
|
first = 0;
|
|
continue;
|
|
}
|
|
if (line[0] == '\0') {
|
|
continue;
|
|
}
|
|
char *p = line;
|
|
for (int j = 0; j < ncol; j++) {
|
|
rows[n * ncol + j] = strtod(p, &p);
|
|
if (*p == ',') {
|
|
p++;
|
|
}
|
|
}
|
|
n++;
|
|
}
|
|
fclose(f);
|
|
return n;
|
|
}
|
|
|
|
static int check(const char *fixture, bool gap, const double *ticks, int nt) {
|
|
struct TickAggregator *a = wickra_tick_aggregator_new(1000, gap);
|
|
if (!a) {
|
|
printf("FAIL %s: new returned NULL\n", fixture);
|
|
return 1;
|
|
}
|
|
double want[MAXROWS * 6];
|
|
int nw = read_csv(fixture, want, 6);
|
|
double got[MAXROWS * 6];
|
|
int ng = 0;
|
|
for (int i = 0; i < nt; i++) {
|
|
intptr_t n = wickra_tick_aggregator_push(a, ticks[i * 3 + 0], ticks[i * 3 + 1],
|
|
(int64_t)ticks[i * 3 + 2]);
|
|
if (n > 0) {
|
|
struct WickraCandle buf[MAXROWS];
|
|
intptr_t w = wickra_tick_aggregator_drain(a, buf, (uintptr_t)n);
|
|
for (intptr_t j = 0; j < w; j++) {
|
|
got[ng * 6 + 0] = buf[j].open;
|
|
got[ng * 6 + 1] = buf[j].high;
|
|
got[ng * 6 + 2] = buf[j].low;
|
|
got[ng * 6 + 3] = buf[j].close;
|
|
got[ng * 6 + 4] = buf[j].volume;
|
|
got[ng * 6 + 5] = (double)buf[j].timestamp;
|
|
ng++;
|
|
}
|
|
}
|
|
}
|
|
wickra_tick_aggregator_free(a);
|
|
if (ng != nw) {
|
|
printf("FAIL %s: %d candles vs %d\n", fixture, ng, nw);
|
|
return 1;
|
|
}
|
|
int fails = 0;
|
|
for (int i = 0; i < ng; i++) {
|
|
for (int j = 0; j < 6; j++) {
|
|
double w = want[i * 6 + j];
|
|
double tol = 1e-9 * fmax(1.0, fabs(w));
|
|
if (fabs(got[i * 6 + j] - w) > tol) {
|
|
printf("FAIL %s row %d col %d: %g vs %g\n", fixture, i, j, got[i * 6 + j], w);
|
|
fails++;
|
|
}
|
|
}
|
|
}
|
|
return fails;
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
GDIR = (argc > 1) ? argv[1] : "testdata/golden";
|
|
double ticks[MAXROWS * 3];
|
|
int nt = read_csv("data_ticks", ticks, 3);
|
|
int fails = check("data_candles", false, ticks, nt);
|
|
fails += check("data_candles_gap", true, ticks, nt);
|
|
if (fails == 0) {
|
|
printf("C/C++ data layer: OK (%d ticks)\n", nt);
|
|
}
|
|
return fails ? 1 : 0;
|
|
}
|