Resampling, Aggregation, and Time Alignment

/**
 * Fintech Math Bootcamp · Lesson 095 of 120
 * Resampling, Aggregation, and Time Alignment
 * Module 10: Financial Time-Series Foundations
 *
 * Scenario: Aggregating event payments without double-counting a boundary
 * Rule:     bucket(t)=floor(t/width) for left-closed, right-open buckets
 *
 * Try it:   Which bucket owns the event exactly at second sixty?
 *
 * Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/financial-time-series-foundations/resampling-aggregation-and-time-alignment/
 * Free course:    https://courses.thefintechbuilder.com
 * Synthetic teaching example, not financial advice or a production library.
 */

export function lesson095() {
  const events=[{t:0,v:10},{t:59,v:20},{t:60,v:30},{t:119,v:40}];
  const sums=new Map<number,number>();
  for(const e of events){const bucket=Math.floor(e.t/60);
    sums.set(bucket,(sums.get(bucket)??0)+e.v);}
  const result=[...sums].map(([bucket,total])=>({bucket,total}));
  return result;
}

export const checkedResult = [{"bucket":0,"total":30},{"bucket":1,"total":70}];

// Run this file directly: npx tsx lessons/10-financial-time-series-foundations/095-resampling-aggregation-and-time-alignment.ts
if (process.argv[1] && import.meta.url.endsWith(process.argv[1].replace(/\\/g, "/").split("/").pop()!)) {
  console.log(JSON.stringify(lesson095(), null, 2));
}

# Fintech Math Bootcamp · Lesson 095 of 120
# Resampling, Aggregation, and Time Alignment
# Module 10: Financial Time-Series Foundations
#
# Scenario: Aggregating event payments without double-counting a boundary
# Rule:     bucket(t)=floor(t/width) for left-closed, right-open buckets
#
# Try it:   Which bucket owns the event exactly at second sixty?
#
# Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/financial-time-series-foundations/resampling-aggregation-and-time-alignment/
# Free course:    https://courses.thefintechbuilder.com
# Synthetic teaching example, not financial advice or a production library.
#
# Run: python main.py

import json


def lesson_095():
    events = [{"t": 0, "v": 10}, {"t": 59, "v": 20}, {"t": 60, "v": 30}, {"t": 119, "v": 40}]
    sums = {}  # dicts keep insertion order, like a JavaScript Map
    for e in events:
        bucket = e["t"] // 60  # floor division: left-closed, right-open buckets
        sums[bucket] = sums.get(bucket, 0) + e["v"]
    return [{"bucket": bucket, "total": total} for bucket, total in sums.items()]


if __name__ == "__main__":
    print(json.dumps(lesson_095(), indent=2))

/*
 * Fintech Math Bootcamp - Lesson 095 of 120
 * Resampling, Aggregation, and Time Alignment
 * Module 10: Financial Time-Series Foundations
 *
 * Scenario: Aggregating event payments without double-counting a boundary
 * Rule:     bucket(t)=floor(t/width) for left-closed, right-open buckets
 *
 * Try it:   Which bucket owns the event exactly at second sixty?
 *
 * Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/financial-time-series-foundations/resampling-aggregation-and-time-alignment/
 * Free course:    https://courses.thefintechbuilder.com
 * Synthetic teaching example, not financial advice or a production library.
 *
 * Run: javac Main.java && java Main
 */

import java.util.*;

public class Main {
    static List<Object> lesson095() {
        int[][] events = {{0, 10}, {59, 20}, {60, 30}, {119, 40}}; // {t, v}
        Map<Integer, Integer> sums = new LinkedHashMap<Integer, Integer>();
        for (int[] e : events) {
            int bucket = (int) Math.floor(e[0] / 60.0);
            Integer previous = sums.get(bucket);
            sums.put(bucket, (previous == null ? 0 : previous) + e[1]);
        }
        List<Object> result = new ArrayList<Object>();
        for (Map.Entry<Integer, Integer> entry : sums.entrySet()) {
            result.add(obj("bucket", entry.getKey(), "total", entry.getValue()));
        }
        return result;
    }

    public static void main(String[] args) {
        System.out.println(toJson(lesson095(), ""));
    }

    // Minimal JSON writer: insertion-ordered Map, List, Number, Boolean, String and null.
    static String toJson(Object value, String indent) {
        if (value == null) return "null";
        if (value instanceof String) return quote((String) value);
        if (value instanceof Boolean) return value.toString();
        if (value instanceof Double) return formatNumber((Double) value);
        if (value instanceof Number) return value.toString();
        String inner = indent + "  ";
        StringBuilder sb = new StringBuilder();
        if (value instanceof Map) {
            Map<?, ?> map = (Map<?, ?>) value;
            if (map.isEmpty()) return "{}";
            sb.append("{\n");
            int i = 0;
            for (Map.Entry<?, ?> e : map.entrySet()) {
                sb.append(inner).append(quote(e.getKey().toString())).append(": ").append(toJson(e.getValue(), inner));
                sb.append(++i < map.size() ? ",\n" : "\n");
            }
            return sb.append(indent).append("}").toString();
        }
        List<?> list = (List<?>) value;
        if (list.isEmpty()) return "[]";
        sb.append("[\n");
        for (int i = 0; i < list.size(); i++) {
            sb.append(inner).append(toJson(list.get(i), inner)).append(i + 1 < list.size() ? ",\n" : "\n");
        }
        return sb.append(indent).append("]").toString();
    }

    // Integral doubles print without ".0", as JavaScript does; others use Java's round-trip form.
    static String formatNumber(double x) {
        if (x == Math.rint(x) && Math.abs(x) < 1e15) return Long.toString((long) x);
        return Double.toString(x);
    }

    static String quote(String s) {
        StringBuilder sb = new StringBuilder("\"");
        for (char c : s.toCharArray()) {
            if (c == '"' || c == '\\') sb.append('\\').append(c);
            else if (c < 0x20) sb.append(String.format("\\u%04x", (int) c));
            else sb.append(c);
        }
        return sb.append('"').toString();
    }

    // Builds an insertion-ordered object from alternating keys and values.
    static Map<String, Object> obj(Object... keysAndValues) {
        Map<String, Object> map = new LinkedHashMap<String, Object>();
        for (int i = 0; i < keysAndValues.length; i += 2) map.put((String) keysAndValues[i], keysAndValues[i + 1]);
        return map;
    }

    static List<Object> list(double... values) {
        List<Object> out = new ArrayList<Object>();
        for (double v : values) out.add(v);
        return out;
    }
}

// Fintech Math Bootcamp · Lesson 095 of 120
// Resampling, Aggregation, and Time Alignment
// Module 10: Financial Time-Series Foundations
//
// Scenario: Aggregating event payments without double-counting a boundary
// Rule:     bucket(t)=floor(t/width) for left-closed, right-open buckets
//
// Try it:   Which bucket owns the event exactly at second sixty?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/financial-time-series-foundations/resampling-aggregation-and-time-alignment/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: go run main.go

package main

import (
	"encoding/json"
	"fmt"
	"math"
)

type Bucket struct {
	Bucket int `json:"bucket"`
	Total  int `json:"total"`
}

func lesson095() []Bucket {
	type event struct{ t, v int }
	events := []event{{0, 10}, {59, 20}, {60, 30}, {119, 40}}
	sums := map[int]int{}
	var order []int // Go maps are unordered; keep first-seen order like a JavaScript Map
	for _, e := range events {
		bucket := int(math.Floor(float64(e.t) / 60))
		if _, seen := sums[bucket]; !seen {
			order = append(order, bucket)
		}
		sums[bucket] += e.v
	}
	result := make([]Bucket, 0, len(order))
	for _, b := range order {
		result = append(result, Bucket{Bucket: b, Total: sums[b]})
	}
	return result
}

func main() {
	out, err := json.MarshalIndent(lesson095(), "", "  ")
	if err != nil {
		panic(err)
	}
	fmt.Println(string(out))
}

// Fintech Math Bootcamp · Lesson 095 of 120
// Resampling, Aggregation, and Time Alignment
// Module 10: Financial Time-Series Foundations
//
// Scenario: Aggregating event payments without double-counting a boundary
// Rule:     bucket(t)=floor(t/width) for left-closed, right-open buckets
//
// Try it:   Which bucket owns the event exactly at second sixty?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/financial-time-series-foundations/resampling-aggregation-and-time-alignment/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: g++ -std=c++17 -O1 -o lesson main.cpp && ./lesson

#include <algorithm>
#include <charconv>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <optional>
#include <stdexcept>
#include <string>
#include <utility>
#include <variant>
#include <vector>

// Minimal JSON value: objects keep insertion order; numbers print in shortest round-trip form.
struct Json {
    enum class Kind { Null, Bool, Number, String, Array, Object };
    Kind kind = Kind::Null;
    bool flag = false;
    double number = 0.0;
    std::string text;
    std::vector<std::string> keys;  // object keys, parallel to items
    std::vector<Json> items;        // array items, or object values
};

Json jnull() { return Json{}; }
Json jbool(bool value) { Json j; j.kind = Json::Kind::Bool; j.flag = value; return j; }
Json jnum(double value) { Json j; j.kind = Json::Kind::Number; j.number = value; return j; }
Json jstr(const std::string& value) { Json j; j.kind = Json::Kind::String; j.text = value; return j; }
Json jarr(std::vector<Json> items) { Json j; j.kind = Json::Kind::Array; j.items = std::move(items); return j; }

Json jobj(std::vector<std::pair<std::string, Json>> fields) {
    Json j;
    j.kind = Json::Kind::Object;
    for (auto& field : fields) {
        j.keys.push_back(field.first);
        j.items.push_back(std::move(field.second));
    }
    return j;
}

Json jnums(const std::vector<double>& values) {
    std::vector<Json> items;
    for (double v : values) items.push_back(jnum(v));
    return jarr(std::move(items));
}

Json jnums(const std::vector<std::optional<double>>& values) {
    std::vector<Json> items;
    for (const auto& v : values) items.push_back(v ? jnum(*v) : jnull());
    return jarr(std::move(items));
}

std::string formatNumber(double value) {
    char buffer[64];
    auto result = std::to_chars(buffer, buffer + sizeof buffer, value);  // shortest round-trip form
    return std::string(buffer, result.ptr);
}

std::string quote(const std::string& text) {
    std::string out = "\"";
    for (char c : text) {
        if (c == '"' || c == '\\') {
            out += '\\';
            out += c;
        } else if (static_cast<unsigned char>(c) < 0x20) {
            char buffer[8];
            std::snprintf(buffer, sizeof buffer, "\\u%04x", static_cast<unsigned>(c));
            out += buffer;
        } else {
            out += c;
        }
    }
    return out + "\"";
}

void writeJson(std::ostream& out, const Json& value, const std::string& indent = "") {
    const std::string inner = indent + "  ";
    switch (value.kind) {
        case Json::Kind::Null: out << "null"; return;
        case Json::Kind::Bool: out << (value.flag ? "true" : "false"); return;
        case Json::Kind::Number: out << formatNumber(value.number); return;
        case Json::Kind::String: out << quote(value.text); return;
        case Json::Kind::Array:
        case Json::Kind::Object: {
            const bool isObject = value.kind == Json::Kind::Object;
            if (value.items.empty()) {
                out << (isObject ? "{}" : "[]");
                return;
            }
            out << (isObject ? "{\n" : "[\n");
            for (std::size_t i = 0; i < value.items.size(); ++i) {
                out << inner;
                if (isObject) out << quote(value.keys[i]) << ": ";
                writeJson(out, value.items[i], inner);
                out << (i + 1 < value.items.size() ? ",\n" : "\n");
            }
            out << indent << (isObject ? "}" : "]");
        }
    }
}

Json lesson095() {
    struct Event { double t, v; };
    const std::vector<Event> events{{0, 10}, {59, 20}, {60, 30}, {119, 40}};
    std::vector<std::pair<double, double>> sums;  // (bucket, total) in first-seen order, like a JavaScript Map
    for (const Event& e : events) {
        const double bucket = std::floor(e.t / 60);
        auto it = std::find_if(sums.begin(), sums.end(), [&](const auto& s) { return s.first == bucket; });
        if (it == sums.end()) sums.push_back({bucket, e.v});
        else it->second += e.v;
    }
    std::vector<Json> result;
    for (const auto& [bucket, total] : sums) result.push_back(jobj({{"bucket", jnum(bucket)}, {"total", jnum(total)}}));
    return jarr(result);
}

int main() {
    writeJson(std::cout, lesson095());
    std::cout << "\n";
    return 0;
}

// Fintech Math Bootcamp · Lesson 095 of 120
// Resampling, Aggregation, and Time Alignment
// Module 10: Financial Time-Series Foundations
//
// Scenario: Aggregating event payments without double-counting a boundary
// Rule:     bucket(t)=floor(t/width) for left-closed, right-open buckets
//
// Try it:   Which bucket owns the event exactly at second sixty?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/financial-time-series-foundations/resampling-aggregation-and-time-alignment/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: rustc -O main.rs && ./main

#![allow(dead_code)]

/// Minimal JSON value; objects keep insertion order.
enum Json {
    Null,
    Bool(bool),
    Num(f64),
    Str(String),
    Arr(Vec<Json>),
    Obj(Vec<(String, Json)>),
}

fn obj(fields: Vec<(&str, Json)>) -> Json {
    Json::Obj(fields.into_iter().map(|(k, v)| (k.to_string(), v)).collect())
}

fn nums(values: &[f64]) -> Json {
    Json::Arr(values.iter().map(|&v| Json::Num(v)).collect())
}

fn optional_nums(values: &[Option<f64>]) -> Json {
    Json::Arr(values.iter().map(|v| v.map_or(Json::Null, Json::Num)).collect())
}

fn quote(text: &str) -> String {
    let mut out = String::from("\"");
    for c in text.chars() {
        match c {
            '"' => out.push_str("\\\""),
            '\\' => out.push_str("\\\\"),
            c if (c as u32) < 0x20 => out.push_str(&format!("\\u{:04x}", c as u32)),
            c => out.push(c),
        }
    }
    out.push('"');
    out
}

// Display for f64 prints the shortest string that round-trips, as JavaScript does.
fn write_json(value: &Json, indent: &str, out: &mut String) {
    let inner = format!("{}  ", indent);
    match value {
        Json::Null => out.push_str("null"),
        Json::Bool(b) => out.push_str(if *b { "true" } else { "false" }),
        Json::Num(n) => out.push_str(&format!("{}", n)),
        Json::Str(s) => out.push_str(&quote(s)),
        Json::Arr(items) if items.is_empty() => out.push_str("[]"),
        Json::Obj(fields) if fields.is_empty() => out.push_str("{}"),
        Json::Arr(items) => {
            out.push_str("[\n");
            for (i, item) in items.iter().enumerate() {
                out.push_str(&inner);
                write_json(item, &inner, out);
                out.push_str(if i + 1 < items.len() { ",\n" } else { "\n" });
            }
            out.push_str(indent);
            out.push(']');
        }
        Json::Obj(fields) => {
            out.push_str("{\n");
            for (i, (key, item)) in fields.iter().enumerate() {
                out.push_str(&inner);
                out.push_str(&quote(key));
                out.push_str(": ");
                write_json(item, &inner, out);
                out.push_str(if i + 1 < fields.len() { ",\n" } else { "\n" });
            }
            out.push_str(indent);
            out.push('}');
        }
    }
}

fn lesson_095() -> Json {
    let events: [(f64, f64); 4] = [(0.0, 10.0), (59.0, 20.0), (60.0, 30.0), (119.0, 40.0)]; // (t, v)
    let mut sums: Vec<(f64, f64)> = Vec::new(); // (bucket, total) in first-seen order, like a JavaScript Map
    for &(t, v) in &events {
        let bucket = (t / 60.0_f64).floor();
        match sums.iter_mut().find(|(b, _)| *b == bucket) {
            Some(entry) => entry.1 += v,
            None => sums.push((bucket, v)),
        }
    }
    Json::Arr(
        sums.iter()
            .map(|&(bucket, total)| obj(vec![("bucket", Json::Num(bucket)), ("total", Json::Num(total))]))
            .collect(),
    )
}

fn main() {
    let mut out = String::new();
    write_json(&lesson_095(), "", &mut out);
    println!("{}", out);
}

// Fintech Math Bootcamp · Lesson 095 of 120
// Resampling, Aggregation, and Time Alignment
// Module 10: Financial Time-Series Foundations
//
// Scenario: Aggregating event payments without double-counting a boundary
// Rule:     bucket(t)=floor(t/width) for left-closed, right-open buckets
//
// Try it:   Which bucket owns the event exactly at second sixty?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/financial-time-series-foundations/resampling-aggregation-and-time-alignment/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: dotnet run

using System;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text.Encodings.Web;
using System.Text.Json;

var options = new JsonSerializerOptions { WriteIndented = true, Encoder = JavaScriptEncoder.UnsafeRelaxedJsonEscaping };
Console.WriteLine(JsonSerializer.Serialize(Lesson095(), options));

static object Lesson095()
{
    var events = new[] { (t: 0, v: 10), (t: 59, v: 20), (t: 60, v: 30), (t: 119, v: 40) };
    var sums = new Dictionary<int, int>();
    var order = new List<int>(); // first-seen order, like a JavaScript Map
    foreach (var e in events)
    {
        int bucket = (int)Math.Floor(e.t / 60.0);
        if (!sums.ContainsKey(bucket)) { sums[bucket] = 0; order.Add(bucket); }
        sums[bucket] += e.v;
    }
    return order.Select(bucket => new { bucket, total = sums[bucket] }).ToArray();
}