Get rid of the remaining versionadded/versionchanged directives.

1 files changed, 0 insertions, 13 deletions

diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 2d38c26..af10019 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -11,8 +11,6 @@
 
 .. % Theoretical explanation:
 
-.. versionadded:: 2.3
-
 This module provides an implementation of the heap queue algorithm, also known
 as the priority queue algorithm.
 
@@ -99,8 +97,6 @@ The module also offers three general purpose functions based on heaps.
    not pull the data into memory all at once, and assumes that each of the input
    streams is already sorted (smallest to largest).
 
-   .. versionadded:: 2.6
-
 
 .. function:: nlargest(n, iterable[, key])
 
@@ -110,11 +106,6 @@ The module also offers three general purpose functions based on heaps.
    ``key=str.lower`` Equivalent to:  ``sorted(iterable, key=key,
    reverse=True)[:n]``
 
-   .. versionadded:: 2.4
-
-   .. versionchanged:: 2.5
-      Added the optional *key* argument.
-
 
 .. function:: nsmallest(n, iterable[, key])
 
@@ -123,10 +114,6 @@ The module also offers three general purpose functions based on heaps.
    used to extract a comparison key from each element in the iterable:
    ``key=str.lower`` Equivalent to:  ``sorted(iterable, key=key)[:n]``
 
-   .. versionadded:: 2.4
-
-   .. versionchanged:: 2.5
-      Added the optional *key* argument.
 
 The latter two functions perform best for smaller values of *n*.  For larger
 values, it is more efficient to use the :func:`sorted` function.  Also, when