<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss 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" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" version="2.0">
<channel>
	<title>Comments for Richard Bolkey - Blog</title>
	
	<link>http://blog.bolkey.com</link>
	<description>Thoughts of a plain old java developer.</description>
	<lastBuildDate>Mon, 30 Nov 2009 02:52:10 -0700</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.feedburner.com/rbolkey-comments" /><feedburner:info xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" uri="rbolkey-comments" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><item>
		<title>Comment on Building a contextual recursive tree in Tapestry 5 by rbolkey</title>
		<link>http://blog.bolkey.com/2009/06/tapestry-5-recursive-tree/comment-page-1/#comment-1251</link>
		<dc:creator>rbolkey</dc:creator>
		<pubDate>Mon, 30 Nov 2009 02:52:10 +0000</pubDate>
		<guid isPermaLink="false">http://blog.bolkey.com/?p=29#comment-1251</guid>
		<description>A complete source code example has been added.</description>
		<content:encoded><![CDATA[<p>A complete source code example has been added.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a contextual recursive tree in Tapestry 5 by Kumar</title>
		<link>http://blog.bolkey.com/2009/06/tapestry-5-recursive-tree/comment-page-1/#comment-1192</link>
		<dc:creator>Kumar</dc:creator>
		<pubDate>Wed, 25 Nov 2009 13:24:26 +0000</pubDate>
		<guid isPermaLink="false">http://blog.bolkey.com/?p=29#comment-1192</guid>
		<description>Could you please help posting the complete source code...</description>
		<content:encoded><![CDATA[<p>Could you please help posting the complete source code&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a contextual recursive tree in Tapestry 5 by Simon</title>
		<link>http://blog.bolkey.com/2009/06/tapestry-5-recursive-tree/comment-page-1/#comment-1171</link>
		<dc:creator>Simon</dc:creator>
		<pubDate>Wed, 25 Nov 2009 00:01:58 +0000</pubDate>
		<guid isPermaLink="false">http://blog.bolkey.com/?p=29#comment-1171</guid>
		<description>If you could just post all your source code, it will be much more helpful.</description>
		<content:encoded><![CDATA[<p>If you could just post all your source code, it will be much more helpful.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a contextual recursive tree in Tapestry 5 by Van</title>
		<link>http://blog.bolkey.com/2009/06/tapestry-5-recursive-tree/comment-page-1/#comment-161</link>
		<dc:creator>Van</dc:creator>
		<pubDate>Thu, 17 Sep 2009 10:22:28 +0000</pubDate>
		<guid isPermaLink="false">http://blog.bolkey.com/?p=29#comment-161</guid>
		<description>Thank for your quick reply,
Now i can display simple tree recursively.
Simple tree is the following form
Root
   Node1
     Node 1.1
     Node 1.2
   Node2
For advance tree
Root
   Node1
     Node 1.1
     Node 1.2
   Node2
     Node 2.1 ( can't display)
Because I'm using only one index variable to loop. I find it hard to do recursively ( myself).
But in summary, Your solution works great. Thank for your tutorial.
( :) I still get headache to display tree correctly)</description>
		<content:encoded><![CDATA[<p>Thank for your quick reply,<br />
Now i can display simple tree recursively.<br />
Simple tree is the following form<br />
Root<br />
   Node1<br />
     Node 1.1<br />
     Node 1.2<br />
   Node2<br />
For advance tree<br />
Root<br />
   Node1<br />
     Node 1.1<br />
     Node 1.2<br />
   Node2<br />
     Node 2.1 ( can&#8217;t display)<br />
Because I&#8217;m using only one index variable to loop. I find it hard to do recursively ( myself).<br />
But in summary, Your solution works great. Thank for your tutorial.<br />
( <img src='http://blog.bolkey.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  I still get headache to display tree correctly)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a contextual recursive tree in Tapestry 5 by rbolkey</title>
		<link>http://blog.bolkey.com/2009/06/tapestry-5-recursive-tree/comment-page-1/#comment-156</link>
		<dc:creator>rbolkey</dc:creator>
		<pubDate>Wed, 16 Sep 2009 15:14:05 +0000</pubDate>
		<guid isPermaLink="false">http://blog.bolkey.com/?p=29#comment-156</guid>
		<description>"element in "element = element.getChildren().get(childPosition)" was a mistake.  That should be a reference to the "node" parameter of the component.  Originally, I was using "element", but thought "node" was a clearer term for the post and missed that change.

And yeah, that's exactly what the NodeDelegate looks like.

I'm using "Node" terminology for both the data object and the component, hopefully that's not confusing.</description>
		<content:encoded><![CDATA[<p>&#8220;element in &#8220;element = element.getChildren().get(childPosition)&#8221; was a mistake.  That should be a reference to the &#8220;node&#8221; parameter of the component.  Originally, I was using &#8220;element&#8221;, but thought &#8220;node&#8221; was a clearer term for the post and missed that change.</p>
<p>And yeah, that&#8217;s exactly what the NodeDelegate looks like.</p>
<p>I&#8217;m using &#8220;Node&#8221; terminology for both the data object and the component, hopefully that&#8217;s not confusing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a contextual recursive tree in Tapestry 5 by Van</title>
		<link>http://blog.bolkey.com/2009/06/tapestry-5-recursive-tree/comment-page-1/#comment-152</link>
		<dc:creator>Van</dc:creator>
		<pubDate>Wed, 16 Sep 2009 08:16:22 +0000</pubDate>
		<guid isPermaLink="false">http://blog.bolkey.com/?p=29#comment-152</guid>
		<description>Hi,
I've followed your guide but I don't understand these following things
+ element = element.getChildren().get(childPosition);
what is the element?
+ How to remove caching? Is NodeDelegate like this
public class NodeDelegate {
    @Parameter(required = true,cache=false)
    private Object to;

    Object beginRender() {
        return to;
    }
}
+ Can you expose your source code? I'd appreciate your help</description>
		<content:encoded><![CDATA[<p>Hi,<br />
I&#8217;ve followed your guide but I don&#8217;t understand these following things<br />
+ element = element.getChildren().get(childPosition);<br />
what is the element?<br />
+ How to remove caching? Is NodeDelegate like this<br />
public class NodeDelegate {<br />
    @Parameter(required = true,cache=false)<br />
    private Object to;</p>
<p>    Object beginRender() {<br />
        return to;<br />
    }<br />
}<br />
+ Can you expose your source code? I&#8217;d appreciate your help</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Trouble with Proxies: Hibernate or DataNucleus by Chrisco</title>
		<link>http://blog.bolkey.com/2009/05/hibernate-datanucleus-r1/comment-page-1/#comment-72</link>
		<dc:creator>Chrisco</dc:creator>
		<pubDate>Tue, 04 Aug 2009 06:49:08 +0000</pubDate>
		<guid isPermaLink="false">http://blog.bolkey.com/?p=21#comment-72</guid>
		<description>Amen brother!

I started off using Hibernate a few years back but I tried to find something better when I discovered the awkwardness of Hibernate due to its "proxy compromise" to avoid byte code enhancement. I stumbled across JPOX (now DataNucleus) and haven't looked back. Now I can model and code how I want, exactly how I want - as a programmer that's pretty important to me ;)

As far as the byte code enhancement goes - the latest ASM enhancer is so efficient now that it takes less than a second to enhance the classes in a mega enterprise application that we work on every day - to be honest I don't even notice it - it's a tiny portion of the code, compile, deploy cycle.</description>
		<content:encoded><![CDATA[<p>Amen brother!</p>
<p>I started off using Hibernate a few years back but I tried to find something better when I discovered the awkwardness of Hibernate due to its &#8220;proxy compromise&#8221; to avoid byte code enhancement. I stumbled across JPOX (now DataNucleus) and haven&#8217;t looked back. Now I can model and code how I want, exactly how I want &#8211; as a programmer that&#8217;s pretty important to me <img src='http://blog.bolkey.com/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
<p>As far as the byte code enhancement goes &#8211; the latest ASM enhancer is so efficient now that it takes less than a second to enhance the classes in a mega enterprise application that we work on every day &#8211; to be honest I don&#8217;t even notice it &#8211; it&#8217;s a tiny portion of the code, compile, deploy cycle.</p>
]]></content:encoded>
	</item>
</channel>
</rss><!-- Dynamic page generated in 1.479 seconds. --><!-- Cached page generated by WP-Super-Cache on 2010-02-03 14:09:33 -->
