Комментарии:
Did this pass as is? I have a similar approach but I get errors with Francinette. Fsoares test read_error.txt claims there's memory leaks. Which I can see there are with valgrind. The variable returned by get_next_line() is malloc'd but never freed. Did u get similar errors with Francinette. I'm quite sure my code works, but I don't want to submit and get a fail.
Ответитьperfect tutorial u did it the hard way for us as beginners using linked list but it's okay the important thing is that i got the full idea of what i need to do, much love 🙏
ОтветитьI am a huge fan, and I always follow you.. But I am really sorry to tell you that this video made the task even harder for a beginner. the fact you are using linked lists approach while beginners just got introduced to the linked lists in the bonus part of libft and they havent even properly used it and got handy with it, would definitely make me not suggest this video for a beginner. Sorry, and keep it up. cheers!
Ответитьthank you for this video great help
ОтветитьHey ! Thanks a lot for your vidéo, it helps a lot to understand more !
For dealloc function, why did you free buf only if clean node is NULL ? And not in any case ? And why do you bring it to dealloc and don't free it directly in polish ?
Never seen such a complicated explaination on this topic try to switch not to much and keep your focus on the subject. I have seen this video and compared to other things on the internet this seem like higher math.
ОтветитьThx for the video=) Despite on I've made a project, there was a bunch of interesting information.
One question: which IDE do you use. And could you pls share some basic settings of your .vimrc file? I see that you have autocomplete option in it. And, honestly, I don't know how to switch it on.
Many thx in advance.
is there reasaon why we need to define BUFFER_SIZE 10 instead of just writing 10? or is it just convenient?
ОтветитьCool
Ответить