2008-12-30 23:45:08 -05:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include "dtypes.h"
|
|
|
|
|
2009-02-01 00:41:43 -05:00
|
|
|
char *int2str(char *dest, size_t len, int64_t num, uint32_t base)
|
2008-12-30 23:45:08 -05:00
|
|
|
{
|
2009-02-01 00:41:43 -05:00
|
|
|
int i = len-1, neg = 0;
|
|
|
|
int64_t b = (int64_t)base;
|
2008-12-30 23:45:08 -05:00
|
|
|
char ch;
|
switching to scheme #t, #f, and () values
porting code to sort out which NILs are false and which are
empty lists
switching to scheme-style special forms. however you feel about
scheme names vs. CL names, using both is silly.
mostly switching to scheme predicate names, with compatibility
aliases for now. adding set-constant! to make this efficient.
adding null?, eqv?, assq, assv, assoc, memq, memv, member
adding 2-argument form of if
allowing else as final cond condition
looking for init file in same directory as executable, so flisp
can be started from anywhere
renaming T to FL_T, since exporting a 1-character symbol is
not very nice
adding opaque type boilerplate example file
adding correctness checking for the pattern-lambda benchmark
bugfix in int2str
2009-01-28 20:04:23 -05:00
|
|
|
if (num < 0) {
|
|
|
|
num = -num;
|
|
|
|
neg = 1;
|
|
|
|
}
|
2008-12-30 23:45:08 -05:00
|
|
|
dest[i--] = '\0';
|
|
|
|
while (i >= 0) {
|
|
|
|
ch = (char)(num % b);
|
|
|
|
if (ch < 10)
|
|
|
|
ch += '0';
|
|
|
|
else
|
|
|
|
ch = ch-10+'a';
|
|
|
|
dest[i--] = ch;
|
|
|
|
num /= b;
|
|
|
|
if (num == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i >= 0 && neg)
|
|
|
|
dest[i--] = '-';
|
|
|
|
return &dest[i+1];
|
|
|
|
}
|
2009-02-01 00:41:43 -05:00
|
|
|
|
|
|
|
int isdigit_base(char c, int base)
|
|
|
|
{
|
|
|
|
if (base < 11)
|
|
|
|
return (c >= '0' && c < '0'+base);
|
|
|
|
return ((c >= '0' && c <= '9') ||
|
|
|
|
(c >= 'a' && c < 'a'+base-10) ||
|
|
|
|
(c >= 'A' && c < 'A'+base-10));
|
|
|
|
}
|
|
|
|
|
|
|
|
/* assumes valid base, returns 1 on error, 0 if OK */
|
|
|
|
int str2int(char *str, size_t len, int64_t *res, uint32_t base)
|
|
|
|
{
|
|
|
|
int64_t result, place;
|
|
|
|
char digit;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
place = 1; result = 0;
|
|
|
|
for(i=len-1; i>=0; i--) {
|
|
|
|
digit = str[i];
|
|
|
|
if (!isdigit_base(digit, base))
|
|
|
|
return 1;
|
|
|
|
if (digit <= '9')
|
|
|
|
digit -= '0';
|
|
|
|
else if (digit >= 'a')
|
|
|
|
digit = digit-'a'+10;
|
|
|
|
else if (digit >= 'A')
|
|
|
|
digit = digit-'A'+10;
|
|
|
|
result += digit * place;
|
|
|
|
place *= base;
|
|
|
|
}
|
|
|
|
*res = result;
|
|
|
|
return 0;
|
|
|
|
}
|