FROM #497… QUOTE RFC2822: [[[ I’m with you that the implementation is only partly (BTW, I rarely know implementations that cover the spec to 100%, although it’s the goal to achieve in most cases).]]]
Seems that #497, #439, and #528 – this one – (and probably others) bugs all result from the same LAZY programming “hack” of RFC6764.
I was correct on all counts. Don’t shoot the messenger.
Hopefully by now, you’ve also dabbled with Konqueror and learned that Cal/CardDAV is indeed a ‘surfable’ recursive tree structure [not a “directed graph”] and can be of unlimited dimensions; and, that the Cal/CardDAV client configuration URI can make a relative root out of any branch of the local system’s tree.
AND, that the DNS SRV / TXT records should resolve to the system root of the Cal/CardDAV tree for the DNS ZONE… (determined by the sysadmin)
AND, that well-known will normally be configured to make a relative root of the default login user’s tree – in the absence of a specific, usable URI – but, in fact, it can point to any part of the local system tree… (determined by the sysadmin)
AND, when considering the context of system- (aka “Cal/CardDAV resources”) or user-shared nodes via ACLs, all siblings shall be queried/listed and traversed.
Done correctly as described, an authenticated user would be presented with a complete view of all Cal/CardDAV resources (‘nodes’) authorized to the authenticated user.
http://en.wikipedia.org/wiki/Tree_structure