#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>

using Node     = char;
using EdgeList = std::vector< std::tuple<Node, int> >;
using Graph    = std::unordered_map<Node, EdgeList>;

void RecursiveDFS(Node node, const Graph& graph, void(*visit)(Node),
    std::unordered_set<Node>& visited)
{
  if(visited.find(node) != visited.end())
    return;

  visited.insert(node);
  visit(node);

  for(auto [n, w] : graph.find(node)->second)
    RecursiveDFS(n, graph, visit, visited);
}

void DFS(Node start, const Graph& graph, void(*visit)(Node))
{
  std::unordered_set<Node> visited;
  std::stack<Node> stack;
  stack.push(start);

  while(!stack.empty())
  {
    Node node = stack.top();
    stack.pop();

    if(visited.find(node) != visited.end())
      continue;

    visited.insert(node);
    visit(node);

    auto it = graph.find(node);
    if(it == graph.end())
      throw;

    for(auto rit = it->second.rbegin(); rit != it->second.rend(); ++rit)
      stack.push( std::get<0>(*rit));
  }
}

void BFS(Node start, const Graph& graph, void(*visit)(Node))
{
  std::queue<Node> queue;
  queue.emplace(start);

  while(!queue.empty())
  {
    Node node = queue.front();
    queue.pop();

    visit(node);

    auto it = graph.find(node);
    if(it == graph.end())
      throw;

    for(auto [n, w] : it->second)
      queue.emplace(n);
  }

}

{{user.isAuthorize}}
Welcome to Wayland-Youtani corporation mr. {{user.name}}.
bla bla bla
{{/}}

if' True  x _ = x
if' False _ y = y

f x = if' (x == 2)
      ("arg was 2")
      ("arg was" ++ show x)

g x = if' (x == 2)
      ("arg was 2")
     $ "arg was" ++ show x

o x = if x == 2
      then "arg was 2"
      else "arg was" ++ show x

h x y z = case (x, y ,z) of
  (True, _, _) -> "first"
  (_, True, _) -> "second"
  (_, _, True) -> "third"
  _            -> "none"

i x y z
  | x    = "first"
  | y    = "second"
  | z    = "third"
  | True = "none"

f b x y z
  = case b of
      True -> if x == 2
              then "first was two"
              else if y == 3
              then "second was three"
              else if z == 4
              then "third was four"
              else "no match"
      False -> "false"

g b x y z
  = let i | x == 2 = "first was two"
          | y == 3 = "second was three"
          | z == 4 = "third was four"
          | True   = "no match"
    in case b of
      True  -> i
      False -> "false"

h b x y z
  = case b of
      True  -> let i | x == 2 = "first was two"
                     | y == 3 = "second was three"
                     | z == 4 = "third was four"
                     | True   = "no match"
               in i
      False -> "false"

std::cout << 'hello mr ' << user[id].name << '!';

echo 'hello mr '.$user[$id]->name.'!';

{{user.isAuthorized}} hello mr {{user.name}}!
{{/}}

f x = bool ("arg was" ++ show x) "arg was 2" (x == 2)

int* x;

int *x;

COMPANYNAME_UINT32_T * ui32X = COMPANYNAME_UINT32_CAST( 0 );

{{'Hello, ',x,', you are ',(y>:18) {:: 'a minor.';'an adult.'}}

image size => 1168, 272
box found:
  coordinates: (46, 178)
  width: 44

class DoubleMap {
    
    HashMap<String, Object> map;
    
    public DoubleMap() {
        map = new HashMap<>();
    }
    
    public Object queryA(String keyA) {
        return map.get("AAA-" + keyA);
    }
    
    public Object queryB(String keyB) {
        return map.get("BBB-" + keyB);
    }
    
    public void putA(String keyA, Object o) {
        map.put("AAA-" + keyA, o);
    }
    
    public void putB(String keyB, Object o) {
        map.put("BBB-" + keyB, o);
    }
    
}

def g(input):
    if g halts on its own source code:
        loop forever
    else
        return 1

mov eax, DWORD PTR [0DEADBABEh]
eax = *((int32_t*)(0xDEADBABE));

int *x;

int * x;

int *x, **y, z;