Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Correct multiple spelling mistakes #1121

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Correct multiple spelling mistakes #1121

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
3f04041
Correct interchangeably spelling
lue-bird Oct 10, 2021
7b7a5d2
Correct comparison and specifies spelling
lue-bird Oct 10, 2021
d9d123a
Correct initialize spelling
lue-bird Oct 10, 2021
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Correct comparison and specifies spelling
  • Loading branch information
@lue-bird
lue-bird committed Oct 10, 2021
commit 7b7a5d251042aa3d8117bd9a1184b77556837d9c
4 changes: 2 additions & 2 deletions src/Array.elm
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -52,7 +52,7 @@ import Tuple


{-| The array in this module is implemented as a tree with a high branching
factor (number of elements at each level). In comparision, the `Dict` has
factor (number of elements at each level). In comparison, the `Dict` has
a branching factor of 2 (left or right).

The higher the branching factor, the more elements are stored at each level.
Expand Down Expand Up @@ -86,7 +86,7 @@ any given level of the tree, we need to shift (or move) the correct amount of
bits so that those bits are at the front. We can then perform a bitwise and to
read which of the 32 branches to take.

The `shiftStep` specifices how many bits are required to represent the branching
The `shiftStep` specifies how many bits are required to represent the branching
factor.
-}
shiftStep : Int
Expand Down