#include <teide/td.h>

int main(void) {
    td_heap_init();
    td_sym_init();

    td_t* trades = td_read_csv("trades.csv");

    /* Build the operation DAG — nothing executes yet */
    td_graph_t* g = td_graph_new(trades);

    /* Filter: keep only rows where flag == 0 */
    td_op_t* flag = td_scan(g, "flag");
    td_op_t* pred = td_eq(g, flag, td_const_i64(g, 0));

    td_op_t* region = td_filter(g, td_scan(g, "region"), pred);
    td_op_t* amount = td_filter(g, td_scan(g, "amount"), pred);

    /* Group by region, sum amounts */
    td_op_t* keys[]    = { region };
    uint16_t agg_ops[] = { OP_SUM };
    td_op_t* agg_ins[] = { amount };
    td_op_t* grp = td_group(g, keys, 1, agg_ops, agg_ins, 1);

    /* Optimize (10 passes) and execute */
    td_t* result = td_execute(g, td_optimize(g, grp));

    /* result:
     *   region | sum_amount
     *   -------|----------
     *        0 |    166583
     *        1 |    166742
     *        2 |    166900
     *        3 |    167058
     *        4 |    167217
     */

    if (result && !TD_IS_ERR(result)) td_release(result);
    td_graph_free(g);
    td_release(trades);
    td_sym_destroy();
    td_heap_destroy();
    return 0;
}

#include <teide/td.h>

int main(void) {
    td_heap_init();
    td_sym_init();

    /* Build a directed graph: 0→1, 0→2, 1→2, 1→3, 2→3, 3→0 */
    td_t* src = td_vec_from_raw(TD_I64, (int64_t[]){0,0,1,1,2,3}, 6);
    td_t* dst = td_vec_from_raw(TD_I64, (int64_t[]){1,2,2,3,3,0}, 6);

    td_t* edges = td_table_new(2);
    edges = td_table_add_col(edges, td_sym_intern("src", 3), src);
    edges = td_table_add_col(edges, td_sym_intern("dst", 3), dst);
    td_release(src);
    td_release(dst);

    /* Double-indexed CSR (forward + reverse) */
    td_rel_t* rel = td_rel_from_edges(edges, "src", "dst", 4, 4, true);

    /* Start at node 0, BFS 1..3 hops forward */
    td_t* start = td_vec_from_raw(TD_I64, (int64_t[]){0}, 1);
    td_t* nodes = td_table_new(1);
    nodes = td_table_add_col(nodes, td_sym_intern("id", 2), start);
    td_release(start);

    td_graph_t* g = td_graph_new(nodes);
    td_op_t* reach = td_var_expand(g, td_scan(g, "id"), rel, 0, 1, 3, false);

    td_t* result = td_execute(g, td_optimize(g, reach));

    /* result (BFS from node 0, depth 1..3):
     *   src | dst | depth
     *   ----|-----|------
     *     0 |   1 |     1
     *     0 |   2 |     1
     *     0 |   3 |     2
     */

    if (result && !TD_IS_ERR(result)) td_release(result);
    td_graph_free(g);
    td_rel_free(rel);
    td_release(edges);
    td_release(nodes);
    td_sym_destroy();
    td_heap_destroy();
    return 0;
}

#include <teide/td.h>

int main(void) {
    td_heap_init();
    td_sym_init();

    td_t* orders = td_read_csv("orders.csv");
    td_t* custs  = td_read_csv("customers.csv");

    td_graph_t* g = td_graph_new(orders);

    td_op_t* lo = td_const_table(g, orders);
    td_op_t* ro = td_const_table(g, custs);

    /* Inner join on customer_id */
    td_op_t* lk[] = { td_scan(g, "customer_id") };
    td_op_t* rk[] = { td_scan(g, "customer_id") };
    td_op_t* joined = td_join(g, lo, lk, ro, rk, 1, 0);

    td_t* result = td_execute(g, td_optimize(g, joined));

    /* result:
     *   customer_id | amount | name
     *   ------------|--------|--------
     *             1 |    250 | Alice
     *             2 |    180 | Bob
     *             2 |    340 | Bob
     *             3 |    120 | Charlie
     */

    if (result && !TD_IS_ERR(result)) td_release(result);
    td_graph_free(g);
    td_release(orders);
    td_release(custs);
    td_sym_destroy();
    td_heap_destroy();
    return 0;
}