Code Highlighting

May 27, 2026

Rust

use std::collections::HashMap;

fn word_count(text: &str) -> HashMap<&str, usize> {
    let mut map = HashMap::new();
    for word in text.split_whitespace() {
        *map.entry(word).or_insert(0) += 1;
    }
    map
}

Python

from dataclasses import dataclass
from typing import Optional

@dataclass
class Node:
    val: int
    left: Optional["Node"] = None
    right: Optional["Node"] = None

def inorder(node: Node | None) -> list[int]:
    if not node:
        return []
    return inorder(node.left) + [node.val] + inorder(node.right)

Go

package main

import (
    "fmt"
    "sync"
)

func fanOut(ch <-chan int, workers int) []<-chan int {
    channels := make([]<-chan int, workers)
    for i := 0; i < workers; i++ {
        out := make(chan int)
        channels[i] = out
        go func(c chan<- int) {
            for v := range ch {
                c <- v * v
            }
            close(c)
        }(out)
    }
    return channels
}

SQL

SELECT
    d.name AS department,
    COUNT(e.id) AS headcount,
    AVG(e.salary) AS avg_salary
FROM employees e
JOIN departments d ON e.dept_id = d.id
WHERE e.start_date > '2024-01-01'
GROUP BY d.name
HAVING COUNT(e.id) > 5
ORDER BY avg_salary DESC;

Shell

#!/bin/bash
find /var/log -name "*.log" -mtime +30 -exec gzip {} \;
echo "Compressed $(find /var/log -name '*.gz' | wc -l) old log files"