1
1
mirror of https://github.com/theoludwig/libcproject.git synced 2024-11-08 22:31:31 +01:00
libcproject/lib/convert.c

102 lines
2.9 KiB
C
Raw Normal View History

2023-01-05 19:28:05 +01:00
#include "convert.h"
string_t convert_character_to_string(const char character) {
string_t string = malloc(sizeof(string) * 2);
2023-01-05 19:28:05 +01:00
if (string == NULL) {
exit(EXIT_FAILURE);
}
character_append(string, character);
return string;
}
char convert_character_to_digit(const char character) {
return character - '0';
}
char convert_digit_to_character(const char digit) {
return digit + '0';
}
long long convert_string_to_number(const string_t string_value) {
2023-06-25 15:01:25 +02:00
bool is_negative = string_value[0] == '-';
2023-01-05 19:28:05 +01:00
long long integer = 0;
2023-06-25 15:01:25 +02:00
size_t length = string_get_length(string_value);
2023-01-05 19:28:05 +01:00
for (size_t index = is_negative ? 1 : 0; index < length; index++) {
2023-06-25 15:01:25 +02:00
integer = integer * 10 + convert_character_to_digit(string_value[index]);
2023-01-05 19:28:05 +01:00
}
return is_negative ? integer * -1 : integer;
}
string_t convert_number_to_string(const long long integer) {
2023-01-05 19:28:05 +01:00
if (integer == 0) {
return convert_character_to_string('0');
}
bool is_negative = integer < 0;
size_t length = 1;
string_t string_value = malloc(sizeof(string_t) * length);
2023-06-25 15:01:25 +02:00
if (string_value == NULL) {
2023-01-05 19:28:05 +01:00
exit(EXIT_FAILURE);
}
long long current = mathematics_absolute_value(integer);
while (current != 0) {
2023-06-25 15:01:25 +02:00
character_append(string_value, convert_digit_to_character(current % 10));
2023-01-05 19:28:05 +01:00
current = current / 10;
length++;
string_value = realloc(string_value, sizeof(string_t) * length);
2023-01-05 19:28:05 +01:00
}
if (is_negative) {
2023-06-25 15:01:25 +02:00
character_append(string_value, '-');
2023-01-05 19:28:05 +01:00
length++;
string_value = realloc(string_value, sizeof(string_t) * length);
2023-01-05 19:28:05 +01:00
}
2023-06-25 15:01:25 +02:00
return string_reverse(string_value);
2023-01-05 19:28:05 +01:00
}
string_t convert_number_from_base_10_to_base(unsigned long long number, unsigned int base) {
2023-01-05 19:28:05 +01:00
if (number == 0) {
return "0";
}
int remainders[64];
int index = 0;
while (number > 0) {
remainders[index] = number % base;
number = number / base;
index++;
}
string_t result = malloc(sizeof(string_t) * (index + 1));
2023-01-05 19:28:05 +01:00
int index_result = 0;
for (int iteration = index - 1; iteration >= 0; iteration--) {
int remainder = remainders[iteration];
if (remainder >= 10) {
result[index_result] = (char)((remainder - 10) + 'A');
} else {
result[index_result] = (char)(remainder + '0');
}
index_result++;
}
return result;
}
int convert_number_from_base_to_base_10(string_t number, unsigned int base) {
2023-01-05 19:28:05 +01:00
int length = string_get_length(number);
int exponent = length - 1;
int result = 0;
int index = 0;
while (exponent >= 0) {
int current_number = (int)(number[index] - '0');
if (current_number >= 10) {
current_number = (int)(number[index] - 'A') + 10;
} else {
current_number = (int)(number[index] - '0');
}
result = result + current_number * mathematics_pow(base, exponent);
exponent--;
index++;
}
return result;
}
string_t convert_number_from_base_to_another(string_t number, int base_from, int base_target) {
2023-01-05 19:28:05 +01:00
return convert_number_from_base_10_to_base(convert_number_from_base_to_base_10(number, base_from), base_target);
}