Avoid Async Rust At All Cost Avoid async in your codebase and in your dependencies at all cost. Reasons: Leaky abstraction problem which leads to "async contamination". Violation of the zero-cost abstractions principle. Major degradation in developer's productivity. Most advertised benefits are imaginary, too expensive (unless you are FAANG) or can be achieved without async. Alternatives: Event lo
UPDATE Wed 24th, 2024: This article was originally called “Nominal Types”. A few people on lobste.rs and r/programming pointed out that naming this Nominal Types is incorrect. A better description would be Phantom Types or maybe Tagged Types. Quick overview of using nominal types to encode semantic differences between types in an efficient and elegant way The Problem#Let’s say we’re writing a prog
In France, income tax is computed from taxpayers' individual returns, using an algorithm that is authored, designed and maintained by the French Public Finances Directorate (DGFiP). This algorithm relies on a legacy custom language and compiler originally designed in 1990, which unlike French wine, did not age well with time. Owing to the shortcomings of the input language and the technical limita
Ruby 3.3リリース！ 新機能解説 Prism：エラートレラントな、まったく新しいRubyパーサ Prismは、Ruby 3.3.0にバンドルされた新しいライブラリで、プログラミング言語Rubyの新しいパーサであるPrismパーサのバインディングです。Prismはエラートレラント、移植性、メンテナンス性、高速性、効率性を考慮して設計されています。この記事では、Prismの歴史、設計、API、そして今後の課題について取り上げます。 使用方法 Rubyバインディングを通してPrismパーサを使うにはrequire "prism"をして、Prismモジュールのparseメソッド、または他のparse_*系のメソッドを呼んでください。次に例を示します。 require "prism" Prism.parse("1 + 2") parseメソッドは、パース結果のオブジェクトを返します。こ
In this post I'm excited to announce the Saber Virtual Machine, or SaberVM. It's a project I've been working hard on for the past month, with fascinating properties and an in-progress MVP implementation that's coming along well. If you like writing functional languages and want a portable backend to target that's fast and/or safe, you may be very interested in SaberVM, especially in its upcoming A
So, there's this function. It's called a lot. More importantly, all those calls are on the critical path of a key user interaction. Let's talk about making it fast. Spoiler: it's a dot product. Some background (or skip to the juicy stuff)At Sourcegraph, we're working on a Code AI tool named Cody. In order for Cody to answer questions well, we need to give them enough context to work with. One of t
sled theoretical performance guide This guide covers timeless ideas that are helpful to keep in mind while working with systems where performance matters. Many of these ideas are fairly “durable” and will apply regardless of what hardware, programming language, operating system, or decade you are working in. Stay tuned for follow-up articles that will drill into hardware and more Rust-specific tec
Assuming this would focus more on Rust, I did not expect the ending discussion on Lua. Finally, one of the key things that we found was that a lot of projects used C/C++ out of inertia. They don’t have peak memory or sub-millisecond-latency constraints and could easily be written in a managed language, often even in an interpreted one. We have Lua in the base system. I’d love to see a richer set o
Like most hash map implementations, Zig's std.HashMap relies on 2 functions, hash(key: K) u64 and eql(key_a: K, key_b: K) bool. The hash function takes a key and returns an unsigned 64 bit integer, known as the hash code. The same key always returns the same hash code. The hash function can produce the same hash code for two different keys which is one reason we also need eql: to determine if two
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
