@@ -17,16 +17,30 @@ decoder::decoder() {
1717}
1818
1919unsigned __int8 decoder::decode (unsigned __int8 recv) {
20- std::cout << " decoder : " << std::bitset<8 >(recv) << std::endl;
21- node * n = graphTracer (0 ,recv,1 );
22- for (int i = 1 ; n->getNextFirstStateNode () != nullptr ; i++) {
20+ std::cout << " decoder : " << std::bitset<8 >(recv) << std::endl;
21+ node* n = graphTracer (0 , recv, 1 );
22+ printStates (n);
23+ /* for (int i = 1; n->getNextFirstStateNode() != nullptr; i++) {
2324 std::cout << "i : " << i << " | " << std::bitset<8>(n->getNextFirstStateNodeDistance()&0x03) << std::endl;
2425 std::cout << "i : " << i << " | " << std::bitset<8>(n->getNextScondStateNodeDistance() & 0x03) << std::endl;
2526 n = n->getNextFirstStateNode();
26- }
27+ }*/
2728 return 0 ;
2829}
2930
31+ void decoder::printStates (node* n) {
32+ if (n->getNextFirstStateNode () == nullptr ) {
33+ return ;
34+ }
35+ std::cout << " state : " << std::bitset<8 >(n->getState ()) << std::endl;
36+ std::cout << " NextFirstStateNodeDistance : " << std::bitset<8 >(n->getNextFirstStateNodeDistance () & 0x03 ) << std::endl;
37+ std::cout << " NextScondStateNodeDistance : " << std::bitset<8 >(n->getNextScondStateNodeDistance () & 0x03 ) << std::endl;
38+ std::cout << " getNextFirstStateNode()->getState() : " << std::bitset<8 >(n->getNextFirstStateNode ()->getState ()) << std::endl;
39+ std::cout << " getNextScondStateNode()->getState() : " << std::bitset<8 >(n->getNextScondStateNode ()->getState ()) << std::endl;
40+ this ->printStates (n->getNextFirstStateNode ());
41+ this ->printStates (n->getNextScondStateNode ());
42+ }
43+
3044node* decoder::graphTracer (unsigned __int8 state, unsigned __int8 data, unsigned __int8 level){
3145 // return point | break point of recursive loop
3246 if (level == MAX_STATE_CEHCK + 2 ) {
0 commit comments