BuffaloFeeds » Comments for Josh the Outspoken

Comments for Josh the Outspoken (10 unread)

Comment on Refcounting immutable cyclic graphs by Josh

Posted: January 25th, 2012, 9:15pm MST by Josh

When a node is first created it is mutable (edges can be created or changed), but it does not own refs on nodes it points to, so the client of my library is responsible for keeping nodes alive through this first stage. When they client is ready they can “finalize” a set of nodes which does the SCC search and guarantees, from then on, that all reachable nodes are always kept alive.
Comment on Refcounting immutable cyclic graphs by Brian Slesinsky

Posted: January 25th, 2012, 8:33pm MST by Brian Slesinsky

If each node is immutable once initialized, how do you build a cycle to begin with? Do you build nodes in batches?
Comment on Refcounting immutable cyclic graphs by Josh

Posted: January 25th, 2012, 9:28am MST by Josh

Because my objects are immutable once initialized, the graph is immutable also and I can find SCC at initialization time, not when a refcount is decremented to 0. I do have to search, but I can do the search only once per graph.

This scheme wouldn’t work in most situations where GC or refcounting is used, but I have the luxury of an immutable object graph.
Comment on Refcounting immutable cyclic graphs by Dave

Posted: January 25th, 2012, 8:50am MST by Dave

How do you avoid the expense of frequently running the O(V+E) SCC-finding algorithm whenever an object’s reference count is decremented to 0? I can imagine coloring each object you visit as you go along in a normal refcounting approach, then when you detect an object you’ve already visited (b/c it’s been colored already) switching to the SCC approach. But this algorithm will probably be pretty abusive to the cache for large numbers of objects.

Or is it that in upb you (the programmer) naturally know which objects are SCCs because of some nice structural property of the code, so that you don’t need to “discover” where they are with some sort of search? Perhaps that’s what you mean by “if the defs are immutable”…
Comment on Wanted: a mailing list reader website by Pierre Riteau

Posted: November 16th, 2011, 3:12am MST by Pierre Riteau

I have also been looking for a while for such a gem â€¦ Did you discover any new project since you wrote this post?
Comment on Addicted to hardware: new toy on the way by Alexandre Abreu

Posted: September 5th, 2011, 1:00pm MDT by Alexandre Abreu

have you seen this a bit more expensive but a bit better gadget:

[trimslice.com]

w/ a NVIDIA Tegra2 as CPU …
Comment on Addicted to hardware: new toy on the way by Josh

Posted: August 26th, 2011, 6:47pm MDT by Josh

I like it! Unfortunately it doesn’t work too well as a headless always-on box for two reasons:

1. it loses its wireless connection sometimes and doesn’t automatically re-establish it for some reason. If I log in to it physically and click the wireless network again everything is fine, but that’s no good if you were planning to use it headless.

2. it doesn’t want to boot up unless it’s connected to a display. so you can’t boot it headless.

For these two reasons I don’t use it as much as I was expecting. But when I do use it it does just what I was hoping for.
Comment on Addicted to hardware: new toy on the way by Alexandre Abreu

Posted: August 24th, 2011, 1:37pm MDT by Alexandre Abreu

Any feedback on the EFIKA MX Smarttop?
Comment on Torn over the C++ question by Rodrigo Moraes

Posted: July 28th, 2011, 5:44am MDT by Rodrigo Moraes

If you’d be starting today, do you think it could benefit from using go? Also, could you please drop some general considerations about golang?
Comment on Books About Parsing by Rodrigo Moraes

Posted: July 20th, 2011, 7:50pm MDT by Rodrigo Moraes

jb: the PDF is from the first edition, from 1990. The second edition listed aboveis from 2007 and is not available as PDF.