From tory.long at gmail.com  Thu Mar  6 14:34:19 2008
From: tory.long at gmail.com (Tory Long)
Date: Thu, 6 Mar 2008 14:34:19 -0500
Subject: [Betternestedset-talk] Replicating a nested set structure to
	another model
Message-ID: <bf69b2d90803061134g2e255f85wd769e602061e59d5@mail.gmail.com>

Hi - first off BNS is awesome.  We are using it extensively in our project
and are very happy.

What I am trying to accomplish is replicating a nested set structure from
one model to another.  Currently, to do this, I am rebuilding the tree
structure entirely, as I am not able to simply copy nodes and their identity
(parent_id, rgt, lft) based off the "template" nested set in the original
model.   This is very expensive code-wise, and the alternative (simply
copying the lft/rgt/parent_id structure) would allow for what I need.

BetterNestedSet enforces "move_to_child_of" and that seems to be the
prohibiting factor from simply creating the new structure with
parent_id/lft/rgt easily replicated through replicating or populating those
fields to a similar structure as the original.

Does anyone have a more graceful solution for this?  While functional,
rebuilding this structure with node-by-node traversal is not ideal.

Thanks,
Tory
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080306/714ded68/attachment.html 

From giorgian at gmail.com  Tue Mar 18 12:50:58 2008
From: giorgian at gmail.com (Pietro Giorgianni)
Date: Tue, 18 Mar 2008 17:50:58 +0100
Subject: [Betternestedset-talk] when the table doesn't exist
Message-ID: <871w68asct.fsf@giorgian.widge.org>

A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 188 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080318/cadfeb2b/attachment.bin 

From hukl at medienhaus.udk-berlin.de  Wed Mar 19 15:16:47 2008
From: hukl at medienhaus.udk-berlin.de (John-Paul Bader)
Date: Wed, 19 Mar 2008 20:16:47 +0100
Subject: [Betternestedset-talk] Sortable Sets
Message-ID: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>

Hey there,

I just subscribed so i hope this question isn't redundant.

I'm trying to implement a sortable nested set.

I've already got an application with better_nested_set in place. I  
also got a nice nested <ul> rendering for my tree. No I'd be able to  
drag an drop / sort elements across the set.

I found this Wiki entry which says that it wouldn't be a good idea in  
general to use sortable.create with :tree => true

http://whynotwiki.com/Rails_/_Sortable_trees

On the same page there is a link to the rubyonrails wiki stating that  
there is a fix expecially for better_nested_set. http://dev.rubyonrails.org/ticket/7807

My question would be what your experiences are. Is there a good way to  
implement a sortable / draggable better_nested_set ? If not do you  
have any suggestions, thoughs on this ?

Thanks and kind regards,

John (Berlin / Germany)

From jnicoll at gnexp.com  Wed Mar 19 15:45:29 2008
From: jnicoll at gnexp.com (Jeremy Nicoll)
Date: Wed, 19 Mar 2008 13:45:29 -0600
Subject: [Betternestedset-talk] Sortable Sets
In-Reply-To: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>
References: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>
Message-ID: <47E16D59.8080404@gnexp.com>

Hello John-Paul,

    I've done this in a recent project.  Basically the way I do it is 
check to see what order the a selected item in a list is in, and then 
move that item before/after a child node in the target parent based off 
this information.  It's a bit complicated, but it's doable. I monkey 
patched the module SymetrieCom::Acts::NestedSet to include the following 
method to help me with this scenario:

------------------------------------------------------------------------
        def move_to_parent_location(parent, location)
          parent = nil if parent == 0
          parent = parent === self.class ? parent : 
self.class.find(parent) if parent
          children = parent ? parent.children : self.class.roots
         
          if children.length > 0
            ord = location.to_i
            if ord > children.length
              self.move_to(children.last, :right)
            elsif children[ord] != self
              self.move_to(children[ord], :left)
            end
          elsif parent
            self.move_to(parent, :child)
          end
        end
------------------------------------------------------------------------



*Jeremy Nicoll*
www.gnexp.com <http://www.gnexp.com>
(801) 783-3831


John-Paul Bader wrote:
> Hey there,
>
> I just subscribed so i hope this question isn't redundant.
>
> I'm trying to implement a sortable nested set.
>
> I've already got an application with better_nested_set in place. I  
> also got a nice nested <ul> rendering for my tree. No I'd be able to  
> drag an drop / sort elements across the set.
>
> I found this Wiki entry which says that it wouldn't be a good idea in  
> general to use sortable.create with :tree => true
>
> http://whynotwiki.com/Rails_/_Sortable_trees
>
> On the same page there is a link to the rubyonrails wiki stating that  
> there is a fix expecially for better_nested_set. http://dev.rubyonrails.org/ticket/7807
>
> My question would be what your experiences are. Is there a good way to  
> implement a sortable / draggable better_nested_set ? If not do you  
> have any suggestions, thoughs on this ?
>
> Thanks and kind regards,
>
> John (Berlin / Germany)
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
>   
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/cf89fb10/attachment-0001.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: logo_sig.jpg
Type: image/jpeg
Size: 2312 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/cf89fb10/attachment-0001.jpg 

From hukl at medienhaus.udk-berlin.de  Wed Mar 19 17:50:25 2008
From: hukl at medienhaus.udk-berlin.de (John-Paul Bader)
Date: Wed, 19 Mar 2008 22:50:25 +0100
Subject: [Betternestedset-talk] Sortable Sets
In-Reply-To: <47E16D59.8080404@gnexp.com>
References: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>
	<47E16D59.8080404@gnexp.com>
Message-ID: <BD7CFD8B-BA1A-4B47-B844-A7E29E8664F3@medienhaus.udk-berlin.de>

After lots of reading I think the best way is to use simple draggables  
and droppables. After the drop i'll move the dragged node to the  
dropped one with move_to_child_of and after that i'll redraw the tree.

Any thoughts on that ?

Kind regards, John

On 19.03.2008, at 20:45, Jeremy Nicoll wrote:

> Hello John-Paul,
>
>     I've done this in a recent project.  Basically the way I do it  
> is check to see what order the a selected item in a list is in, and  
> then move that item before/after a child node in the target parent  
> based off this information.  It's a bit complicated, but it's  
> doable. I monkey patched the module SymetrieCom::Acts::NestedSet to  
> include the following method to help me with this scenario:
>
>         def move_to_parent_location(parent, location)
>           parent = nil if parent == 0
>           parent = parent === self.class ? parent :  
> self.class.find(parent) if parent
>           children = parent ? parent.children : self.class.roots
>
>           if children.length > 0
>             ord = location.to_i
>             if ord > children.length
>               self.move_to(children.last, :right)
>             elsif children[ord] != self
>               self.move_to(children[ord], :left)
>             end
>           elsif parent
>             self.move_to(parent, :child)
>           end
>         end
>
>
> <logo_sig.jpg>
> Jeremy Nicoll
> www.gnexp.com
> (801) 783-3831
>
>
> John-Paul Bader wrote:
>>
>> Hey there,
>>
>> I just subscribed so i hope this question isn't redundant.
>>
>> I'm trying to implement a sortable nested set.
>>
>> I've already got an application with better_nested_set in place. I
>> also got a nice nested <ul> rendering for my tree. No I'd be able to
>> drag an drop / sort elements across the set.
>>
>> I found this Wiki entry which says that it wouldn't be a good idea in
>> general to use sortable.create with :tree => true
>>
>> http://whynotwiki.com/Rails_/_Sortable_trees
>>
>> On the same page there is a link to the rubyonrails wiki stating that
>> there is a fix expecially for better_nested_set. http://dev.rubyonrails.org/ticket/7807
>>
>> My question would be what your experiences are. Is there a good way  
>> to
>> implement a sortable / draggable better_nested_set ? If not do you
>> have any suggestions, thoughs on this ?
>>
>> Thanks and kind regards,
>>
>> John (Berlin / Germany)
>> _______________________________________________
>> Betternestedset-talk mailing list
>> Betternestedset-talk at rubyforge.org
>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>
>>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/3b2a0fa7/attachment.html 

From jnicoll at gnexp.com  Wed Mar 19 18:04:09 2008
From: jnicoll at gnexp.com (Jeremy Nicoll)
Date: Wed, 19 Mar 2008 16:04:09 -0600
Subject: [Betternestedset-talk] Sortable Sets
In-Reply-To: <BD7CFD8B-BA1A-4B47-B844-A7E29E8664F3@medienhaus.udk-berlin.de>
References: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>	<47E16D59.8080404@gnexp.com>
	<BD7CFD8B-BA1A-4B47-B844-A7E29E8664F3@medienhaus.udk-berlin.de>
Message-ID: <47E18DD9.2070906@gnexp.com>

    No thoughts at the moment, but if you run into any problems I'll see 
if I can help you.  FYI, I have not used the two components that you are 
using together - mostly I've just used better_nested_set.  Ordering 
things in a list is pretty easy and so I've always just done my own code 
because I've felt the other helpers just get in my way.


*Jeremy Nicoll*
www.gnexp.com <http://www.gnexp.com>
(801) 783-3831


John-Paul Bader wrote:
> After lots of reading I think the best way is to use simple draggables 
> and droppables. After the drop i'll move the dragged node to the 
> dropped one with move_to_child_of and after that i'll redraw the tree.
>
> Any thoughts on that ? 
>
> Kind regards, John
>
> On 19.03.2008, at 20:45, Jeremy Nicoll wrote:
>> Hello John-Paul,
>>
>>     I've done this in a recent project.  Basically the way I do it is 
>> check to see what order the a selected item in a list is in, and then 
>> move that item before/after a child node in the target parent based 
>> off this information.  It's a bit complicated, but it's doable. I 
>> monkey patched the module SymetrieCom::Acts::NestedSet to include the 
>> following method to help me with this scenario:
>>
>> ------------------------------------------------------------------------
>>         def move_to_parent_location(parent, location)
>>           parent = nil if parent == 0
>>           parent = parent === self.class ? parent : 
>> self.class.find(parent) if parent
>>           children = parent ? parent.children : self.class.roots
>>          
>>           if children.length > 0
>>             ord = location.to_i
>>             if ord > children.length
>>               self.move_to(children.last, :right)
>>             elsif children[ord] != self
>>               self.move_to(children[ord], :left)
>>             end
>>           elsif parent
>>             self.move_to(parent, :child)
>>           end
>>         end
>> ------------------------------------------------------------------------
>>
>>
>> <logo_sig.jpg>
>> *Jeremy Nicoll*
>> www.gnexp.com <http://www.gnexp.com>
>> (801) 783-3831
>>
>>
>> John-Paul Bader wrote:
>>> Hey there,
>>>
>>> I just subscribed so i hope this question isn't redundant.
>>>
>>> I'm trying to implement a sortable nested set.
>>>
>>> I've already got an application with better_nested_set in place. I  
>>> also got a nice nested <ul> rendering for my tree. No I'd be able to  
>>> drag an drop / sort elements across the set.
>>>
>>> I found this Wiki entry which says that it wouldn't be a good idea in  
>>> general to use sortable.create with :tree => true
>>>
>>> http://whynotwiki.com/Rails_/_Sortable_trees
>>>
>>> On the same page there is a link to the rubyonrails wiki stating that  
>>> there is a fix expecially for better_nested_set. http://dev.rubyonrails.org/ticket/7807
>>>
>>> My question would be what your experiences are. Is there a good way to  
>>> implement a sortable / draggable better_nested_set ? If not do you  
>>> have any suggestions, thoughs on this ?
>>>
>>> Thanks and kind regards,
>>>
>>> John (Berlin / Germany)
>>> _______________________________________________
>>> Betternestedset-talk mailing list
>>> Betternestedset-talk at rubyforge.org
>>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>>
>>>   
>> _______________________________________________
>> Betternestedset-talk mailing list
>> Betternestedset-talk at rubyforge.org 
>> <mailto:Betternestedset-talk at rubyforge.org>
>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
> ------------------------------------------------------------------------
>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>   
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/dd180f07/attachment.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: logo_sig.jpg
Type: image/jpeg
Size: 2312 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/dd180f07/attachment.jpg 

From hukl at medienhaus.udk-berlin.de  Wed Mar 19 18:12:38 2008
From: hukl at medienhaus.udk-berlin.de (John-Paul Bader)
Date: Wed, 19 Mar 2008 23:12:38 +0100
Subject: [Betternestedset-talk] Sortable Sets
In-Reply-To: <47E18DD9.2070906@gnexp.com>
References: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>	<47E16D59.8080404@gnexp.com>
	<BD7CFD8B-BA1A-4B47-B844-A7E29E8664F3@medienhaus.udk-berlin.de>
	<47E18DD9.2070906@gnexp.com>
Message-ID: <2EEBAC5B-80AD-490B-8B04-698BE130C9B7@medienhaus.udk-berlin.de>

Well I think actually these are two seperate functions. One function  
is to put nodes on different positions in the tree and the other one  
would be ordering the nodes within a parent node. Tomorrow at work  
I'll try that approach and let you know how it went.

Kind regards, John

On 19.03.2008, at 23:04, Jeremy Nicoll wrote:

>     No thoughts at the moment, but if you run into any problems I'll  
> see if I can help you.  FYI, I have not used the two components that  
> you are using together - mostly I've just used better_nested_set.   
> Ordering things in a list is pretty easy and so I've always just  
> done my own code because I've felt the other helpers just get in my  
> way.
>
> <logo_sig.jpg>
> Jeremy Nicoll
> www.gnexp.com
> (801) 783-3831
>
>
> John-Paul Bader wrote:
>>
>> After lots of reading I think the best way is to use simple  
>> draggables and droppables. After the drop i'll move the dragged  
>> node to the dropped one with move_to_child_of and after that i'll  
>> redraw the tree.
>>
>> Any thoughts on that ?
>>
>> Kind regards, John
>>
>> On 19.03.2008, at 20:45, Jeremy Nicoll wrote:
>>> Hello John-Paul,
>>>
>>>     I've done this in a recent project.  Basically the way I do it  
>>> is check to see what order the a selected item in a list is in,  
>>> and then move that item before/after a child node in the target  
>>> parent based off this information.  It's a bit complicated, but  
>>> it's doable. I monkey patched the module  
>>> SymetrieCom::Acts::NestedSet to include the following method to  
>>> help me with this scenario:
>>>
>>>         def move_to_parent_location(parent, location)
>>>           parent = nil if parent == 0
>>>           parent = parent === self.class ? parent :  
>>> self.class.find(parent) if parent
>>>           children = parent ? parent.children : self.class.roots
>>>
>>>           if children.length > 0
>>>             ord = location.to_i
>>>             if ord > children.length
>>>               self.move_to(children.last, :right)
>>>             elsif children[ord] != self
>>>               self.move_to(children[ord], :left)
>>>             end
>>>           elsif parent
>>>             self.move_to(parent, :child)
>>>           end
>>>         end
>>>
>>>
>>> <logo_sig.jpg>
>>> Jeremy Nicoll
>>> www.gnexp.com
>>> (801) 783-3831
>>>
>>>
>>> John-Paul Bader wrote:
>>>>
>>>> Hey there,
>>>>
>>>> I just subscribed so i hope this question isn't redundant.
>>>>
>>>> I'm trying to implement a sortable nested set.
>>>>
>>>> I've already got an application with better_nested_set in place. I
>>>> also got a nice nested <ul> rendering for my tree. No I'd be able  
>>>> to
>>>> drag an drop / sort elements across the set.
>>>>
>>>> I found this Wiki entry which says that it wouldn't be a good  
>>>> idea in
>>>> general to use sortable.create with :tree => true
>>>>
>>>> http://whynotwiki.com/Rails_/_Sortable_trees
>>>>
>>>> On the same page there is a link to the rubyonrails wiki stating  
>>>> that
>>>> there is a fix expecially for better_nested_set. http://dev.rubyonrails.org/ticket/7807
>>>>
>>>> My question would be what your experiences are. Is there a good  
>>>> way to
>>>> implement a sortable / draggable better_nested_set ? If not do you
>>>> have any suggestions, thoughs on this ?
>>>>
>>>> Thanks and kind regards,
>>>>
>>>> John (Berlin / Germany)
>>>> _______________________________________________
>>>> Betternestedset-talk mailing list
>>>> Betternestedset-talk at rubyforge.org
>>>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>>>
>>>>
>>> _______________________________________________
>>> Betternestedset-talk mailing list
>>> Betternestedset-talk at rubyforge.org
>>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>
>>
>> _______________________________________________
>> Betternestedset-talk mailing list
>> Betternestedset-talk at rubyforge.org
>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/0cc1fcf2/attachment-0001.html 

From jnicoll at gnexp.com  Wed Mar 19 19:23:27 2008
From: jnicoll at gnexp.com (Jeremy Nicoll)
Date: Wed, 19 Mar 2008 17:23:27 -0600
Subject: [Betternestedset-talk] Sortable Sets
In-Reply-To: <2EEBAC5B-80AD-490B-8B04-698BE130C9B7@medienhaus.udk-berlin.de>
References: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>	<47E16D59.8080404@gnexp.com>	<BD7CFD8B-BA1A-4B47-B844-A7E29E8664F3@medienhaus.udk-berlin.de>	<47E18DD9.2070906@gnexp.com>
	<2EEBAC5B-80AD-490B-8B04-698BE130C9B7@medienhaus.udk-berlin.de>
Message-ID: <47E1A06F.4090300@gnexp.com>

Oh, I think I know what you are saying now.  Actually, it's a bit more 
hairy than that because with nested sets, the order is determined by the 
"lft" column. You cannot change this column directly, as ANS (and as 
such, BNS) uses this to keep track of where everything belongs. If you 
don't care about the ordering of the children when retrieved by the BNS 
methods then you might be able to do the method that you are thinking.  
Something to consider.


*Jeremy Nicoll*
www.gnexp.com <http://www.gnexp.com>
(801) 783-3831


John-Paul Bader wrote:
> Well I think actually these are two seperate functions. One function 
> is to put nodes on different positions in the tree and the other one 
> would be ordering the nodes within a parent node. Tomorrow at work 
> I'll try that approach and let you know how it went.
>
> Kind regards, John
>
> On 19.03.2008, at 23:04, Jeremy Nicoll wrote:
>>     No thoughts at the moment, but if you run into any problems I'll 
>> see if I can help you.  FYI, I have not used the two components that 
>> you are using together - mostly I've just used better_nested_set.  
>> Ordering things in a list is pretty easy and so I've always just done 
>> my own code because I've felt the other helpers just get in my way.
>>
>> <logo_sig.jpg>
>> *Jeremy Nicoll*
>> www.gnexp.com <http://www.gnexp.com>
>> (801) 783-3831
>>
>>
>> John-Paul Bader wrote:
>>> After lots of reading I think the best way is to use simple 
>>> draggables and droppables. After the drop i'll move the dragged node 
>>> to the dropped one with move_to_child_of and after that i'll redraw 
>>> the tree.
>>>
>>> Any thoughts on that ? 
>>>
>>> Kind regards, John
>>>
>>> On 19.03.2008, at 20:45, Jeremy Nicoll wrote:
>>>> Hello John-Paul,
>>>>
>>>>     I've done this in a recent project.  Basically the way I do it 
>>>> is check to see what order the a selected item in a list is in, and 
>>>> then move that item before/after a child node in the target parent 
>>>> based off this information.  It's a bit complicated, but it's 
>>>> doable. I monkey patched the module SymetrieCom::Acts::NestedSet to 
>>>> include the following method to help me with this scenario:
>>>>
>>>> ------------------------------------------------------------------------
>>>>         def move_to_parent_location(parent, location)
>>>>           parent = nil if parent == 0
>>>>           parent = parent === self.class ? parent : 
>>>> self.class.find(parent) if parent
>>>>           children = parent ? parent.children : self.class.roots
>>>>          
>>>>           if children.length > 0
>>>>             ord = location.to_i
>>>>             if ord > children.length
>>>>               self.move_to(children.last, :right)
>>>>             elsif children[ord] != self
>>>>               self.move_to(children[ord], :left)
>>>>             end
>>>>           elsif parent
>>>>             self.move_to(parent, :child)
>>>>           end
>>>>         end
>>>> ------------------------------------------------------------------------
>>>>
>>>>
>>>> <logo_sig.jpg>
>>>> *Jeremy Nicoll*
>>>> www.gnexp.com <http://www.gnexp.com>
>>>> (801) 783-3831
>>>>
>>>>
>>>> John-Paul Bader wrote:
>>>>> Hey there,
>>>>>
>>>>> I just subscribed so i hope this question isn't redundant.
>>>>>
>>>>> I'm trying to implement a sortable nested set.
>>>>>
>>>>> I've already got an application with better_nested_set in place. I  
>>>>> also got a nice nested <ul> rendering for my tree. No I'd be able to  
>>>>> drag an drop / sort elements across the set.
>>>>>
>>>>> I found this Wiki entry which says that it wouldn't be a good idea in  
>>>>> general to use sortable.create with :tree => true
>>>>>
>>>>> http://whynotwiki.com/Rails_/_Sortable_trees
>>>>>
>>>>> On the same page there is a link to the rubyonrails wiki stating that  
>>>>> there is a fix expecially for better_nested_set. http://dev.rubyonrails.org/ticket/7807
>>>>>
>>>>> My question would be what your experiences are. Is there a good way to  
>>>>> implement a sortable / draggable better_nested_set ? If not do you  
>>>>> have any suggestions, thoughs on this ?
>>>>>
>>>>> Thanks and kind regards,
>>>>>
>>>>> John (Berlin / Germany)
>>>>> _______________________________________________
>>>>> Betternestedset-talk mailing list
>>>>> Betternestedset-talk at rubyforge.org
>>>>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>>>>
>>>>>   
>>>> _______________________________________________
>>>> Betternestedset-talk mailing list
>>>> Betternestedset-talk at rubyforge.org 
>>>> <mailto:Betternestedset-talk at rubyforge.org>
>>>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>>
>>> ------------------------------------------------------------------------
>>>
>>> _______________________________________________
>>> Betternestedset-talk mailing list
>>> Betternestedset-talk at rubyforge.org
>>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>>   
>> _______________________________________________
>> Betternestedset-talk mailing list
>> Betternestedset-talk at rubyforge.org 
>> <mailto:Betternestedset-talk at rubyforge.org>
>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
> ------------------------------------------------------------------------
>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>   
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/ca00a0dc/attachment.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: logo_sig.jpg
Type: image/jpeg
Size: 2312 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080319/ca00a0dc/attachment.jpg 

From dontfall at gmail.com  Wed Mar 19 20:44:09 2008
From: dontfall at gmail.com (Krishna Dole)
Date: Wed, 19 Mar 2008 17:44:09 -0700
Subject: [Betternestedset-talk] Sortable Sets
In-Reply-To: <47E1A06F.4090300@gnexp.com>
References: <9B3FAD14-7316-43A6-A318-1B45B250CFD8@medienhaus.udk-berlin.de>
	<47E16D59.8080404@gnexp.com>
	<BD7CFD8B-BA1A-4B47-B844-A7E29E8664F3@medienhaus.udk-berlin.de>
	<47E18DD9.2070906@gnexp.com>
	<2EEBAC5B-80AD-490B-8B04-698BE130C9B7@medienhaus.udk-berlin.de>
	<47E1A06F.4090300@gnexp.com>
Message-ID: <8d64b97d0803191744m2c96231djd399f53a0be85349@mail.gmail.com>

Just in case you hadn't seen them, BNS has all the ordering methods of
ActsAsList, and a method for swapping 2 nodes in a single operation.
This should be everything you need for sorting, correct?

Krishna

On Wed, Mar 19, 2008 at 4:23 PM, Jeremy Nicoll <jnicoll at gnexp.com> wrote:
>
>  Oh, I think I know what you are saying now.  Actually, it's a bit more
> hairy than that because with nested sets, the order is determined by the
> "lft" column. You cannot change this column directly, as ANS (and as such,
> BNS) uses this to keep track of where everything belongs. If you don't care
> about the ordering of the children when retrieved by the BNS methods then
> you might be able to do the method that you are thinking.  Something to
> consider.
>
>
>
>
>
>
>  Jeremy Nicoll
>  www.gnexp.com
>  (801) 783-3831
>
>  John-Paul Bader wrote:
>
> Well I think actually these are two seperate functions. One function is to
> put nodes on different positions in the tree and the other one would be
> ordering the nodes within a parent node. Tomorrow at work I'll try that
> approach and let you know how it went.
>
>
> Kind regards, John
>
>
>
> On 19.03.2008, at 23:04, Jeremy Nicoll wrote:
>
>
>      No thoughts at the moment, but if you run into any problems I'll see if
> I can help you.  FYI, I have not used the two components that you are using
> together - mostly I've just used better_nested_set.  Ordering things in a
> list is pretty easy and so I've always just done my own code because I've
> felt the other helpers just get in my way.
>
>
>
>  <logo_sig.jpg>
>  Jeremy Nicoll
>  www.gnexp.com
>  (801) 783-3831
>
>  John-Paul Bader wrote:
>
> After lots of reading I think the best way is to use simple draggables and
> droppables. After the drop i'll move the dragged node to the dropped one
> with move_to_child_of and after that i'll redraw the tree.
>
>
> Any thoughts on that ?
>
>
> Kind regards, John
>
> On 19.03.2008, at 20:45, Jeremy Nicoll wrote:
>
>
>  Hello John-Paul,
>
>      I've done this in a recent project.  Basically the way I do it is check
> to see what order the a selected item in a list is in, and then move that
> item before/after a child node in the target parent based off this
> information.  It's a bit complicated, but it's doable. I monkey patched the
> module SymetrieCom::Acts::NestedSet to include the following method to help
> me with this scenario:
>
>  ________________________________
>         def move_to_parent_location(parent, location)
>            parent = nil if parent == 0
>            parent = parent === self.class ? parent : self.class.find(parent)
> if parent
>            children = parent ? parent.children : self.class.roots
>
>            if children.length > 0
>              ord = location.to_i
>              if ord > children.length
>                self.move_to(children.last, :right)
>              elsif children[ord] != self
>                self.move_to(children[ord], :left)
>              end
>            elsif parent
>              self.move_to(parent, :child)
>            end
>          end
>  ________________________________
>
>
>
>
>  <logo_sig.jpg>
>  Jeremy Nicoll
>  www.gnexp.com
>  (801) 783-3831
>
>  John-Paul Bader wrote:
>  Hey there,
>
> I just subscribed so i hope this question isn't redundant.
>
> I'm trying to implement a sortable nested set.
>
> I've already got an application with better_nested_set in place. I
> also got a nice nested <ul> rendering for my tree. No I'd be able to
> drag an drop / sort elements across the set.
>
> I found this Wiki entry which says that it wouldn't be a good idea in
> general to use sortable.create with :tree => true
>
> http://whynotwiki.com/Rails_/_Sortable_trees
>
> On the same page there is a link to the rubyonrails wiki stating that
> there is a fix expecially for better_nested_set.
> http://dev.rubyonrails.org/ticket/7807
>
> My question would be what your experiences are. Is there a good way to
> implement a sortable / draggable better_nested_set ? If not do you
> have any suggestions, thoughs on this ?
>
> Thanks and kind regards,
>
> John (Berlin / Germany)
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
>
>  _______________________________________________
>  Betternestedset-talk mailing list
>  Betternestedset-talk at rubyforge.org
>  http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
>  ________________________________
>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
>  _______________________________________________
>  Betternestedset-talk mailing list
>  Betternestedset-talk at rubyforge.org
>  http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
>  ________________________________
>
>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
>
> _______________________________________________
>  Betternestedset-talk mailing list
>  Betternestedset-talk at rubyforge.org
>  http://rubyforge.org/mailman/listinfo/betternestedset-talk
>
>

From lutzle at swbell.net  Fri Mar 21 09:27:53 2008
From: lutzle at swbell.net (Larry E. Lutz)
Date: Fri, 21 Mar 2008 08:27:53 -0500
Subject: [Betternestedset-talk] Retrieving a Subset of the "Tree"
Message-ID: <!&!AAAAAAAAAAAYAAAAAAAAAJEa5KrSnKZOu8NPJG9qB4fCgAAAEAAAADiPoz/8J9BPv5uD3u069LEBAAAAAA==@swbell.net>

I have a "categories" table, set up as a nested set, that I want to use to
categorize a number of different types of things, such as  books, software,
movies, etc. Since the table is rather large (over 3,000 rows), I would like
to be able to pull subsets of the table for the different types of things. I
can't use a singleton because the same category can apply to more than one
type of thing, and in many cases, a category set for a type of thing may
start a level below the root. In lieu of that, I have several Boolean fields
within the table for the different types of things. The problem is that, no
matter where I try to apply a scope or condition, the system seems to ignore
it and, instead, returns the full dataset.

My schema looks like this:

  create_table "categories", :force => true do |t|
    t.column "parent_id",     :integer
    t.column "lft",           :integer
    t.column "rgt",           :integer
    t.column "topic",         :string,  :default => "",    :null => false
    t.column "description",   :text
    t.column "books",         :boolean, :default => true
    t.column "entities",      :boolean, :default => false
    t.column "movies",        :boolean, :default => false
    t.column "music",         :boolean, :default => false
    t.column "software",      :boolean, :default => false
    t.column "tech_articles", :boolean, :default => false
  end

Within the data in this table, "Movie Genres," for instance, is not a root
level record. Instead, it is buried several layers deep under the
"Performing Arts" root. The identifier for Movie Genres is the Boolean field
"movies."

With set_table_name "categories", here are some of the things that I've
tried that don't work:
------------------------------------------
  has_many :children, :class_name => "MovieGenre", :foreign_key =>
:parent_id, :conditions => "movies = true"
  belongs_to :parent, :class_name => "MovieGenre"
----------------------------------------
  has_many :children, :class_name => "MovieGenre", :foreign_key =>
:parent_id, :conditions => "movies = true"
  belongs_to :parent, :class_name => "MovieGenre", :foreign_key =>
:parent_id, :conditions => "movies = true" 
  acts_as_nested_set :scope => 'movies = true'
  has_many :children, :class_name => "MovieGenre"
  belongs_to :parent, :class_name => "MovieGenre" 
----------------------------------------------

Is there anyway to achieve what I need to accomplish? I really don't want to
go to multiple "categories" tables for each kind of thing because I need to
keep the categories consistent. By the way, I would also like to have a
"long name" returned when I pull the subset, like this:

  def long_name
    self_and_ancestors.map{ |a| a.topic}.join(' > ')
  end

However, that's not absolutely essential. I do need to be able to use the
returned dataset both in a listing and in a select form field.

Any ideas folks?

Larry E. Lutz 
2425 Sage Road, Apt. 53 
Houston, Texas 77056
(713) 850-1358 
lutzle at swbell.net 


-------------- next part --------------
A non-text attachment was scrubbed...
Name: winmail.dat
Type: application/ms-tnef
Size: 11734 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/9e801f9c/attachment-0001.bin 

From jnicoll at gnexp.com  Fri Mar 21 10:38:21 2008
From: jnicoll at gnexp.com (Jeremy Nicoll)
Date: Fri, 21 Mar 2008 08:38:21 -0600
Subject: [Betternestedset-talk] Retrieving a Subset of the "Tree"
In-Reply-To: <!&!AAAAAAAAAAAYAAAAAAAAAJEa5KrSnKZOu8NPJG9qB4fCgAAAEAAAADiPoz/8J9BPv5uD3u069LEBAAAAAA==@swbell.net>
References: <!&!AAAAAAAAAAAYAAAAAAAAAJEa5KrSnKZOu8NPJG9qB4fCgAAAEAAAADiPoz/8J9BPv5uD3u069LEBAAAAAA==@swbell.net>
Message-ID: <47E3C85D.7040609@gnexp.com>

Ah, this one I do know about.  :)  If you are using MySQL, it actually 
needs to be:

:conditions => "movies = 1"


As there are no true boolean fields in MySQL - it's actually just a 
tinyint with values of either  0 (for false) or 1 (for true).  The only 
problem that I can possibly see with the above method is that it looks 
like (according to my good friend, Google) other databases /might/ store 
true/false queries differently and so if you were to need to switch to a 
different database then you /might/ have to change this code.  I'm sure 
others could enlighten us on this subject.


*Jeremy Nicoll*
www.gnexp.com <http://www.gnexp.com>
(801) 783-3831


Larry E. Lutz wrote:
> I have a "categories" table, set up as a nested set, that I want to use to
> categorize a number of different types of things, such as  books, software,
> movies, etc. Since the table is rather large (over 3,000 rows), I would like
> to be able to pull subsets of the table for the different types of things. I
> can't use a singleton because the same category can apply to more than one
> type of thing, and in many cases, a category set for a type of thing may
> start a level below the root. In lieu of that, I have several Boolean fields
> within the table for the different types of things. The problem is that, no
> matter where I try to apply a scope or condition, the system seems to ignore
> it and, instead, returns the full dataset.
>
> My schema looks like this:
>
>   create_table "categories", :force => true do |t|
>     t.column "parent_id",     :integer
>     t.column "lft",           :integer
>     t.column "rgt",           :integer
>     t.column "topic",         :string,  :default => "",    :null => false
>     t.column "description",   :text
>     t.column "books",         :boolean, :default => true
>     t.column "entities",      :boolean, :default => false
>     t.column "movies",        :boolean, :default => false
>     t.column "music",         :boolean, :default => false
>     t.column "software",      :boolean, :default => false
>     t.column "tech_articles", :boolean, :default => false
>   end
>
> Within the data in this table, "Movie Genres," for instance, is not a root
> level record. Instead, it is buried several layers deep under the
> "Performing Arts" root. The identifier for Movie Genres is the Boolean field
> "movies."
>
> With set_table_name "categories", here are some of the things that I've
> tried that don't work:
> ------------------------------------------
>   has_many :children, :class_name => "MovieGenre", :foreign_key =>
> :parent_id, :conditions => "movies = true"
>   belongs_to :parent, :class_name => "MovieGenre"
> ----------------------------------------
>   has_many :children, :class_name => "MovieGenre", :foreign_key =>
> :parent_id, :conditions => "movies = true"
>   belongs_to :parent, :class_name => "MovieGenre", :foreign_key =>
> :parent_id, :conditions => "movies = true" 
>   acts_as_nested_set :scope => 'movies = true'
>   has_many :children, :class_name => "MovieGenre"
>   belongs_to :parent, :class_name => "MovieGenre" 
> ----------------------------------------------
>
> Is there anyway to achieve what I need to accomplish? I really don't want to
> go to multiple "categories" tables for each kind of thing because I need to
> keep the categories consistent. By the way, I would also like to have a
> "long name" returned when I pull the subset, like this:
>
>   def long_name
>     self_and_ancestors.map{ |a| a.topic}.join(' > ')
>   end
>
> However, that's not absolutely essential. I do need to be able to use the
> returned dataset both in a listing and in a select form field.
>
> Any ideas folks?
>
> Larry E. Lutz 
> 2425 Sage Road, Apt. 53 
> Houston, Texas 77056
> (713) 850-1358 
> lutzle at swbell.net 
>
>
>   
> ------------------------------------------------------------------------
>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>   
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/adcda7f7/attachment.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: logo_sig.jpg
Type: image/jpeg
Size: 2312 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/adcda7f7/attachment.jpg 

From jnicoll at gnexp.com  Fri Mar 21 11:09:48 2008
From: jnicoll at gnexp.com (Jeremy Nicoll)
Date: Fri, 21 Mar 2008 09:09:48 -0600
Subject: [Betternestedset-talk] Retrieving a Subset of the "Tree"
In-Reply-To: <47E3C85D.7040609@gnexp.com>
References: <!&!AAAAAAAAAAAYAAAAAAAAAJEa5KrSnKZOu8NPJG9qB4fCgAAAEAAAADiPoz/8J9BPv5uD3u069LEBAAAAAA==@swbell.net>
	<47E3C85D.7040609@gnexp.com>
Message-ID: <47E3CFBC.2080700@gnexp.com>

    Of course, /children/ and /parent/ are also methods used by BNS, the 
methods override ActiveRecord's way of handling the associations.  Sorry 
- did not quite get what you were asking before.  It seems the children 
method does not work as other AR associations either.  So you can't do 
an AR find like /record.children.find(:all, :conditions => 'something = 
1'). 

    /To be quite honest, I'm still not sure what your intent is.  Are 
all movies going to be grouped together?  It seems like with your db 
setup that it is quite possible to have movies spread all over the 
database, which when the records are by themselves would render the 
/parent/ and /children/ methods quite useless.  If you could explain 
more fully why you want to do this and what the expected outcome is, 
that would be most helpful.


*Jeremy Nicoll*
www.gnexp.com <http://www.gnexp.com>
(801) 783-3831


Jeremy Nicoll wrote:
> Ah, this one I do know about.  :)  If you are using MySQL, it actually 
> needs to be:
> :conditions => "movies = 1"
>
> As there are no true boolean fields in MySQL - it's actually just a 
> tinyint with values of either  0 (for false) or 1 (for true).  The 
> only problem that I can possibly see with the above method is that it 
> looks like (according to my good friend, Google) other databases 
> /might/ store true/false queries differently and so if you were to 
> need to switch to a different database then you /might/ have to change 
> this code.  I'm sure others could enlighten us on this subject.
>
>
> *Jeremy Nicoll*
> www.gnexp.com <http://www.gnexp.com>
> (801) 783-3831
>
>
> Larry E. Lutz wrote:
>> I have a "categories" table, set up as a nested set, that I want to use to
>> categorize a number of different types of things, such as  books, software,
>> movies, etc. Since the table is rather large (over 3,000 rows), I would like
>> to be able to pull subsets of the table for the different types of things. I
>> can't use a singleton because the same category can apply to more than one
>> type of thing, and in many cases, a category set for a type of thing may
>> start a level below the root. In lieu of that, I have several Boolean fields
>> within the table for the different types of things. The problem is that, no
>> matter where I try to apply a scope or condition, the system seems to ignore
>> it and, instead, returns the full dataset.
>>
>> My schema looks like this:
>>
>>   create_table "categories", :force => true do |t|
>>     t.column "parent_id",     :integer
>>     t.column "lft",           :integer
>>     t.column "rgt",           :integer
>>     t.column "topic",         :string,  :default => "",    :null => false
>>     t.column "description",   :text
>>     t.column "books",         :boolean, :default => true
>>     t.column "entities",      :boolean, :default => false
>>     t.column "movies",        :boolean, :default => false
>>     t.column "music",         :boolean, :default => false
>>     t.column "software",      :boolean, :default => false
>>     t.column "tech_articles", :boolean, :default => false
>>   end
>>
>> Within the data in this table, "Movie Genres," for instance, is not a root
>> level record. Instead, it is buried several layers deep under the
>> "Performing Arts" root. The identifier for Movie Genres is the Boolean field
>> "movies."
>>
>> With set_table_name "categories", here are some of the things that I've
>> tried that don't work:
>> ------------------------------------------
>>   has_many :children, :class_name => "MovieGenre", :foreign_key =>
>> :parent_id, :conditions => "movies = true"
>>   belongs_to :parent, :class_name => "MovieGenre"
>> ----------------------------------------
>>   has_many :children, :class_name => "MovieGenre", :foreign_key =>
>> :parent_id, :conditions => "movies = true"
>>   belongs_to :parent, :class_name => "MovieGenre", :foreign_key =>
>> :parent_id, :conditions => "movies = true" 
>>   acts_as_nested_set :scope => 'movies = true'
>>   has_many :children, :class_name => "MovieGenre"
>>   belongs_to :parent, :class_name => "MovieGenre" 
>> ----------------------------------------------
>>
>> Is there anyway to achieve what I need to accomplish? I really don't want to
>> go to multiple "categories" tables for each kind of thing because I need to
>> keep the categories consistent. By the way, I would also like to have a
>> "long name" returned when I pull the subset, like this:
>>
>>   def long_name
>>     self_and_ancestors.map{ |a| a.topic}.join(' > ')
>>   end
>>
>> However, that's not absolutely essential. I do need to be able to use the
>> returned dataset both in a listing and in a select form field.
>>
>> Any ideas folks?
>>
>> Larry E. Lutz 
>> 2425 Sage Road, Apt. 53 
>> Houston, Texas 77056
>> (713) 850-1358 
>> lutzle at swbell.net 
>>
>>
>>   
>> ------------------------------------------------------------------------
>>
>> _______________________________________________
>> Betternestedset-talk mailing list
>> Betternestedset-talk at rubyforge.org
>> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>>   
> ------------------------------------------------------------------------
>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>   
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/cd525eb6/attachment-0001.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: logo_sig.jpg
Type: image/jpeg
Size: 2312 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/cd525eb6/attachment-0001.jpg 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: image/jpeg
Size: 2312 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/cd525eb6/attachment-0001.jpe 

From lutzle at swbell.net  Fri Mar 21 12:28:50 2008
From: lutzle at swbell.net (Larry E. Lutz)
Date: Fri, 21 Mar 2008 11:28:50 -0500
Subject: [Betternestedset-talk] Retrieving a Subset of the "Tree"
Message-ID: <!&!AAAAAAAAAAAYAAAAAAAAAJEa5KrSnKZOu8NPJG9qB4fCgAAAEAAAAHVAQaWVB/xHq/hux43R+lIBAAAAAA==@swbell.net>

Actually, I failed to mention that I had tried the scope/conditions with
both "true" and "1." Rails should make the appropriate substitution of "1"
for "true" as it does in a migration and other places, but just to be sure,
I tried it both ways.

It is correct, theoretically, that movies could be scattered all over the
database - or more correctly, the movie genres could be scattered all over
the database. ("Categories" is merely a list of "subject headings," if you
will, that will be connected to the table that contains the information on
the movies themselves, through a join table. The same would happen for the
"books" table, the "albums" table, etc.) That's why I've used a Boolean
field to designate which particular category rows are to be associated with
movie genres, and that's why I need to pull on that value.

In actual practice, movie genres do happen to be clumped together in the
database. Perhaps an example would make this clearer. The following is a
sampling of the entries in my table (minus the lft and rgt columns):

       Id       parent_id   topic
        1       null                Antiques & Collectibles
     32       null                 Performing Arts
2507           32                Business Aspects
2511           32                Film & Video
2539       2511               Screenwriting
3566       2511              Genres
3567       3566              Setting
3568       3566              Mood
3573       3567              Crime
3574     3567               Film Noir

All of these entries are possible "subjects" for "books." Hence, the Boolean
field "books" would be set to true (or 1, which is the equivalent for true
in MySQL). However, only those with the id's 3566, 3567, 3568, 3573, and
3574 are appropriate to "music genres" and would have their associate
"movies" Boolean field set to true (or 1).

My goal is to be able to display a selection list for a particular type of
thing that has only the categories that are appropriate to that kind of
thing so that (a) the user doesn't have to wade through irrelevant
categories and (b) the user doesn't inadvertently select a category that is
inappropriate to that particular kind of thing. Because any given category,
as in this example, can apply to multiple kinds of things, it just makes
sense to have all the categories in the same table.

By the way, in my system, this sample listing would display as

   1     Antiques & Collectibles
  32   Performing Arts
2507   Performing Arts > Business Aspects
2511  Performing Arts > Film & Video
3566  Performing Arts > Film & Video > Genres
3567  Performing Arts > Film & Video > Genres > Setting
3573  Performing Arts > Film & Video > Genres > Setting > Crime
3574  Performing Arts > Film & Video > Genres > Setting > Film Noir
3568  Performing Arts > Film & Video > Genres > Mood
2539 Performing Arts > Film & Video > Screenwriting

What is truly scary to me is that this kind of categorization of things
within a consistent, hierarchical framework is one of the most common
aspects of human life. It's done everyday in everything from libraries to
botany to genealogy, yet it seems overwhelmingly difficult to do on a
computer.

Larry E. Lutz 
lutzle at swbell.net 


-------------- next part --------------
A non-text attachment was scrubbed...
Name: winmail.dat
Type: application/ms-tnef
Size: 11522 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/30875028/attachment.bin 

From jnicoll at gnexp.com  Fri Mar 21 14:10:06 2008
From: jnicoll at gnexp.com (Jeremy Nicoll)
Date: Fri, 21 Mar 2008 12:10:06 -0600
Subject: [Betternestedset-talk] Retrieving a Subset of the "Tree"
In-Reply-To: <!&!AAAAAAAAAAAYAAAAAAAAAJEa5KrSnKZOu8NPJG9qB4fCgAAAEAAAAHVAQaWVB/xHq/hux43R+lIBAAAAAA==@swbell.net>
References: <!&!AAAAAAAAAAAYAAAAAAAAAJEa5KrSnKZOu8NPJG9qB4fCgAAAEAAAAHVAQaWVB/xHq/hux43R+lIBAAAAAA==@swbell.net>
Message-ID: <47E3F9FE.3080309@gnexp.com>

    I think I have the trick for what you need.  You want all types of 
things below a certain category, right?  Rather than using completely 
different models, just add a few methods to the one model that keeps 
track of everything like so:

class Something
  acts_as_nested_set

  def movie_children
    find_children(:movies)
  end

  def books_children
    find_children(:books)
  end

  # Or... if you really want to get fancy with meta programming, you can 
just define this method and
  # then just call /s = Something.find(some_id_variable); s.movie_children

/  def method_missing(method_name, *args, &block)
    matches = /^([^_]+)_children$/.match(method_name)
    matches ? send(:find_children, matches[1].pluralize) : 
super(method_name, *args, &block)
  end

  private
   def find_children(col_name)
     self.class.find(:all, :conditions => ["lft BETWEEN ? AND ? AND 
`#{col_name}` = 1", self.lft, self.rgt])
   end
end

*Jeremy Nicoll*
www.gnexp.com <http://www.gnexp.com>
(801) 783-3831


Larry E. Lutz wrote:
> Actually, I failed to mention that I had tried the scope/conditions with
> both "true" and "1." Rails should make the appropriate substitution of "1"
> for "true" as it does in a migration and other places, but just to be sure,
> I tried it both ways.
>
> It is correct, theoretically, that movies could be scattered all over the
> database - or more correctly, the movie genres could be scattered all over
> the database. ("Categories" is merely a list of "subject headings," if you
> will, that will be connected to the table that contains the information on
> the movies themselves, through a join table. The same would happen for the
> "books" table, the "albums" table, etc.) That's why I've used a Boolean
> field to designate which particular category rows are to be associated with
> movie genres, and that's why I need to pull on that value.
>
> In actual practice, movie genres do happen to be clumped together in the
> database. Perhaps an example would make this clearer. The following is a
> sampling of the entries in my table (minus the lft and rgt columns):
>
>        Id       parent_id   topic
>         1       null                Antiques & Collectibles
>      32       null                 Performing Arts
> 2507           32                Business Aspects
> 2511           32                Film & Video
> 2539       2511               Screenwriting
> 3566       2511              Genres
> 3567       3566              Setting
> 3568       3566              Mood
> 3573       3567              Crime
> 3574     3567               Film Noir
>
> All of these entries are possible "subjects" for "books." Hence, the Boolean
> field "books" would be set to true (or 1, which is the equivalent for true
> in MySQL). However, only those with the id's 3566, 3567, 3568, 3573, and
> 3574 are appropriate to "music genres" and would have their associate
> "movies" Boolean field set to true (or 1).
>
> My goal is to be able to display a selection list for a particular type of
> thing that has only the categories that are appropriate to that kind of
> thing so that (a) the user doesn't have to wade through irrelevant
> categories and (b) the user doesn't inadvertently select a category that is
> inappropriate to that particular kind of thing. Because any given category,
> as in this example, can apply to multiple kinds of things, it just makes
> sense to have all the categories in the same table.
>
> By the way, in my system, this sample listing would display as
>
>    1     Antiques & Collectibles
>   32   Performing Arts
> 2507   Performing Arts > Business Aspects
> 2511  Performing Arts > Film & Video
> 3566  Performing Arts > Film & Video > Genres
> 3567  Performing Arts > Film & Video > Genres > Setting
> 3573  Performing Arts > Film & Video > Genres > Setting > Crime
> 3574  Performing Arts > Film & Video > Genres > Setting > Film Noir
> 3568  Performing Arts > Film & Video > Genres > Mood
> 2539 Performing Arts > Film & Video > Screenwriting
>
> What is truly scary to me is that this kind of categorization of things
> within a consistent, hierarchical framework is one of the most common
> aspects of human life. It's done everyday in everything from libraries to
> botany to genealogy, yet it seems overwhelmingly difficult to do on a
> computer.
>
> Larry E. Lutz 
> lutzle at swbell.net 
>
>
>   
> ------------------------------------------------------------------------
>
> _______________________________________________
> Betternestedset-talk mailing list
> Betternestedset-talk at rubyforge.org
> http://rubyforge.org/mailman/listinfo/betternestedset-talk
>   
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/6bb78d80/attachment-0001.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: logo_sig.jpg
Type: image/jpeg
Size: 2312 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080321/6bb78d80/attachment-0001.jpg 

From rails-list at stephan.homeunix.net  Fri Mar 21 19:38:20 2008
From: rails-list at stephan.homeunix.net (Jan Luehr)
Date: Sat, 22 Mar 2008 00:38:20 +0100
Subject: [Betternestedset-talk] numbering bug?
Message-ID: <200803220038.21618.rails-list@stephan.homeunix.net>

Hello,

I'm using better nested set with rails 1.2.6 and ruby 1.8.6 p111 and 
discovered some odd behaivior:
I created a tree with a root-node, 1 inner nodes and two leaves:

select id,parent_id,lft,rgt,name from holdings;
+----+-----------+------+------+----------------+
| id | parent_id | lft  | rgt  | name           |
+----+-----------+------+------+----------------+
|  0 |      NULL |    1 |    6 | --- Keiner --- |
|  2 |         0 |    2 |    3 | Spatensatz     |
|  3 |         0 |    4 |    5 | Klappspaten    |
|  4 |         3 |    7 |    8 | Reservestil    |
+----+-----------+------+------+----------------+
4 rows in set (0.00 sec)

But for some reason, "Reservestil" is not included in 
Klappspaten.all_children:
>> Holding.find(3).all_children
=> []

Renumbering the tree fixes the issue:
>> Holding.find(0).renumber_full_tree
=> [{:lft=>5, :rgt=>6, :id=>4}, {:lft=>4, :rgt=>7, :id=>3}, 
{:lft=>1, :rgt=>8, :id=>0}, {:lft=>8, :rgt=>9, :id=>2}, 
{:lft=>10, :rgt=>11, :id=>4}, {:lft=>9, :rgt=>12, :id=>3}]

>> Holding.find(3).all_children.size
=> 1

What might have gone wrong?
All nodes (expect "--- Keiner --") were moved by move_to_child_of to their 
positions...

Thanks,
Keep smiling
yanosz

From beholdthepanda at gmail.com  Mon Mar 24 13:45:16 2008
From: beholdthepanda at gmail.com (Stephen Schor)
Date: Mon, 24 Mar 2008 13:45:16 -0400
Subject: [Betternestedset-talk] Promoting Leaves to Roots.
Message-ID: <45e5e9bc0803241045o456ff969td5e321bd9202817c@mail.gmail.com>

Heyo,

I have a table called Teams which I hope to hold multiple trees (using :scope
=> :tree_id).
My table looks like this...

ID     NAME                     LFT   RGT    PARENT_ID     TREE_ID
17     My first team           1       6          NULL              17
18     Soon to break away  2       5          17                  17
19     Child of soon to...     3       4          18                  17


If I wanted to promote "Soon to break away" and make it a root I'd try
something like...
  >> t = Team.find(18)
  >> t.move_to_right_of(17)
  => #<Team id: 17, name: "My First Team", lft: 1, rgt: 2, parent_id: nil,
lock_version: 1, created_at: "2008-03-24 13:27:30", updated_at: "2008-03-24
13:27:30", tree_id: 17>

Now the table looks like...


ID     NAME                     LFT   RGT    PARENT_ID     TREE_ID
17     My first team           1       2          NULL              17
18     Soon to break away  3       6          NULL              17
19     Child of soon to...     4       5          18                  17

So since 18 is now a root...
  I was expecting his lft to adjust itself to 1 and rght to adjust to
maxright.
  I was also expecting row  18 and 19 to adjust their tree_ids to 18.

Oy.  Am I approaching this the wrong way?

-Stephen
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://rubyforge.org/pipermail/betternestedset-talk/attachments/20080324/0965bf6b/attachment.html