This page lists the benchmark results of the iceoryx2 lockfree structures. At the beginning, I hold the assumption that the lockfree structures are faster. However, that's not a true assumption. There is no significant differences between locked implementation and lockfree implementation in my test cases.
During FFI, I want to know the layout of structure and then this temporary structure will be discarded when function returns. However, the rustc rejects this case because the array size n is not a constant during the compiling time, even though the structure is defined for layout calculation.
This blog records some notes when I am learning vue. The frontend framework performs quite different from the backend system which contains a lot of implicit conventions , and I try to highlight these differences to understand the vue better for frontend development.
This is a reading notes from the great book named book of monads. It helps me a lot and I quite recommend you to read it if you have any plan to read books about haskell monads.
This is the following article after understand monad transformers as there are some confusions and missing points in the previous blog.
Previous blog focused on when to use monad transformers, and how we understand the monad transformer creates a new powerful monad which supports both monadT and underlying monad features.
After several months, I would rather to say it didn't point out the core part of monad transformer, which is how the monad transformer supports the underlying monad functionalities via type class.
what's the problem of stacking monads(the reason why we need monad transformer)
why we can use features from both monad and monad transformer under the scope of monad transformer.