Kian-Meng Ang 3 лет назад
Родитель
Сommit
30fb199ed4

+ 3 - 3
doc/gproc.md

@@ -383,7 +383,7 @@ await(Key::<a href="#type-key">key()</a>, Timeout) -&gt; {pid(), Value}
 
 Wait for a name or aggregated counter to be registered.
 The function raises an exception if the timeout expires. Timeout must be
-either an interger > 0 or 'infinity'.
+either an integer > 0 or 'infinity'.
 A small optimization: we first perform a lookup, to see if the name
 is already registered. This way, the cost of the operation will be
 roughly the same as of where/1 in the case where the name is already
@@ -687,7 +687,7 @@ sense to use multiple times is `{default, Value}`.
 
 The return value will be one of:
 
-* The value of the first matching alternative, or `error` eception,
+* The value of the first matching alternative, or `error` exception,
 whichever comes first
 * The last instance of `{default, Value}`, or `undefined`, if there is no
 matching alternative, default or `error` entry in the list.
@@ -1504,7 +1504,7 @@ Add/modify `{Key, Value}` attributes associated with a registration.
 Gproc registration objects can have `{Key, Value}` attributes associated with
 them. These are stored in a way that doesn't affect the cost of name lookup.
 
-Attributs can be retrieved using `gproc:get_attribute/3` or
+Attributes can be retrieved using `gproc:get_attribute/3` or
 `gproc:get_attributes/2`.
 
 <a name="set_attributes_shared-2"></a>

+ 2 - 2
doc/gproc_pool.md

@@ -108,7 +108,7 @@ This function allows the pool maintainer to exactly position each worker
 inside the pool. An exception is raised if the position is already taken,
 or if `Name` already exists in the pool. If `Slot` is larger than the current
 size of the pool, an exception is raised iff `auto_size` is `false`;
-otherwise the pool is expanded to accomodate the new position.
+otherwise the pool is expanded to accommodate the new position.
 
 <a name="claim-2"></a>
 
@@ -277,7 +277,7 @@ Create a new pool.
 The pool starts out empty. If a size is not given, the pool size is set to
 0 initially. `auto_size` is `true` by default if size is not specified, but
 `false` by default otherwise. If `auto_size == true`, the pool will be
-enlarged to accomodate new workers, when necessary. Otherwise, trying to add
+enlarged to accommodate new workers, when necessary. Otherwise, trying to add
 a worker when the pool is full will raise an exception, as will trying to add
 a worker on a specific position beyond the current size of the pool.
 

+ 1 - 1
patches/stdlib/gen_fsm.erl

@@ -224,7 +224,7 @@ start_timer(Time, Msg) ->
 send_event_after(Time, Event) ->
     erlang:start_timer(Time, self(), {'$gen_event', Event}).
 
-%% Returns the remaing time for the timer if Ref referred to 
+%% Returns the remaining time for the timer if Ref referred to 
 %% an active timer/send_event_after, false otherwise.
 cancel_timer(Ref) ->
     case erlang:cancel_timer(Ref) of

+ 3 - 3
patches/stdlib/gen_server.erl

@@ -194,7 +194,7 @@ reply({To, Tag}, Reply) ->
     catch To ! {Tag, Reply}.
 
 %% ----------------------------------------------------------------- 
-%% Asyncronous broadcast, returns nothing, it's just send'n prey
+%% Asynchronous broadcast, returns nothing, it's just send'n prey
 %%-----------------------------------------------------------------  
 abcast(Name, Request) when is_atom(Name) ->
     do_abcast([node() | nodes()], Name, cast_msg(Request)).
@@ -324,7 +324,7 @@ loop(Parent, Name, State, Mod, Time, Debug) ->
     end.
 
 %%% ---------------------------------------------------
-%%% Send/recive functions
+%%% Send/receive functions
 %%% ---------------------------------------------------
 do_send(Dest, Msg) ->
     case catch erlang:send(Dest, Msg, [noconnect]) of
@@ -345,7 +345,7 @@ do_multi_call(Nodes, Name, Req, Timeout) ->
 	spawn(
 	  fun() ->
 		  %% Middleman process. Should be unsensitive to regular
-		  %% exit signals. The sychronization is needed in case
+		  %% exit signals. The synchronization is needed in case
 		  %% the receiver would exit before the caller started
 		  %% the monitor.
 		  process_flag(trap_exit, true),

+ 1 - 1
patches/stdlib/supervisor.erl

@@ -858,7 +858,7 @@ validMods(Mods) -> throw({invalid_modules, Mods}).
 %%% Add a new restart and calculate if the max restart
 %%% intensity has been reached (in that case the supervisor
 %%% shall terminate).
-%%% All restarts accured inside the period amount of seconds
+%%% All restarts occurred inside the period amount of seconds
 %%% are kept in the #state.restarts list.
 %%% Returns: {ok, State'} | {terminate, State'}
 %%% ------------------------------------------------------

+ 3 - 3
src/gproc.erl

@@ -417,7 +417,7 @@ get_env(Scope, App, Key) ->
 %%
 %% The return value will be one of:
 %%
-%% * The value of the first matching alternative, or `error' eception,
+%% * The value of the first matching alternative, or `error' exception,
 %%   whichever comes first
 %% * The last instance of `{default, Value}', or `undefined', if there is no
 %%   matching alternative, default or `error' entry in the list.
@@ -675,7 +675,7 @@ await(Key) ->
 %%
 %% @doc Wait for a name or aggregated counter to be registered.
 %% The function raises an exception if the timeout expires. Timeout must be
-%% either an interger &gt; 0 or 'infinity'.
+%% either an integer &gt; 0 or 'infinity'.
 %% A small optimization: we first perform a lookup, to see if the name
 %% is already registered. This way, the cost of the operation will be
 %% roughly the same as of where/1 in the case where the name is already
@@ -1343,7 +1343,7 @@ unreg_other1({T,l,_} = Key, Pid) when is_pid(Pid) ->
 %% Gproc registration objects can have `{Key, Value}' attributes associated with
 %% them. These are stored in a way that doesn't affect the cost of name lookup.
 %%
-%% Attributs can be retrieved using `gproc:get_attribute/3' or
+%% Attributes can be retrieved using `gproc:get_attribute/3' or
 %% `gproc:get_attributes/2'.
 %% @end
 set_attributes(Key, Props) ->

+ 2 - 2
src/gproc_pool.erl

@@ -114,7 +114,7 @@ new(Pool) ->
 %% The pool starts out empty. If a size is not given, the pool size is set to
 %% 0 initially. `auto_size' is `true' by default if size is not specified, but
 %% `false' by default otherwise. If `auto_size == true', the pool will be
-%% enlarged to accomodate new workers, when necessary. Otherwise, trying to add
+%% enlarged to accommodate new workers, when necessary. Otherwise, trying to add
 %% a worker when the pool is full will raise an exception, as will trying to add
 %% a worker on a specific position beyond the current size of the pool.
 %%
@@ -182,7 +182,7 @@ add_worker(Pool, Name) ->
 %% inside the pool. An exception is raised if the position is already taken,
 %% or if `Name' already exists in the pool. If `Slot' is larger than the current
 %% size of the pool, an exception is raised iff `auto_size' is `false';
-%% otherwise the pool is expanded to accomodate the new position.
+%% otherwise the pool is expanded to accommodate the new position.
 %% @end
 add_worker(Pool, Name, Slot) ->
     call({add_worker, Pool, Name, Slot}).