tailix/libkernaux
1
0
Fork 0
mirror of https://github.com/tailix/libkernaux.git synced 2025-03-31 17:25:22 -04:00
Code Releases Activity

Remove func kernaux_itoa

Browse source
This commit is contained in:
Alex Kotov 2022-01-18 12:44:55 +05:00
parent 6ec77f3033
commit 861efcd159
Signed by: kotovalexarian
GPG key ID: 553C0EBBEB5D5F08
3 changed files with 0 additions and 68 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
include/kernaux/itoa.h
View file

@ -10,9 +10,6 @@ extern "C" {
// uint64_t: "18446744073709551615"
#define KERNAUX_ITOA_BUFFER_SIZE 21
// TODO: remove this
void kernaux_itoa(int d, char *buf, int base);
void kernaux_utoa10(uint64_t value, char *buffer);
#ifdef __cplusplus

41
src/itoa.c
View file

@ -3,47 +3,6 @@
#endif
#include <kernaux/itoa.h>
#include <kernaux/libc.h>
void kernaux_itoa(const int d, char *buf, const int base)
{
char *p = buf;
char *p1, *p2;
unsigned long ud = d;
int divisor = 10;
// If %d is specified and D is minus, put '-' in the head.
if (base == 'd' && d < 0) {
*p++ = '-';
buf++;
ud = -d;
}
else if (base == 'x') {
divisor = 16;
}
// Divide UD by DIVISOR until UD == 0.
do {
int remainder = ud % divisor;
*p++ = (remainder < 10) ? remainder + '0' : remainder + 'A' - 10;
}
while (ud /= divisor);
// Terminate BUF.
*p = '\0';
// Reverse BUF.
p1 = buf;
p2 = p - 1;
while (p1 < p2) {
char tmp = *p1;
*p1 = *p2;
*p2 = tmp;
p1++;
p2--;
}
}
void kernaux_utoa10(uint64_t value, char *buffer)
{

24
tests/test_itoa.c
View file

@ -48,30 +48,6 @@ static const struct {
int main()
{
{
char buffer[10];
kernaux_itoa(495, buffer, 'd');
assert(buffer[0] == '4');
assert(buffer[1] == '9');
assert(buffer[2] == '5');
assert(buffer[3] == '\0');
}
{
char buffer[10];
kernaux_itoa(-7012, buffer, 'd');
assert(buffer[0] == '-');
assert(buffer[1] == '7');
assert(buffer[2] == '0');
assert(buffer[3] == '1');
assert(buffer[4] == '2');
assert(buffer[5] == '\0');
}
char buffer[KERNAUX_ITOA_BUFFER_SIZE];
for (