char *ft_itoa(int n) { char *tab; int i; i = ft_index(n); tab = ft_strnew(i + 1); if (!tab) return (NULL); if (n == -2147483648) return (ft_limit(n, i)); if (n < 0) { n = n * -1; tab[0] = '-'; } i--; if (n == 0) tab[0] = '0'; while (n > 0) { tab[i] = '0' + n % 10; n = n / 10; i--; } return (tab); }
char *ft_strtrim(char const *s) { char *str; int i; int i2; int len; int *tab; if (s) { len = ft_strlen(s); if (!(str = (char*)malloc(sizeof(char) * (len + 1)))) return (NULL); i2 = 0; tab = ft_index((char*)s); i = tab[0]; while (s[i] && i < tab[1]) { str[i2] = s[i]; i2++; i++; } free(tab); str[i2] = '\0'; return (str); } return (NULL); }
int ft_recur(t_map *map, char *tabf) { int p; int len; p = 0; len = (int)ft_strlen(tabf); if (map) { while (p < len) { if (ft_feel_tab(tabf, map, p)) { if (ft_recur(map->next, tabf) == 1) return (1); ft_index(map->letter, tabf); } p = ft_suite_tab(ft_increm(tabf, p), tabf, map->tab); } return (0); } return (1); }