inscapist

#version: "3"

# More info at https://github.com/pi-hole/docker-pi-hole/ and https://docs.pi-hole.net/
services:
  pihole:
    container_name: pihole
    image: pihole/pihole:latest
    network_mode: "host"
    # For DHCP it is recommended to remove these ports and instead add: network_mode: "host"
    environment:

inscapist

xset r rate 250 60
setxkbmap -option caps:escape
xbacklight -set 10

# paired with `Xft.dpi: 144`
export GDK_DPI_SCALE=1.4

if [ -z "${XDG_RUNTIME_DIR}" ]; then
    export XDG_RUNTIME_DIR=/tmp/${USER}-runtime-dir
    if [ ! -d "${XDG_RUNTIME_DIR}" ]; then

inscapist

import QRgen
import QRgen/renderer
import pkg/[pixie]
import os


# Create a new QR code
let qr = newQR("https://github.com/aruZeta/QRgen", ecLevel=qrECH)

# Generate the QR code

inscapist

CREATE TABLE audit_log (
    id SERIAL PRIMARY KEY,
    schema_name TEXT NOT NULL,
    table_name TEXT NOT NULL,
    operation CHAR(1) NOT NULL,
    new_data JSONB,
    old_data JSONB,
    changed_at TIMESTAMP NOT NULL,
    changed_by TEXT
);

inscapist

ANSI Escape Sequences

Standard escape codes are prefixed with Escape:

• Ctrl-Key: ^[
• Octal: \033
• Unicode: \u001b
• Hexadecimal: \x1B
• Decimal: 27

inscapist

{ lib, ... }:
rec {
  # Compute the fixed point of the given function `f`, which is usually an
  # attribute set that expects its final, non-recursive representation as an
  # argument:
  #
  #     f = self: { foo = "foo"; bar = "bar"; foobar = self.foo + self.bar; }
  #
  # Nix evaluates this recursion until all references to `self` have been
  # resolved. At that point, the final result is returned and `f x = x` holds:

inscapist

# args:
#   $1. server_name assuming SNI (eg. sub.domain.com)
#   $2. endpoint (eg. IP_ADDR:8443 or sub.domain.com:443) 
function tlscert-check() {
  echo | \
    openssl s_client -servername $1 -connect $2 2>/dev/null | \
    openssl x509 -text -noout
}

function tlscert-list-kube() {

inscapist

Preamble

First, we can check the time needed to complete the following algorithm class:

1. O(N) -> say it requires 1 second to process N=100
2. O(N^3) -> 3 nested loops -> now requires N^3=1000000/100 * 1_second = 10000 seconds = ~ 3 hours
3. O(2^N) -> N levels (binary tree) of computations -> 2^N = 1.26e+30 seconds
4. O(n!) -> N levels (of increasing branches, 1x2x3x...xN) of computations -> 9.332622e+157 seconds

All about P

inscapist

# https://web.mit.edu/rhel-doc/4/RH-DOCS/rhel-rg-en-4/s1-x-server-configuration.html
Section "ServerLayout"
    Identifier     "layout"
    Screen         0 "laptopscreen"
    Option 	   "AllowNVIDIAGPUScreens"
EndSection

Section "Device"
    # Option         "PrimaryGPU" "no"
    # BusID          "PCI:1:0:0"

inscapist

# in livedisk terminal:
# refer gparted for diskids (look for root and boot/esp)

# mount root
sudo mount /dev/nvme1n1p2 /mnt

# mount boot/esp
# refer `cat /mnt/etc/fstab` to ensure correct efi path 
sudo mount /dev/nvme1n1p1 /mnt/boot/efi