<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Iterator on Minko Gechev&#39;s blog</title>
		<link>https://blog.mgechev.com/tags/iterator/</link>
		<description>Recent content in Iterator on Minko Gechev&#39;s blog</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
		
		
		
			<lastBuildDate>Fri, 12 Sep 2014 19:07:34 +0000</lastBuildDate>
		
			<atom:link href="https://blog.mgechev.com/tags/iterator/feed.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Binary Tree iterator with ES6 generators</title>
				<link>https://blog.mgechev.com/2014/09/12/binary-tree-iterator-with-es6-generators/</link>
				<pubDate>Fri, 12 Sep 2014 19:07:34 +0000</pubDate>
				<guid>https://blog.mgechev.com/2014/09/12/binary-tree-iterator-with-es6-generators/</guid>
				<description>&lt;p&gt;ES6 specification is being clarified every passed day! One of the key features of the new version of the language are the &lt;a href=&#34;https://en.wikipedia.org/wiki/Generator_(computer_programming)&#34;&gt;generators&lt;/a&gt;.&#xA;Generators (a.k.a. semicoroutines) will play quite important role after they are being officially released. They could be used to simplify the asynchronous control flow of any JavaScript program (look at &lt;a href=&#34;https://github.com/visionmedia/co&#34;&gt;co&lt;/a&gt;). Another important role is using them for creating iterators.&lt;/p&gt;&#xA;&lt;p&gt;In this blog post we are going to take a look at how could be implemented iterator of binary search tree using the ES6 generators.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
