felixr

My guide to Vimium-C

interface CssOptions

• match CSS selector to match elements
  • e.g. map X LinkHints.activate match="li" to hint all
  • elements.
• clickable CSS selector to match clickable elements
  • e.g. map X LinkHints.activate clickable="li" will add all <li> elements to the set of clickable elements and show hints on the clickable elements. The difference to match is that it extends the default logic for finding clickable elements and it does not replace it.
• clickableOnHost per-host clickable settings
  • This allows you to set clickable to different values depending on the current host.

felixr

Lua Formatter

lua_formatter = lua_formatter or { initDone = false }

-- Not using @johnnymorganz/stylua@2.3.0/stylua.web/stylua_lib.js
-- because of https://github.com/JohnnyMorganz/StyLua/issues/999

felixr

#!/bin/bash

TMPDIR="$(mktemp -d)"

cmd_status() {
  local pid=$1
  local cmd=$2
  local log=$3
  if ps h ${PIDS[$cmd_idx]} > /dev/null; then
    echo -e "› \033[32m${cmd}\033[0m" 

felixr

https://www.uiua.org/pad?src=0_12_0-dev_2__8J-UoiDihpAg4oqCwrDii5XiipniiqLiirjip7sK8J-XnO-4jyDihpAg4pmt4oi14peH8J-UouKKnOKWoeKKuC1AIAriiY0iM0EyQjJBMUMi8J-XnO-4jyJBQUFCQkFBQyIK
🔢 ← ⊂°⋕⊙⊢⊸⧻
🗜️ ← ♭∵◇🔢⊜□⊸-@ 
≍"3A2B2A1C"🗜️"AAABBAAC"

felixr

{
 "NotebookModel": "LENOVO 20R4001CBR",
 "Author": "Rafaelti",
 "EcPollInterval": 2000,
 "ReadWriteWords": false,
 "CriticalTemperature": 92,
 "FanConfigurations": [
        {
         "ReadRegister": 149,
         "WriteRegister": 148,

felixr

function handleEvent(name, payload) {
  fetch('http://localhost:8118/report?'+JSON.stringify({name, payload}));
}

chrome.tabs.onActivated.addListener(
    (tabId, windowId) => handleEvent("activated", {tabId, windowId}));

chrome.tabs.onActiveChanged.addListener(
    (tabId, selectInfo) => handleEvent("activeChanged", {tabId, selectInfo}));

felixr

Intro

This describes an adaptive, stable, natural mergesort, modestly called timsort (hey, I earned it ). It has supernatural performance on many kinds of partially ordered arrays (less than lg(N!) comparisons needed, and as few as N-1), yet as fast as Python's previous highly tuned samplesort hybrid on random arrays.

In a nutshell, the main routine marches over the array once, left to right, alternately identifying the next run, then merging it into the previous

felixr

(defn insertion-sort [arr left right]
  (for i (+ left 1) (+ right 1)
    (def temp (in arr i))
    (var j (- i 1))
    (while (and (>= j left) (> (in arr j) temp))
           (set (arr (+ j 1)) (in arr j))
           (-- j))

    (set (arr (+ j 1)) temp))
  arr)

felixr

(defmacro dbg! [form]
  (let [func (first form)
        args (drop 1 form)]
    (var accum @['do])
    (var syms @[])
    (each arg args
      (let [sym (gensym)]
        (array/push accum (tuple 'def sym arg))
        (array/push syms [arg sym])))

felixr

function dtype(t) { return t=="function" ? "Function" : (t=="macro" ? "Macro": "Builtin");}

let s = "";

for (let b of document.querySelectorAll('.binding')) {
s += `INSERT OR IGNORE INTO searchIndex(name, type, path) VALUES ("${b.firstChild.id}","${dtype(b.children[1].innerText)}","api/index.html#${b.firstChild.id}");\n`;
}
s