sets, hash-sets, bit-sets: fix some typos in the documentation

diff --git a/basis/bit-sets/bit-sets-docs.factor b/basis/bit-sets/bit-sets-docs.factor
index bb4dc75cac522bdf1ff7749fe8bfce398098831c..706ffb5cf1d8ccd5c3bdbae9f205e2cb9957732a 100644 (file)
--- a/basis/bit-sets/bit-sets-docs.factor
+++ b/basis/bit-sets/bit-sets-docs.factor
@@ -3,9 +3,9 @@ IN: bit-sets
 
 ARTICLE: "bit-sets" "Bit sets"
 "The " { $vocab-link "bit-sets" } " vocabulary implements bit-array-backed sets. Bitsets are efficient for implementing relatively dense sets whose members are in a contiguous range of integers starting from 0. One bit is required for each integer in this range in the underlying representation." $nl
-"Bit sets are of the class"
+"Bit sets form a class:"
 { $subsection bit-set }
-"They can be instantiated with the word"
+"Constructing new bit sets:"
 { $subsection <bit-set> } ;
 
 ABOUT: "bit-sets"

diff --git a/core/hash-sets/hash-sets-docs.factor b/core/hash-sets/hash-sets-docs.factor
index e771442932108e959b33358ea9925b88bbf8fce2..d59ebeca1037685f4bbac001a5282276d39cf380 100644 (file)
--- a/core/hash-sets/hash-sets-docs.factor
+++ b/core/hash-sets/hash-sets-docs.factor
@@ -2,9 +2,9 @@ USING: help.markup help.syntax sequences ;
 IN: hash-sets
 
 ARTICLE: "hash-sets" "Hash sets"
-"The " { $vocab-link "hash-sets" } " vocabulary implements hashtable-backed sets. These are of the class:"
+"The " { $vocab-link "hash-sets" } " vocabulary implements hashtable-backed sets. Hash sets form a class:"
 { $subsection hash-set }
-"They can be instantiated with the word"
+"Constructing new hash sets:"
 { $subsection <hash-set> }
 "The syntax for hash sets is described in " { $link "syntax-hash-sets" } "." ;
 

diff --git a/core/sets/sets-docs.factor b/core/sets/sets-docs.factor
index 75df4069dc61252bbcd031ec0eb17f46709acaee..5bde8a1febce4e5a09f3e661ba22fce2f3e0b217 100644 (file)
--- a/core/sets/sets-docs.factor
+++ b/core/sets/sets-docs.factor
@@ -61,9 +61,9 @@ ARTICLE: "set-implementations" "Set implementations"
 ARTICLE: "sequence-sets" "Sequences as sets"
 "Any sequence can be used as a set. The members of this set are the elements of the sequence. Calling the word " { $link members } " on a sequence returns a copy of the sequence with only one listing of each member. Destructive operations " { $link adjoin } " and " { $link delete } " only work properly on growable sequences like " { $link vector } "s."
 $nl
-"Care must be taken in writing efficient code using sequence sets. Testing for membership with " { $link in? } ", as well as the destructive set operations, take time proportional to the size of the sequence. Another representation, like " { $link "hash-sets" } ", would take constant time for membership tests. But binary operations like " { $link union } "are asymptotically optimal, taking time proportional to the sum of the size of the inputs."
+"Care must be taken in writing efficient code using sequence sets. Testing for membership with " { $link in? } ", as well as the destructive set operations, take time proportional to the size of the sequence. Another representation, like " { $link "hash-sets" } ", would take constant time for membership tests. But binary operations like " { $link union } " are asymptotically optimal, taking time proportional to the sum of the size of the inputs."
 $nl
-"As one particlar example, " { $link POSTPONE: f } " is a representation of the empty set, as it represents the empty sequence." ;
+"As one particular example, " { $link POSTPONE: f } " is a representation of the empty set, since it is an empty sequence." ;
 
 HELP: set
 { $class-description "The class of all sets. Custom implementations of the set protocol should be declared as instances of this mixin for all set implementation to work correctly." } ;