Raise copyright years

[pygost.git] / pygost / utils.py

diff --git a/pygost/utils.py b/pygost/utils.py
index 1fdba000f842517d7e40869aa51577c5841c6fe4..3ed80e4b4f14ba75834279a17228a2c633ce8f80 100644 (file)
--- a/pygost/utils.py
+++ b/pygost/utils.py
@@ -1,6 +1,6 @@
 # coding: utf-8
 # PyGOST -- Pure Python GOST cryptographic functions library
-# Copyright (C) 2015-2016 Sergey Matveev <stargrave@stargrave.org>
+# Copyright (C) 2015-2019 Sergey Matveev <stargrave@stargrave.org>
 #
 # This program is free software: you can redistribute it and/or modify
 # it under the terms of the GNU General Public License as published by
@@ -20,7 +20,7 @@ from codecs import getencoder
 from sys import version_info
 
 
-xrange = range if version_info[0] == 3 else xrange
+xrange = range if version_info[0] == 3 else xrange  # pylint: disable=redefined-builtin
 
 
 def strxor(a, b):
@@ -56,7 +56,7 @@ def bytes2long(raw):
     """ Deserialize big-endian bytes into long number
 
     :param bytes raw: binary string
-    :return: deserialized long number
+    :returns: deserialized long number
     :rtype: int
     """
     return int(hexenc(raw), 16)
@@ -66,7 +66,7 @@ def long2bytes(n, size=32):
     """ Serialize long number into big-endian bytestring
 
     :param long n: long number
-    :return: serialized bytestring
+    :returns: serialized bytestring
     :rtype: bytes
     """
     res = hex(int(n))[2:].rstrip("L")
@@ -81,7 +81,7 @@ def long2bytes(n, size=32):
 def modinvert(a, n):
     """ Modular multiplicative inverse
 
-    :return: inverse number. -1 if it does not exist
+    :returns: inverse number. -1 if it does not exist
 
     Realization is taken from:
     https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm