Yan Cui
I help clients go faster for less using serverless technologies.
NOTE : read the rest of the series, or check out the source code.
If you enjoy reading these exercises then please buy Crista’s book to support her work.
Following on from the last post, we will look at the Infinite Mirror style today.
Style 7 – Infinite Mirror
This style is really all about recursions.
Constraints
- All, or a significant part, of the problem is modelled using induction.
First, let’s get the list of stop words and put them in a set:
and then we will implement the counting logic using recursion:
I made some adjustments to Crista’s version here. In her version, wordFreqs is a global state that has been passed in as argument but the recursive count function returns nothing.
In my implementation, although I’m still using a mutable dictionary, it’s an implementation detail that is not exposed to the outside world. I could have used a Map here instead, but constantly updating a Map is really clumsy, plus Map performs really poorly in this type of use pattern.
Then we have another recursive functions, for printing out the word frequencies:
and then some code to tie everything together:
You can find all the source code for this exercise here.
Whenever you’re ready, here are 3 ways I can help you:
- Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game.
- Consulting: If you want to improve feature velocity, reduce costs, and make your systems more scalable, secure, and resilient, then let’s work together and make it happen.
- Join my FREE Community on Skool, where you can ask for help, share your success stories and hang out with me and other like-minded people without all the negativity from social media.
Pingback: Exercises in Programming Style–Kick Forward | theburningmonk.com
Pingback: F# Weekly #45, 2015 | Sergey Tihon's Blog