From 50f64c60b87e8d03fedc3f9f4e655aff8ca9f16c Mon Sep 17 00:00:00 2001
From: Sverker Eriksson <sverker@erlang.org>
Date: Wed, 12 Dec 2018 19:32:24 +0100
Subject: Add empty 'since' attribute for old modules and functions

---
 lib/stdlib/doc/src/digraph.xml | 66 +++++++++++++++++++++---------------------
 1 file changed, 33 insertions(+), 33 deletions(-)

(limited to 'lib/stdlib/doc/src/digraph.xml')

diff --git a/lib/stdlib/doc/src/digraph.xml b/lib/stdlib/doc/src/digraph.xml
index a5252b443b..cf2c0844c9 100644
--- a/lib/stdlib/doc/src/digraph.xml
+++ b/lib/stdlib/doc/src/digraph.xml
@@ -32,7 +32,7 @@
     <rev>C</rev>
     <file>digraph.xml</file>
   </header>
-  <module>digraph</module>
+  <module since="">digraph</module>
   <modulesummary>Directed graphs.</modulesummary>
   <description>
     <p>This module provides a version of labeled
@@ -144,9 +144,9 @@
 
   <funcs>
     <func>
-      <name name="add_edge" arity="3"/>
-      <name name="add_edge" arity="4"/>
-      <name name="add_edge" arity="5"/>
+      <name name="add_edge" arity="3" since=""/>
+      <name name="add_edge" arity="4" since=""/>
+      <name name="add_edge" arity="5" since=""/>
       <fsummary>Add an edge to a digraph.</fsummary>
       <type name="add_edge_err_rsn"/>
       <desc>
@@ -183,9 +183,9 @@
     </func>
 
     <func>
-      <name name="add_vertex" arity="1"/>
-      <name name="add_vertex" arity="2"/>
-      <name name="add_vertex" arity="3"/>
+      <name name="add_vertex" arity="1" since=""/>
+      <name name="add_vertex" arity="2" since=""/>
+      <name name="add_vertex" arity="3" since=""/>
       <fsummary>Add or modify a vertex of a digraph.</fsummary>
       <desc>
         <p><c>add_vertex/3</c> creates (or modifies) vertex
@@ -204,7 +204,7 @@
     </func>
 
     <func>
-      <name name="del_edge" arity="2"/>
+      <name name="del_edge" arity="2" since=""/>
       <fsummary>Delete an edge from a digraph.</fsummary>
       <desc>
         <p>Deletes edge <c><anno>E</anno></c> from digraph
@@ -213,7 +213,7 @@
     </func>
 
     <func>
-      <name name="del_edges" arity="2"/>
+      <name name="del_edges" arity="2" since=""/>
       <fsummary>Delete edges from a digraph.</fsummary>
       <desc>
         <p>Deletes the edges in list <c><anno>Edges</anno></c> from digraph
@@ -222,7 +222,7 @@
     </func>
 
     <func>
-      <name name="del_path" arity="3"/>
+      <name name="del_path" arity="3" since=""/>
       <fsummary>Delete paths from a digraph.</fsummary>
       <desc>
         <p>Deletes edges from digraph <c><anno>G</anno></c> until there are no
@@ -252,7 +252,7 @@
     </func>
 
     <func>
-      <name name="del_vertex" arity="2"/>
+      <name name="del_vertex" arity="2" since=""/>
       <fsummary>Delete a vertex from a digraph.</fsummary>
       <desc>
         <p>Deletes vertex <c><anno>V</anno></c> from digraph
@@ -265,7 +265,7 @@
     </func>
 
     <func>
-      <name name="del_vertices" arity="2"/>
+      <name name="del_vertices" arity="2" since=""/>
       <fsummary>Delete vertices from a digraph.</fsummary>
       <desc>
         <p>Deletes the vertices in list <c><anno>Vertices</anno></c> from
@@ -274,7 +274,7 @@
     </func>
 
     <func>
-      <name name="delete" arity="1"/>
+      <name name="delete" arity="1" since=""/>
       <fsummary>Delete a digraph.</fsummary>
       <desc>
         <p>Deletes digraph <c><anno>G</anno></c>. This call is important
@@ -285,7 +285,7 @@
     </func>
 
     <func>
-      <name name="edge" arity="2"/>
+      <name name="edge" arity="2" since=""/>
       <fsummary>Return the vertices and the label of an edge of a digraph.
       </fsummary>
       <desc>
@@ -303,7 +303,7 @@
     </func>
 
     <func>
-      <name name="edges" arity="1"/>
+      <name name="edges" arity="1" since=""/>
       <fsummary>Return all edges of a digraph.</fsummary>
       <desc>
         <p>Returns a list of all edges of digraph <c><anno>G</anno></c>, in
@@ -312,7 +312,7 @@
     </func>
 
     <func>
-      <name name="edges" arity="2"/>
+      <name name="edges" arity="2" since=""/>
       <fsummary>Return the edges emanating from or incident on a vertex of
         a digraph.</fsummary>
       <desc>
@@ -324,7 +324,7 @@
     </func>
 
     <func>
-      <name name="get_cycle" arity="2"/>
+      <name name="get_cycle" arity="2" since=""/>
       <fsummary>Find one cycle in a digraph.</fsummary>
       <desc>
         <p>If a <seealso marker="#simple_cycle">simple cycle</seealso> of
@@ -341,7 +341,7 @@
     </func>
 
     <func>
-      <name name="get_path" arity="3"/>
+      <name name="get_path" arity="3" since=""/>
       <fsummary>Find one path in a digraph.</fsummary>
       <desc>
         <p>Tries to find
@@ -357,7 +357,7 @@
     </func>
 
     <func>
-      <name name="get_short_cycle" arity="2"/>
+      <name name="get_short_cycle" arity="2" since=""/>
       <fsummary>Find one short cycle in a digraph.</fsummary>
       <desc>
         <p>Tries to find an as short as possible
@@ -375,7 +375,7 @@
     </func>
 
     <func>
-      <name name="get_short_path" arity="3"/>
+      <name name="get_short_path" arity="3" since=""/>
       <fsummary>Find one short path in a digraph.</fsummary>
       <desc>
         <p>Tries to find an as short as possible
@@ -392,7 +392,7 @@
     </func>
 
     <func>
-      <name name="in_degree" arity="2"/>
+      <name name="in_degree" arity="2" since=""/>
       <fsummary>Return the in-degree of a vertex of a digraph.</fsummary>
       <desc>
         <p>Returns the <seealso marker="#in_degree">in-degree</seealso> of
@@ -401,7 +401,7 @@
     </func>
 
     <func>
-      <name name="in_edges" arity="2"/>
+      <name name="in_edges" arity="2" since=""/>
       <fsummary>Return all edges incident on a vertex of a digraph.</fsummary>
       <desc>
         <p>Returns a list of all
@@ -412,7 +412,7 @@
     </func>
 
     <func>
-      <name name="in_neighbours" arity="2"/>
+      <name name="in_neighbours" arity="2" since=""/>
       <fsummary>Return all in-neighbors of a vertex of  a digraph.</fsummary>
       <desc>
         <p>Returns a list of
@@ -423,7 +423,7 @@
     </func>
 
     <func>
-      <name name="info" arity="1"/>
+      <name name="info" arity="1" since=""/>
       <fsummary>Return information about a digraph.</fsummary>
       <type name="d_cyclicity"/>
       <type name="d_protection"/>
@@ -453,7 +453,7 @@
     </func>
 
     <func>
-      <name name="new" arity="0"/>
+      <name name="new" arity="0" since=""/>
       <fsummary>Return a protected empty digraph, where cycles are allowed.
       </fsummary>
       <desc>
@@ -462,7 +462,7 @@
     </func>
 
     <func>
-      <name name="new" arity="1"/>
+      <name name="new" arity="1" since=""/>
       <fsummary>Create a new empty digraph.</fsummary>
       <type variable="Type"/>
       <type name="d_type"/>
@@ -492,7 +492,7 @@
     </func>
 
     <func>
-      <name name="no_edges" arity="1"/>
+      <name name="no_edges" arity="1" since=""/>
       <fsummary>Return the number of edges of a digraph.</fsummary>
       <desc>
         <p>Returns the number of edges of digraph <c><anno>G</anno></c>.</p>
@@ -500,7 +500,7 @@
     </func>
 
     <func>
-      <name name="no_vertices" arity="1"/>
+      <name name="no_vertices" arity="1" since=""/>
       <fsummary>Return the number of vertices of a digraph.</fsummary>
       <desc>
         <p>Returns the number of vertices of digraph <c><anno>G</anno></c>.</p>
@@ -508,7 +508,7 @@
     </func>
 
     <func>
-      <name name="out_degree" arity="2"/>
+      <name name="out_degree" arity="2" since=""/>
       <fsummary>Return the out-degree of a vertex of a digraph.</fsummary>
       <desc>
         <p>Returns the <seealso marker="#out_degree">out-degree</seealso> of
@@ -517,7 +517,7 @@
     </func>
 
     <func>
-      <name name="out_edges" arity="2"/>
+      <name name="out_edges" arity="2" since=""/>
       <fsummary>Return all edges emanating from a vertex of a digraph.
       </fsummary>
       <desc>
@@ -529,7 +529,7 @@
     </func>
 
     <func>
-      <name name="out_neighbours" arity="2"/>
+      <name name="out_neighbours" arity="2" since=""/>
       <fsummary>Return all out-neighbors of a vertex of a digraph.</fsummary>
       <desc>
         <p>Returns a list of 
@@ -540,7 +540,7 @@
     </func>
 
     <func>
-      <name name="vertex" arity="2"/>
+      <name name="vertex" arity="2" since=""/>
       <fsummary>Return the label of a vertex of a digraph.</fsummary>
       <desc>
         <p>Returns <c>{<anno>V</anno>,&nbsp;<anno>Label</anno>}</c>,
@@ -553,7 +553,7 @@
     </func>
 
     <func>
-      <name name="vertices" arity="1"/>
+      <name name="vertices" arity="1" since=""/>
       <fsummary>Return all vertices of a digraph.</fsummary>
       <desc>
         <p>Returns a list of all vertices of digraph <c><anno>G</anno></c>, in
-- 
cgit v1.2.3