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.

0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
クロユリ@skeb募集中 @sakuraYuki_Lily@misskey.design
Public
22日夕方まで手数料無料らしいので宣伝！！
描けそうなものなら何でも描きます！！
ケモミミでもケモでも半ケモでもケモ度の階段風でもなんでも！！！描きます！！！
よければリクエストください～～！！

クロユリ skeb募集中さんはコミッションを募集しています！ https://skeb.jp/@SakuraYuki_Lily @skeb_jpより
0
0
0
0
0
0
한겨레 @hanibsky.bsky.social@bsky.brid.gy
Public

과거 아동·노숙인 시설 등에서 벌어진 인권침해 사건 피해자들이 국가소송에 나서지 않아도 보상을 받는 등 피해를 회복할 수 있는 길이 열립니다. 보건복지부는 20일 아동복지·노숙인 시설 등에서 발생한 인권침해 사건 피해자들을 위한 범정부 피해 회복 지원업무에 나선다고 밝혔습니다.

선감학원·형제복지원 등 인권침해 피해자, 국가 소송 없...

선감학원·형제복지원 피해자, 국가소송 없이 보상받는다

과거 아동·노숙인 시설 등에서 벌어진 인권침해 사건 피해자들이 국가소송에 나서지 않아도 보상을 받는 등 피해를 회복할 수 있는 길이 열린다. 보건복지부는 20일 아동복지·노숙인 시설 등에서 발생한 인권침해 사건 피해자들을 위한 범정부 피해 회복 지원업무에 나선다고 밝혔

www.hani.co.kr · 한겨레

0
0
0
0
0
0
MDN Web Docs @mdn@mastodon.social
Public

Safely embed user input in regex patterns 🔐

RegExp.escape() escapes regex syntax characters in a string, so you can use user-provided text as a literal pattern.

Prevents unexpected regex behavior and security issues when dynamically creating RegExp patterns.

Learn more here 👇
developer.mozilla.org/en-US/do

The MDN logo

RegExp.escape() - JavaScript | MDN

The RegExp.escape() static method escapes any potential regex syntax characters in a string, and returns a new string that can be safely used as a literal pattern for the RegExp() constructor.

developer.mozilla.org · MDN Web Docs

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
1
0
0
0
1
0
0
0
0
2
0
0
Satoshi Kojima (小嶋智) @skoji@sandbox.skoji.jp
Public

私も趣味の延長線上に労役としてのプログラミングがあるのが基本なんだけどそれはそれとして仕事で書いているものにあらゆる側面から意義が感じられないことはあり、だから「向き合い方に影響して」いない、といのはわりとうらやましい環境な可能性がある

まあ全然そういう話じゃなくわたしという個人の問題の可能性もある

0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
Ch. :animal_feed_trickcal: @sftblw@lake.naru.cafe
Public

​:speaki_cry:​
💥 💥💥💥
🏢 🏢 🏢 🏢

www.youtube.com/shorts/g2D1G3vgDto

ｽﾋﾟｷの逆襲 #ｽﾋﾟｷ #スピッキー #トリッカル

creditトリッカル day life【AIcover】スペシャルサンクス：学習モデルの元となったコンテンツ制作者の皆様研究目的でAI関連を中心に活動していこうと思います。分野はAI・パロディ・一次創作・二次創作など。不定期的だけどたくさん投稿していきたいので、チャンネル登録よろしく！sora2にて実験的な動画...

www.youtube.com · YouTube

0
0
0
0
0
0
0
0
0
0
1
0
Abhinav 🌏 @abnv@fantastic.earth
Public
Shared by 洪 民憙 (Hong Minhee)

Bookmarked: [brandon.si] Linking Smaller Haskell Binaries

brandon.si/code/linking-smalle

See more links at abhinavsarkar.net/linkblog

Linking Smaller Haskell Binaries | Brandon Simmons' website

Haskell binaries can get quite large (think ~100MB), especially for projects with many transitive dependencies. Here are two strategies that can help at link time, the latter being more experimental. I used the test-pandoc binary from pandoc on GHC 9.2.5 below. This was nice because obviously it was easy to test if linking broke anything (just run the tests). -split-sections and --gc-sections You can instruct ghc to emit code in individual minimal sections, allowing the linker to easily find and remove dead code. This looks like, in your cabal.project:

brandon.si

1
0
0
1
0
0
Abhinav 🌏 @abnv@fantastic.earth
Public
Shared by 洪 民憙 (Hong Minhee) :nonbinary:

Bookmarked: [brandon.si] Linking Smaller Haskell Binaries

brandon.si/code/linking-smalle

See more links at abhinavsarkar.net/linkblog

Linking Smaller Haskell Binaries | Brandon Simmons' website

Haskell binaries can get quite large (think ~100MB), especially for projects with many transitive dependencies. Here are two strategies that can help at link time, the latter being more experimental. I used the test-pandoc binary from pandoc on GHC 9.2.5 below. This was nice because obviously it was easy to test if linking broke anything (just run the tests). -split-sections and --gc-sections You can instruct ghc to emit code in individual minimal sections, allowing the linker to easily find and remove dead code. This looks like, in your cabal.project:

brandon.si

1
0
0
0
0
0
0
8
0
0
1
0
셀럽 노른자 @yolkegg1234.bsky.social@bsky.brid.gy
Public

길을 걷고 있었는데 반대쪽에서 내 쪽을 보며 웃고 있는 사람이 걸어왔다. 처음엔 흐뭇하게 웃고 있는 정도였는데 가까워질수록 조커처럼 광기에 찬 표정으로 바뀌었다. 바로 앞까지 왔을 때는 흥분해서 팔을 들고 소리까지 지르길래 너무 무서웠는데 그대로 내 뒤쪽에 있던 산책하는 강아지와 가족분께 달려들었다. 그리고 무자비하게 쓰다듬었다. 좋은 아버지네

0
0
0
0
0
0
0
3
0
0
0
0
Abhinav 🌏 @abnv@fantastic.earth
Public

Bookmarked: [brandon.si] Linking Smaller Haskell Binaries

brandon.si/code/linking-smalle

See more links at abhinavsarkar.net/linkblog

Linking Smaller Haskell Binaries | Brandon Simmons' website

Haskell binaries can get quite large (think ~100MB), especially for projects with many transitive dependencies. Here are two strategies that can help at link time, the latter being more experimental. I used the test-pandoc binary from pandoc on GHC 9.2.5 below. This was nice because obviously it was easy to test if linking broke anything (just run the tests). -split-sections and --gc-sections You can instruct ghc to emit code in individual minimal sections, allowing the linker to easily find and remove dead code. This looks like, in your cabal.project:

brandon.si

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