kbridge

#include <format>
#include <iostream>
#include <string>
#include <string_view>

class Factor
{
public:
	Factor(std::string_view representation) :
		m_representation(representation)

kbridge

#include <windows.h>

#include <iostream>
#include <sstream>
#include <string>
#include <utility>

#include <intrin.h>
#include <stdint.h>

kbridge

#include <iostream>
#include <version>

#ifdef __cpp_lib_print
#	include <print>
#endif

#ifdef __cpp_lib_expected
#	include <expected>
#	include <system_error>

kbridge

#include <iostream>
#include <type_traits>

class Bird
{
public:
    virtual ~Bird() = default;
};

class IFly

kbridge

import Control.Monad
import Control.Monad.Trans.Class -- from `transformers`
import Control.Monad.Trans.Maybe -- from `transformers`
import Data.IORef

main :: IO ()
main = do
  i <- newIORef (0 :: Int)
  void $ runMaybeT $ forever $ do
    n <- lift (readIORef i)

kbridge

Understanding the Phases Applicative

While I was researching how to do level-order traversals of a binary tree in Haskell, I came across a library called tree-traversals which introduced a fancy Applicative instance called Phases. It took me a lot of effort to understand how it works. Although I still have some unresolved issues, I want to share my journey.

Note: I was planning to post this article on Reddit. But I gave up because it was too long so here might be a better place.

See the discussion.

Note: This article is written in a beginner-friendly way. Experts may find it tedious.