Module 12 · Statistical Computing and Reproducibility Lesson 115 of 120
Missing, Infinite, Invalid, and Unsupported-State Policies
Refusing to make invalid inputs look like calm markets.
Transcript
20 sentences · select one to jump thereCheck your understanding
Why is the string "3" rejected in this example?
Code lab
Run it yourself
The lesson source in 7 languages. Edit it, run TypeScript and Python right here, and compare with the expected output.
/**
* Fintech Math Bootcamp · Lesson 115 of 120
* Missing, Infinite, Invalid, and Unsupported-State Policies
* Module 12: Statistical Computing and Reproducibility
*
* Scenario: Refusing to make invalid inputs look like calm markets
* Rule: missing ≠ zero ≠ invalid ≠ unsupported
*
* Try it: Why is the string "3" rejected in this example?
*
* Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/missing-infinite-invalid-and-unsupported-state-policies/
* Free course: https://courses.thefintechbuilder.com
* Synthetic teaching example, not financial advice or a production library.
*/
export function lesson115() {
const raw:unknown[]=[1,null,NaN,Infinity,"3",-2];
const accepted=raw.filter((x):x is number=>typeof x==="number" && Number.isFinite(x));
const result={accepted,rejected:raw.length-accepted.length,
sum:accepted.reduce((s,x)=>s+x,0)};
return result;
}
export const checkedResult = {"accepted":[1,-2],"rejected":4,"sum":-1};
// Run this file directly: npx tsx lessons/12-statistical-computing-and-reproducibility/115-missing-infinite-invalid-and-unsupported-state-policies.ts
if (process.argv[1] && import.meta.url.endsWith(process.argv[1].replace(/\\/g, "/").split("/").pop()!)) {
console.log(JSON.stringify(lesson115(), null, 2));
}
Your output
Press Run to execute the code in your browser.
Expected output
{
"accepted": [
1,
-2
],
"rejected": 4,
"sum": -1
}# Fintech Math Bootcamp · Lesson 115 of 120
# Missing, Infinite, Invalid, and Unsupported-State Policies
# Module 12: Statistical Computing and Reproducibility
#
# Scenario: Refusing to make invalid inputs look like calm markets
# Rule: missing ≠ zero ≠ invalid ≠ unsupported
#
# Try it: Why is the string "3" rejected in this example?
#
# Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/missing-infinite-invalid-and-unsupported-state-policies/
# Free course: https://courses.thefintechbuilder.com
# Synthetic teaching example, not financial advice or a production library.
#
# Run: python main.py
import json
import math
def lesson_115():
raw = [1, None, math.nan, math.inf, "3", -2]
# Finite numbers only; bool is a subclass of int in Python, so it is excluded explicitly.
accepted = [
x for x in raw
if isinstance(x, (int, float)) and not isinstance(x, bool) and math.isfinite(x)
]
return {"accepted": accepted, "rejected": len(raw) - len(accepted), "sum": sum(accepted)}
if __name__ == "__main__":
print(json.dumps(lesson_115(), indent=2))
Your output
Press Run to execute the code in your browser.
Expected output
{
"accepted": [
1,
-2
],
"rejected": 4,
"sum": -1
}/*
* Fintech Math Bootcamp - Lesson 115 of 120
* Missing, Infinite, Invalid, and Unsupported-State Policies
* Module 12: Statistical Computing and Reproducibility
*
* Scenario: Refusing to make invalid inputs look like calm markets
* Rule: missing != zero != invalid != unsupported
*
* Try it: Why is the string "3" rejected in this example?
*
* Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/missing-infinite-invalid-and-unsupported-state-policies/
* 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 Map<String, Object> lesson115() {
Object[] raw = {1.0, null, Double.NaN, Double.POSITIVE_INFINITY, "3", -2.0};
List<Object> accepted = new ArrayList<Object>();
double sum = 0;
for (Object x : raw) {
// Finite numbers only: null, strings, NaN and infinities are rejected, never coerced.
if (x instanceof Double && Double.isFinite((Double) x)) {
accepted.add(x);
sum += (Double) x;
}
}
return obj("accepted", accepted, "rejected", raw.length - accepted.size(), "sum", sum);
}
public static void main(String[] args) {
System.out.println(toJson(lesson115(), ""));
}
// 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;
}
}
No browser runner for Java yet
Read the code here, then run it in your own toolchain or a ready-made cloud workspace.
Expected output
{
"accepted": [
1,
-2
],
"rejected": 4,
"sum": -1
}// Fintech Math Bootcamp · Lesson 115 of 120
// Missing, Infinite, Invalid, and Unsupported-State Policies
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Refusing to make invalid inputs look like calm markets
// Rule: missing ≠ zero ≠ invalid ≠ unsupported
//
// Try it: Why is the string "3" rejected in this example?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/missing-infinite-invalid-and-unsupported-state-policies/
// 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 Result struct {
Accepted []float64 `json:"accepted"`
Rejected int `json:"rejected"`
Sum float64 `json:"sum"`
}
func lesson115() Result {
raw := []any{1.0, nil, math.NaN(), math.Inf(1), "3", -2.0}
accepted := []float64{}
sum := 0.0
for _, x := range raw {
// Finite numbers only: nil, strings, NaN and infinities are rejected, never coerced.
if v, ok := x.(float64); ok && !math.IsNaN(v) && !math.IsInf(v, 0) {
accepted = append(accepted, v)
sum += v
}
}
return Result{Accepted: accepted, Rejected: len(raw) - len(accepted), Sum: sum}
}
func main() {
out, err := json.MarshalIndent(lesson115(), "", " ")
if err != nil {
panic(err)
}
fmt.Println(string(out))
}
No browser runner for Go yet
Read the code here, then run it in your own toolchain or a ready-made cloud workspace.
Expected output
{
"accepted": [
1,
-2
],
"rejected": 4,
"sum": -1
}// Fintech Math Bootcamp · Lesson 115 of 120
// Missing, Infinite, Invalid, and Unsupported-State Policies
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Refusing to make invalid inputs look like calm markets
// Rule: missing ≠ zero ≠ invalid ≠ unsupported
//
// Try it: Why is the string "3" rejected in this example?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/missing-infinite-invalid-and-unsupported-state-policies/
// 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 ? "}" : "]");
}
}
}
// A raw field can be missing, a number, or text.
using Raw = std::variant<std::monostate, double, std::string>;
Json lesson115() {
const std::vector<Raw> raw{1.0, std::monostate{}, std::numeric_limits<double>::quiet_NaN(),
std::numeric_limits<double>::infinity(), std::string("3"), -2.0};
std::vector<double> accepted;
double sum = 0;
for (const Raw& x : raw) {
// Finite numbers only: missing values, text, NaN and infinities are rejected, never coerced.
if (const double* v = std::get_if<double>(&x); v && std::isfinite(*v)) {
accepted.push_back(*v);
sum += *v;
}
}
return jobj({{"accepted", jnums(accepted)},
{"rejected", jnum(static_cast<double>(raw.size() - accepted.size()))},
{"sum", jnum(sum)}});
}
int main() {
writeJson(std::cout, lesson115());
std::cout << "\n";
return 0;
}
No browser runner for C++ yet
Read the code here, then run it in your own toolchain or a ready-made cloud workspace.
Expected output
{
"accepted": [
1,
-2
],
"rejected": 4,
"sum": -1
}// Fintech Math Bootcamp · Lesson 115 of 120
// Missing, Infinite, Invalid, and Unsupported-State Policies
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Refusing to make invalid inputs look like calm markets
// Rule: missing ≠ zero ≠ invalid ≠ unsupported
//
// Try it: Why is the string "3" rejected in this example?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/missing-infinite-invalid-and-unsupported-state-policies/
// 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("e(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("e(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('}');
}
}
}
/// A raw field can be missing, a number, or text.
enum Raw {
Missing,
Number(f64),
Text(&'static str),
}
fn lesson_115() -> Json {
let raw = [
Raw::Number(1.0),
Raw::Missing,
Raw::Number(f64::NAN),
Raw::Number(f64::INFINITY),
Raw::Text("3"),
Raw::Number(-2.0),
];
// Finite numbers only: missing values, text, NaN and infinities are rejected, never coerced.
let accepted: Vec<f64> = raw
.iter()
.filter_map(|x| match x {
Raw::Number(v) if v.is_finite() => Some(*v),
_ => None,
})
.collect();
let sum = accepted.iter().fold(0.0, |s, x| s + x);
obj(vec![
("accepted", nums(&accepted)),
("rejected", Json::Num((raw.len() - accepted.len()) as f64)),
("sum", Json::Num(sum)),
])
}
fn main() {
let mut out = String::new();
write_json(&lesson_115(), "", &mut out);
println!("{}", out);
}
No browser runner for Rust yet
Read the code here, then run it in your own toolchain or a ready-made cloud workspace.
Expected output
{
"accepted": [
1,
-2
],
"rejected": 4,
"sum": -1
}// Fintech Math Bootcamp · Lesson 115 of 120
// Missing, Infinite, Invalid, and Unsupported-State Policies
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Refusing to make invalid inputs look like calm markets
// Rule: missing ≠ zero ≠ invalid ≠ unsupported
//
// Try it: Why is the string "3" rejected in this example?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/missing-infinite-invalid-and-unsupported-state-policies/
// 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(Lesson115(), options));
static object Lesson115()
{
object?[] raw = { 1.0, null, double.NaN, double.PositiveInfinity, "3", -2.0 };
// Finite numbers only: null, strings, NaN and infinities are rejected, never coerced.
double[] accepted = raw.OfType<double>().Where(double.IsFinite).ToArray();
return new { accepted, rejected = raw.Length - accepted.Length, sum = accepted.Aggregate(0.0, (s, x) => s + x) };
}
No browser runner for C# yet
Read the code here, then run it in your own toolchain or a ready-made cloud workspace.
Expected output
{
"accepted": [
1,
-2
],
"rejected": 4,
"sum": -1
}Prefer your own machine? Every file is in the course repository · open it in Codespaces.
Lesson notes
The rule
missing ≠ zero ≠ invalid ≠ unsupported