Thanks Jake! Just what I was looking for. dtree is exactly the kind of
javascript API I like. It's simple, does only 1 thing very well, has an easy to
understand API, very little config/setup and do on. Too many dhtml APIs are
humungous and try to offer everything under the sun. The end result is often a
confusin mess of an API and a huge config burden just to get started. Some more
simple APIs can be found at http://youngpup.net .
Anyways, I noticed that the dtree code uses the ids to write the current tree
state to a cookie (if enabled). Cookies do have a maximum length for cookie
values, last time I checked it was 4k. With your example thread and all nodes
open the cookie looks like this:
Which is only 626 bytes long. My point is a huge view with lots of tree nodes
open may blow the limit. Small chance I know, but something to keep in mind.
Thanks Jake! Just what I was looking for. dtree is exactly the kind of javascript API I like. It's simple, does only 1 thing very well, has an easy to understand API, very little config/setup and do on. Too many dhtml APIs are humungous and try to offer everything under the sun. The end result is often a confusin mess of an API and a huge config burden just to get started. Some more simple APIs can be found at http://youngpup.net .
Anyways, I noticed that the dtree code uses the ids to write the current tree state to a cookie (if enabled). Cookies do have a maximum length for cookie values, last time I checked it was 4k. With your example thread and all nodes open the cookie looks like this:
"409C234D9868F94586256E1D00814AB9.29E6FF4DA81977EE86256E1D00815498.9117CC01D83A7 17686256E3E003C0D08.E7829B0A4504AB6086256E3E00467693.74C22D0B707E662086256E3F002 DD052.E4DA017B1C3F684986256E3F00698333.AE7DF2A1AB4E95A086256E3F006B906B.3DEC0F9A F65152FA86256E3F006B98EA.7D143565619780FB86256E3E0052CD4B.5285FBB8F382329886256E 1D00817028.FF1C622AEFE6525186256E3E003B56D0.AE47DA647858A2FF86256E3E0053BDDC.944 208A3EB3CE8F286256E3F00540FE7.D95EC20C8C45C94680256E1E00572367.83D46D4AF7B40FFC8 6256E3E003AF24D.C4BBC3E4B803887886256E3E003B4B83.A15840E0423F970F86256E3E003B0E9 C.0EC57DB9241C718186256E3E0061C64D.628AEAFAECC9C39486256E3E0075DE5E"
Which is only 626 bytes long. My point is a huge view with lots of tree nodes open may blow the limit. Small chance I know, but something to keep in mind.
Anyway, off to implement! Thanks again.