๐Ÿ“ฆ lilipops / ft_printf

๐Ÿ“„ ft_print_print.c ยท 78 lines
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_print_print.c                                   :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: ngurskiy <ngurskiy@student.42.fr>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2024/04/24 15:25:10 by ngurskiy          #+#    #+#             */
/*   Updated: 2024/04/24 15:39:58 by ngurskiy         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "ft_printf.h"

int	ft_print_char(char c)
{
	int	writen_byte;

	writen_byte = write(1, &c, 1);
	if (writen_byte == -1)
		return (-1);
	return (1);
}

int	ft_print_str(char *str)
{
	int	i;

	i = 0;
	if (!str)
		return (ft_print_str("(null)"));
	while (str[i] != '\0')
	{
		ft_print_char(str[i]);
		i++;
	}
	return (i);
}

int	ft_print_dec(int nb)
{
	long int	n;

	n = 0;
	ft_putnbr(nb);
	if (nb >= 0)
		return (ft_countn(nb));
	n = (long int)nb * (-1);
	return (ft_countn(n) + 1);
}

int	ft_print_uns(unsigned int nb)
{
	int	i;

	i = 0;
	if (nb >= 10)
		i += ft_print_uns(nb / 10);
	ft_print_char(nb % 10 + '0');
	i++;
	return (i);
}

int	ft_print_hex(unsigned long long nb, char c)
{
	unsigned long long	i;

	i = 0;
	if (nb >= 16)
		i += ft_print_hex(nb / 16, c);
	if (c == 'x')
		ft_print_char("0123456789abcdef"[nb % 16]);
	if (c == 'X')
		ft_print_char("0123456789ABCDEF"[nb % 16]);
	i++;
	return (i);
}