From 87b49870da77ecab30bda142c3e9b068d1b0cb85 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Johanna=20S=C3=B6rng=C3=A5rd?= Date: Fri, 13 Dec 2024 12:32:03 +0100 Subject: [PATCH] Remove information about what the method isn't --- README.md | 4 ---- src/lib.rs | 8 ++------ 2 files changed, 2 insertions(+), 10 deletions(-) diff --git a/README.md b/README.md index 2182aee..6c2cad3 100644 --- a/README.md +++ b/README.md @@ -14,10 +14,6 @@ This method works by dividing the function's domain into subdomains. On each one, it uses a simple transformation of the input inserted into a rational function to approximate the function's value. -The method is not iterative, it doesn't allocate memory, and it doesn't use -recursion or loops except for what might already be included in the -implementations of the logarithm and square root functions. - The implementation uses conditional switches on the input value to select the appropriate subdomain, followed by either a square root (and possibly a division) or a logarithm. Then it performs a series of diff --git a/src/lib.rs b/src/lib.rs index baa22d2..a76d7b6 100644 --- a/src/lib.rs +++ b/src/lib.rs @@ -4,12 +4,8 @@ //! with the method of Toshio Fukushima \[[1](#references)\]. //! //! This method works by dividing the function's domain into subdomains. -//! On each one, it uses a simple transformation of the input inserted -//! into a rational function to approximate the function's value. -//! -//! The method is not iterative, it doesn't allocate memory, and it doesn't use -//! recursion or loops except for what might already be included in the -//! implementations of the logarithm and square root functions. +//! On each one, it uses a simple transformation of the input inserted into +//! a rational function to approximate the function's value. //! //! The implementation uses conditional switches on the input value //! to select the appropriate subdomain, followed by either a square root