Morris-Pratt
Sunday, 13. September 2009, 17:38:23
My dear friend, did you hear that I am an addicted geek? No?!
Well, a bit...
Today, I am glad to inform you that today, on Sunday (yes, on Sunday...) I cracked Morris-Pratt algorithm of string matching. As for me, this is a bit tricky algorithm because it uses statements like table[table[index]] (double index nesting).
So far, so good....
Ah, yes, I started working with Visual Studio 10 and Visual SVN.
A new C++ features, like auto and lambda expressions - are delicious! It is amazing, how we may leave without automatic type deduction before?!
Yes, I like it!
Well, a bit...
Today, I am glad to inform you that today, on Sunday (yes, on Sunday...) I cracked Morris-Pratt algorithm of string matching. As for me, this is a bit tricky algorithm because it uses statements like table[table[index]] (double index nesting).
So far, so good....
Ah, yes, I started working with Visual Studio 10 and Visual SVN.
A new C++ features, like auto and lambda expressions - are delicious! It is amazing, how we may leave without automatic type deduction before?!
typedef ::std::map< ::std::string, ::std::pair<unsigned, ::std::list<int> > > crazy_map_type;
crazy_map_type map;
for (auto it (mab.begin()); it != map.end(); ++it) {
auto data = *it;
}
Yes, I like it!
WIDGETIZE