rexpr 1.0.7

use crate::ast::Node;
use crate::error::Error;
use crate::parser::parse;
use crate::token::TokenMap;
use std::collections::LinkedList;

///lexer
pub fn lexer(express: &str, token_map: &TokenMap) -> Result<Vec<String>, Error> {
    let express = express.replace("none", "null").replace("None", "null");
    let mut tokens = parse_tokens(&express, token_map)?;
    loop_fill_lost_token(0, &mut tokens, token_map);
    return Ok(tokens);
}

//fill lost node to  '+1'  =>  ['(','null',"+",'1',')']
fn loop_fill_lost_token(start_index: usize, arg: &mut Vec<String>, opt_map: &TokenMap) {
    let len = arg.len();
    let mut last = "".to_string();
    for index in start_index..len {
        let item = arg[index].clone();
        if index == 0 && item != "(" && opt_map.is_token(&item) {
            let mut right = "null".to_string();
            if arg.get((index + 1) as usize).is_some() {
                right = arg.remove((index + 1) as usize);
            }
            let current = arg.remove(0);
            arg.insert(0, ")".to_string());
            arg.insert(0, right);
            arg.insert(0, current);
            arg.insert(0, "null".to_string());
            arg.insert(0, "(".to_string());
            return loop_fill_lost_token(4, arg, opt_map);
        }
        if index >= 1
            && last != ")"
            && item != "("
            && item != ")"
            && (opt_map.is_token(&last))
            && opt_map.is_token(&item)
        {
            let mut right = "null".to_string();
            if arg.get((index + 1) as usize).is_some() {
                right = arg.remove((index + 1) as usize);
            }
            let current = arg.remove(index);
            arg.insert(index, ")".to_string());
            arg.insert(index, right);
            arg.insert(index, current);
            arg.insert(index, "null".to_string());
            arg.insert(index, "(".to_string());
            return loop_fill_lost_token(index + 5, arg, opt_map);
        }
        if (index + 1) as usize == len && item != ")" && opt_map.is_token(&item) {
            let right = "null".to_string();
            let current = arg.remove(index);
            let last;
            if (index - 1) as i32 >= 0 {
                last = arg.remove(index - 1);
            } else {
                last = "null".to_string();
            }
            let index = index - 1;
            arg.insert(index, ")".to_string());
            arg.insert(index, right);
            arg.insert(index, current);
            arg.insert(index, last);
            arg.insert(index, "(".to_string());
        }
        last = item.to_string();
    }
}

/// lexer and parse
pub fn lexer_parse_node(express: &str, token_map: &TokenMap) -> Result<Node, Error> {
    let tokens = lexer(express, token_map)?;
    return Ok(parse(token_map, &tokens, express)?);
}

///parse token to vec
pub fn parse_tokens(s: &str, token_map: &TokenMap) -> Result<Vec<String>, Error> {
    let chars = s.chars();
    let chars_len = s.len() as i32;
    let mut result = LinkedList::new();
    //str
    let mut is_find_str = false;
    let mut temp_str = String::new();

    let empty_string = String::new();
    //token
    let mut temp_arg = String::new();
    let mut index: i32 = -1;
    for item in chars {
        index = index + 1;
        let is_token = token_map.is_token(item.to_string().as_str());
        if item == '\'' || item == '`' {
            if is_find_str {
                //第二次找到
                is_find_str = false;
                temp_str.push(item);
                trim_push_back(&temp_str, &mut result);
                temp_str.clear();
                continue;
            }
            is_find_str = true;
            temp_str.push(item);
            continue;
        }
        if is_find_str {
            temp_str.push(item);
            continue;
        }
        if item != '`' && item != '\'' && is_token == false && !is_find_str {
            //need reset
            temp_arg.push(item);
            if (index + 1) == chars_len {
                trim_push_back(&temp_arg, &mut result);
            }
        } else {
            trim_push_back(&temp_arg, &mut result);
            temp_arg.clear();
        }
        //token node
        if is_token {
            if result.len() > 0 {
                let back = result.back().unwrap_or(&empty_string);
                if token_map.is_token(&format!("{}{}", back, &item)) == false {
                    trim_push_back(&item.to_string(), &mut result);
                    continue;
                }
                if back != "" && token_map.is_token(back) {
                    let mut new_item = back.to_owned();
                    result.pop_back();
                    new_item.push(item);
                    trim_push_back(&new_item, &mut result);
                    continue;
                }
            }
            trim_push_back(&item.to_string(), &mut result);
            continue;
        }
    }
    if is_find_str {
        return Err(Error::from(format!(
            "[rexpr] find string expr not end! express:{}",
            s
        )));
    }
    let mut v = vec![];
    for item in result {
        v.push(item);
    }
    return Ok(v);
}

fn trim_push_back(arg: &str, list: &mut LinkedList<String>) {
    let trim_str = arg.trim().to_string();
    if trim_str.is_empty() {
        return;
    }
    list.push_back(trim_str);
}

#[cfg(test)]
mod test {
    use crate::bencher::QPS;
    use crate::lexer::{lexer, parse_tokens};
    use crate::token::TokenMap;

    #[test]
    fn test_fill() {
        let l = lexer("-1 == -a", &TokenMap::new()).unwrap();
        println!("{:?}", &l);
        assert_eq!(
            l,
            vec!["(", "null", "-", "1", ")", "==", "(", "null", "-", "a", ")"]
        )
    }

    #[test]
    fn test_fill_first() {
        let l = lexer("-1 == -1", &TokenMap::new()).unwrap();
        println!("{:?}", &l);
        assert_eq!(
            l,
            vec!["(", "null", "-", "1", ")", "==", "(", "null", "-", "1", ")"]
        )
    }

    #[test]
    fn test_fill_last() {
        let l = lexer("-1 == 1-", &TokenMap::new()).unwrap();
        println!("{:?}", &l);
        assert_eq!(
            l,
            vec!["(", "null", "-", "1", ")", "==", "(", "1", "-", "null", ")"]
        )
    }

    #[test]
    fn test_fill_center() {
        let l = lexer("-1 == -1 && -1 == -2", &TokenMap::new()).unwrap();
        println!("{:?}", &l);
        assert_eq!(
            l,
            vec![
                "(", "null", "-", "1", ")", "==", "(", "null", "-", "1", ")", "&&", "(", "null",
                "-", "1", ")", "==", "(", "null", "-", "2", ")"
            ]
        )
    }

    #[test]
    fn test_fill_center_n() {
        let l = lexer("-1 -1 -1 --1", &TokenMap::new()).unwrap();
        println!("{:?}", &l);
        assert_eq!(
            l,
            vec!["(", "null", "-", "1", ")", "-", "1", "-", "1", "-", "(", "null", "-", "1", ")"]
        )
    }

    //cargo test --release --package rexpr --lib lexer::test::test_bench_lexer --no-fail-fast -- --exact -Z unstable-options --show-output
    #[test]
    fn test_bench_lexer() {
        let token_map = TokenMap::new();
        let now = std::time::Instant::now();
        let total = 1000000;
        for _ in 0..total {
            parse_tokens("1+1", &token_map).unwrap();
        }
        now.time(total);
    }
}