RFC Errata
RFC 6241, "Network Configuration Protocol (NETCONF)", June 2011
Source of RFC: netconf (ops)See Also: RFC 6241 w/ inline errata
Errata ID: 3980
Status: Verified
Type: Technical
Publication Format(s) : TEXT
Reported By: Klement Sekera
Date Reported: 2014-05-05
Verifier Name: Benoit Claise
Date Verified: 2015-01-23
Sections 6.2.5 and 6.3
In section 6.3: OLD: The algorithm continues until all sibling sets in all subtrees specified in the filter have been processed. In section 6.2.5 OLD: o If any sibling nodes of the selection node are instance identifier components for a conceptual data structure (e.g., list key leaf), then they MAY also be included in the filter output.
It should say:
In section 6.3: NEW: The algorithm continues until all sibling sets in all subtrees specified in the filter have been processed. If any sibling nodes of a node are instance identifier components for a conceptual data structure (e.g., list key leaf), then they MAY also be included in the filter output. In section 6.2.5 NEW:
Notes:
The intent is to allow the server to always include the key node values and the wording accidentally does not cover this case.
Here is the OLD/NEW in a more intuitive way:
In section 6.3:
OLD:
The algorithm continues until all sibling sets in all subtrees specified
in the filter have been processed.
NEW:
The algorithm continues until all sibling sets in all subtrees specified
in the filter have been processed. If any sibling nodes of a node
are instance identifier components for a conceptual data structure
(e.g., list key leaf), then they MAY also be included in the filter output.
Implicitly in section 6.2.5 to delete the moved text:
OLD:
If any sibling nodes of the selection node are instance identifier
components for a conceptual data structure (e.g., list key leaf),
then they MAY also be included in the filter output.
NEW:
<void>