Тёмный

Ramda JS Tutorial - Part 40 (filter) 

Christopher Okhravi
Подписаться 158 тыс.
Просмотров 2,4 тыс.
50% 1

Not just arrays and objects. In this video we implement filter for the Maybe type.
⭐️ Support the channel on Patreon:
/ christopherokhravi
👾 In this video:
R.filter
Array.prototype.filter
Fantasy-Land Filterable
R.addIndex
🖥 Full playlist:
• Ramda JS Tutorial

Опубликовано:

 

15 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 20   
@LosEagle
@LosEagle 5 лет назад
It sucks that the series stopped here but thanks so much for this series. Whenever I try to look up videos about functional programming it's mostly filled with presentations and such but I prefer hands-on approach more than that because I learn faster by doing not watching. Especially when it comes to Ramda. I don't even know how to read the function parameters in docs descriptions but at least I know what many of the functions do now..
@superpupernone
@superpupernone 5 лет назад
Christopher! We are still waiting for new episodes.........
@bmehder
@bmehder 7 месяцев назад
I'm about to watch the last video of this playlist, and I am a bit sad that it ended. I learned so much from this series, and I can't thank you enough for all the time you put into it. I just want to throw this out there - How cool would it be to come back to this series after 5+ years?
@afrymusic
@afrymusic 5 лет назад
This has been a seriously excellent series of videos Christopher! Thank you so much for taking the time and care to explain this library for the rest of us, you've got a great ability to teach. 🙇‍♂️ 🙇‍♂️ 🙇‍♂️
@shakibamoshiri2503
@shakibamoshiri2503 5 лет назад
Hey man, very great series. Make it greater by mapping your vim buffer to node, so not leaving the vim every time :map r :w !/usr/bin/env node or you can read it back to your buffer :map t :r !node % for anyone uses vim, you do not have to save file. just press 'r' and the is sent to "node" and the output is seen below buffer.
@MrPDTaylor
@MrPDTaylor 5 лет назад
Thank you so so much for this Ramda series!!! I'm loving my journey in the world of functional programming and you are helping so much!!!
@ChristopherOkhravi
@ChristopherOkhravi 5 лет назад
Awesome! I’m very glad to hear! I’m liking the journey as well so far and while I feel that there’s a long way to go, the good thing is that it actually feels like I’m learning very pragmatically useful things along the way. Best of lucks in your future endeavors! And thanks for watching 😊😊😊
@danielzaretsky1375
@danielzaretsky1375 5 лет назад
I can't believe your devotion to this utility library. amazing effort. you are awesome.
@ChristopherOkhravi
@ChristopherOkhravi 5 лет назад
It’s a pretty cool library after all. I’ve learned crazy much by systematically reading through it :) Thank you very much for your comment and for watching the video :)
@brunohublocal188
@brunohublocal188 3 года назад
Congratulations for this videos. Is Very good!
@angelino.oliveira
@angelino.oliveira 5 лет назад
You helped alot with this series, thanks Christopher! Keep your good work man :)
@ChristopherOkhravi
@ChristopherOkhravi 5 лет назад
I’m glad to hear 😊 Thank you very much for letting me know and thanks for watching 😊😊
@binary64
@binary64 2 года назад
This series was incredible. Thank you so much. Is there any chance of resuming from 'F'? Or a re-do of the series with fp-ts?
@ruslanvolovik2745
@ruslanvolovik2745 3 года назад
Could you make videos on ramda-fantasy, or fantasy-land?
@markusgattol
@markusgattol 5 лет назад
waiting for 41+ now...
@chandrab7185
@chandrab7185 4 года назад
Your videos always inspire. can u please also make a video on 'Path'
@MrPDTaylor
@MrPDTaylor 5 лет назад
What exactly are the fantasy land specifications? Will you please do a video on them?!?
@christernilsson1
@christernilsson1 3 года назад
Extremely good content! But, I think the alphabetical order should have been replaced with complexity order.
@ironhammer4095
@ironhammer4095 2 года назад
What a great series. Too bad you only got as far as F.