Cronjob - daily check of IETF modules.

experimental/ietf-extracted-YANG-modules/ietf-netconf-private-candidate@2024-09-12.yang

@@ -0,0 +1,103 @@
+module ietf-netconf-private-candidate {
+    yang-version 1.1;
+    namespace "urn:ietf:params:xml:ns:netconf:private-candidate:1.0";
+    prefix pc;
+
+    import ietf-nmda-compare {
+        prefix cmp;
+    }
+
+    organization
+        "IETF NETCONF (Network Configuration) Working Group";
+    contact
+        "WG Web:   <http://tools.ietf.org/wg/netconf/>
+        WG List:  <[email protected]>
+
+        WG Chair: Kent Watsen
+                <[email protected]>
+
+        WG Chair: Per Andersson
+                <[email protected]>
+
+        Editor:   James Cumming
+                <[email protected]>
+
+        Editor:   Robert Wills
+                <[email protected]>";
+    description
+        "NETCONF private candidate support.
+
+        Copyright (c) 2024 IETF Trust and the persons identified as
+        authors of the code. All rights reserved.
+
+        Redistribution and use in source and binary forms, with or
+        without modification, is permitted pursuant to, and subject
+        to the license terms contained in, the Revised BSD License
+        set forth in Section 4.c of the IETF Trust’s Legal Provisions
+        Relating to IETF Documents
+        (https://trustee.ietf.org/license-info).
+
+        This version of this YANG module is part of
+        draft-ietf-netconf-privcand; see these documents for full
+        legal notices.";
+
+    revision 2024-09-12 {
+        description
+            "Introduce private candidate support";
+        reference
+            "draft-ietf-netconf-privcand:
+             Netconf Private Candidates";
+    }
+
+    feature private-candidate {
+        description
+            "NETCONF :private-candidate capability;
+            If the server advertises the :private-candidate
+            capability for a session, then this feature must
+            also be enabled for that session.  Otherwise,
+            this feature must not be enabled.";
+        reference
+            "draft-ietf-netconf-privcand";
+    }
+
+    rpc update {
+        if-feature "private-candidate";
+        description
+            "Updates the private candidate from the running
+            configuration.";
+        reference
+            "draft-ietf-netconf-privcand";
+        input {
+            leaf resolution-mode {
+                description
+                    "Mode to resolve conflicts between running and
+                    private-candidate configurations.";
+                default revert-on-conflict;
+                type enumeration {
+                    enum revert-on-conflict;
+                    enum ignore;
+                    enum overwrite;
+                }
+            }
+        }
+    }
+    augment /cmp:compare/cmp:input {
+        leaf reference-point {
+            reference "draft-ietf-netconf-privcand";
+            if-feature "private-candidate";
+            description
+                "When this leaf is provided and the source or
+                destination is the candidate datastore, operating
+                in private candidate mode, the comparison will
+                either occur between the last-update point of
+                the private candidate or the creation-point of
+                the private candidate.";
+            default last-update;
+            type enumeration {
+                enum last-update;
+                enum creation-point;
+            }
+        }
+    }
+
+}

experimental/ietf-extracted-YANG-modules/ietf-schedule@2024-04-16.yang

@@ -61,13 +61,13 @@ module ietf-schedule {
       "RFC XXXX: A Common YANG Data Model for Scheduling";
   }
 
-  feature basic-recurrence-supported {
+  feature basic-recurrence {
     description
       "Indicates that the server supports configuring a basic
        scheduled recurrence.";
   }
 
-  feature icalendar-recurrence-supported {
+  feature icalendar-recurrence {
     description
       "Indicates that the server supports configuring a comprehensive
        scheduled icalendar recurrence";
@@ -229,26 +229,33 @@ module ietf-schedule {
   identity enabled {
     base schedule-state;
     description
-      "Indicates a recurrence with an enabled state.";
+      "Indicates a schedule with an enabled state.";
   }
 
   identity finished {
     base schedule-state;
     description
-      "Indicates a recurrence with a finished state.
+      "Indicates a schedule with a finished state.
        The finished state indicates that the schedule has ended.";
   }
 
   identity disabled {
     base schedule-state;
     description
-      "Indicates a recurrence with a disabled state.";
+      "Indicates a schedule with a disabled state.";
   }
 
   identity out-of-date {
     base schedule-state;
     description
-      "Indicates a recurrence with an out-of-date state.";
+      "Indicates a schedule with an out-of-date state.";
+  }
+
+  identity conflicted {
+    base schedule-state;
+    description
+      "Indicates a schedule with a conflicted state with other
+       schedules.";
   }
 
   identity discard-action {
@@ -401,7 +408,7 @@ module ietf-schedule {
     }
   }
 
-  grouping recurrence {
+  grouping recurrence-basic {
     description
       "A simple definition of recurrence.";
     leaf recurrence-description {
@@ -436,7 +443,7 @@ module ietf-schedule {
     container recurrence-first {
       description
         "Specifies the first instance of the recurrence.";
-      leaf utc-start-time {
+      leaf start-time-utc {
         type yang:date-and-time;
         description
           "Defines the instant date and time of the first instance
@@ -451,20 +458,20 @@ module ietf-schedule {
            the other instances in the recurrence set.";
       }
     }
-    choice recurrence-bound {
+    choice recurrence-end {
       description
-        "Modes to bound the recurrence rule. If no choice is
-         indicated, the recurrence rule is considered to repeat
-         forever.";
+        "Modes to control the end of a recurrence rule. If no
+         choice is indicated, the recurrence rule is considered
+         to repeat forever.";
       case until {
         description
-          "This case defines a way that bounds the recurrence
-           rule in an inclusive manner.";
+          "This case defines a way that limits the end of a
+           recurrence rule in an inclusive manner.";
         leaf utc-until {
           type yang:date-and-time;
           description
             "This parameter specifies a date and time value to
-             inclusively bound the recurrence in UTC format. If
+             inclusively terminate the recurrence in UTC format. If
              the value specified by this parameter is synchronized
              with the specified recurrence, it becomes the last
              instance of the recurrence.";
@@ -473,16 +480,16 @@ module ietf-schedule {
       case count {
         description
           "This case defines the number of occurrences at which
-           to range-bound the recurrence.";
+           to terminate the recurrence.";
         leaf count {
           type uint32;
           description
             "The positive number of occurrences at which to
-             range-bound the recurrence.";
+             terminate the recurrence.";
         }
       }
     }
-    uses recurrence;
+    uses recurrence-basic;
   }
 
   grouping recurrence-with-time-zone {
@@ -493,7 +500,7 @@ module ietf-schedule {
     container recurrence-first {
       description
         "Specifies the first instance of the recurrence.";
-      leaf date-time-start {
+      leaf start-time {
         type yang:date-and-time;
         description
           "Defines the instant date and time of the first instance
@@ -512,14 +519,13 @@ module ietf-schedule {
         description
           "Indicates the identifier for the time zone in a time
            zone database. This parameter MUST be specified if
-           'date-time-start' or 'until' value is neither
-           reported in the format of UTC nor time zone offset to
-           UTC.";
+           'start-time' or 'until' value is neither reported in
+           the format of UTC nor time zone offset to UTC.";
       }
     }
-    choice recurrence-bound {
+    choice recurrence-end {
       description
-        "Modes to bound the recurrence rule. If no choice is
+        "Modes to terminate the recurrence rule. If no choice is
          indicated, the recurrence rule is considered to repeat
          forever.";
       case until {
@@ -529,7 +535,7 @@ module ietf-schedule {
         leaf until {
           type yang:date-and-time;
           description
-            "Specifies a date and time value to bound the
+            "Specifies a date and time value to terminate the
              recurrence. If the value specified by this parameter
              is synchronized with the specified recurrence, it
              becomes the last instance of the recurrence.";
@@ -543,11 +549,11 @@ module ietf-schedule {
           type uint32;
           description
             "The positive number of occurrences at which to
-             range-bound the recurrence.";
+             terminate the recurrence.";
         }
       }
     }
-    uses recurrence;
+    uses recurrence-basic;
   }
 
   grouping recurrence-utc-with-date-times {
@@ -756,8 +762,9 @@ module ietf-schedule {
       type yang:counter32;
       config false;
       description
-        "The counter of occurrences since the schedule was enabled.
-         The count wraps around when it reaches the maximum value.";
+        "The number of occurrences while invoking the scheduled
+         action successfully. The count wraps around when it reaches
+         the maximum value.";
     }
     leaf last-occurrence {
       when "derived-from-or-self(../schedule-type, "

standard/ietf/RFC/ietf-babel.yang

@@ -0,0 +1 @@
+ietf-babel@2024-10-10.yang