src/: change copyright date, use edoc -type attribute

README.md

@@ -3,7 +3,6 @@
 # sfmt-erlang: SIMD-oriented Fast Mersenne Twister (SFMT) for Erlang
 
 * Version 0.14.0 15-MAY-2021
-* 0.13.2 and 0.14.0 have the identical Erlang and C code files.
 * Edited and written by Kenji Rikitake (Kenji Rikitake Professional Engineer's Office)
 * Email contact: <kenji.rikitake@acm.org>
 

src/sfmt.erl

@@ -8,11 +8,11 @@
 %% The module defines a PRNG of period ((2^19937) - 1).
 %% @reference <a href="http://github.com/jj1bdx/sfmt-erlang">GitHub page
 %% for sfmt-erlang</a>
-%% @copyright 2010-2016 Kenji Rikitake and Kyoto University.
+%% @copyright 2010-2021 Kenji Rikitake and Kyoto University.
 %% Copyright (c) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and
 %% Hiroshima University.
 
-%% Copyright (c) 2010-2020 Kenji Rikitake and Kyoto University. All rights
+%% Copyright (c) 2010-2021 Kenji Rikitake and Kyoto University. All rights
 %% reserved.
 %%
 %% Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
@@ -139,21 +139,21 @@
 nif_stub_error(Line) ->
     erlang:nif_error({nif_not_loaded, module, ?MODULE, line, Line}).
 
-%% @type w128() = [integer()].
+%% -type w128() = [integer()].
 %% An 128-bit integer represented by four 32-bit unsigned integers.
 %% Note: the number of elements is four (4).
 
 %% -type w128() :: [integer()].
 
-%% @type randlist() = [integer()].
+%% -type randlist() = [integer()].
 %% A list of N 128-bit integers for the portable representation of
 %% the internal state table,
 %% represented as multiple concatenation of four 32-bit unsigned integers.
 %% Note: the number of elements is the same as N32 (624).
 
 -type randlist() :: [integer()].
 
-%% @type intstate() = binary().
+%% -type intstate() = binary().
 %% A binary representation of N 128-bit integers for the internal state table,
 %% represented as multiple concatenation of four 32-bit unsigned integers.
 %% Note: the number of the binary bytes is the same as N32*4 (2496).
@@ -288,7 +288,7 @@ intstate_to_randlist(_) -> ?nif_stub.
 uint32_to_float(N) when is_integer(N) ->
         ((N + 0.5) * ?FLOAT_CONST).
 
-%% @type ran_sfmt() = {non_neg_integer(), intstate()}.
+%% -type ran_sfmt() = {non_neg_integer(), intstate()}.
 %% This type represents an internal state for random number generator.
 
 -type ran_sfmt() :: {non_neg_integer(), intstate()}.

src/sfmt_pure.erl

@@ -1,7 +1,7 @@
 %% @author Kenji Rikitake <kenji.rikitake@acm.org>
 %% @author Mutsuo Saito
 %% @author Makoto Matsumoto
-%% @copyright 2010-2016 Kenji Rikitake, Mutsuo Saito, Makoto Matsumoto, Kyoto University,
+%% @copyright 2010-2021 Kenji Rikitake, Mutsuo Saito, Makoto Matsumoto, Kyoto University,
 %% Hiroshima University, The University of Tokyo
 %% @doc SIMD-oriented Fast Mersenne Twister (SFMT) in pure Erlang.
 %% The recursion algorithm for `gen_rand_all' and `gen_rand_list32' are
@@ -45,7 +45,7 @@
 %% This makes the algorithm simpler and faster.
 %% @end
 %%
-%% Copyright (c) 2010-2020 Kenji Rikitake and Kyoto University.
+%% Copyright (c) 2010-2021 Kenji Rikitake and Kyoto University.
 %% All rights reserved.
 %%
 %% Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
@@ -158,12 +158,12 @@
 -define(BITMASK32, 16#ffffffff).
 -define(BITMASK64, 16#ffffffffffffffff).
 
-%% @type w128(). Four-element list of 32-bit unsigned integers
+%% -type w128(). Four-element list of 32-bit unsigned integers
 %% to represent a 128-bit integer.
 
 -type w128() :: [integer()].
 
-%% @type intstate(). N-element list of 128-bit unsigned integers,
+%% -type intstate(). N-element list of 128-bit unsigned integers,
 %% represented as a four-element list of 32-bit integers.
 %% The number of N is 156.
 %% Each 128-bit number is represented in little endian,
@@ -180,7 +180,7 @@
 
 -type intstate() :: [integer()].
 
-%% @type ran_sfmt(). N-element list of 128-bit unsigned integers,
+%% -type ran_sfmt(). N-element list of 128-bit unsigned integers,
 %% represented as a list of 32-bit integers. The number of N is 156.
 
 -type ran_sfmt() :: {[integer()], intstate()}.

src/sfmt_pure_tests.erl

@@ -7,11 +7,11 @@
 %% (for period ((2^19937) - 1))
 %% @reference <a href="http://github.com/jj1bdx/sfmt-erlang">GitHub page
 %% for sfmt-erlang</a>
-%% @copyright 2010-2020 Kenji Rikitake and Kyoto University.
+%% @copyright 2010-2021 Kenji Rikitake and Kyoto University.
 %% Copyright (c) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and
 %% Hiroshima University.
 
-%% Copyright (c) 2010-2020 Kenji Rikitake and Kyoto University. All rights
+%% Copyright (c) 2010-2021 Kenji Rikitake and Kyoto University. All rights
 %% reserved.
 %%
 %% Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima

src/sfmt_tests.erl

@@ -7,11 +7,11 @@
 %% (for period ((2^19937) - 1))
 %% @reference <a href="http://github.com/jj1bdx/sfmt-erlang">GitHub page
 %% for sfmt-erlang</a>
-%% @copyright 2010-2020 Kenji Rikitake and Kyoto University.
+%% @copyright 2010-2021 Kenji Rikitake and Kyoto University.
 %% Copyright (c) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and
 %% Hiroshima University.
 
-%% Copyright (c) 2010-2020 Kenji Rikitake and Kyoto University. All rights
+%% Copyright (c) 2010-2021 Kenji Rikitake and Kyoto University. All rights
 %% reserved.
 %%
 %% Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima