Skip to content

Clarify subdirectories exercise (Chapter 5) and pin markdown-cli #470

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Aug 3, 2024
Merged

Clarify subdirectories exercise (Chapter 5) and pin markdown-cli #470

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f0ea83c
[Chapter 5] Clarify that an exercise should include subdirectories
Zelenya Jun 9, 2024
0133859
Pin markdownlint version
Zelenya Jul 20, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .github/workflows/tests.yml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,7 @@ jobs:
${{ runner.os }}-

- name: Install NPM dependencies
run: npm install purescript spago markdownlint-cli
run: npm install purescript spago markdownlint-cli@0.37.0

- name: Run Build
run: ./scripts/buildAll.sh
Expand Down
2 changes: 1 addition & 1 deletion text/chapter5.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -630,7 +630,7 @@ Try out the new version in PSCi – you should get the same result. I'll let you
```

_Hint_: Try to write this function as an array comprehension using do notation.
3. (Difficult) Write a function `largestSmallest` which takes a `Path` and returns an array containing the single largest and single smallest files in the `Path`. _Note_: consider the cases where there are zero or one files in the `Path` by returning an empty or one-element array, respectively.
3. (Difficult) Write a function `largestSmallest` which takes a `Path` and returns an array containing the single largest and single smallest files in the `Path`, including (recursively) any subdirectories. _Note_: consider the cases where there are zero or one files in the `Path` by returning an empty or one-element array, respectively.

## Conclusion

Expand Down