Cacher is the code snippet organizer for pro developers

# fzf → macOS (Homebrew + zsh) port kit

Companion to `patch-work-mac-port.md`. Contains: (1) what the Linux fzf notes say,
(2) the macOS/zsh translation and gotchas, (3) a ready-to-paste prompt for Claude Code
on the Mac vault.

---

## 1. What exists on Linux

Two linked notes in `linux-setup/wiki/`, indexed from `linux-setup/context.md`:

- **`fzf-setup.md`** — install, shell integration, `Ctrl+R` tuning, usage.
- **`env-bash-history-cleanup.md`** — the one-time `~/.bash_history` cleanup that

We’ve all been there – that satisfying click as the last letter turns green, the triumphant feeling of cracking the daily [wordle unlimited](https://wordleunlimitedfree.com/). But what if we looked at this beloved word puzzle not just as a game, but as a miniature business operation? Imagine you’re not just a player, but a savvy store manager, meticulously handling your inventory, fulfilling customer orders, and striving for maximum efficiency. And our bustling establishment today? It’s wordle u

# patch-work → macOS (Homebrew) port kit

Everything needed to recreate the Linux `patch-work` command on the Mac tech-vault.
Contains: (1) what the Linux script does, (2) the macOS gotchas, (3) a ready-to-paste
prompt for Claude Code on the Mac.

---

## 1. What the Linux script is

- **File:** `shell-scripts/raw/apt-maintain.sh` in the Linux tech-vault (source of truth;
  `~/.local/bin/apt-maintain.sh` is a **symlink** back to it).
- **Invoked as:** `patch-work` — a `~/.bashrc` alias pointing 

/**
 * @param {number[]} nums
 * @return {number}
 */
var maximumProduct = function(nums) {
    // Track the three largest values
    let max1 = -Infinity, max2 = -Infinity, max3 = -Infinity;

    // Track the two smallest values (could be negative)
    let min1 = Infinity, min2 = Infinity

    for (let n of nums) {

        // Update the three largest numbers
        if (n > max1) {
            max3 = max2;    // shift down
            max2 = max1;
            max1 = n;
        } else if (n > m

add_filter( 'register_block_type_args', function( $args, $block_type ) {
	if ( 'core/heading' !== $block_type ) {
		return $args;
	}

  //H2からH5まで
	$args['attributes']['levelOptions']['default'] = [ 2, 3, 4, 5 ];

	return $args;
}, 10, 2 );

Complex, vintage Chicano tattoo-style graphic composition showing a Phoenix summer block party with booming speakers, lowrider bikes, backyard fences, grill smoke, tattooed arms, kids watching from the sidewalk, and a classic lowrider bouncing in the street. Above the block party floats a large skull wearing aviator sunglasses and a cap reading "BLOCK HEAT." Gothic typography reads "PHX BLOCK PARTY," wrapped in ornate ribbons, roses, barbed wire, speaker wires, and desert sun rays. Palm trees, p

You
can you run a deep research task: a mutli part blog post aimed at senior agentic javascript engineers, that talks about building a suspence aware router from scratch that enables react server components, data loading, nesting of routes, re-directs, guareded routes forauth

Parallel
<tdd_planning>

Test-First Analysis
Core User Journeys
A user directly requests a nested URL; the server matches the route branch, authenticates protected segments, runs eligible loaders in parallel, renders the R

/**
 * @param {number} n
 * @return {number}
 */
var maxProduct = function(n) {
    // Track the two largest digits found so far.
    // 'first' will hold the largest digit,
    // 'second' will hold the second-largest digit.
    let first = 0;
    let second = 0;

    // Loop through each digit of n.
    // We repeatedly take n % 10 to extract the last digit,
    // then divide n by 10 to remove that digit.
    while (n > 0) {
        let d = n % 10;              // Extract last digit
        n

s2_fe37b25c37764dff86c39d9d854368f3

/**
 * @param {number[]} nums
 * @return {number}
 */
var uniqueXorTriplets = function(nums) {
    const n = nums.length;

    // Edge case: only one element.
    // Only triplet is (0,0,0) → nums[0] ^ nums[0] ^ nums[0] = nums[0],
    // so there is exactly 1 unique XOR value.
    if (n === 1) return 1;

    // Step 1: collect all unique pair XORs (i < j).
    const pairXors = new Set();
    for (let i = 0; i < n; i++) {
        for (let j = i + 1; j < n; j++) {
            pairXors.add(nums[i] 

    upgreade  beacon-ui version
    Use that version on the project that will be deployed
    Merge change to main in beacon-ui project using squash
    then crea tag with version name and do a push origin of the tag
    I cron will be run 
    
    

{
    "model": "opus[1m]",
    "permissions": {
        "allow": [
            "Bash(poetry run pytest:*)",
            "Bash(poetry run ruff check:*)",
            "Bash(poetry run ruff format:*)",
            "Bash(poetry run mypy:*)",
            "Bash(poetry install:*)",
            "Bash(poetry lock:*)",
            "Bash(poetry show:*)",
            "Bash(git status:*)",
            "Bash(git diff:*)",
            "Bash(git log:*)",
            "Bash(git show:*)",
            "Bash(git bra

/**
 * @param {number[]} nums
 * @return {number}
 */
var uniqueXorTriplets = function(nums) {
    const n = nums.length;

    // Special-case handling:
    // For n = 1 → only one value possible (x ⊕ x ⊕ x = x)
    if (n === 1) return 1;

    // For n = 2 → only values {1, 2} are possible
    // LeetCode confirms this exception
    if (n === 2) return 2;

    // For n ≥ 3:
    // The array is a permutation of 1..n.
    // XOR values depend on the highest bit present in n.
    //
    // msb(n) =

/**
 * @param {number[]} nums
 * @return {number}
 */
var uniqueXorTriplets = function(nums) {
    const n = nums.length;

    // Special-case handling:
    // For n = 1 → only one value possible (x ⊕ x ⊕ x = x)
    if (n === 1) return 1;

    // For n = 2 → only values {1, 2} are possible
    // LeetCode confirms this exception
    if (n === 2) return 2;

    // For n ≥ 3:
    // The array is a permutation of 1..n.
    // XOR values depend on the highest bit present in n.
    //
    // msb(n) =

Here you can stop the rotation of the particles based in age or speed

// Define when the slowdown starts and how long it takes to stop
float start_age = 1.0;  // Starts slowing down at 1 second old
float duration = 1.5;   // Takes 1.5 seconds to fully stop

if (@age > start_age) {
    // Calculate a 0 to 1 ramp based on age
    float factor = (@age - start_age) / duration;
    factor = clamp(factor, 0.0, 1.0);
    
    // Smooth the transition (optional but looks better)
    factor = smooth(0.0

use [Boscolo_TravelPlace]
use [Boscolo_TravelPlace_DEV]
use [Cartorange_TravelPlace]
use [FT_TravelPlace]
use [Futura_TravelPlace]
use [Glamour_TravelPlace]
use [Going_TravelPlace]
use [Mind3_TravelPlace]
use [Mind3_TravelPlace_TEST]
use [Nicolaus_TravelPlace]
use [PT_TravelPlace]

insert into dbo.Permissions_MenuItems_Profili (IDPermission, IDMenuItem, IDProfilo)
SELECT 
	--mi.Label,
    --mi.Url,
	--p.Name,
	--p.Description,
    src.IDPermission,
    src.IDMenuItem,
    src