HN user

fla

2,819 karma

"06+@39￸<9>2↑+>↑17+36￸-97".split('').map(x => String.fromCharCode(x.charCodeAt(0)+54)).join('')

Posts129
Comments397
View on HN
ca.finance.yahoo.com 27d ago

Trump administration asks OpenAI to stagger release of new model

fla
13pts2
github.com 4mo ago

Pg_doom

fla
3pts0
neosmart.net 5mo ago

Recreating uncensored Epstein PDFs from raw encoded attachments

fla
8pts0
www.youtube.com 6mo ago

Photonic Chips Are Coming Faster Than Anyone Expected [video]

fla
2pts0
gitpush--force.com 6mo ago

I decided to make a worse UUID for the pettiest of reasons

fla
3pts0
rushter.com 6mo ago

Oh My Zsh adds bloat

fla
337pts297
smallcultfollowing.com 4y ago

Many Modes: A GATs Pattern

fla
1pts0
github.com 4y ago

Helix – A post-modern modal text editor

fla
2pts0
youtu.be 5y ago

Detailed Rigid Body Simulation with Extended Position Based Dynamics

fla
1pts0
www.galaxus.ch 6y ago

Shopping in the time of Corona – the virus is mirrored in our shopping carts

fla
1pts0
youtu.be 6y ago

SpaceX Crew Demo-2

fla
4pts0
medium.com 6y ago

Socat

fla
1pts0
www.redtimmy.com 6y ago

ELF launcher for encrypted binaries decrypted on-the-fly and executed in memory

fla
2pts0
github.com 6y ago

Sokol – Simple STB-style cross-platform libraries for C and C++

fla
2pts0
erikbern.com 7y ago

The half-life of code and the ship of Theseus (2016)

fla
1pts0
github.com 8y ago

SQLite ORM light header only library for modern C++

fla
2pts0
github.com 8y ago

A vector field explorer

fla
2pts0
anvaka.github.io 8y ago

Field Play

fla
1pts0
medium.com 8y ago

Let’s Enhance How we found rogerkver’s $1000 wallet obfuscated private key

fla
1pts0
hackernoon.com 9y ago

C++ Error Handling: Why Use Eithers in Favor of Exceptions and Error-Codes

fla
44pts66
github.com 9y ago

A high performance, shared memory, lock free C++11 key-value store

fla
3pts0
venturebeat.com 9y ago

Capture your facial expression in virtual reality

fla
2pts0
www.mindmaze.com 9y ago

Introducing MASK

fla
2pts0
github.com 9y ago

25 times faster dynamic cast in C++ for MSVC

fla
2pts0
github.com 9y ago

HIP: Convert CUDA to Portable C++ Code

fla
134pts14
android-developers.blogspot.com 9y ago

CMake and ndk-build support in Android Studio 2.2

fla
2pts0
mars.jpl.nasa.gov 9y ago

Curiosity Rover Finds and Examines a Meteorite on Mars

fla
2pts0
github.com 10y ago

Bloat-free Immediate Mode GUI for C++ with minimal dependencies

fla
1pts0
news.utexas.edu 10y ago

New Method of Producing Random Numbers Could Improve Cybersecurity

fla
1pts0
github.com 10y ago

Choreograph – A simple, modern C++ animation and timing library

fla
4pts0

I usually solve this by commiting my fixup in a dummy commit, then do a rebase -i HEAD~n where n is the number of commits I want to look back at. Then during the rebase I just move my commit below the one that seem the most appropriate and mark it for squash. Execute the rebase. Done

Hello, PNG 4 years ago

Can’t answer as to why it is mandatory but it is known to improve compression.

Swiss here. Not an expert on the project but AFAIK the idea is to reduce the impact of transportation on the surface.

With globalization and population increase, the need for point to point logistic is going to go through the roof in urban areas in the next years.

Currently this translates to having more trucks on the highways and roads, as our rail wail system is close to saturation already. Not to mention our road are really small compared to US (ie: highways are two-lanes per direction). This creates a ton of air and noise pollution and traffic jams.

This new transportation system should absorb some of the goods traffic and hopefully scale country-wide in the future while sparing the environnement at the surface as much as possible.

It can generate some funny C code with very opinionated comments too!

Prompt: int add_numbers(int a, int b)

Result: int add_numbers(int a, int b) { int nums[3] = {a,b,a+b}; return nums[2]; }

A:

A more C-like way of doing this would be: int add_numbers(int a, int b) { int nums[2]; nums[0] = a; nums[1] = b; return nums[1] + nums[0]; }

Also, in this case, it is safer to return a single int, since that is more self-documenting. If there is any possibility of an error in one of the numbers, then it is less clear what the expected return value should be. This is similar to how you would code a simple + operator: int operator+(const int &a, const int &b

0xF Rules 6 years ago

"There are 2 hard problems in computer science: cache invalidation, naming things, and off-by-1 errors."

Because doing this inflates the price of everything, including the exchange rate.

Imagine the following (simplified) situation:

Before inflation, a beer costs 10CHF, Euro is at parity: 10EUR = 10CHF = 1 beer

After inflation of 10x, beer now costs 100CHF: 10EUR = 100CHF = 1 beer

In the end, if you pay in EUR, a beer always costs 10EUR. The value of the CHF has not really weaken (only numerically)

From the article: > Although it’s not one single long exposure, Google’s night mode still gathers light over a period of a few seconds, and anything moving through the frame in that time will turn into a blur of motion.