Add empty 'since' attribute for old modules and functions

1 files changed, 35 insertions, 35 deletions

diff --git a/lib/stdlib/doc/src/gb_sets.xml b/lib/stdlib/doc/src/gb_sets.xml
index 16db0906f5..a9596c6e4d 100644
--- a/lib/stdlib/doc/src/gb_sets.xml
+++ b/lib/stdlib/doc/src/gb_sets.xml
@@ -28,7 +28,7 @@
     <date></date>
     <rev></rev>
   </header>
-  <module>gb_sets</module>
+  <module since="">gb_sets</module>
   <modulesummary>General balanced trees.</modulesummary>
   <description>
     <p>This module provides ordered sets using Prof. Arne Andersson's
@@ -123,8 +123,8 @@
 
   <funcs>
     <func>
-      <name name="add" arity="2"/>
-      <name name="add_element" arity="2"/>
+      <name name="add" arity="2" since=""/>
+      <name name="add_element" arity="2" since=""/>
       <fsummary>Add a (possibly existing) element to a set.</fsummary>
       <desc>
         <p>Returns a new set formed from <c><anno>Set1</anno></c> with
@@ -135,7 +135,7 @@
     </func>
 
     <func>
-      <name name="balance" arity="1"/>
+      <name name="balance" arity="1" since=""/>
       <fsummary>Rebalance tree representation of a set.</fsummary>
       <desc>
         <p>Rebalances the tree representation of <c><anno>Set1</anno></c>.
@@ -149,7 +149,7 @@
     </func>
 
     <func>
-      <name name="del_element" arity="2"/>
+      <name name="del_element" arity="2" since=""/>
       <fsummary>Remove a (possibly non-existing) element from a set.</fsummary>
       <desc>
         <p>Returns a new set formed from <c><anno>Set1</anno></c> with
@@ -160,7 +160,7 @@
     </func>
 
     <func>
-      <name name="delete" arity="2"/>
+      <name name="delete" arity="2" since=""/>
       <fsummary>Remove an element from a set.</fsummary>
       <desc>
         <p>Returns a new set formed from <c><anno>Set1</anno></c> with
@@ -171,7 +171,7 @@
     </func>
 
     <func>
-      <name name="delete_any" arity="2"/>
+      <name name="delete_any" arity="2" since=""/>
       <fsummary>Remove a (possibly non-existing) element from a set.</fsummary>
       <desc>
         <p>Returns a new set formed from <c><anno>Set1</anno></c> with
@@ -182,7 +182,7 @@
     </func>
 
     <func>
-      <name name="difference" arity="2"/>
+      <name name="difference" arity="2" since=""/>
       <fsummary>Return the difference of two sets.</fsummary>
       <desc>
         <p>Returns only the elements of <c><anno>Set1</anno></c> that are not
@@ -191,7 +191,7 @@
     </func>
 
     <func>
-      <name name="empty" arity="0"/>
+      <name name="empty" arity="0" since=""/>
       <fsummary>Return an empty set.</fsummary>
       <desc>
         <p>Returns a new empty set.</p>
@@ -199,7 +199,7 @@
     </func>
 
     <func>
-      <name name="filter" arity="2"/>
+      <name name="filter" arity="2" since=""/>
       <fsummary>Filter set elements.</fsummary>
       <desc>
         <p>Filters elements in <c><anno>Set1</anno></c> using predicate function
@@ -208,7 +208,7 @@
     </func>
 
     <func>
-      <name name="fold" arity="3"/>
+      <name name="fold" arity="3" since=""/>
       <fsummary>Fold over set elements.</fsummary>
       <desc>
         <p>Folds <c><anno>Function</anno></c> over every element in
@@ -218,7 +218,7 @@
     </func>
 
     <func>
-      <name name="from_list" arity="1"/>
+      <name name="from_list" arity="1" since=""/>
       <fsummary>Convert a list into a set.</fsummary>
       <desc>
         <p>Returns a set of the elements in <c><anno>List</anno></c>, where
@@ -227,7 +227,7 @@
     </func>
 
     <func>
-      <name name="from_ordset" arity="1"/>
+      <name name="from_ordset" arity="1" since=""/>
       <fsummary>Make a set from an ordset list.</fsummary>
       <desc>
         <p>Turns an ordered-set list <c><anno>List</anno></c> into a set.
@@ -236,7 +236,7 @@
     </func>
 
     <func>
-      <name name="insert" arity="2"/>
+      <name name="insert" arity="2" since=""/>
       <fsummary>Add a new element to a set.</fsummary>
       <desc>
         <p>Returns a new set formed from <c><anno>Set1</anno></c> with
@@ -247,7 +247,7 @@
     </func>
 
     <func>
-      <name name="intersection" arity="1"/>
+      <name name="intersection" arity="1" since=""/>
       <fsummary>Return the intersection of a list of sets.</fsummary>
       <desc>
         <p>Returns the intersection of the non-empty list of sets.</p>
@@ -255,7 +255,7 @@
     </func>
 
     <func>
-      <name name="intersection" arity="2"/>
+      <name name="intersection" arity="2" since=""/>
       <fsummary>Return the intersection of two sets.</fsummary>
       <desc>
         <p>Returns the intersection of <c><anno>Set1</anno></c> and
@@ -264,7 +264,7 @@
     </func>
 
     <func>
-      <name name="is_disjoint" arity="2"/>
+      <name name="is_disjoint" arity="2" since=""/>
       <fsummary>Check whether two sets are disjoint.</fsummary>
       <desc>
         <p>Returns <c>true</c> if <c><anno>Set1</anno></c> and
@@ -274,7 +274,7 @@
     </func>
 
     <func>
-      <name name="is_element" arity="2"/>
+      <name name="is_element" arity="2" since=""/>
       <fsummary>Test for membership of a set.</fsummary>
       <desc>
         <p>Returns <c>true</c> if <c><anno>Element</anno></c> is an element of
@@ -283,7 +283,7 @@
     </func>
 
     <func>
-      <name name="is_empty" arity="1"/>
+      <name name="is_empty" arity="1" since=""/>
       <fsummary>Test for empty set.</fsummary>
       <desc>
         <p>Returns <c>true</c> if <c><anno>Set</anno></c> is an empty set,
@@ -292,7 +292,7 @@
     </func>
 
     <func>
-      <name name="is_member" arity="2"/>
+      <name name="is_member" arity="2" since=""/>
       <fsummary>Test for membership of a set.</fsummary>
       <desc>
         <p>Returns <c>true</c> if <c><anno>Element</anno></c> is an element of
@@ -301,7 +301,7 @@
     </func>
 
     <func>
-      <name name="is_set" arity="1"/>
+      <name name="is_set" arity="1" since=""/>
       <fsummary>Test for a set.</fsummary>
       <desc>
         <p>Returns <c>true</c> if <c><anno>Term</anno></c> appears to be a set,
@@ -310,7 +310,7 @@
     </func>
 
     <func>
-      <name name="is_subset" arity="2"/>
+      <name name="is_subset" arity="2" since=""/>
       <fsummary>Test for subset.</fsummary>
       <desc>
         <p>Returns <c>true</c> when every element of <c><anno>Set1</anno></c> is
@@ -319,7 +319,7 @@
     </func>
 
     <func>
-      <name name="iterator" arity="1"/>
+      <name name="iterator" arity="1" since=""/>
       <fsummary>Return an iterator for a set.</fsummary>
       <desc>
         <p>Returns an iterator that can be used for traversing the entries of
@@ -351,7 +351,7 @@
     </func>
 
     <func>
-      <name name="largest" arity="1"/>
+      <name name="largest" arity="1" since=""/>
       <fsummary>Return largest element.</fsummary>
       <desc>
         <p>Returns the largest element in <c><anno>Set</anno></c>. Assumes that
@@ -360,7 +360,7 @@
     </func>
 
     <func>
-      <name name="new" arity="0"/>
+      <name name="new" arity="0" since=""/>
       <fsummary>Return an empty set.</fsummary>
       <desc>
         <p>Returns a new empty set.</p>
@@ -368,7 +368,7 @@
     </func>
 
     <func>
-      <name name="next" arity="1"/>
+      <name name="next" arity="1" since=""/>
       <fsummary>Traverse a set with an iterator.</fsummary>
       <desc>
         <p>Returns <c>{<anno>Element</anno>, <anno>Iter2</anno>}</c>, where
@@ -381,7 +381,7 @@
     </func>
 
     <func>
-      <name name="singleton" arity="1"/>
+      <name name="singleton" arity="1" since=""/>
       <fsummary>Return a set with one element.</fsummary>
       <desc>
         <p>Returns a set containing only element <c><anno>Element</anno></c>.
@@ -390,7 +390,7 @@
     </func>
 
     <func>
-      <name name="size" arity="1"/>
+      <name name="size" arity="1" since=""/>
       <fsummary>Return the number of elements in a set.</fsummary>
       <desc>
         <p>Returns the number of elements in <c><anno>Set</anno></c>.</p>
@@ -398,7 +398,7 @@
     </func>
 
     <func>
-      <name name="smallest" arity="1"/>
+      <name name="smallest" arity="1" since=""/>
       <fsummary>Return smallest element.</fsummary>
       <desc>
         <p>Returns the smallest element in <c><anno>Set</anno></c>. Assumes that
@@ -407,7 +407,7 @@
     </func>
 
     <func>
-      <name  name="subtract" arity="2"/>
+      <name  name="subtract" arity="2" since=""/>
       <fsummary>Return the difference of two sets.</fsummary>
       <desc>
         <p>Returns only the elements of <c><anno>Set1</anno></c> that are not
@@ -416,7 +416,7 @@
     </func>
 
     <func>
-      <name name="take_largest" arity="1"/>
+      <name name="take_largest" arity="1" since=""/>
       <fsummary>Extract largest element.</fsummary>
       <desc>
         <p>Returns <c>{<anno>Element</anno>, <anno>Set2</anno>}</c>, where
@@ -428,7 +428,7 @@
     </func>
 
     <func>
-      <name name="take_smallest" arity="1"/>
+      <name name="take_smallest" arity="1" since=""/>
       <fsummary>Extract smallest element.</fsummary>
       <desc>
         <p>Returns <c>{<anno>Element</anno>, <anno>Set2</anno>}</c>, where
@@ -440,7 +440,7 @@
     </func>
 
     <func>
-      <name name="to_list" arity="1"/>
+      <name name="to_list" arity="1" since=""/>
       <fsummary>Convert a set into a list.</fsummary>
       <desc>
         <p>Returns the elements of <c><anno>Set</anno></c> as a list.</p>
@@ -448,7 +448,7 @@
     </func>
 
     <func>
-      <name name="union" arity="1"/>
+      <name name="union" arity="1" since=""/>
       <fsummary>Return the union of a list of sets.</fsummary>
       <desc>
         <p>Returns the merged (union) set of the list of sets.</p>
@@ -456,7 +456,7 @@
     </func>
 
     <func>
-      <name name="union" arity="2"/>
+      <name name="union" arity="2" since=""/>
       <fsummary>Return the union of two sets.</fsummary>
       <desc>
         <p>Returns the merged (union) set of <c><anno>Set1</anno></c> and