<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/1.5" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Array</title>
	<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/</link>
	<description>serious code</description>
	<pubDate>Fri, 21 Nov 2008 13:16:07 +0000</pubDate>
	<generator>http://wordpress.org/?v=1.5</generator>

	<item>
		<title>by: Jim</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-489</link>
		<pubDate>Fri, 23 Dec 2005 20:41:07 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-489</guid>
					<description>I'm new to Objective C (well, just about any C as a practical matter). This is the single most useful blog I've come across. Thanks.</description>
		<content:encoded><![CDATA[	<p>I&#8217;m new to Objective C (well, just about any C as a practical matter). This is the single most useful blog I&#8217;ve come across. Thanks.
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: Michel Fortin</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-490</link>
		<pubDate>Fri, 23 Dec 2005 22:54:11 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-490</guid>
					<description>Being pretty familiar with PHP arrays from the PHP side, you intrigued me enough for me to look at PHP's array code in the Zend engine.

It's a hash table and a linked list at the same time: each element of the table contains a pointer to next and previous elements, making them a *ordered* linked list. There is nothing polymorphic in there, nor would I think it could give much improvements since PHP arrays are never really accessed by index, always by key. It's more like an ordered dictionary. :-)</description>
		<content:encoded><![CDATA[	<p>Being pretty familiar with PHP arrays from the PHP side, you intrigued me enough for me to look at PHP&#8217;s array code in the Zend engine.</p>
	<p>It&#8217;s a hash table and a linked list at the same time: each element of the table contains a pointer to next and previous elements, making them a *ordered* linked list. There is nothing polymorphic in there, nor would I think it could give much improvements since PHP arrays are never really accessed by index, always by key. It&#8217;s more like an ordered dictionary. :-)
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: indyJT Weblog &raquo; In Soviet Russia you don&#8217;t second guess Apple, Apple second guesses YOU</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-491</link>
		<pubDate>Fri, 23 Dec 2005 22:56:33 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-491</guid>
					<description>[...] OU 	Filed under: General, Programing, Apple, Macintosh &amp;#8212; Jay @ 11:49 am  	 	 			From ridiculous_fish &amp;raquo; Blog Archive &amp;raquo; Array: 	&amp;#8220;Don&amp;rsquo;t second guess Apple, because Apple ha [...]</description>
		<content:encoded><![CDATA[	<p>[...] OU 	Filed under: General, Programing, Apple, Macintosh &#8212; Jay @ 11:49 am  	 	 			From ridiculous_fish &raquo; Blog Archive &raquo; Array: 	&#8220;Don&rsquo;t second guess Apple, because Apple ha [...]
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: I am here  &raquo; Blog Archive   &raquo; Around the web</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-492</link>
		<pubDate>Fri, 23 Dec 2005 23:52:48 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-492</guid>
					<description>[...]  is your blog worth?&amp;#8221; 			 		 	 		 			Around the web 	 			 					Sharing iTunes iLeech Array Shellcode 	 					 				 					 						This entry was posted 						  						on Saturday, December 24th, 200 [...]</description>
		<content:encoded><![CDATA[	<p>[...]  is your blog worth?&#8221; 			 		 	 		 			Around the web 	 			 					Sharing iTunes iLeech Array Shellcode 	 					 				 					 						This entry was posted 						  						on Saturday, December 24th, 200 [...]
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: Maarten Sneep</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-493</link>
		<pubDate>Sat, 24 Dec 2005 02:47:56 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-493</guid>
					<description>Hi, I think you left out a zero in the numbers when describing the CF results. Makes it a bit more confusing than it needs to be.

Maarten</description>
		<content:encoded><![CDATA[	<p>Hi, I think you left out a zero in the numbers when describing the CF results. Makes it a bit more confusing than it needs to be.</p>
	<p>Maarten
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: ridiculous_fish</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-494</link>
		<pubDate>Sat, 24 Dec 2005 03:04:54 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-494</guid>
					<description>Thanks, Maarten!  I've fixed that.</description>
		<content:encoded><![CDATA[	<p>Thanks, Maarten!  I&#8217;ve fixed that.
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: nicolas</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-495</link>
		<pubDate>Sat, 24 Dec 2005 06:15:56 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-495</guid>
					<description>Love your blog !
What about sorting ?
I'd love to see your cunning analysis compare NSArray sorts with objective C sort methods and C arrays with qsort().
(Unless I'm wrong, you're an apple guy), you should be funded by your group to run a weekly (?) entry here !</description>
		<content:encoded><![CDATA[	<p>Love your blog !<br />
What about sorting ?<br />
I&#8217;d love to see your cunning analysis compare NSArray sorts with objective C sort methods and C arrays with qsort().<br />
(Unless I&#8217;m wrong, you&#8217;re an apple guy), you should be funded by your group to run a weekly (?) entry here !
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: Aaron Jensen</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-496</link>
		<pubDate>Sat, 24 Dec 2005 10:01:04 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-496</guid>
					<description>Does this really matter?  I mean, in the five years I've been developing, I've never used arrays that have more than 1,000 elements.  Yes, I believe there is some software that actually has 100,000+ element data structures, but I think they are few and far between.  Are they?</description>
		<content:encoded><![CDATA[	<p>Does this really matter?  I mean, in the five years I&#8217;ve been developing, I&#8217;ve never used arrays that have more than 1,000 elements.  Yes, I believe there is some software that actually has 100,000+ element data structures, but I think they are few and far between.  Are they?
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: Zac Bedell</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-498</link>
		<pubDate>Sat, 24 Dec 2005 15:51:28 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-498</guid>
					<description>I've been working on an app that deals with 100,000+ element arrays lately, so this was a very interesting read.  Thank you!

To respond to nicolas' comment: NSArray's sorting methods appear comparable to qsort at least for between 20,000 and 40,000 objects.  I found that for my purposes (sorting arrays that are usually *mostly* sorted), implementing a category on NSMutableArray which used the standard C library's mergesort was significantly faster.    Given what I've learned of NSArray today, I think I have some more benchmarking to do.

My link on this post is to what benchmarks I've done.</description>
		<content:encoded><![CDATA[	<p>I&#8217;ve been working on an app that deals with 100,000+ element arrays lately, so this was a very interesting read.  Thank you!</p>
	<p>To respond to nicolas&#8217; comment: NSArray&#8217;s sorting methods appear comparable to qsort at least for between 20,000 and 40,000 objects.  I found that for my purposes (sorting arrays that are usually *mostly* sorted), implementing a category on NSMutableArray which used the standard C library&#8217;s mergesort was significantly faster.    Given what I&#8217;ve learned of NSArray today, I think I have some more benchmarking to do.</p>
	<p>My link on this post is to what benchmarks I&#8217;ve done.
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: Jens Alfke</title>
		<link>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-499</link>
		<pubDate>Sat, 24 Dec 2005 18:00:26 +0000</pubDate>
		<guid>http://ridiculousfish.com/blog/archives/2005/12/23/array/#comment-499</guid>
					<description>If you want to read some interesting array-implementation stuff, take a look at the excellent paper on the implementation of Lua 5.0:
http://www.tecgraf.puc-rio.br/~lhf/ftp/doc/jucs05.pdf
Lua's arrays are basically like PHPs (array plus dictionary) but they've put in some very interesting space and speed optimizations; which is important, because Lua uses arrays for &lt;i&gt;everything&lt;/i&gt;. (I recommend Lua in general; it's a very compact, elegant language.)</description>
		<content:encoded><![CDATA[	<p>If you want to read some interesting array-implementation stuff, take a look at the excellent paper on the implementation of Lua 5.0:<br />
<a href='http://www.tecgraf.puc-rio.br/~lhf/ftp/doc/jucs05.pdf' rel='nofollow'>http://www.tecgraf.puc-rio.br/~lhf/ftp/doc/jucs05.pdf</a><br />
Lua&#8217;s arrays are basically like PHPs (array plus dictionary) but they&#8217;ve put in some very interesting space and speed optimizations; which is important, because Lua uses arrays for <i>everything</i>. (I recommend Lua in general; it&#8217;s a very compact, elegant language.)
</p>
]]></content:encoded>
				</item>
</channel>
</rss>
