address comments

doc/lib.rst

@@ -85,10 +85,16 @@ Algorithms
 * `algorithm <algorithm.html>`_
   This module implements some common generic algorithms like sort or binary search.
 
+* `std/enumutils <enumutils.html>`_
+  This module adds functionality for the built-in ``enum`` type.
+
 * `sequtils <sequtils.html>`_
   This module implements operations for the built-in ``seq`` type
   which were inspired by functional programming languages.
 
+* `std/setutils <setutils.html>`_
+  This module adds functionality for the built-in ``set`` type.
+
 
 Collections
 -----------
@@ -120,12 +126,6 @@ Collections
 * `sets <sets.html>`_
   Nim hash and bit set support.
 
-* `std/setutils <setutils.html>`_
-  This module adds functionality for the built-in ``set`` type.
-
-* `std/enumutils <enumutils.html>`_
-  This module adds functionality for the built-in ``enum`` type.
-
 * `sharedlist <sharedlist.html>`_
   Nim shared linked list support. Contains a shared singly-linked list.
 

lib/pure/typetraits.nim

@@ -15,7 +15,7 @@
 import std/private/since
 export system.`$` # for backward compatibility
 
-type SomeSparseEnum* = (not Ordinal) and enum ## sparse enum's, a.k.a enum with holes
+type SomeSparseEnum* = (not Ordinal) and enum ## Sparse enum's, a.k.a enum with holes.
 
 #[
 xxx `runnableExamples` isn't run if inside:

lib/std/enumutils.nim

@@ -69,7 +69,7 @@ macro sparseEnumFullRange(a: typed): untyped =
   newNimNode(nnkCurly).add(a.getType[1][1..^1])
 
 iterator items*[T: enum and not Ordinal](E: typedesc[T]): T =
-  ## iterates over a sparse enum
+  ## Iterates over a sparse enum.
   runnableExamples:
     type A = enum a0 = 2, a1 = 4, a2
     type B[T] = enum b0 = 2, b1 = 4