Basically, for those who don’t know, a lazy list is an infinite list in which elements are generated on the fly. Although this has been possible in C++ for a long time, with C++0x it really becomes beautiful.

For example, to represent the Fibonacci Numbers we can do:

LazyList<int> fibonacci([](unsigned int index, LazyList<int> *obj) -> int
{
	if(index < 2) return index;
	return (*obj)[index-1] + (*obj)[index-2];
});
 
/* Print the first 20 fibonacci numbers */
for(int i = 0; i < 20; i++)
	printf("%d ", fibonacci[i]);

And the code for class LinkedList (Note: I have not implemented a cache, to show how simple it is):

#include <functional>
template<typename T>
class LazyList 
{
public:
	typedef std::function<T(unsigned int, LazyList<T>*)> Generator;
 
	LazyList(Generator gen)
		: m_gen(gen)
	{
	}
 
	T operator [](unsigned int n) 
	{
		return m_gen(n, this);
	}
private:
	Generator m_gen;
};

Awesome.

I have been playing with Processing lately. It is surprisingly fun.

I have created a visualization/spectrum analyzer, using code borrowed from: James Alliban. In my opinion this is the coolest part of processing, the idea that all code should be open sourced.

You can check it out here.

This is my website about my life, my thoughts, and my experiences.  And it is still very much a work in progress, but wordpress is a very forgiving system and it should all be up and running very soon.