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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536
//! A simple calculator that accepts input keys acting like a real calculator. It is base on [`crate::calc::DumbCalcProcessor`] for it's calculation processing.
#![deny(warnings)]
#![allow(unused)]
use core::panic;
use std::{error::Error, ops::Index};
use crate::{
calc::{self, CalcProcessorBackup, CalcResult, DumbCalcProcessor},
shared::DumbError,
};
#[test]
fn test_calculator() {}
pub struct DumbCalculator {
entering: EnteringMode,
calc: calc::DumbCalcProcessor,
undo_stack: Option<Vec<UndoStep>>,
history_stack: Option<Vec<String>>,
}
/// a simple calculator that accepts input keys acting like a real calculator;
/// it may task is the keep track of key presses and turn them into "calculation units";
/// it uses a [`crate::calc::DumbCalcProcessor`] to handle the actual calculation processing
///
/// for example:
/// ```
/// use rusty_dumb_tools::calculator::DumbCalculator;
/// let mut calculator = DumbCalculator::new();
/// calculator.push("1").unwrap();
/// calculator.push(".").unwrap();
/// calculator.push("0").unwrap();
/// calculator.push("2").unwrap();
/// assert_eq!(calculator.get_display(), "1.02");
/// calculator.push("*").unwrap();
/// calculator.push("3").unwrap();
/// assert_eq!(calculator.get_display(), "3");
/// calculator.push("=").unwrap();
/// assert_eq!(calculator.get_display(), "3.06");
/// ```
///
/// for a fuller sample code, please refer to the "calculator" sub-demo of [`crate::demo::run_demo`]
impl DumbCalculator {
/// create a new [`DumbCalculator`] instance with minimum feature (i.e. no undo etc)
pub fn new_min() -> Self {
DumbCalculator::new_with_settings(DumbCalculatorSettings {
enable_history: false,
enable_undo: false,
})
}
/// create a new [`DumbCalculator`] (with all the default features enabled)
pub fn new() -> Self {
DumbCalculator::new_with_settings(DumbCalculatorSettings::default())
}
/// like [`DumbCalculator::new`] but with settings
pub fn new_with_settings(settings: DumbCalculatorSettings) -> Self {
let undo_stack = if settings.enable_undo {
Some(Vec::new())
} else {
None
};
let history_stack = if settings.enable_history {
Some(Vec::new())
} else {
None
};
Self {
entering: EnteringMode::Not,
calc: calc::DumbCalcProcessor::new(),
undo_stack: undo_stack,
history_stack: history_stack,
}
}
/// push a "key input":
/// * a digit, including a "."
/// * a bracket: “(”, “)”
/// * an operator accepted by [`crate::calc::DumbCalcProcessor::push`] like:
/// - binary operators; e.g. "+", "-", "*", "/", etc
/// - unary operators; e.g. "neg", "sin", "cos", "tan", etc
/// * a constant accepted by [`crate::calc::DumbCalcProcessor::push`] like "PI", etc
/// * "="
pub fn push(&mut self, key: &str) -> Result<(), DumbError> {
if key == "." {
self._record_undo(key, false);
self.entering = match &self.entering {
EnteringMode::Not => EnteringMode::Decimal(0, String::from("")),
EnteringMode::Integer(i) => EnteringMode::Decimal(*i, String::from("")),
EnteringMode::Decimal(i, d) => EnteringMode::Decimal(*i, d.clone()),
EnteringMode::Error => EnteringMode::Error,
}
} else if key >= "0" && key <= "9" {
self._record_undo(key, false);
let digit = key.parse::<u32>().unwrap();
self.entering = match &self.entering {
EnteringMode::Not => EnteringMode::Integer(digit),
EnteringMode::Integer(i) => {
if true {
match i.checked_mul(10).and_then(|x| x.checked_add(digit)) {
Some(new_i) => EnteringMode::Integer(new_i),
None => EnteringMode::Error,
}
} else {
EnteringMode::Integer(*i * 10 + digit)
}
}
EnteringMode::Decimal(i, d) => {
let digit_str = digit.to_string();
if d.is_empty() {
EnteringMode::Decimal(*i, digit_str)
} else {
let mut new_d = d.clone();
new_d.push_str(&digit_str /*&digit.to_string()*/);
EnteringMode::Decimal(*i, new_d)
}
}
EnteringMode::Error => EnteringMode::Error,
}
} else {
self._record_undo(key, true);
self.entering = match &self.entering {
EnteringMode::Not => EnteringMode::Not,
EnteringMode::Integer(i) => {
self.calc.push(i.to_string().as_str()).unwrap();
EnteringMode::Not
}
EnteringMode::Decimal(i, d) => {
let num = if d.is_empty() {
format!("{}.0", i)
} else {
format!("{}.{}", i, d)
};
self.calc.push(num.as_str()).unwrap();
EnteringMode::Not
}
EnteringMode::Error => EnteringMode::Error,
};
self.calc.push(key)?;
}
Ok(())
}
/// like [`DumbCalculator::push`] but each characters of the input will be pushed individually one by one
pub fn push_chars(&mut self, keys: &str) -> Result<(), DumbError> {
for key in keys.chars() {
if key != ' ' {
self.push(key.to_string().as_str())?;
}
}
Ok(())
}
/// undo the last "key input" done by [`DumbCalculator::push`], if undo is enabled
pub fn undo(&mut self) {
if let Some(history_stack) = &mut self.history_stack {
history_stack.pop();
}
if let Some(undo_stack) = &mut self.undo_stack {
let undo = undo_stack.pop();
if let Some(undo) = undo {
match undo {
UndoStep::EnteringBackup(entering) => {
self.entering = entering;
}
UndoStep::CalcBackup(backup, entering) => {
//println!("backup: {:?}", entering);
self.calc.restore(backup);
self.entering = entering;
}
}
} else {
self.entering = EnteringMode::Not;
self.calc.reset();
}
}
}
fn _record_undo(&mut self, key: &str, for_calc: bool) {
if let Some(history_stack) = &mut self.history_stack {
history_stack.push(key.to_string());
}
if let Some(undo_stack) = &mut self.undo_stack {
let undo = if for_calc {
UndoStep::CalcBackup(self.calc.backup(), self.entering.clone())
} else {
UndoStep::EnteringBackup(self.entering.clone())
// match &self.entering {
// EnteringMode::Not => None,
// EnteringMode::Integer(i) => Some(UndoStep::EnteringInteger(*i)),
// EnteringMode::Decimal(i, d) => Some(UndoStep::EnteringDecimal(*i, d.clone())),
// EnteringMode::Error => None,
// }
};
undo_stack.push(undo);
}
}
/// reset the calculator
pub fn reset(&mut self) {
self.entering = EnteringMode::Not;
self.calc.reset();
if let Some(undo_stack) = &mut self.undo_stack {
undo_stack.clear();
}
if let Some(history_stack) = &mut self.history_stack {
history_stack.clear();
}
}
/// get history of the "key input", if history is enabled
pub fn get_history(&self) -> Option<&Vec<String>> {
if let Some(history_stack) = &self.history_stack {
Some(history_stack)
} else {
None
}
}
/// like [`DumbCalculator::get_history`] but returns a string instead
pub fn get_history_string(&self, better_symbols: bool) -> Option<String> {
enum Marker {
NumberStart(usize),
OpenBracket(usize),
Finalized,
}
enum UnaryBracket {
No,
IfNeeded,
IfNeededNotNum,
}
let history = self.get_history();
if let Some(history) = history {
let mut hist: String = String::new();
//let mut prev_h: Option<&str> = None;
let mut marker_stack: Vec<Marker> = Vec::new();
let mut prev_c = None::<char>;
let mut pop_marker = false;
for h in history {
let mut new_prev_c = None::<char>;
let mut new_pop_marker = false;
if h == "=" {
let mut new_hist = String::new();
new_hist.push('{');
new_hist.push_str(hist.as_str());
new_hist.push('}');
hist = new_hist;
marker_stack.clear();
marker_stack.push(Marker::Finalized);
new_prev_c = None;
new_pop_marker = false;
} else if DumbCalcProcessor::is_unary_operator(h) {
let marker = marker_stack.last();
let marker = match marker {
Some(Marker::NumberStart(start)) => Some((*start, true)),
Some(Marker::OpenBracket(start)) => Some((*start, false)),
Some(Marker::Finalized) => Some((0, true)),
_ => None,
};
if h == "%" && !better_symbols {
hist.push_str("%");
} else if let Some((start, bracket)) = marker {
let prefix = hist[0..start].to_string();
let inside = hist[start..].to_string();
let (h1, h2, unary_bracket) = if better_symbols && h == "neg" {
("-", "", UnaryBracket::IfNeededNotNum)
} else if better_symbols && h == "%" {
if inside.parse::<f64>().is_err() {
("", "/100", UnaryBracket::IfNeeded)
} else {
("", "%", UnaryBracket::No)
}
} else if better_symbols && h == "square" {
("", "²", UnaryBracket::IfNeededNotNum)
} else if better_symbols && h == "inv" {
("1/", "", UnaryBracket::IfNeededNotNum)
} else if better_symbols && h == "sqrt" {
("√", "", UnaryBracket::IfNeededNotNum)
} else if better_symbols && h == "abs" {
("|", "|", UnaryBracket::No)
} else if better_symbols && h == "pow10" {
("10^", "", UnaryBracket::No)
} else if better_symbols && h == "asin" {
("sin⁻¹", "", UnaryBracket::IfNeeded)
} else if better_symbols && h == "acos" {
("cos⁻¹", "", UnaryBracket::IfNeeded)
} else if better_symbols && h == "atan" {
("tan⁻¹", "", UnaryBracket::IfNeeded)
} else {
(h.as_str(), "", UnaryBracket::IfNeeded)
};
let bracket = match unary_bracket {
UnaryBracket::No => false,
UnaryBracket::IfNeeded => bracket,
UnaryBracket::IfNeededNotNum => {
bracket && inside.parse::<f64>().is_err()
}
};
hist = prefix;
hist.push_str(h1);
if bracket {
hist.push('(');
}
hist.push_str(inside.as_str());
if bracket {
hist.push(')');
}
hist.push_str(h2);
} else {
let h = format!("_{}_", h);
hist.push_str(h.as_str()); // ²
}
// if marker.is_some() {
// marker_stack.push(marker.unwrap());
// }
if pop_marker {
marker_stack.pop();
}
} else {
//let h = h.trim();
if pop_marker {
marker_stack.pop();
}
let h = if better_symbols {
match h.as_str() {
"+" => "+",
"-" => "−",
"*" => "×",
"/" => "÷",
_ => h,
}
} else {
h
};
if h == "(" {
marker_stack.push(Marker::OpenBracket(hist.len()));
} else if h == ")" {
loop {
let marker = marker_stack.last();
if marker.is_none() {
break;
}
if let Marker::OpenBracket(start) = marker.unwrap() {
break;
} else {
marker_stack.pop();
}
}
new_pop_marker = true;
} else if let Some(c) = h.chars().next() {
if c == '.' || (c >= '0' && c <= '9') {
new_prev_c = Some(c);
}
if prev_c.is_none() {
let marker = marker_stack.last();
if let Some(Marker::NumberStart(_)) = marker {
marker_stack.pop();
}
marker_stack.push(Marker::NumberStart(hist.len()));
}
}
hist.push_str(h);
// if pop_marker {
// marker_stack.pop();
// }
}
//prev_h = Some(h);
prev_c = new_prev_c;
pop_marker = new_pop_marker;
}
Some(hist)
} else {
None
}
}
/// get what to show on the calculator's display
pub fn get_display(&self) -> String {
self._get_display(None)
}
/// get what to show on the calculator's display, but with a fixed display width
pub fn get_display_sized(&self, result_width: usize) -> String {
self._get_display(Some(result_width))
}
fn _get_display(&self, result_width: Option<usize>) -> String {
let mut display_result = self.__get_display(result_width);
if let Some(result_width) = result_width {
if result_width == 0 {
panic!("result_width is zero")
}
if display_result == "Error" {
if result_width < 5 {
if result_width < 3 {
display_result = format!("{}E", " ".repeat(result_width - 1))
} else {
display_result = format!("{}Err", " ".repeat(result_width - 3))
}
} else {
display_result = format!("{}Error", " ".repeat(result_width - 5))
}
}
if display_result.len() <= result_width {
let room = result_width - display_result.len();
display_result = format!("{}{}", " ".repeat(room), display_result);
} else {
if true {
display_result = format!("{}", "~".repeat(result_width))
} else {
panic!(
"cannot fit display_result [{}] ({}) to fixed width {}",
display_result,
display_result.len(),
result_width
);
}
}
}
display_result
}
fn __get_display(&self, result_width: Option<usize>) -> String {
let (mut display_result, result) = match &self.entering {
EnteringMode::Not => {
let result = match self.calc.get_result() {
CalcResult::Final(r) => r,
CalcResult::Intermediate(r) => r,
CalcResult::Error(e) => return String::from("Error"),
};
let display_result = format!("{}", result);
(display_result, result)
}
EnteringMode::Integer(i) => {
let result = *i as f64;
let display_result = format!("{}", result);
(display_result, result)
}
EnteringMode::Decimal(i, d) => {
if d.is_empty() {
let display_result = format!("{}.", i);
let result = *i as f64;
(display_result, result)
} else {
let display_result = format!("{}.{}", i, d);
let divider = 10_f64.powf(d.len() as f64);
//let d = d.parse::<u64>().unwrap();
let d = match d.parse::<u64>() {
Ok(d) => d,
Err(_) => {
return String::from("Error");
}
};
let result = *i as f64 + d as f64 / divider;
(display_result, result)
}
}
EnteringMode::Error => {
return String::from("Error");
}
};
//let result = -21.2345;
//let result = -0.123456789123456789;
//let result = -1234567891234.0;
if let Some(result_width) = result_width {
if display_result.len() > result_width {
if display_result.contains(".") {
let dot_idx = display_result.find('.').unwrap();
let places: i32 = result_width as i32 - dot_idx as i32 - 1;
if places > 0 {
display_result = format!("{:.*}", places as usize, result);
}
}
if display_result.len() > result_width {
let places = result_width as i32 - (if result < 0.0 { 5 } else { 4 });
if places > 0 {
display_result = format!("{:.*e}", places as usize, result);
}
}
}
let is_zero = if display_result.len() == result_width {
let dr = display_result.replace('-', "");
let dr = dr.replace(".", "");
let dr = dr.replace('0', "");
let dr = dr.trim();
dr.is_empty()
} else {
false
};
if is_zero {
let places = result_width as i32 - (if result < 0.0 { 6 } else { 5 });
if places > 0 {
let ori_display_result = display_result;
display_result = format!("{:.*e}", places as usize, result);
if display_result.len() > result_width {
//println!("{}", display_result);
// e more than 1 digits
display_result = ori_display_result;
}
}
}
}
display_result
//let display_result = format!("\x1B[7m {} \x1B[0m", display_result);
//Some((display_result, DISPLAY_WIDTH))
}
pub fn get_last_operator(&self) -> Option<String> {
self.calc.get_last_operator()
}
pub fn count_opened_brackets(&self) -> u16 {
self.calc.count_opened_brackets()
}
}
pub struct DumbCalculatorSettings {
pub enable_undo: bool,
pub enable_history: bool,
}
impl Default for DumbCalculatorSettings {
fn default() -> Self {
Self {
enable_undo: true,
enable_history: true,
}
}
}
// pub enum CalculatorDisplay {
// Normal(f64),
// Error(String),
// }
enum UndoStep {
EnteringBackup(EnteringMode),
//EnteringInteger(u32),
//EnteringDecimal(u32, String),
CalcBackup(CalcProcessorBackup, EnteringMode),
}
#[derive(Debug, Clone)]
enum EnteringMode {
Not,
Error,
Integer(u32),
Decimal(u32, String),
}