Giovanni Bajo's swapfile

Because memory is volatile
Options:

Golomb-coded sets: smaller than Bloom filters

04 Sep

Posted by: Giovanni Bajo in: C++, Optimizations, Python

While reading the super-interesting Imperial Violet, Adam Langley’s weblog, I stumbled upon a new data structure that I had never heard of: the Golomb-coded sets (GCS). It is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.

Compile-time Function Execution in D

30 May

Posted by: Giovanni Bajo in: Optimizations

This post will describe the basics of a very powerful feature of the D programming language: the Compile-time Function Execution (CTFE), which allows complicated functions to be fully evaluated at compile-time, irrespective of the optimization levels. C optimizations If you are an average C programmer, you know that simple code can be trusted to be [...]

Search

Follow me

GitHub ProfileTwitter ProfileLinkedIn ProfileFacebook Profile

Short mindswaps

Swap partitions

strings | sort | uniq

algorithms api C++ Canvas Compile-time Function Execution cow ctypes D DNSBL GPU greylisting H264 hash HTML5 IE9 Languages optimization Programming py2app py2exe pyinstaller Python qt RBL security SpamAssassin tokens

Recent Comments

A design creation of Design Disease

Copyright © 2010 - Giovanni Bajo's swapfile - is proudly powered by WordPress
InSense 1.0 Theme by Design Disease brought to you by HostGator Web Hosting.