Commit c1c5dee

authored

Fix various spelling errors. (#1158)

1 parent 9498edf commit c1c5deeCopy full SHA for c1c5dee

File tree

-8

lines changed

-8

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`# Instructions for Contributors`
`2`	`2`
`3`		`-To report bugs, or propose enchancements or changes, please use the`
	`3`	`+To report bugs, or propose enhancements or changes, please use the`
`4`	`4`	`[GitHub issue tracker](https://github.com/haskell/containers/issues).`
`5`	`5`
`6`	`6`	`You are also welcome to propose code changes in the form of`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@`
`12`	`12`
`13`	`13`	`# -- General configuration ------------------------------------------------`
`14`	`14`
`15`		`-# Add the _extenions dir to the search path.`
	`15`	`+# Add the _extensions dir to the search path.`
`16`	`16`	`sys.path.insert(0, os.path.abspath('.') + '/_extensions')`
`17`	`17`	`sys.path.insert(0, os.path.abspath('.') + '/_extensions/haddock-autolink')`
`18`	`18`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -117,7 +117,7 @@ Common API Functions`
`117`	`117`	``size`` which is O(1) for ``Map`` and O(n) for ``IntMap``.
`118`	`118`
`119`	`119`	`.. NOTE::`
`120`		- A ``Map`` is printed as an association list preceeded by ``fromList``. For
	`120`	+ A ``Map`` is printed as an association list preceded by ``fromList``. For
`121`	`121`	example, it might look like ``fromList [(Key1,True),(Key2,False)]``.
`122`	`122`
`123`	`123`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -81,7 +81,7 @@ Importing Sequence`
`81`	`81`	`------------------`
`82`	`82`
`83`	`83`	When using ``Sequence`` in a Haskell source file you should always use a
`84`		-``qualified`` import becasue it exports names that clash with the standard
	`84`	+``qualified`` import because it exports names that clash with the standard
`85`	`85`	`Prelude (you can import the type constructor and some operators on their own`
`86`	`86`	`though!).`
`87`	`87`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1326,7 +1326,7 @@ restrictBM t@(Bin p l r) !bm`
`1326`	`1326`	`-- Here we care about the "submask" of bm corresponding the current Bin's`
`1327`	`1327`	`-- range. So we create bm', where this submask is at the lowest position and`
`1328`	`1328`	`-- and all other bits are set to the highest bit of the submask (using an`
`1329`		`- -- arithmetric shiftR). Now bm' is 0 when the submask is empty and -1 when`
	`1329`	`+ -- arithmetic shiftR). Now bm' is 0 when the submask is empty and -1 when`
`1330`	`1330`	`-- the submask is full.`
`1331`	`1331`	`px = IntSet.suffixOf (unPrefix p)`
`1332`	`1332`	`px1 = px - 1`
`@@ -3612,7 +3612,7 @@ ascLinkStack stk !rk r = case stk of`
`3612`	`3612`	`-- [zipper](https://en.wikipedia.org/wiki/Zipper_(data_structure)). It always`
`3613`	`3613`	`-- has its "focus" at the last inserted entry. To insert a new entry, we need`
`3614`	`3614`	`-- to move the focus to the new entry. To do this we move up the stack to the`
`3615`		`--- lowest common ancestor of the currest position and the position of the`
	`3615`	`+-- lowest common ancestor of the current position and the position of the`
`3616`	`3616`	`-- new key (implemented as moveUpB), then down to the position of the new key`
`3617`	`3617`	`-- (implemented as moveDownB).`
`3618`	`3618`	`--`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -2335,8 +2335,8 @@ validsize t`
`2335`	`2335`	-- done in O(1) using `Bin`. The final linking of the stack is done in O(log n)
`2336`	`2336`	-- using `link` (proof below). The total time is thus O(n).
`2337`	`2337`	`--`
`2338`		`--- Additionally, the implemention is written using foldl' over the input list,`
`2339`		`--- which makes it participate as a good consumer in list fusion.`
	`2338`	`+-- Additionally, the implementation is written using foldl' over the input`
	`2339`	`+-- list, which makes it participate as a good consumer in list fusion.`
`2340`	`2340`	`--`
`2341`	`2341`	`-- fromDistinctDescList is implemented similarly, adapted for left and right`
`2342`	`2342`	`-- sides being swapped.`

Comments

(0)