summary refs log tree commit diff stats
path: root/doc/manual.txt
diff options
context:
space:
mode:
authorGrzegorz Adam Hankiewicz <gradha@imap.cc>2014-07-27 00:21:23 +0200
committerGrzegorz Adam Hankiewicz <gradha@imap.cc>2014-07-27 00:21:23 +0200
commitb87ec14579ac89b56be9d0b5788f3788f836245a (patch)
tree94fa6923ddceaa489b7ba0b0cf40a84c0e25ff35 /doc/manual.txt
parent48a13a76c8d754496b604f96bb2cf3238ff24937 (diff)
downloadNim-b87ec14579ac89b56be9d0b5788f3788f836245a.tar.gz
Factors common documentation in fragment to avoid repetition.
Diffstat (limited to 'doc/manual.txt')
-rw-r--r--doc/manual.txt32
1 files changed, 1 insertions, 31 deletions
diff --git a/doc/manual.txt b/doc/manual.txt
index 54c1477e8..53700ae80 100644
--- a/doc/manual.txt
+++ b/doc/manual.txt
@@ -1221,38 +1221,8 @@ branch switch ``system.reset`` has to be used.
 
 Set type
 --------
-The set type models the mathematical notion of a set. The set's
-basetype can only be an ordinal type. The reason is that sets are implemented
-as high performance bit vectors.
-
-Sets can be constructed via the set constructor: ``{}`` is the empty set. The
-empty set is type compatible with any special set type. The constructor
-can also be used to include elements (and ranges of elements) in the set:
-
-.. code-block:: nimrod
-
-  {'a'..'z', '0'..'9'} # This constructs a set that contains the
-                       # letters from 'a' to 'z' and the digits
-                       # from '0' to '9'
-
-These operations are supported by sets:
-
-==================    ========================================================
-operation             meaning
-==================    ========================================================
-``A + B``             union of two sets
-``A * B``             intersection of two sets
-``A - B``             difference of two sets (A without B's elements)
-``A == B``            set equality
-``A <= B``            subset relation (A is subset of B or equal to B)
-``A < B``             strong subset relation (A is a real subset of B)
-``e in A``            set membership (A contains element e)
-``A -+- B``           symmetric set difference (= (A - B) + (B - A))
-``card(A)``           the cardinality of A (number of elements in A)
-``incl(A, elem)``     same as A = A + {elem}
-``excl(A, elem)``     same as A = A - {elem}
-==================    ========================================================
 
+.. include:: sets_fragment.txt
 
 Reference and pointer types
 ---------------------------