Permalink
Browse files

Fix a couple typo and formatting errors in eep-0031

A couple trivial fixes in eep-0031.

Signed-off-by: Tuncer Ayaz <tuncer.ayaz@gmail.com>
  • Loading branch information...
1 parent 549dc38 commit 28948772c6fda7bbbd777e23171e7bb741c5f64e @tuncer tuncer committed Apr 10, 2010
Showing with 9 additions and 7 deletions.
  1. +9 −7 eeps/eep-0031.md
View
@@ -50,9 +50,9 @@ programming style.
Some operations for converting lists to binaries and v.v. are today in
the erlang module. BIFs concerning binaries now present have varied
view of zero vs. one-based positioning in binaries. I.e.
-``binay_to_list/3`` uses one-based while ``split_binary/2`` uses
+``binary_to_list/3`` uses one-based while ``split_binary/2`` uses
zero-based. As the convention is to use zero-based, new functions for
-convertion binaries to lists and v.v. are needed.
+converting binaries to lists and v.v. are needed.
Binaries are in fact a shared data-type, with small binaries often
referencing parts of larger binaries in a way not controllable by
@@ -198,7 +198,9 @@ the position and length.
The function will return
``{Pos,Length}`` for the binary in ``Pattern`` starting at
-the lowest position in ``Subject``, Example::
+the lowest position in ``Subject``.
+
+Example::
1> binary:find(<<"abcde">>, [<<"bcde">>,<<"cd">>],[]).
{1,4}
@@ -253,7 +255,7 @@ to a shorter, which is illustrated by the following example::
1> binary:matches(<<"abcde">>, [<<"bcde">>,<<"bc">>>,<<"de">>],[]).
[{1,4}]
-\- the result shows that ``<<"bcde">>>`` is selected instead of the
+The result shows that ``<<"bcde">>>`` is selected instead of the
shorter match ``<<"bc">>`` (which would have given raise to one more
match,``<<"de">>``). This corresponds to the behavior of
posix regular expressions (and programs like ``awk``), but is not
@@ -292,7 +294,7 @@ Types:
Option = {scope, part()} | trim | global
Splits Binary into a list of binaries based on ``Pattern``. If the
-option ``global``is not given, only the first occurrence of
+option ``global`` is not given, only the first occurrence of
``Pattern`` in ``Subject`` will give rise to a split.
The parts of ``Pattern`` actually found in ``Subject`` are not included
@@ -627,7 +629,7 @@ Types:
Endianess = big | little
-Converts a positive integer the smallest possible representation
+Converts a positive integer to the smallest possible representation
in in a binary digit representation, either big or little endian.
Example:
@@ -730,7 +732,7 @@ number of parameters has to be considered.
``match/3`` instead of a separate ``matches/3`` function.
The fact that there are a manageable set of possible return types
- for the searching and decomposition functiona allows us to follow
+ for the searching and decomposition functions allows us to follow
that rule of thumb.
(Unfortunately that rule could not be easilly followed in ``re``, as the

0 comments on commit 2894877

Please sign in to comment.