sui-bytecode 0.1.215

//! VM-specific value representation.
//!
//! Simpler than `sui_eval::Value` — no thunks, no rnix AST references.
//! The bytecode VM handles laziness through its own mechanisms; values
//! here are always fully evaluated.
//!
//! # String Interning
//!
//! Attribute set keys use [`Symbol`] handles instead of heap-allocated
//! `String`s. This makes key comparison O(1) (integer equality) instead
//! of O(n) (byte-by-byte string comparison). The interner is shared
//! between the compiler and VM via `Rc<RefCell<Interner>>`.

use std::cell::Cell;
use std::collections::BTreeMap;
use std::fmt;
use std::path::PathBuf;
use std::rc::Rc;

use crate::chunk::Chunk;
use crate::intern::{Interner, Symbol};
use crate::nanbox::NanBox;

/// A value in the bytecode VM.
///
/// Intentionally simpler than the tree-walker's `Value` type: no thunks
/// (the VM manages laziness via its call stack), no rnix AST nodes.
///
/// Attribute sets use [`Symbol`] keys for O(1) comparisons. Use
/// [`VMValue::attrs_to_strings`] to convert back to `BTreeMap<String, VMValue>`
/// for external consumption.
#[derive(Clone)]
pub enum VMValue {
    /// Nix `null`.
    Null,
    /// Nix boolean.
    Bool(bool),
    /// Nix integer (64-bit signed).
    Int(i64),
    /// Nix float (64-bit IEEE 754).
    Float(f64),
    /// Nix string (context tracking deferred to Phase 2).
    String(String),
    /// Nix path literal.
    Path(String),
    /// Nix list.
    List(Vec<VMValue>),
    /// Nix attribute set with interned keys.
    Attrs(BTreeMap<Symbol, VMValue>),
    /// A closure: compiled function body + captured upvalues.
    Closure(VMClosure),
    /// A built-in function (native Rust implementation).
    Builtin(VMBuiltin),
    /// A lazy thunk: deferred computation, evaluated on first force.
    Thunk(VMThunk),
    /// A higher-order builtin: partially applied operation that needs VM
    /// access to call closures. The VM intercepts calls to these and
    /// executes them with full execution context.
    HigherOrderBuiltin(HigherOrderBuiltin),
}

/// Tag identifying which higher-order operation a partially-applied
/// builtin represents.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum HigherOrderOp {
    /// `map f list` -- apply f to each element
    Map,
    /// `filter pred list` -- keep elements where pred returns true
    Filter,
    /// `foldl' f init` -- strict left fold (first partial: has f only)
    FoldlP1,
    /// `foldl' f init list` -- strict left fold (second partial: has f + init)
    FoldlP2,
    /// `sort comparator list` -- sort using comparator function
    Sort,
    /// `genList f n` -- generate list by calling f(0)..f(n-1)
    GenList,
    /// `concatMap f list` -- map then concatenate results
    ConcatMap,
    /// `any pred list` -- true if any element satisfies pred
    Any,
    /// `all pred list` -- true if all elements satisfy pred
    All,
    /// `partition pred list` -- split into { right, wrong }
    Partition,
    /// `groupBy f list` -- group elements by f result
    GroupBy,
    /// `mapAttrs f attrs` -- apply f to each attr value
    MapAttrs,
    /// `filterAttrs pred attrs` -- keep attrs where pred name value is true
    /// `elem needle list` -- check if needle is in list (needs VM to force elements)
    Elem,
}

/// A partially-applied higher-order builtin that needs VM access to
/// call user closures.
#[derive(Clone)]
pub struct HigherOrderBuiltin {
    /// Which operation this represents.
    pub op: HigherOrderOp,
    /// The captured function/predicate/comparator.
    pub func: Box<VMValue>,
    /// Additional captured arguments (e.g., `init` for foldl').
    pub extra_args: Vec<VMValue>,
}

/// A compiled closure: the function's bytecode chunk plus captured values.
#[derive(Clone)]
pub struct VMClosure {
    /// The function's compiled bytecode.
    pub chunk: Rc<Chunk>,
    /// Captured upvalues (values from enclosing scopes).
    ///
    /// Stored as `NanBox` (the runtime frame representation) so that closure
    /// capture and invocation are Rc-refcount clones, not deep VMValue<->NanBox
    /// round-trips. The runtime `CallFrame` already holds `Vec<NanBox>`.
    pub upvalues: Vec<NanBox>,
    /// Number of parameters this closure expects (1 for Nix lambdas,
    /// but pattern-match destructuring may set multiple locals).
    pub arity: u16,
    /// Name hint for error messages (e.g., the parameter name).
    pub name: Option<String>,
    /// Formal parameter names and whether they have defaults.
    /// Populated for pattern-destructuring lambdas (`{ a, b ? 1 }: ...`).
    /// Empty for simple ident-param lambdas (`x: ...`).
    /// Used by `builtins.functionArgs`.
    pub formals: Vec<(String, bool)>,
}

/// A built-in function callable from the VM.
#[derive(Clone)]
pub struct VMBuiltin {
    /// Name for error messages (e.g., "length", "map<partial>").
    pub name: &'static str,
    /// The native implementation. Takes args and returns a result.
    pub func: Rc<dyn Fn(Vec<VMValue>) -> Result<VMValue, crate::error::VMError>>,
    /// How many arguments this builtin expects (0 = variadic/partial).
    pub arity: u8,
}

impl fmt::Debug for VMBuiltin {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "<builtin {}>", self.name)
    }
}

impl fmt::Debug for HigherOrderBuiltin {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "<hof {:?}>", self.op)
    }
}

/// State of a thunk's evaluation lifecycle.
#[derive(Clone)]
pub enum ThunkState {
    /// Not yet evaluated. Holds the bytecode chunk to execute and
    /// captured upvalues for the thunk body.
    Pending {
        chunk: Rc<Chunk>,
        upvalues: Vec<NanBox>,
    },
    /// Lazy source: the thunk body has not been compiled yet.
    /// On first force, the source span is compiled and then executed.
    /// This avoids compiling thunk bodies that are never forced.
    LazySource {
        /// Shared source text of the file containing this thunk.
        source: Rc<String>,
        /// Byte offset of the expression within the source.
        offset: usize,
        /// Byte length of the expression.
        length: usize,
        /// Base directory for resolving relative imports.
        base_dir: PathBuf,
        /// Captured upvalues (resolved at thunk creation time).
        upvalues: Vec<NanBox>,
    },
    /// A native Rust callback that produces a value on demand.
    ///
    /// Used by the tree-walker bridge to wrap lazy flake input thunks:
    /// instead of eagerly forcing all inputs during `eval_to_string_keyed`,
    /// the tree-walker thunk is wrapped in a callback and only evaluated
    /// when the VM actually accesses the value.
    NativeCallback(Rc<dyn Fn() -> Result<StringKeyedValue, String>>),
    /// Currently being evaluated -- detects infinite recursion (blackhole).
    Evaluating,
    /// Already evaluated and memoized.
    Done(Box<VMValue>),
}

/// A lazy thunk with memoization and blackhole detection.
#[derive(Clone)]
pub struct VMThunk {
    pub state: Rc<Cell<Option<ThunkState>>>,
}

impl VMThunk {
    /// Create a new pending thunk.
    pub fn new(chunk: Rc<Chunk>, upvalues: Vec<NanBox>) -> Self {
        Self {
            state: Rc::new(Cell::new(Some(ThunkState::Pending { chunk, upvalues }))),
        }
    }

    /// Create a thunk that is already evaluated (optimization).
    pub fn new_done(value: VMValue) -> Self {
        Self {
            state: Rc::new(Cell::new(Some(ThunkState::Done(Box::new(value))))),
        }
    }

    /// Create a native callback thunk from a Rust closure.
    ///
    /// The callback is invoked lazily the first time the thunk is forced,
    /// and the result is memoized. Used by the builtin bridge to wrap
    /// tree-walker computations that should be deferred.
    pub fn new_native<F>(callback: F) -> Self
    where
        F: Fn() -> Result<VMValue, crate::error::VMError> + 'static,
    {
        // Wrap the VMValue-returning callback into a StringKeyedValue callback
        // that the NativeCallback variant expects.
        let wrapped: Rc<dyn Fn() -> Result<StringKeyedValue, String>> =
            Rc::new(move || {
                let val = callback().map_err(|e| e.to_string())?;
                let interner = crate::intern::Interner::new();
                Ok(val.to_string_keyed(&interner))
            });
        Self {
            state: Rc::new(Cell::new(Some(ThunkState::NativeCallback(wrapped)))),
        }
    }
}

impl fmt::Debug for VMThunk {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "<thunk>")
    }
}

impl fmt::Debug for VMClosure {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "<closure arity={}", self.arity)?;
        if let Some(ref name) = self.name {
            write!(f, " name={name}")?;
        }
        write!(f, ">")
    }
}

impl VMValue {
    /// Return the Nix type name for this value.
    #[must_use]
    pub fn type_name(&self) -> &'static str {
        match self {
            VMValue::Null => "null",
            VMValue::Bool(_) => "bool",
            VMValue::Int(_) => "int",
            VMValue::Float(_) => "float",
            VMValue::String(_) => "string",
            VMValue::Path(_) => "path",
            VMValue::List(_) => "list",
            VMValue::Attrs(_) => "set",
            VMValue::Closure(_) | VMValue::Builtin(_) | VMValue::HigherOrderBuiltin(_) => "lambda",
            VMValue::Thunk(_) => "thunk",
        }
    }

    /// Check if this value is truthy (for conditionals).
    pub fn is_truthy(&self) -> Result<bool, crate::error::VMError> {
        match self {
            VMValue::Bool(b) => Ok(*b),
            other => Err(crate::error::VMError::TypeError {
                expected: "bool",
                got: other.type_name(),
                context: "condition".to_string(),
            }),
        }
    }

    /// Convert a `Symbol`-keyed attrset to a `String`-keyed `BTreeMap`
    /// using the provided interner. Returns `None` if not an `Attrs`.
    #[must_use]
    pub fn attrs_to_strings(&self, interner: &Interner) -> Option<BTreeMap<String, VMValue>> {
        match self {
            VMValue::Attrs(attrs) => {
                let map = attrs
                    .iter()
                    .map(|(sym, val)| (interner.resolve(*sym).to_string(), val.clone()))
                    .collect();
                Some(map)
            }
            _ => None,
        }
    }

    /// Convert this entire value tree to use string keys (for external API).
    /// Recursively resolves all `Symbol` keys in nested attrsets and lists.
    #[must_use]
    pub fn to_string_keyed(&self, interner: &Interner) -> StringKeyedValue {
        match self {
            VMValue::Null => StringKeyedValue::Null,
            VMValue::Bool(b) => StringKeyedValue::Bool(*b),
            VMValue::Int(n) => StringKeyedValue::Int(*n),
            VMValue::Float(f) => StringKeyedValue::Float(*f),
            VMValue::String(s) => StringKeyedValue::String(s.clone()),
            VMValue::Path(p) => StringKeyedValue::Path(p.clone()),
            VMValue::List(items) => {
                StringKeyedValue::List(items.iter().map(|v| v.to_string_keyed(interner)).collect())
            }
            VMValue::Attrs(attrs) => {
                let map = attrs
                    .iter()
                    .map(|(sym, val)| {
                        (interner.resolve(*sym).to_string(), val.to_string_keyed(interner))
                    })
                    .collect();
                StringKeyedValue::Attrs(map)
            }
            VMValue::Closure(_) | VMValue::Builtin(_) | VMValue::HigherOrderBuiltin(_) => {
                StringKeyedValue::Lambda
            }
            VMValue::Thunk(t) => {
                // If the thunk is already forced, convert the memoized value.
                // Otherwise fall back to Lambda (the VM should have forced it).
                let state = t.state.take();
                match &state {
                    Some(ThunkState::Done(v)) => {
                        let result = v.to_string_keyed(interner);
                        t.state.set(state);
                        result
                    }
                    _ => {
                        t.state.set(state);
                        StringKeyedValue::Lambda
                    }
                }
            }
        }
    }

    /// Format this value for display using the interner for key resolution.
    pub fn display_with(&self, interner: &Interner, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            VMValue::Null => write!(f, "null"),
            VMValue::Bool(b) => write!(f, "{b}"),
            VMValue::Int(n) => write!(f, "{n}"),
            VMValue::Float(n) => {
                if n.fract() == 0.0 {
                    write!(f, "{n:.6}")
                } else {
                    write!(f, "{n}")
                }
            }
            VMValue::String(s) => write!(f, "\"{s}\""),
            VMValue::Path(p) => write!(f, "{p}"),
            VMValue::List(items) => {
                write!(f, "[ ")?;
                for item in items {
                    item.display_with(interner, f)?;
                    write!(f, " ")?;
                }
                write!(f, "]")
            }
            VMValue::Attrs(map) => {
                write!(f, "{{ ")?;
                for (sym, v) in map {
                    let key = interner.resolve(*sym);
                    write!(f, "{key} = ")?;
                    v.display_with(interner, f)?;
                    write!(f, "; ")?;
                }
                write!(f, "}}")
            }
            VMValue::Closure(_) => write!(f, "<<lambda>>"),
            VMValue::Builtin(b) => write!(f, "<<builtin {}>>", b.name),
            VMValue::HigherOrderBuiltin(h) => write!(f, "<<builtin {:?}>>", h.op),
            VMValue::Thunk(_) => write!(f, "<<thunk>>"),
        }
    }

    /// Debug this value using the interner for key resolution.
    pub fn debug_with(&self, interner: &Interner, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            VMValue::Null => write!(f, "null"),
            VMValue::Bool(b) => write!(f, "{b}"),
            VMValue::Int(n) => write!(f, "{n}"),
            VMValue::Float(n) => write!(f, "{}", sui_compat::versions::cppnix_format_float(*n)),
            VMValue::String(s) => write!(f, "{s:?}"),
            VMValue::Path(p) => write!(f, "{p}"),
            VMValue::List(items) => {
                write!(f, "[ ")?;
                for item in items {
                    item.debug_with(interner, f)?;
                    write!(f, " ")?;
                }
                write!(f, "]")
            }
            VMValue::Attrs(map) => {
                write!(f, "{{ ")?;
                for (sym, v) in map {
                    let key = interner.resolve(*sym);
                    write!(f, "{key} = ")?;
                    v.debug_with(interner, f)?;
                    write!(f, "; ")?;
                }
                write!(f, "}}")
            }
            VMValue::Closure(c) => write!(f, "{c:?}"),
            VMValue::Builtin(b) => write!(f, "{b:?}"),
            VMValue::HigherOrderBuiltin(h) => write!(f, "{h:?}"),
            VMValue::Thunk(t) => write!(f, "{t:?}"),
        }
    }
}

/// A string-keyed value for external API consumption.
///
/// Produced by [`VMValue::to_string_keyed`]. Uses `BTreeMap<String, _>`
/// for attrsets so callers don't need access to the interner.
///
/// The `Thunk` variant carries a deferred computation from the tree-walker
/// bridge. When the VM encounters it during `string_keyed_to_nanbox`, it
/// wraps the callback in a `VMThunk` so the value is only evaluated when
/// actually accessed. This keeps `getFlake` fast by not eagerly resolving
/// all transitive flake inputs.
pub enum StringKeyedValue {
    Null,
    Bool(bool),
    Int(i64),
    Float(f64),
    String(String),
    Path(String),
    List(Vec<StringKeyedValue>),
    Attrs(BTreeMap<String, StringKeyedValue>),
    Lambda,
    /// A deferred value — evaluated on demand when the VM forces it.
    ///
    /// The callback returns a `StringKeyedValue` which is then converted
    /// to a `NanBox` by the VM. Uses `Rc<dyn Fn()>` for cheap cloning
    /// and shared memoization.
    Thunk(Rc<dyn Fn() -> Result<StringKeyedValue, String>>),
    /// A callable tree-walker function wrapped as a bridge callback.
    ///
    /// When the VM needs to call this, it converts args through the
    /// bridge and delegates to the tree-walker. Created when a Lambda
    /// or Builtin value crosses the tree-walker → VM boundary.
    Callable(Rc<dyn Fn(StringKeyedValue) -> Result<StringKeyedValue, String>>),
}

impl Clone for StringKeyedValue {
    fn clone(&self) -> Self {
        match self {
            Self::Null => Self::Null,
            Self::Bool(b) => Self::Bool(*b),
            Self::Int(n) => Self::Int(*n),
            Self::Float(f) => Self::Float(*f),
            Self::String(s) => Self::String(s.clone()),
            Self::Path(p) => Self::Path(p.clone()),
            Self::List(items) => Self::List(items.clone()),
            Self::Attrs(map) => Self::Attrs(map.clone()),
            Self::Lambda => Self::Lambda,
            Self::Thunk(cb) => Self::Thunk(Rc::clone(cb)),
            Self::Callable(cb) => Self::Callable(Rc::clone(cb)),
        }
    }
}

impl PartialEq for StringKeyedValue {
    fn eq(&self, other: &Self) -> bool {
        match (self, other) {
            (Self::Null, Self::Null) => true,
            (Self::Bool(a), Self::Bool(b)) => a == b,
            (Self::Int(a), Self::Int(b)) => a == b,
            (Self::Float(a), Self::Float(b)) => a == b,
            (Self::String(a), Self::String(b)) => a == b,
            (Self::Path(a), Self::Path(b)) => a == b,
            (Self::List(a), Self::List(b)) => a == b,
            (Self::Attrs(a), Self::Attrs(b)) => a == b,
            (Self::Lambda, Self::Lambda) => true,
            // Thunks are never structurally equal (identity comparison
            // would be misleading since they are lazy).
            (Self::Thunk(_), _) | (_, Self::Thunk(_)) => false,
            // Callables are function values — identity comparison is misleading.
            (Self::Callable(_), _) | (_, Self::Callable(_)) => false,
            _ => false,
        }
    }
}

impl Eq for StringKeyedValue {}

impl fmt::Debug for StringKeyedValue {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            Self::Null => write!(f, "Null"),
            Self::Bool(b) => write!(f, "Bool({b})"),
            Self::Int(n) => write!(f, "Int({n})"),
            Self::Float(v) => write!(f, "Float({v})"),
            Self::String(s) => write!(f, "String({s:?})"),
            Self::Path(p) => write!(f, "Path({p:?})"),
            Self::List(items) => f.debug_tuple("List").field(items).finish(),
            Self::Attrs(map) => f.debug_tuple("Attrs").field(map).finish(),
            Self::Lambda => write!(f, "Lambda"),
            Self::Thunk(_) => write!(f, "Thunk(<deferred>)"),
            Self::Callable(_) => write!(f, "Callable(<bridge-fn>)"),
        }
    }
}

impl fmt::Display for StringKeyedValue {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            StringKeyedValue::Null => write!(f, "null"),
            StringKeyedValue::Bool(b) => write!(f, "{b}"),
            StringKeyedValue::Int(n) => write!(f, "{n}"),
            StringKeyedValue::Float(n) => write!(f, "{}", sui_compat::versions::cppnix_format_float(*n)),
            StringKeyedValue::String(s) => write!(f, "\"{s}\""),
            StringKeyedValue::Path(p) => write!(f, "{p}"),
            StringKeyedValue::List(items) => {
                write!(f, "[ ")?;
                for item in items {
                    write!(f, "{item} ")?;
                }
                write!(f, "]")
            }
            StringKeyedValue::Attrs(map) => {
                write!(f, "{{ ")?;
                for (k, v) in map {
                    write!(f, "{k} = {v}; ")?;
                }
                write!(f, "}}")
            }
            StringKeyedValue::Lambda => write!(f, "<<lambda>>"),
            StringKeyedValue::Thunk(_) => write!(f, "<<thunk>>"),
            StringKeyedValue::Callable(_) => write!(f, "<<lambda>>"),
        }
    }
}

// -- Debug / Display without interner (best-effort) --------------------

impl fmt::Debug for VMValue {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            VMValue::Null => write!(f, "null"),
            VMValue::Bool(b) => write!(f, "{b}"),
            VMValue::Int(n) => write!(f, "{n}"),
            VMValue::Float(n) => write!(f, "{}", sui_compat::versions::cppnix_format_float(*n)),
            VMValue::String(s) => write!(f, "{s:?}"),
            VMValue::Path(p) => write!(f, "{p}"),
            VMValue::List(items) => {
                write!(f, "[ ")?;
                for item in items {
                    write!(f, "{item:?} ")?;
                }
                write!(f, "]")
            }
            VMValue::Attrs(map) => {
                write!(f, "{{ ")?;
                for (sym, v) in map {
                    write!(f, "#{} = {v:?}; ", sym.index())?;
                }
                write!(f, "}}")
            }
            VMValue::Closure(c) => write!(f, "{c:?}"),
            VMValue::Builtin(b) => write!(f, "{b:?}"),
            VMValue::HigherOrderBuiltin(h) => write!(f, "{h:?}"),
            VMValue::Thunk(t) => write!(f, "{t:?}"),
        }
    }
}

impl fmt::Display for VMValue {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            VMValue::Null => write!(f, "null"),
            VMValue::Bool(b) => write!(f, "{b}"),
            VMValue::Int(n) => write!(f, "{n}"),
            VMValue::Float(n) => {
                // Nix always prints at least one decimal place for floats.
                if n.fract() == 0.0 {
                    write!(f, "{n:.6}")
                } else {
                    write!(f, "{n}")
                }
            }
            VMValue::String(s) => write!(f, "\"{s}\""),
            VMValue::Path(p) => write!(f, "{p}"),
            VMValue::List(items) => {
                write!(f, "[ ")?;
                for item in items {
                    write!(f, "{item} ")?;
                }
                write!(f, "]")
            }
            VMValue::Attrs(map) => {
                write!(f, "{{ ")?;
                for (sym, v) in map {
                    write!(f, "#{} = {v}; ", sym.index())?;
                }
                write!(f, "}}")
            }
            VMValue::Closure(_) => write!(f, "<<lambda>>"),
            VMValue::Builtin(b) => write!(f, "<<builtin {}>>", b.name),
            VMValue::HigherOrderBuiltin(h) => write!(f, "<<builtin {:?}>>", h.op),
            VMValue::Thunk(_) => write!(f, "<<thunk>>"),
        }
    }
}

impl PartialEq for VMValue {
    fn eq(&self, other: &Self) -> bool {
        match (self, other) {
            (VMValue::Null, VMValue::Null) => true,
            (VMValue::Bool(a), VMValue::Bool(b)) => a == b,
            (VMValue::Int(a), VMValue::Int(b)) => a == b,
            (VMValue::Float(a), VMValue::Float(b)) => a == b,
            (VMValue::Int(a), VMValue::Float(b)) | (VMValue::Float(b), VMValue::Int(a)) => {
                (*a as f64) == *b
            }
            (VMValue::String(a), VMValue::String(b)) => a == b,
            (VMValue::Path(a), VMValue::Path(b)) => a == b,
            (VMValue::List(a), VMValue::List(b)) => a == b,
            (VMValue::Attrs(a), VMValue::Attrs(b)) => a == b,
            _ => false,
        }
    }
}

impl Eq for VMValue {}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn type_names() {
        assert_eq!(VMValue::Null.type_name(), "null");
        assert_eq!(VMValue::Bool(true).type_name(), "bool");
        assert_eq!(VMValue::Int(0).type_name(), "int");
        assert_eq!(VMValue::Float(0.0).type_name(), "float");
        assert_eq!(VMValue::String("".to_string()).type_name(), "string");
        assert_eq!(VMValue::Path("/tmp".to_string()).type_name(), "path");
        assert_eq!(VMValue::List(vec![]).type_name(), "list");
        assert_eq!(VMValue::Attrs(BTreeMap::new()).type_name(), "set");
    }

    #[test]
    fn equality_int_float_coercion() {
        assert_eq!(VMValue::Int(1), VMValue::Float(1.0));
        assert_eq!(VMValue::Float(1.0), VMValue::Int(1));
        assert_ne!(VMValue::Int(1), VMValue::Float(1.5));
    }

    #[test]
    fn equality_same_types() {
        assert_eq!(VMValue::Null, VMValue::Null);
        assert_eq!(VMValue::Bool(true), VMValue::Bool(true));
        assert_ne!(VMValue::Bool(true), VMValue::Bool(false));
        assert_eq!(VMValue::Int(42), VMValue::Int(42));
        assert_eq!(
            VMValue::String("hello".to_string()),
            VMValue::String("hello".to_string())
        );
    }

    #[test]
    fn equality_different_types() {
        assert_ne!(VMValue::Null, VMValue::Bool(false));
        assert_ne!(VMValue::Int(0), VMValue::Bool(false));
        assert_ne!(VMValue::String("1".to_string()), VMValue::Int(1));
    }

    #[test]
    fn is_truthy_bool() {
        assert!(VMValue::Bool(true).is_truthy().unwrap());
        assert!(!VMValue::Bool(false).is_truthy().unwrap());
    }

    #[test]
    fn is_truthy_non_bool_errors() {
        assert!(VMValue::Int(1).is_truthy().is_err());
        assert!(VMValue::Null.is_truthy().is_err());
    }

    #[test]
    fn attrs_to_strings_conversion() {
        let mut interner = Interner::new();
        let key = interner.intern("hello");
        let mut attrs = BTreeMap::new();
        attrs.insert(key, VMValue::Int(42));
        let val = VMValue::Attrs(attrs);
        let string_map = val.attrs_to_strings(&interner).unwrap();
        assert_eq!(string_map.get("hello"), Some(&VMValue::Int(42)));
    }

    #[test]
    fn to_string_keyed_roundtrip() {
        let mut interner = Interner::new();
        let key = interner.intern("x");
        let mut attrs = BTreeMap::new();
        attrs.insert(key, VMValue::Int(1));
        let val = VMValue::Attrs(attrs);
        let sk = val.to_string_keyed(&interner);
        match sk {
            StringKeyedValue::Attrs(map) => {
                assert_eq!(map.get("x"), Some(&StringKeyedValue::Int(1)));
            }
            _ => panic!("expected Attrs"),
        }
    }

    #[test]
    fn symbol_keyed_attrs_equality() {
        let mut interner = Interner::new();
        let k1 = interner.intern("a");
        let k2 = interner.intern("a");
        let mut a1 = BTreeMap::new();
        a1.insert(k1, VMValue::Int(1));
        let mut a2 = BTreeMap::new();
        a2.insert(k2, VMValue::Int(1));
        assert_eq!(VMValue::Attrs(a1), VMValue::Attrs(a2));
    }
}