<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Talking to myself</title>
	<atom:link href="http://stasyan.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://stasyan.wordpress.com</link>
	<description>Just another WordPress.com weblog</description>
	<lastBuildDate>Mon, 28 Nov 2011 16:28:42 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='stasyan.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Talking to myself</title>
		<link>http://stasyan.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://stasyan.wordpress.com/osd.xml" title="Talking to myself" />
	<atom:link rel='hub' href='http://stasyan.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Chris Okasaki&#8217;s &#8220;Purely functional data structures&#8221;.</title>
		<link>http://stasyan.wordpress.com/2010/02/19/chris-okasakis-purely-functional-data-structures/</link>
		<comments>http://stasyan.wordpress.com/2010/02/19/chris-okasakis-purely-functional-data-structures/#comments</comments>
		<pubDate>Fri, 19 Feb 2010 22:47:39 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/?p=228</guid>
		<description><![CDATA[Jon Harrop, of Flying Frog Consultancy have posted a comment that I should read Chris Okasaki&#8217;s &#8220;Purely functional data structures&#8221;. I googled it and found this pdf : Purely functional data structures And there is a book of course. I don&#8217;t know if the pdf and the book are the same. Nevertheless, so far I&#8217;ve [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=228&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/02/19/chris-okasakis-purely-functional-data-structures/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>
	</item>
		<item>
		<title>Skip Lists and functional programming</title>
		<link>http://stasyan.wordpress.com/2010/02/18/skip-lists-and-functional-programming/</link>
		<comments>http://stasyan.wordpress.com/2010/02/18/skip-lists-and-functional-programming/#comments</comments>
		<pubDate>Thu, 18 Feb 2010 13:23:56 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/2010/02/18/skip-lists-and-functional-programming/</guid>
		<description><![CDATA[I spent some time trying to figure out how to write a Skip Lists data-structure in F# using pure functional approach. It seems that functional implementation of Skip Lists will make them perform in O(n^2) instead of O(log n). This happens since in a functional implementation lists in Skip List data-structure are immutable. Therefore any [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=224&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/02/18/skip-lists-and-functional-programming/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>
	</item>
		<item>
		<title>Red and Black Tree re-write</title>
		<link>http://stasyan.wordpress.com/2010/02/16/red-and-black-tree-re-write/</link>
		<comments>http://stasyan.wordpress.com/2010/02/16/red-and-black-tree-re-write/#comments</comments>
		<pubDate>Tue, 16 Feb 2010 14:38:31 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/?p=214</guid>
		<description><![CDATA[I rewrote Red And Black tree from scratch. Making new implementation about 100 lines less than what I posted before. I also believe that new implementation is much simpler, and it follows the Red And Black tree definition pretty closely. I&#8217;ve been using Mercurial to revision control my projects. So I&#8217;ve pushed Avl Tree and [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=214&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/02/16/red-and-black-tree-re-write/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>
	</item>
		<item>
		<title>Red and Black tree in F#: post mortem</title>
		<link>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-post-mortem/</link>
		<comments>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-post-mortem/#comments</comments>
		<pubDate>Wed, 20 Jan 2010 14:22:45 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-post-mortem/</guid>
		<description><![CDATA[I implemented the Red and Black tree so I could understand continuations better. I really don&#8217;t like the implementation, since it is not as clean as I would like it to be. But it works nevertheless. I did some random testing of 10000 elements. Insertion and deletion worked. The cool thing is that the Black [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=210&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-post-mortem/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>
	</item>
		<item>
		<title>Red and Black tree in F# &#8211; extras</title>
		<link>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-extras/</link>
		<comments>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-extras/#comments</comments>
		<pubDate>Wed, 20 Jan 2010 14:09:35 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/?p=199</guid>
		<description><![CDATA[This includes some simple functions that are might be useful for playing around with the Red and Black tree. This is the height of tree measured in black nodes let getBlackHeight tree = let rec doGetBlackHeight leftoverTree height = match leftoverTree with &#124; Empty -&#62; height &#124; Node(node, leftNode, _) -&#62; match node with &#124; [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=199&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-extras/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>
	</item>
		<item>
		<title>Red and Black tree in F# : Deletion</title>
		<link>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-deletion/</link>
		<comments>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-deletion/#comments</comments>
		<pubDate>Wed, 20 Jan 2010 14:04:12 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/?p=152</guid>
		<description><![CDATA[Deleting a node even from regular binary tree is a little bit more complicated than insertion. Deleting a node from Red and Black tree is also a little bit more complicated than insertion. I updated the legend to include Double black node: Double Black nodes appear when a Black node with Empty children becomes Empty. [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=152&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/01/20/red-and-black-tree-in-f-deletion/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/updatedlegend.png" medium="image">
			<media:title type="html">Updated legend</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2009/12/tree.png" medium="image">
			<media:title type="html">final tree</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/delete71.png" medium="image">
			<media:title type="html">Step 1</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/delete72.png" medium="image">
			<media:title type="html">Step 2</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/delete73.png" medium="image">
			<media:title type="html">Step 3</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/delete74.png" medium="image">
			<media:title type="html">Step 4</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/deletioncase11.png" medium="image">
			<media:title type="html">Case 1</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/deletioncase12.png" medium="image">
			<media:title type="html">Case1</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/case1result.png" medium="image">
			<media:title type="html">Case 1</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/deletioncase21.png" medium="image">
			<media:title type="html">Case 2</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/deletioncase22.png" medium="image">
			<media:title type="html">Case 2</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/deletioncase3.png" medium="image">
			<media:title type="html">Case 3</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2010/01/deletenotmentioned.png" medium="image">
			<media:title type="html">Not Mentioned</media:title>
		</media:content>
	</item>
		<item>
		<title>There was a bug in insertion implementation</title>
		<link>http://stasyan.wordpress.com/2010/01/08/there-is-a-bug-in-insertion-implementation/</link>
		<comments>http://stasyan.wordpress.com/2010/01/08/there-is-a-bug-in-insertion-implementation/#comments</comments>
		<pubDate>Fri, 08 Jan 2010 13:44:05 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/2010/01/08/there-is-a-bug-in-insertion-implementation/</guid>
		<description><![CDATA[I missed the case when recoloring of the black parent into red may cause double red problem in the parent, therefore we need to propagate node restructuring up the tree. I fixed the bug, and updated Red and Black tree post<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=162&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/01/08/there-is-a-bug-in-insertion-implementation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>
	</item>
		<item>
		<title>Red and Black tree in F# : Insertion</title>
		<link>http://stasyan.wordpress.com/2010/01/06/red-and-black-tree-in-f-insertion/</link>
		<comments>http://stasyan.wordpress.com/2010/01/06/red-and-black-tree-in-f-insertion/#comments</comments>
		<pubDate>Wed, 06 Jan 2010 15:54:20 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/?p=69</guid>
		<description><![CDATA[Here is a legend that explains what I am trying to do in the diagrams: Insertion in Red and Black trees is based on insertion in binary trees plus some extra work to keep the tree balanced. To insert a new value into Red and Black tree: Create a Red node with the value that [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=69&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2010/01/06/red-and-black-tree-in-f-insertion/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2009/12/legend.png" medium="image">
			<media:title type="html">Legend</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2009/12/insertioncase13.png" medium="image" />

		<media:content url="http://stasyan.files.wordpress.com/2009/12/insertioncase2.png" medium="image" />
	</item>
		<item>
		<title>Red and Black tree in F#</title>
		<link>http://stasyan.wordpress.com/2009/12/31/red-and-black-tree-in-f/</link>
		<comments>http://stasyan.wordpress.com/2009/12/31/red-and-black-tree-in-f/#comments</comments>
		<pubDate>Thu, 31 Dec 2009 14:28:18 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/?p=53</guid>
		<description><![CDATA[I wrote 2-4 tree about 5 years ago in C++. This is a take on the Red and Black tree in F#. Both 2-4 and Red and Black tress are self balancing trees. They are kind of like cousins, since one could be converted into the other quite easily. Hence all performance analysis that apply [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=53&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2009/12/31/red-and-black-tree-in-f/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2009/12/binary.png" medium="image">
			<media:title type="html">Binary Tree</media:title>
		</media:content>

		<media:content url="http://stasyan.files.wordpress.com/2009/12/redblack.png" medium="image">
			<media:title type="html">Red and Black Tree</media:title>
		</media:content>
	</item>
		<item>
		<title>Getting started with F# and XNA</title>
		<link>http://stasyan.wordpress.com/2009/12/08/getting-started-with-f-and-xna/</link>
		<comments>http://stasyan.wordpress.com/2009/12/08/getting-started-with-f-and-xna/#comments</comments>
		<pubDate>Tue, 08 Dec 2009 21:54:05 +0000</pubDate>
		<dc:creator>stasyan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://stasyan.wordpress.com/?p=22</guid>
		<description><![CDATA[Game development I think is more involved and more fun than any other types of software development. Even though I had not made any games that are worth publishing. I still keep working on a game related stuff all the time. Right now I am trying to write a game using F# and XNA. Of [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stasyan.wordpress.com&amp;blog=851895&amp;post=22&amp;subd=stasyan&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://stasyan.wordpress.com/2009/12/08/getting-started-with-f-and-xna/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/b0b37fbe31305a5f6ce20befd5532d23?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">stasyan</media:title>
		</media:content>
	</item>
	</channel>
</rss>
