| school 21(POOL) |
| 1 | vim |
| 2 | vim |
| 3 | vim |
| 4 | :q |
| 5 | :q |
| 6 | :q |
| 7 | :wq |
| 8 | :wq |
| 9 | :wq |
| 10 | :!q |
| 11 | git add . |
| 12 | git add . |
| 13 | git add . |
| 14 | git commit -m "" |
| 15 | git commit -m "" |
| 16 | git commit -m "" |
| 17 | git push |
| 18 | git push |
| 19 | git push |
| 20 | rm -rf |
| 21 | cd .. |
| 22 | cd .. |
| 23 | cd .. |
| 24 | cd .. |
| 25 | cd .. |
| 26 | ls |
| 27 | ls |
| 28 | ls |
| 29 | ls |
| 30 | ls |
| 31 | mkdir |
| 32 | mkdir |
| 33 | mkdir |
| 34 | mkdir |
| 35 | mkdir |
| 36 | norminette |
| 37 | norminette |
| 38 | norminette |
| 39 | norminette |
| 40 | norminette |
| 41 | cat |
| 42 | cat |
| 43 | cat |
| 44 | man |
| 45 | gcc -Wall -Wextra -Werror |
| 46 | gcc -Wall -Wextra -Werror |
| 47 | gcc -Wall -Wextra -Werror |
| 48 | int i; |
| 49 | int i; |
| 50 | int i; |
| 51 | int i; |
| 52 | while (i < count) |
| 53 | while (i < count) |
| 54 | while (i < count) |
| 55 | return (0); |
| 56 | return (0); |
| 57 | return (0); |
| 58 | return (0); |
| 59 | int count; |
| 60 | int count; |
| 61 | int count; |
| 62 | int count; |
| 63 | void |
| 64 | void |
| 65 | void |
| 66 | void |
| 67 | void |
| 68 | char * |
| 69 | char * |
| 70 | char ** |
| 71 | char ** |
| 72 | char *** |
| 73 | char *** |
| 74 | long int |
| 75 | long long int |
| 76 | unsigned int |
| 77 | unsigned long int |
| 78 | unsigned long long int |
| 79 | t_list |
| 80 | t_list |
| 81 | t_list |
| 82 | NULL |
| 83 | NULL |
| 84 | NULL |
| 85 | if (true) |
| 86 | if (true) |
| 87 | t_list *tmp; |
| 88 | tmp->data = data; |
| 89 | tmp->next = NULL; |
| 90 | typedef struct s_list |
| 91 | struct s_list *next; |
| 92 | void *data; |
| 93 | while (list->next) |
| 94 | list = *begin_list; |
| 95 | free(tmp); |
| 96 | t_btree |
| 97 | btree->left = NULL; |
| 98 | btree->right = NULL; |
| 99 | btree->item = item; |
| 100 | typedef struct s_btree |
| 101 | struct s_btree *left; |
| 102 | struct s_btree *right; |
| 103 | void *item; |
| 104 | int main(int argc, char **argv) |
| 105 | write(1, &c, 1); |
| 106 | write(1, &c, 1); |
| 107 | printf("%d", count); |
| 108 | printf("%d", count); |
| 109 | ft_putnbr(89); |
| 110 | if (argc == 2) |
| 111 | else |
| 112 | else |
| 113 | else |
| 114 | ft_putchar(c); |
| 115 | ft_putchar(c); |
| 116 | ft_putchar(c); |
| 117 | ft_putstr(""); |
| 118 | ft_print_alphabet() |
| 119 | ft_print_reverse_alphabet() |
| 120 | ft_is_negative() |
| 121 | ft_swap() |
| 122 | ft_strlen() |
| 123 | ft_atoi() |
| 124 | ft_sqrt() |
| 125 | ft_is_prime() |
| 126 | ft_putnbr() |
| 127 | ft_strcpy() |
| 128 | ft_strstr() |
| 129 | ft_strcmp() |
| 130 | ft_strupcase() |
| 131 | ft_strlowcase() |
| 132 | ft_str_is_alpha() |
| 133 | ft_str_is_numeric() |
| 134 | ft_str_is_lowercase() |
| 135 | ft_str_is_uppercase() |
| 136 | ft_split_whitespaces() |
| 137 | ft_create_elem() |
| 138 | ft_create_elem() |
| 139 | ft_create_elem() |
| 140 | ft_list_push_back() |
| 141 | ft_list_push_front() |
| 142 | *begin_list = list; |
| 143 | #include "ft_header.h" |
| 144 | #include <string.h> |
| 145 | #include <stdio.h> |
| 146 | #include <stdlib.h> |
| 147 | #include <unistd.h> |
| 148 | #include "ft_list.h" |
| 149 | Makefile |
| 150 | all: |
| 151 | clean: |
| 152 | fclean: |
| 153 | re: |
| 154 | libft.a |
| 155 | ar rc libft.a |
| 156 | ranlib libft.a |
| 157 | ft.h |
| 158 | ft_list.h |
| 159 | ft_header.h |
| 160 | #ifndef LIST_H |
| 161 | # define LIST_H |
| 162 | #endif |
Комментарии