<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: 一个简单的列表操作性能测试</title>
	<atom:link href="http://erlang-china.org/study/benchmark_list_operate.html/feed" rel="self" type="application/rss+xml" />
	<link>http://erlang-china.org/study/benchmark_list_operate.html</link>
	<description>erlang 中文社区</description>
	<pubDate>Sun, 07 Sep 2008 20:11:26 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.1</generator>
		<item>
		<title>By: Caoyuan</title>
		<link>http://erlang-china.org/study/benchmark_list_operate.html#comment-401</link>
		<dc:creator>Caoyuan</dc:creator>
		<pubDate>Tue, 14 Aug 2007 05:10:17 +0000</pubDate>
		<guid isPermaLink="false">http://erlang-china.org/study/%e4%b8%80%e4%b8%aa%e7%ae%80%e5%8d%95%e7%9a%84%e5%88%97%e8%a1%a8%e6%93%8d%e4%bd%9c%e6%80%a7%e8%83%bd%e6%b5%8b%e8%af%95.html#comment-401</guid>
		<description>append() 与 ++ 是等价的，或者说，++在编译时会转换成调用lists:append。
如果实现知道一个list的深度是1，可以用append而不要用flatten。

flatten需要遍历list的每一个元素，如果某个元素也是list，那么就要深入下去。</description>
		<content:encoded><![CDATA[<p>append() 与 ++ 是等价的，或者说，++在编译时会转换成调用lists:append。<br />
如果实现知道一个list的深度是1，可以用append而不要用flatten。</p>
<p>flatten需要遍历list的每一个元素，如果某个元素也是list，那么就要深入下去。</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: piggybox</title>
		<link>http://erlang-china.org/study/benchmark_list_operate.html#comment-127</link>
		<dc:creator>piggybox</dc:creator>
		<pubDate>Wed, 11 Jul 2007 18:36:54 +0000</pubDate>
		<guid isPermaLink="false">http://erlang-china.org/study/%e4%b8%80%e4%b8%aa%e7%ae%80%e5%8d%95%e7%9a%84%e5%88%97%e8%a1%a8%e6%93%8d%e4%bd%9c%e6%80%a7%e8%83%bd%e6%b5%8b%e8%af%95.html#comment-127</guid>
		<description>哈哈这样伪装成循环链表啊，彻底晕倒~~~看来还是没法构造真正的循环链表</description>
		<content:encoded><![CDATA[<p>哈哈这样伪装成循环链表啊，彻底晕倒~~~看来还是没法构造真正的循环链表</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arbow</title>
		<link>http://erlang-china.org/study/benchmark_list_operate.html#comment-123</link>
		<dc:creator>Arbow</dc:creator>
		<pubDate>Wed, 11 Jul 2007 15:40:05 +0000</pubDate>
		<guid isPermaLink="false">http://erlang-china.org/study/%e4%b8%80%e4%b8%aa%e7%ae%80%e5%8d%95%e7%9a%84%e5%88%97%e8%a1%a8%e6%93%8d%e4%bd%9c%e6%80%a7%e8%83%bd%e6%b5%8b%e8%af%95.html#comment-123</guid>
		<description>@piggybox
记得以前看过一份代码，将list拷一份，放到一个递归函数里面

fun([], List) -&gt; fun(List, List);
fun([H&#124;T], List) -&gt; ........... fun(T, List).

这种方式来实现循环列表的访问。。。</description>
		<content:encoded><![CDATA[<p>@piggybox<br />
记得以前看过一份代码，将list拷一份，放到一个递归函数里面</p>
<p>fun([], List) -> fun(List, List);<br />
fun([H|T], List) -> &#8230;&#8230;&#8230;.. fun(T, List).</p>
<p>这种方式来实现循环列表的访问。。。</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: piggybox</title>
		<link>http://erlang-china.org/study/benchmark_list_operate.html#comment-122</link>
		<dc:creator>piggybox</dc:creator>
		<pubDate>Wed, 11 Jul 2007 14:45:52 +0000</pubDate>
		<guid isPermaLink="false">http://erlang-china.org/study/%e4%b8%80%e4%b8%aa%e7%ae%80%e5%8d%95%e7%9a%84%e5%88%97%e8%a1%a8%e6%93%8d%e4%bd%9c%e6%80%a7%e8%83%bd%e6%b5%8b%e8%af%95.html#comment-122</guid>
		<description>一般都是头插在反转，list内部好象不是循环链表啊。另外erlang既不支持mutable data也不支持monad，好象没法自己实现循环链表？</description>
		<content:encoded><![CDATA[<p>一般都是头插在反转，list内部好象不是循环链表啊。另外erlang既不支持mutable data也不支持monad，好象没法自己实现循环链表？</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jackyz</title>
		<link>http://erlang-china.org/study/benchmark_list_operate.html#comment-80</link>
		<dc:creator>jackyz</dc:creator>
		<pubDate>Fri, 25 May 2007 16:38:31 +0000</pubDate>
		<guid isPermaLink="false">http://erlang-china.org/study/%e4%b8%80%e4%b8%aa%e7%ae%80%e5%8d%95%e7%9a%84%e5%88%97%e8%a1%a8%e6%93%8d%e4%bd%9c%e6%80%a7%e8%83%bd%e6%b5%8b%e8%af%95.html#comment-80</guid>
		<description>原来如此。难怪看到好多这样的代码。赞。</description>
		<content:encoded><![CDATA[<p>原来如此。难怪看到好多这样的代码。赞。</p>
]]></content:encoded>
	</item>
</channel>
</rss>
