computable 0.1.0

Computable real numbers with guaranteed correctness via interval refinement
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

//! Base operation that wraps user-defined leaf nodes.

use std::sync::Arc;

use crate::binary::Bounds;
use crate::error::ComputableError;
use crate::node::{BaseNode, BoundsAccess, Node, NodeOp};

/// Operation that wraps a user-defined base node.
pub struct BaseOp {
    pub base: Arc<dyn BaseNode>,
}

impl NodeOp for BaseOp {
    fn compute_bounds(&self) -> Result<Bounds, ComputableError> {
        BoundsAccess::get_bounds(self.base.as_ref())
    }

    fn refine_step(&self, _precision_bits: usize) -> Result<bool, ComputableError> {
        self.base.refine()?;
        let bounds = BoundsAccess::get_bounds(self.base.as_ref())?;
        if bounds.small() == &bounds.large() {
            return Ok(false);
        }
        Ok(true)
    }

    fn children(&self) -> Vec<Arc<Node>> {
        Vec::new()
    }

    fn is_refiner(&self) -> bool {
        true
    }
}