/* Code name: Hex to binary and decimal converter * By : Babak Sheykan (Pers) * Date : Aug 21, 2017 * * Description: A simple base converter from Hex to signed * and unsigned binary and decimal numbers. * ///////////////////////////////////////////////// */ #include #include // std::reverse #include #include // powf(), powl() #include using std::cout; using std::cin; using std::endl; /*------------- Prototypes -------------*/ bool isHex(const std::string &str, std::vector &vHex); void miniConv2Dec(long long *d, std::vector *vBin); void converter(std::vector &vHex, std::vector &vBin1, std::vector &vBin2, long long *uD, long long *sD, bool *hasU, bool *hasS); void printOut(std::vector &v); int main() { ////////////////////////////////////////////////////////// /*----- Memory Units -----*/ std::vector memHex; // Holds Hex number memHex.reserve(16); // Max = FFFFFFFFFFFFFFFF (Qword) std::vector memBinU; // Holds Unsigned binary digits memBinU.reserve(64); // Max = 64 bits std::vector memBinS; // Holds signed binary digits memBinS.reserve(64); // Max = 64 bits /*----- Decimal Holders -----*/ long long uDec = 0; // Holds returned unsigned decimal long long sDec = 0; // Holds returned signed decimal /*--- Flags ---*/ bool hasSigned = true; bool hasUnsigned = true; ////////////////////////////////////////////////////////////// std::string inputHex = ""; do { cout << "Enter a hex number (MAX 16 characters): "; cin >> inputHex; } while (!isHex(inputHex, memHex)); converter(memHex, memBinU, memBinS, &uDec, &sDec, &hasUnsigned, &hasSigned); cout << endl << endl; cout << "+------------------------------\n"; cout << "| Hex value : " << inputHex << endl; cout << "| Unsigned Bin: "; if (hasUnsigned) { printOut(memBinU); cout << "| Unsigned Dec: " << uDec << endl; } else { cout << "--\n"; cout << "| Unsigned Dec: " << "--\n"; } cout << "| Signed Bin : "; if (hasSigned) { printOut(memBinS); cout << "| Signed Dec : " << sDec << endl; } else { cout << "--\n"; cout << "| Signed Dec : " << "--\n"; } cout << "+------------------------------\n"; } bool isHex(const std::string &str, std::vector &vHex) { // any hex number greater than 16 digits are invalid [16 * 4 = 64 bits] if (str.size() > 16) return false; for (size_t cell = 0; cell < str.size(); ++cell) { if ((str[cell] >= '0' && str[cell] <= '9') || (str[cell] >= 'A' && str[cell] <= 'F') || (str[cell] >= 'a' && str[cell] <= 'f')) { switch (str[cell]) { case 'A': case 'a': vHex.push_back(10); break; case 'B': case 'b': vHex.push_back(11); break; case 'C': case 'c': vHex.push_back(12); break; case 'D': case 'd': vHex.push_back(13); break; case 'E': case 'e': vHex.push_back(14); break; case 'F': case 'f': vHex.push_back(15); break; default: // For numeric values [0 - 9] // 48 ASCII is equivalent to character 0 // subtracting 48 from current ASCII character // stored in string, gives us the target integer. // e.g 53 ASCII is equivalent to character 5 // That is, 53 - 48 = 5 vHex.push_back(str[cell] - 48); } } else { cout << "Invalid Input!\n"; return false; } } // end of for return true; } void converter(std::vector &vHex, std::vector &vBin1, std::vector &vBin2, long long *uD, long long *sD, bool *hasU, bool *hasS) { // Evaluating the Hex number sign if (vHex[0] > 7) { if (vHex.size() == 16) *hasU = false; } else *hasS = false; // Phase #1: converting to RAW* unsigned binary and 1's complement if any. // * By RAW I mean that the binary number hasn't formatted nicely yet. for (size_t i = 0; i < vHex.size(); ++i) { for (int binPow = 3; binPow >= 0; --binPow) { if (vHex[i] >= powf(2, binPow)) { if (*hasU) vBin1.push_back(true); if (*hasS) // Make 1's complement directly vBin2.push_back(false); vHex[i] -= powf(2, binPow); } else { if (*hasU) vBin1.push_back(false); if (*hasS) // Make 1's complement directly vBin2.push_back(true); } } // end of inner for } // end of outer for // Phase #2:perform 2's complement and Passing // Bin values to converting them to Dec if (*hasU) { std::reverse(vBin1.begin(), vBin1.end()); miniConv2Dec(uD, &vBin1); } if (*hasS) { std::reverse(vBin2.begin(), vBin2.end()); // Adding 1 to 1's complement vBin2[0] = vBin2[0] + true; for (size_t j = 0; j < vHex.size(); ++j) { if (vBin2[j] == 2) { vBin2[j] = false; // add carry to next bit vBin2[j + 1] = vBin2[j + 1] + true; } else break; } miniConv2Dec(sD, &vBin2); *sD *= -1; } // end of if } void miniConv2Dec(long long *d, std::vector *vBin) { // Converting to decimal for (size_t idx = 0; idx < vBin->size(); ++idx) // casting to long long prevent overflow // on very large numbers *d += (long long)powl(2, idx) * vBin->at(idx); int shrinker = 1; while (vBin->at(vBin->size() - shrinker) == false) { ++shrinker; if (shrinker == 5) // if The hex number was 0 break; } // Eliminating the junk 0's by resizing the container, // and make RAW binary to nicely formatted one if (shrinker == 5) // if The hex number was 0 vBin->resize(1); else vBin->resize(vBin->size() - shrinker + 1); std::reverse(vBin->begin(), vBin->end()); } void printOut(std::vector &v) { for (size_t x = 0; x < v.size(); ++x) cout << (int)v[x]; cout << endl; }

Hex to Bin and Dec (signed and unsigned)