Wed Feb 04 12:07:56 AM +08 2026#161
"Design is about keeping things apart" ©
.
year
Король вечеринок вчера до инфаркта жеппы напугал всех, гульнул на 500 баксов, получил порцию кайфа, а мы диагноз, что у пупсика стресс🙈
missing ECC RAM
Vincent Van Gogh Almond Blossom
Shibuya. Tokyo, Japan.
😂
В общем, простым смертным лучше бы смириться с тем, что скорее всего в процессе все пойдет не так и вы почувствуете себя глупо и растерянно — и это нормально. В некоторых профессиях (например, писательство и сценаристика) способность регулярно выдерживать ощущение собственной глупости, бесталанности и растерянности и продолжать контактировать с задачей — это официально один из ключевых предикторов успеха, и про это трубят на всех курсах. Другим профессиям пока не так повезло, но я уверена, что этот навык здорово недооценивается во многих сферах. Может показаться, что если процесс ощущается как заплыв в вязком болоте непонятного говна, то и результат точно не будет блестящим — но вообще-то не факт. Если мы плаваем достаточно долго, учимся на ошибках и итеративно допиливаем наше творение, можно дойти до очень качественной версии. И наверняка она будет качественнее и продуманнее, чем если бы мы тянули до последнего, а потом суматошно делали на адреналине. Засада в том, что часто мы даже не замечаем за собой высокие ожидания от процесса и поэтому сложно рефлексировать, от чего наступил облом и руки опустились. Так что предлагаю поприслушиваться к себе.
The best tool for a balanced life is the clock. Like a hunter’s dog, the clock will be your best ally. It will guard you, keep your impulses in check, and protect what’s important to you. Schedule everything to ensure balance of your time and effort. Scheduling prevents procrastination, distraction, and obsession. A schedule makes you act according to the goals of your highest self, not your passing mood.
Как стать новым человеком? В первую очередь нужно думать. Думать, думать и думать.
Every programmer’s been there, you’ve grown as a developer because you wrote code and somehow managed to wrestle your chaotic thoughts into something coherent. But here’s the kicker: why stop at code? Writing articles or other works takes those same brain-boosting benefits and lets them spill over into the rest of your life. It’s about organizing chaos, finding clarity, and creating something functional, elegant, and, dare I say, beautiful, for yourself and for others who will eventually read or use what you've created.
Why you need your own company We all need a place to play. Kids need playgrounds and sandboxes. Musicians need an instrument. Mad scientists need a laboratory. Those of us with business ideas? We need a company. Not for the money, but because it’s our place to experiment, create, and turn thoughts into reality. We need to pursue our intrinsic motivation. We have so many interesting ideas and theories. We need to try them! The happiest people are not lounging on beaches. They’re engaged in interesting work! Following curiosity is much more fun than being idle. Even if you never have to work a day in your life. That’s the best reason to have a company. It’s your playground, your instrument, your laboratory. It’s your place to play! Get the ideas out of your head and into the world.
When you sign up to run a marathon, you don’t want a taxi to take you to the finish line.
https://www.lua.org/doc/cola.pdf
Nice
In the middle of the journey of our life I found myself within a dark woods where the straight way was lost. Dante Alighieri, Inferno
https://www.lua.org/doc/jucs05.pdf
🫥
Four Cut Sunflowers, 1887 by Vincent Van Gogh
Sony C60 Cassette Tape
https://erlang.org/download/armstrong_thesis_2003.pdf
Tempelhof Airport, Berlin, 1987
one two three ... infinity
Sharp MZ-700 (1984)
- “медитируйте, или не медитируйте, но найдите способ вникнуть в происходящее, не цепляйтесь за него, не отпирайтесь от него”, будьте здоровы
got it
finish line
/|\
Tiki-100
generator_a
.zip(generator_b)
.take(5_000_000)
.map(|(a, b)| ((a ^ b) & 0xFFFF == 0) as usize)
.sum()
this is how you check lower 16 bits for equality and count matches. nice.
Columbo
dream
Lorem Gibson Shibuya assault kanji knife fetishism nano- neon. crypto- A.I. man city corrupted A.I. rain. tank-traps network digital advert uplink free-market garage. BASE jump plastic bicycle narrative singularity free-market pen. nano- range-rover euro-pop RAF plastic warehouse cyber-. car Chiba hotdog tube pistol Kowloon corrupted. dolphin RAF man artisanal nano- bomb uplink.
NASA
repeat
https://github.com/aldanor/aoc-2021 https://en.wikipedia.org/wiki/Hacker's_Delight https://github.com/astral-sh/uv/pull/13469
Keypro II, 1982
Epson HX-20
yeah
Schneider CPC 464
hehe
IBM Selectric I
Arts_et_Metiers_Pascaline_dsc03869.jpg
DEC Digital VT100
Connection Machine (1985)
The idea of balancing a search tree is due to Adel’son-Vel’skiĭ and Landis, who introduced a class of balanced search trees called AVL trees in 1962. Another class of search trees, called 2-3 trees, was introduced by J. E. Hopcroft in 1970. A 2-3 tree maintains balance by manipulating the degrees of nodes in the tree. Bayer and McCreight later generalized 2-3 trees to form B-trees. Red-black trees were invented by Bayer under the name symmetric binary B-trees. Guibas and Sedgewick studied their properties in detail and introduced the red/black color convention. Andersson proposed a simpler-to-code variant of red-black trees, which Weiss later called AA-trees. An AA-tree is similar to a red-black tree except that left children may never be red. Treaps were proposed by Seidel and Aragon. They became the default implementation of a dictionary in LEDA, a well-known collection of data structures and algorithms. Other variations on balanced binary trees include weight-balanced trees, k-neighbor trees, and scapegoat trees. One of the most intriguing is the splay tree introduced by Sleator and Tarjan, which is self-adjusting. Splay trees maintain balance without any explicit balance conditions. Instead, splay operations involving rotations are performed within the tree every time an access is made. The amortized cost of each operation on an n-node tree is logarithmic. Skip lists provide an alternative to balanced binary trees. A skip list is a linked list augmented with additional pointers, allowing dictionary operations to run in expected logarithmic time.
reasonable
Lana_Del_Rey_Cannes_2012.jpg Elizabeth Woolridge Grant
macro_rules! box_it {
($value:literal) => {
Box::new($value)
};
}
fn main() {
let stuff = box_it!("hello, world");
println!("{stuff:?}");
}
going for macros