https://github.com/josefdolezal/fit-mi-afp-assignment-08
MI-AFP 2017/18 assignment 8
https://github.com/josefdolezal/fit-mi-afp-assignment-08
Last synced: about 2 months ago
JSON representation
MI-AFP 2017/18 assignment 8
- Host: GitHub
- URL: https://github.com/josefdolezal/fit-mi-afp-assignment-08
- Owner: josefdolezal
- License: mit
- Created: 2018-04-20T07:25:41.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2018-05-09T07:24:30.000Z (about 7 years ago)
- Last Synced: 2025-02-10T18:13:24.130Z (3 months ago)
- Language: Haskell
- Homepage:
- Size: 15.6 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: ChangeLog.md
- License: LICENSE
Awesome Lists containing this project
README
# hw08
Homework to practice Foldable, Traversable, State Monad Transformer, and Lens
## Task
In this homework you will implement some functions to work with maps...
1. *Data.QuadTree* = make `QuadTree` data structure an instance of `Functor`, `Foldable`, and `Traversable` (think about delegation) and implement other prepated functions. You can use prepared lenses for data types `QuadTree` and `Quadrant` to make your code more readable. *Spoiler*: the most challenging part is `fromMatrix`.
2. *Data.Geography[.Styles]* = this module defined `Coords`, `Map`, and other related stuff. Few functions are not implemented and are waiting for you to be done. Try to make it as simple as possible. Recall syntactic sugar, point free style, and pattern matching. Again, lenses are ready for you...
3. *MapTraveler* = here is the interesting part - the `StateT`, you can rework it or just investigate and use as is. You have to implement 3 normal functions which are used in state manipulation and for the CLI.
When everything is done, you should be able to travel with:
```
% stack exec traveler
The Map Traveler
╔════════════════════════════════════════╗
║^ @ ~~~~~~ ░░░░░░░░║
║ ▓ ^ ~~~~~~~ ░░░░░░║
║ ^ ▓ ~~~~~~~ ^ ░░░░║
║ ███████ ▓ ^^ ~~~~~~~ ░░░░║
║ █ █ ▓ ~~~~~ ^ ░░░░║
║ ███████ ▓ ^ ~~ ║
║ ^^ ▓▓▓▓▓▓▓▓▓▓▓▓▓ ~~ ║
║ ^ ▓ ~~ ║
║ ^ ^ ▓ ~~ ║
║^^ ^ ^^ ▓ ~~~~ ║
║^^ ^ ░░░ ░░░░ ▓ ~~~ ║
║^^^^ ░░░░░░░░ ▓▓ ~~ ║
╚════════════════════════════════════════╝
What direction do you want to go?
w
╔════════════════════════════════════════╗
║^ @ ~~~~~~ ░░░░░░░░║
║ ▓ ^ ~~~~~~~ ░░░░░░║
║ ^ ▓ ~~~~~~~ ^ ░░░░║
║ ███████ ▓ ^^ ~~~~~~~ ░░░░║
║ █ █ ▓ ~~~~~ ^ ░░░░║
║ ███████ ▓ ^ ~~ ║
║ ^^ ▓▓▓▓▓▓▓▓▓▓▓▓▓ ~~ ║
║ ^ ▓ ~~ ║
║ ^ ^ ▓ ~~ ║
║^^ ^ ^^ ▓ ~~~~ ║
║^^ ^ ░░░ ░░░░ ▓ ~~~ ║
║^^^^ ░░░░░░░░ ▓▓ ~~ ║
╚════════════════════════════════════════╝
What direction do you want to go?
s
╔════════════════════════════════════════╗
║^ ▓ ~~~~~~ ░░░░░░░░║
║ @ ^ ~~~~~~~ ░░░░░░║
║ ^ ▓ ~~~~~~~ ^ ░░░░║
║ ███████ ▓ ^^ ~~~~~~~ ░░░░║
║ █ █ ▓ ~~~~~ ^ ░░░░║
║ ███████ ▓ ^ ~~ ║
║ ^^ ▓▓▓▓▓▓▓▓▓▓▓▓▓ ~~ ║
║ ^ ▓ ~~ ║
║ ^ ^ ▓ ~~ ║
║^^ ^ ^^ ▓ ~~~~ ║
║^^ ^ ░░░ ░░░░ ▓ ~~~ ║
║^^^^ ░░░░░░░░ ▓▓ ~~ ║
╚════════════════════════════════════════╝
What direction do you want to go?
q
Byeee!
```
You should be able to move with *w a s d* step by step thru *walkable* places in the map.
The CLI and some other trivial parts are not tested so you can improve it if you want. Also you can create other maps, options, and so on. You can also build some game on top of this and use some *ncurses* library.
## Notes
* In case of uncertainty, check the [dummy homework](https://github.com/MI-AFP/hw00) to recall what is the homework workflow for this course.
* Follow **DRY** principle, use syntactic sugar when you can, make your code clean and understandable.
* If you encounter some trouble, create an issue in your repository.
* In case you find a bug or have an idea how to improve assignment project, create an issue or PR in this repository.
## License
This project is licensed under the MIT License - see the [LICENSE](LICENSE)
file for more details.