OSDN > Developer >

omnifarious > Chamber > GaloisField > 提交

GaloisField
Fork

(Original repository, No fork origin)

R/O
SSH

提交

标签

A small kernel of code for playing with Galois fields of arbitrary characteristic

Commit MetaInfo

修订版	363cd639b602f6b0bfb93b538e10c3bcbec87fc8 (tree)
时间	2016-04-24 23:52:40
作者	Eric Hopper <hopper@omni...>
Commiter	Eric Hopper

Log Message

Rename size to size_ for consistency with prime_ and basis_.

更改概述

modified: gf.py (diff)

差异

diff -r b56509398ead -r 363cd639b602 gf.py

--- a/gf.py Sat Apr 23 16:13:43 2016 -0400

+++ b/gf.py Sun Apr 24 10:52:40 2016 -0400

		@@ -20,7 +20,7 @@
20	20	"and < prime.")
21	21	if basis_[0] != 1:
22	22	raise ValueError("First element of basis must be 1")
23		- size = len(basis_) - 1
	23	+ size_ = len(basis_) - 1
24	24
25	25	@_total_ordering
26	26	class gf(_gfBase):

		@@ -38,8 +38,8 @@
38	38
39	39	def __init__(self, val):
40	40	val = tuple((int(v) for v in val))
41		- if len(val) != size:
42		- raise ValueError("val must be sequence of size size of ints")
	41	+ if len(val) != size_:
	42	+ raise ValueError("val must be sequence of size size_ of ints")
43	43	if any((v < 0) or (v >= prime_) for v in val):
44	44	raise ValueError("Each element of val must be >= 0 and < %d"
45	45	% (prime_,))

		@@ -86,9 +86,9 @@
86	86
87	87	def _intmul(self, other):
88	88	if other == 0:
89		- return self.__class__([0] * size)
	89	+ return self.__class__([0] * size_)
90	90	elif other < 0:
91		- return self.__class__([0] * size) - self._intmul(-other)
	91	+ return self.__class__([0] * size_) - self._intmul(-other)
92	92	elif other & 1:
93	93	return self + self._intmul(other - 1)
94	94	else:

		@@ -105,15 +105,15 @@
105	105	return self._intmul(other)
106	106	else:
107	107	return NotImplemented
108		- tmpval = [0] * (size * 2)
	108	+ tmpval = [0] * (size_ * 2)
109	109	for i, factor in enumerate(reversed(other.val_)):
110	110	for j, term in enumerate(reversed(self.val_)):
111	111	tmpval[i + j] += factor * term
112	112	tmpval = tuple((term % prime_) for term in tmpval)
113	113	tmpval = tuple(reversed(tmpval))
114	114	shiftval = tuple((prime_ - term) % prime_ for term in basis_) \
115		- + ((0,) * (size - 1))
116		- while len(tmpval) > size:
	115	+ + ((0,) * (size_ - 1))
	116	+ while len(tmpval) > size_:
117	117	while tmpval[0] != 0:
118	118	tmpval = tuple((x + y) % prime_ \
119	119	for x, y in zip(tmpval, shiftval))

		@@ -140,7 +140,7 @@
140	140	return NotImplemented
141	141	if other < 0:
142	142	raise ValueError("Negative powers are not supported.")
143		- start = self.__class__((0,) * (size - 1) + (1,))
	143	+ start = self.__class__((0,) * (size_ - 1) + (1,))
144	144	base = self
145	145	while other > 0:
146	146	if other & 1: