Загрузка...

how to code racket 119 - filesystem-p1(mutual recursion)

jest learn how to code and program well for absolute beginners
0:00 intro
0:13 documents directory
1:00 directory diagram Arbitrary Arity Tree
2:39 intro PROBLEM A template Dir and LOFD
3:55 mutual recursive data arrows
5:21 spoilers PROBLEM A
6:26 spoilers lofd template
11:33 intro PROBLEM B make-dir model
12:20 spoilers PROBLEM B data examples
16:10 intro PROBLEM C count-files
17:25 spoilers PROBLEM C sig, purp
17:50 PROBLEM C examples and tests
20:10 spoilers code PROBLEM C
22:05 examples helper count-files--list
24:39 spoilers code helper count-files--list
27:14 why does this mutual reference work
28:55 mechanical steps with debugger
34:30 dont be concerned about mechnical steps
35:10 intro PROBLEM D count-subdirs
36:17 spoilers PROBLEM D sig purp
36:48 examples and tests PROBLEM D
38:41 spoilers code PROBLEM D
39:16 helper count-subdirs--list sig
40:07 helper examples count-subdirs--list
42:08 spoilers code count-subdirs--list
44:27 intro PROBLEM E count-txts
45:02 spoilers count-txts sig purp
45:29 examples tests PROBLEM E count-txts
47:17 spoilers code PROBLEM E count-txts
47:50 sig helper count-txts--list
48:19 examples and tests for helper count-txts--list
50:08 spoilers helper count-txts--list
53:29 helper is-txt?

Exercise problems and writeups:
https://howtocode.pages.dev/

Practice Problems:
https://jestlearn.com/how_to_code/

Installation and DrRacket configuration settings:
https://howtocode.pages.dev/installation

Download Racket:
https://racket-lang.org/download/

Why all the parenthesis?:
https://howtocode.pages.dev/introduction#why_all_the_parenthesis?

Join us on discord, feel free to ask for help:
https://discord.com/invite/6Zq8sH5

patreon:
https://www.patreon.com/jestarray/

Видео how to code racket 119 - filesystem-p1(mutual recursion) канала jest array
Яндекс.Метрика
Все заметки Новая заметка Страницу в заметки
Страницу в закладки Мои закладки
На информационно-развлекательном портале SALDA.WS применяются cookie-файлы. Нажимая кнопку Принять, вы подтверждаете свое согласие на их использование.
О CookiesНапомнить позжеПринять