Function eval_vector_binop

nodedb/src/control/promql/evaluator/binary.rs:55–95

(
    op: BinOp,
    left: &[InstantSample],
    right: &[InstantSample],
    return_bool: bool,
    ts: i64,
)

}

fn eval_vector_binop(
    op: BinOp,
    left: &[InstantSample],
    right: &[InstantSample],
    return_bool: bool,
    ts: i64,
) -> Result<Value, PromqlError> {
    let right_map: BTreeMap<String, &InstantSample> =
        right.iter().map(|s| (match_key(&s.labels), s)).collect();

    let mut result = Vec::new();
    for l in left {
        let key = match_key(&l.labels);
        if let Some(r) = right_map.get(&key) {
            let val = apply_binop(op, l.value, r.value, return_bool);
            if !val.is_nan() || !op.is_comparison() || return_bool {
                let mut labels = l.labels.clone();
                labels.remove("__name__");
                result.push(InstantSample {
                    labels,
                    value: val,
                    timestamp_ms: ts,
                });
            }
        } else if op.is_set_op() && matches!(op, BinOp::Or) {
            result.push(l.clone());
        }
    }

    if matches!(op, BinOp::Or) {
        let left_keys: std::collections::HashSet<String> =
            left.iter().map(|s| match_key(&s.labels)).collect();
        for r in right {
            if !left_keys.contains(&match_key(&r.labels)) {
                result.push(r.clone());
            }
        }
    }

    Ok(Value::Vector(result))
}

fn apply_binop(op: BinOp, a: f64, b: f64, return_bool: bool) -> f64 {
    match op {