How to define a new number system in C++

Question

Essentially what I'm attempting to do is create a base 62 number system in C++ (an alphanumeric number system -- one that includes a-z, A-Z, and 0-9). How would something like this be accomplished? I tried using a char array like this:

const char alphaNum[62] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', ' y', 'z', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z' };

however writing functions to use that array and try to count takes way too much code to be practical (for 0 to 61, sure, just select it from the array. The problem arises when you try to do multiple-digit numbers, i.e. 00). It would be much simpler to just say foobar++;. Does anyone have a way to define number systems, or at least a way for me to make it so that I don't have to write a case for every time it reaches Z?

EDIT: it should have been const char, dunno why VS decided it would be fun not to copy some of it.

Answer 1

You need to separate external (to User) representation and internal representation.

Internal Representation
Internally to the computer, you should use the most efficient representation. This could be hex, binary or decimal; or don't worry about it.

When presenting to the User, you should use the External Representation.

External Representation
Your character array represents digits of your number system. (It should also be const.) You need to isolate the digits from your internal representation. For example, in base 16, we divide the number by 16 to shift the number to the right and use modulo division to get the remainder. The remainder is the digit value. Use the remainder to look up the digit representation from your array.

Try your algorithms on a smaller numeric base, such as 17 or 18. Expanding to base 62 should be a matter of changing a #define or const integer.

Edit 1: The difficult method
A more difficult method is to use one byte for each digit of your number system. A byte, octet or unsigned char, has a range of 0 to 255, so should accommodate a digit of base 62.

Use a std::vector<unsigned char> to represent your number. You'll have to decide if the most significant digit is at the front of the vector or at the end.

To increment a digit:

  add 1 to digit.
  if digit value > 62
  {
     set digit to zero.
     Load digit with next greater column value (i.e. vector[position + 1];
     Repeat at top of algorithm
  }

This is the standard algorithm regardless of base (10, 8, 16, etc.).
The fundamental rules of decimal addition, subtraction, multiplication and division still apply. (Hint).

This is a technique used in the Big Number libraries.