numeral system convert (partly)

/*
	Author: Alex A. Smirnov
        TimeStamp: "2007-11-04 18:02 sceptik"

	This program is free software; you can redistribute it and/or
	modify it under the terms of the GNU General Public License as
	published by the Free Software Foundation; either version 2, or (at
	your option) any later version.

	This program is distributed in the hope that it will be useful, but
	WITHOUT ANY WARRANTY; without even the implied warranty of
	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	General Public License for more details.

	You should have received a copy of the GNU General Public License
	along with this program; if not, write the Free Software
	Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
	02110-1301 USA
*/

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <cmath>

namespace Convert{
	namespace Utils{
		std::string ToString(double value) 
        { 
			std::stringstream ssStream;
			ssStream << value;

			return ssStream.str();
		}

		int fromBinDecDigit (const std::string &number)
		{
			if (number == "0000") return 0;
			if (number == "0001") return 1;
			if (number == "0010") return 2;
			if (number == "0011") return 3;
			if (number == "0100") return 4;
			if (number == "0101") return 5;
			if (number == "0110") return 6;
			if (number == "0111") return 7;
			if (number == "1000") return 8;
			if (number == "1001") return 9;
		}

		std::string toBinDecDigit (char number)
		{
			switch (number) {
				case '0': return "0000";
				case '1': return "0001";
				case '2': return "0010";
				case '3': return "0011";
				case '4': return "0100";
				case '5': return "0101";
				case '6': return "0110";
				case '7': return "0111";
				case '8': return "1000";
				case '9': return "1001";
				case '.': return ".";
			}
		}

		unsigned short digitToInt(char number)
		{
			if (number >= '0' && number <= '9')
				return number - '0';

			if (number >= 'A' && number <= 'Z')
				return number - 'A' + 10;

			return 0;
		}

		char intToDigit(unsigned short number)
		{
			if (number >= 0 && number <= 9)
				return '0' + number;

			if (number >= 10 && number <= 35)
				return 'A' + number - 10;

			return 0;
		}
	}

	double decimalFromBinDec(const std::string &number)
	{

	}

	std::string decimalToBinDec(double number)
	{
		std::string tmp = Utils::ToString(number), result;

		for(std::string::iterator iter = tmp.begin(); iter != tmp.end(); ++iter)
			result.append( Utils::toBinDecDigit(*iter) );

		return result;
	}

	double anyToDecimal(const std::string &number, unsigned short radix)
	{
		double result = 0.0;
		int pow = number.find('.');

		if (pow < 0) pow = 0;
		else pow -= number.length() - 1;

		for(std::string::const_reverse_iterator criter = number.rbegin();
			criter != number.rend(); ++criter) {
				if (*criter != '.')
					result += Utils::digitToInt(*criter) * std::powf(radix, pow++);
			}

		return result;
	}

	std::string decimalToAny(double number, unsigned short radix, int accuracy=5)
	{
		int wholep = int(number);
		double fracp = number - wholep;
		std::string result;

		if (wholep) {
			for (; wholep != 0; wholep /= radix)
				result.push_back(Utils::intToDigit(wholep % radix));

			std::reverse(result.begin(), result.end());
		} else result.push_back('0');
        
		if (fracp) {
			result.push_back('.');

			while (accuracy-- && fracp) {
				fracp *= radix;
				wholep = int(fracp);
				fracp -= wholep;

				result.push_back( Utils::intToDigit(wholep) );
			}
		}

		return result;
	}
}