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

/*
 * Copyright 2013 ZXing authors
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

use crate::common::BitArray;

use super::{BinaryShiftToken, SimpleToken};

#[derive(Debug, PartialEq, Eq, Clone)]
pub enum TokenType {
    Simple(SimpleToken),
    BinaryShift(BinaryShiftToken),
    Empty,
}

impl TokenType {
    pub fn appendTo(&self, bit_array: &mut BitArray, text: &[u8]) {
        // let token = &self.tokens[self.current_pointer];
        match self {
            TokenType::Simple(a) => a.appendTo(bit_array, text),
            TokenType::BinaryShift(a) => a.appendTo(bit_array, text),
            TokenType::Empty => panic!("cannot appendTo on Empty final item"),
        }
    }
}

#[derive(Debug, Clone, PartialEq, Eq)]
pub struct Token {
    tokens: Vec<TokenType>,
    //current_pointer: usize,
}

impl Token {
    pub fn new() -> Self {
        Self {
            tokens: Vec::new(),
            //current_pointer: 0,
        }
    }
    // pub fn getPrevious(&mut self) -> &TokenType {
    //     self.current_pointer -= 1;
    //     &self.tokens[self.current_pointer]
    // }
    pub fn add(&mut self, value: i32, bit_count: u32) {
        //self.current_pointer += 1;
        self.tokens
            .push(TokenType::Simple(SimpleToken::new(value, bit_count)));
        // &self.tokens[self.current_pointer]
    }
    pub fn addBinaryShift(&mut self, start: u32, byte_count: u32) {
        //self.current_pointer += 1;
        self.tokens
            .push(TokenType::BinaryShift(BinaryShiftToken::new(
                start, byte_count,
            )));
        // &self.tokens[self.current_pointer]
    }
}

pub struct TokenIter {
    src: Vec<TokenType>,
    // pos: usize,
}

impl Iterator for TokenIter {
    type Item = TokenType;

    fn next(&mut self) -> Option<Self::Item> {
        self.src.pop()
    }
}

impl IntoIterator for Token {
    type Item = TokenType;

    type IntoIter = TokenIter;

    fn into_iter(self) -> Self::IntoIter {
        TokenIter {
            src: self.tokens,
            // pos: self.current_pointer,
        }
    }
}

// pub enum Token{
//   Simple(Rc<SimpleToken>),
//   BinaryShift(),
//   Empty,
// }

// pub trait TokenTrait {
//     fn getPrevious(&self)->&Token;

//     fn add(&self, value: i32, bitCount: u32) -> Token{
//       Token::Simple(Rc::new(SimpleToken::new(self, value, bitCount)))
//     }

//     fn addBinaryShift(&self, start: i32, byteCount: u32) -> &Token; //{
//                                                                   //   //int bitCount = (byteCount * 8) + (byteCount <= 31 ? 10 : byteCount <= 62 ? 20 : 21);
//                                                                   //   return new BinaryShiftToken(this, start, byteCount);
//                                                                   // }

//     fn appendTo(&self, bitArray: BitArray, text: &[u8]);
// }