サクサク読めて、アプリ限定の機能も多数！
トップへ戻る
ブラックフライデー
blog.omega-prime.co.uk
Something I recently became interested in is map data structures for external memory — i.e. ways of storing indexed data that are optimized for storage on disk. In a typical analysis of algorithm time complexity, you assume it takes constant time to access memory or perform a basic CPU operation such as addition. This is of course not wholly accurate: in particular, cache effects mean that memory
I recently implemented a powerful new extension to GHC HEAD called ConstraintKinds. This (Literate Haskell) post will explain what this means, and how we can exploit it to do some cool stuff. (For long-time readers, this stuff is a generalisation of my earlier post about constraint families which was later also expounded on by Dominic Orchard and Tom Schrijvers in Type Constraints Unleashed. The p
このページを最初にブックマークしてみませんか？
『blog.omega-prime.co.uk』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
