What is Hackers' Pub?

Hackers' Pub is a place for software engineers to share their knowledge and experience with each other. It's also an ActivityPub-enabled social network, so you can follow your favorite hackers in the fediverse and get their latest posts in your feed.

1
0
0
0
0
2
0
0
0
0
1
0

すごい話だなと思ういっぽう、なんらかの理由で登山支援ロボットが山中で機能しなくなる可能性は当然あるわけで、闇雲に登山の手段として頼るべき存在ではないだろうと感じる。

「疲れない登山」が中国でブーム “支援ロボット”で軽々登る女性や映画「アバター」のモデル地では「一歩も歩かず」絶景ポイントに到着も - ライブドアニュース news.livedoor.com/article/deta

0
0

제3자의 데이터 크롤링을 기술적 한계로 완전히 막을 수는 없으므로, 블루스카이 측에서는 이러한 가능성을 대비하고 있다고 예상됩니다. 또한, 크롤러의 대량 접근으로 인한 운영 비용 증가를 고려하면 블루스카이 측이 이러한 행위를 방치하지 않을거라고 봅니다. 다만, 우회 방법은 다양하기 때문에 완전히 차단하는 것은 어려울뿐이죠..🥲

0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0

Advent of Code 2025: Haskell solution reflections for all 12 days. ~ Justin Le. blog.jle.im/entry/advent-of-co

Advent of Code 2025: Haskell Solution Reflections for all 12 Days

Merry Christmas all! This is my annual Advent of Code post! Advent of Code is a series of (this year) 12 daily Christmas-themed programming puzzles that are meant to be fun diversions from your daily life, help you find a bit of whimsy in your world, give you a chance to explore new ideas and program together with your friends. I always enjoy discussing creative ways to solve these puzzles every day, and it’s become a bit of an annual highlight for me and a lot of others. My favorite part about these puzzles is that they are open ended enough that there are usually many different interesting ways to solve them — it’s not like a stressful interview question where you have to recite the obscure incantation to pass the test. In the past I’ve leveraged group theory, galilean transformations and linear algebra, and more group theory. Haskell is especially fun for these because if you set up your abstractions in just the right way, the puzzles seem to solve themselves. It’s a good opportunity every year to get exposed to different parts of the Haskell ecosystem! Last year, I moved almost all of my Haskell code to an Advent of Code Megarepo, and I also write up my favorite ways to solve each one in the megarepo wiki. All of this year’s 12 puzzles are here, but I’ve also included links to each individual one in this post. I’m also considering expanding some of these into full on blog posts, so be on the look out, or let me know if there are any that you might want fully expanded! And if you haven’t, why not try these out yourself? Be sure to drop by the libera-chat ##advent-of-code channel to discuss any fun ways you solve them, or any questions! Thanks again to Eric for a great new fresh take on the event this year! * Day 1 - Secret Entrance — The classic Day 1 scanl * Day 2 - Gift Shop — The super efficient IntSet * Day 3 - Lobby — StateT + [] = backtracking search monad * Day 4 - Printing Department — 2D cellular automata * Day 5 - Cafeteria — The power of the data-interval library * Day 6 - Trash Compactor — Data.List manipulations * Day 7 - Laboratories — Tying the knot * Day 8 - Playground — Iterative Clustering * Day 9 - Movie Theater — IntervalSet and IntervalMap * Day 10 - Factory — Guassian Elimation, Type-safe Mutable Vectors * Day 11 - Reactor — More Knot Tying and DP! * Day 12 - Christmas Tree Farm — Counting

blog.jle.im · in Code

0
1
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0