cho.sh

researchmini

3,250 notes

Claude Code Live Renaming30747B 260726260726 260722260722 I prefer TUIBB9A08 MarkRight8B0501 에이전트 런타임 서버 셋업1983DC Bun을 Rust로 재작성하다2BDED3 260721260721 Agent Runtime Server SetupC38C2C 260719260719 AutoBuilder63849A 260718260718 Slack Bots are the new CLIs3E662F 260717260717 WristcomputerD98BDF 260716260716 SalpakanA2940F AGENTS.mdDFE522 260714260714 260713260713 260712260712 260711260711 인간의 보완재와 AX41F1E5 260710260710

220726 · cho.sh

220726

220726

Warning

This post is more than a year old. Information may be outdated.

Personal Research

Intracranial

Writing with an iPad helps thinking.
Given this, simonbs/InfiniteCanvas: Infinite canvas using PencilKit, it seems relatively easy to convert this into a full-blown FIRE Engine.
Will add this note to Intracranial.

Better Obsidian

Developing Review Notes for Obsidian

Coding Tests

0125 Valid Palindrome
0226 Invert Binary Tree

Today's Hacker News

Backlinks4

0125 Valid Palindrome Definition for a binary tree node.Intracranial Developing Review Notes for Obsidian

Comments

The tar archive format, its extensions, and why GNU tar extracts in quadratic time - Mort's Ramblings

That means, every time GNU tar wants to create a hard link, it first has to walk the entire linked list of delayed links and see if the target is a delayed link. The new link must also be delayed if the target is a delayed link.
Your time complexity alarm bells should be starting to ring now. For every hard link, we walk the list of all delayed links. But it gets worse; for reasons I don't quite understand yet, tar will go through the entire list of delayed links again if it finds out that it can create the connection immediately. So, all normal hard links must go through the entire linked list of delayed links twice.

Comments0

No comments yet. Be the first to share your thoughts.