Erlang / Erlang Basics Interview questions
How do you implement a simple supervision tree?
A supervision tree starts with a top-level supervisor whose init/1 callback
declares a restart strategy and a child specification list; each child can itself be a worker or another
supervisor, nesting arbitrarily deep.
init([]) -> SupFlags = #{strategy => one_for_one, intensity => 5, period => 10}, Children = [ #{id => cache_worker, start => {cache_worker, start_link, []}, restart => permanent, type => worker} ], {ok, {SupFlags, Children}}.
Starting the top supervisor with supervisor:start_link/3 automatically starts every declared
child in order. If cache_worker crashes, the one_for_one strategy restarts just that
child (up to 5 times per 10 seconds, per intensity/period); exceeding that threshold
escalates the crash to the supervisor's own parent.
Invest now in Acorns!!! 🚀
Join Acorns and get your $5 bonus!
Acorns is a micro-investing app that automatically invests your "spare change" from daily purchases into diversified, expert-built portfolios of ETFs. It is designed for beginners, allowing you to start investing with as little as $5. The service automates saving and investing. Disclosure: I may receive a referral bonus.
Invest now!!! Get Free equity stock (US, UK only)!
Use Robinhood app to invest in stocks. It is safe and secure. Use the Referral link to claim your free stock when you sign up!.
The Robinhood app makes it easy to trade stocks, crypto and more.
Webull! Receive free stock by signing up using the link: Webull signup.
More Related questions...
