similar to: self-referencing has_many

Has anyone extended Rails''s acts_as_tree to use the Modified Preorder Traversal algorithm? This is a really clever trick for optimizing access to trees stored in databases, as described lucidly in this article: http://www.sitepoint.com/article/hierarchical-data-database/2 It adds two integer fields, a "left counter" and "right counter", to each row. By

I have a model using acts_as_tree which is working fine. Being new to Ruby I''m don''t know what enumerator is best to use for traversing a tree by depth. I can write one, but before I do I wanted to know if there is there an enumerator for traversing trees available that the community recommends? Thank you, Jose -- Posted via http://www.ruby-forum.com/.

I am creating forum application which needs usage of acts_as_list or acts_as_tree or acts_as_nested_set. I am unable to decide among these. please could some one recommend from their experience? -- Posted via http://www.ruby-forum.com/.

Hello, I have a tree structure that needs to be converted into a nested set. A great deal of work has already been done on the tree items, so maintaining the integrity of the id''s is mandatory. However I need the ability to access entire branches of the tree, which is what Nested set does. Does anyone have any suggestions on how to efficiently transfer the tree to the nested set and

Hi, I''m working with acts_as_tree to print an unordered list of items: Root -- Child ---- Child I''ve got this working, however I''d like to know if there is a more elegant fashion that I''m unaware of: #Takes a parent category and recursivley returns all children def find_all_subcategories(category) if category.children.size > 0

Dear List, Given that I am developing a rails 2.3.5 site, When it comes to storing threaded comments in a blog or forum, Then which plugin/gem should be considered "State of the Art"? I''m starting with these URLs: http://github.com/rails/acts_as_tree http://github.com/rails/acts_as_nested_set http://github.com/collectiveidea/awesome_nested_set

I''m interested in working on a message board application that uses ruby on rails. I''d like to see something end up similar to vBullieten, but with more of a 37signals type of less-is-more philosophy... mostly meaning less need for preferences and settings and configurations. I''ve checked rubyforge, and it looks like there are various forum apps uploaded there, some

I moved from acts_as_tree to acts_as_nested_set because I need the all_children method. I''ve seen an alternative way to add this method to acts_as_tree here: http://www.chuckvose.com/articles/2006/05/24/recursive-children But I''d prefer to use the more efficient way of acts_as_nested_set (and not to have to revert to my old code). Anyway, here''s my issue: if I

hi, I''ve a normal Category model implemented with acts_as_tree (name, parent_id) that has_many :products (name, category_id). What I''m asking for is a method to fetch every product that belongs fall into a particular category and its children, eg: if I''m asking for a root node (/category/show/1) I need to display every product that have category_id = 1 AND every product

I have been using browsercam.com for CSS testing, but it is rather expensive. Recently, I discovered others using funadable.org to purchase a yearly membership as a group. A year long membership at browsercam.com costs $480.00. This gives us 25 user accounts. I am proposing that 25 people throw in $19.20 for their 1/25th share of the membership cost. Once I have raised $479.40 I will

Hey guys, This is the final list of the new maintainers of each plugin. We need two more things to do: First please the owners of the repos add the rest of the maintainers. Second I will add a note on each rails/plugin mentioning this repos updates. So from now on, if someone else is interested in helping/contributing please send a message to the appropriate repo owner. verification

Hello, I am in the process of trying to date hierarchical data in a MySQL database and convert it into a treeview view JS scripting. As a beginner to ROR there are still many unknown things to me, and handling this sort of data is one of them. My question is this: Is there any built in functionality for handling hierarchical data (via a MySQL DB) in Rails/Ruby? If there is can someone please

I am working on an Rails application that uses a pretty complex category structure through out the site. I have defined a table to house all the info and a FK to reference parents within the table CREATE TABLE categories ( id int(11) NOT NULL auto_increment, name varchar(50) NOT NULL, parent_id int(11) default NULL, constraint fk_category_id foreign key (category_id) references

I''m currently using acts_as_tree to display threaded Comments on my forums-like site. It''s waaay too slow to display a page with 1,000 comments, as it''s issuing a TON of selects. I''m pretty sure I want to convert to the nested set model, using acts_as_nested_set or acts_as_threaded. This should give me the performance I''m looking for. The problem,

I thought I had a handle on this one but it''s causing me grief and I''m hoping somebody can set me straight. I have an object AlertTemplate which will contain a fill in the blank style hunk of web content. I then have an object, Alert, which will have a relationship to one of those AlertTemplate objects, plus some data. So, in human speak, I''d think that an Alert

I''m using acts_as_tree to maintain a hierarchy of categories (each top-level category can contain multiple categories and each sub-category can contain multiple sub-categories, etc.). I want to be able to find all parents of a particular category. I realize that I can use @category.parent or even @category.parent.parent to move up in the hierarchy, but I need this to happen dynamically

I need an ordered (sortable tree) and I just was thinking if somehting like this is possible: class Item< ActiveRecord::Base acts_as_tree :order => "position" acts_as_list :scope => ''parent_id = #{self.id}'' end For my understanding mixing of two acts_as should be p?ssible, at least in this case, right? Unfortunatly the :scope is not working, I am not

Hi, I have a model that uses acts_as_tree option to manage a tree structure in the database. Is it possible to fetch the entire tree with constant number of database calls and cache the tree in memory? Thanks! Bob -- Posted via http://www.ruby-forum.com/.

Is there a way to use has_many and have it operate like such? select * from pages where site_id = #{id} or site_id is null I know there''s finder_sql, but then I''ll lose the find_in_collection goodness. Thanks, Joe -- Posted via http://www.ruby-forum.com/. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the

There''s nothing like pushing a new major update in order to find bugs in the code when its exposed to a couple of hundred working applications. Thankfully the fixes were almost as swift as the reports. In any case, you''ll _definitely_ want to upgrade to 0.12.1 right away. There''s a good handful of fixes for both Action Pack and Active Record (mostly concerning the