hensel_code 0.1.0 → 0.3.0

data/lib/hensel_code/truncated_finite_padic_expansion.rb

@@ -2,39 +2,11 @@
 
 module HenselCode
   # truncated finite p-adic expansion hensel code class
-  class TruncatedFinitePadicExpansion
-    include Tools
-    include TFPEVerifier
-
-    attr_accessor :prime, :exponent, :rational, :hensel_code, :n
-    private :prime=, :exponent=, :rational=, :hensel_code=
-
-    def initialize(prime, exponent, number)
-      @prime = prime
-      @exponent = exponent
-      @n = Integer.sqrt((modulus - 1) / 2)
-
-      valid_number?(number)
-      encode
-    end
-
+  class TruncatedFinitePadicExpansion < PAdicBase
     def modulus
       prime**exponent
     end
 
-    def numerator
-      rational.numerator
-    end
-
-    def denominator
-      rational.denominator
-    end
-
-    def to_r
-      decode
-      rational
-    end
-
     def to_i
       hensel_code
     end
@@ -43,61 +15,28 @@ module HenselCode
       hensel_code.to_s
     end
 
-    def replace_prime(new_prime)
-      self.prime = new_prime
-      encode
-      decode
-      self
-    end
-
-    def replace_exponent(new_exponent)
-      self.exponent = new_exponent
-      encode
-      decode
-      self
-    end
-
-    def replace_rational(new_rational)
-      self.rational = new_rational
-      encode
-      decode
-      self
-    end
-
-    def replace_hensel_code(new_hensel_code)
-      self.hensel_code = new_hensel_code
-      decode
-      encode
-      self
-    end
-
-    def +(other)
-      valid?(other)
-      self.class.new prime, exponent, (hensel_code + other.hensel_code) % modulus
-    end
-
-    def -(other)
-      valid?(other)
-      self.class.new prime, exponent, (hensel_code - other.hensel_code) % modulus
+    def inspect
+      "<HenselCode: #{hensel_code}>"
     end
 
-    def *(other)
-      valid?(other)
-      self.class.new prime, exponent, (hensel_code * other.hensel_code) % modulus
+    def inverse
+      new_hensel_code = mod_inverse(hensel_code, modulus)
+      self.class.new prime, exponent, new_hensel_code
     end
 
-    def /(other)
-      valid?(other)
-      h2_hensel_code_inverse = mod_inverse(other.hensel_code, modulus)
-      self.class.new prime, exponent, (hensel_code * h2_hensel_code_inverse) % modulus
-    end
+    private
 
-    def inspect
-      "[HenselCode: #{hensel_code}, prime: #{prime}, exponent: #{exponent}, modulus: #{modulus}]"
+    def evaluate(operation, other)
+      if operation == "/"
+        other_hensel_code = mod_inverse(other.hensel_code, modulus)
+        op = "*"
+      else
+        other_hensel_code = other.hensel_code
+        op = operation
+      end
+      self.class.new prime, exponent, hensel_code.send(op, other_hensel_code) % modulus
     end
 
-    private
-
     def valid_number?(number)
       case number
       when Rational
@@ -111,6 +50,11 @@ module HenselCode
       end
     end
 
+    def valid_hensel_code?(new_hensel_code)
+      message = "must be an integer up to #{modulus - 1}"
+      raise WrongHenselCodeInputType, message unless new_hensel_code < modulus
+    end
+
     def encode
       denominator_inverse = mod_inverse(denominator, modulus)
       @hensel_code = (numerator * denominator_inverse) % modulus

data/lib/hensel_code/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module HenselCode
-  VERSION = "0.1.0"
+  VERSION = "0.3.0"
 end

data/lib/hensel_code.rb

@@ -13,12 +13,21 @@ module HenselCode
   class HenselCodesWithDifferentPrimesAndExponents < StandardError; end
   class HenselCodesWithDifferentExponents < StandardError; end
   class IncompatibleOperandTypes < StandardError; end
+  class NonInitializableClass < StandardError; end
 
-  autoload  :Tools,                           "hensel_code/tools"
-  autoload  :TFPEVerifier,                    "hensel_code/tfpe_verifier"
-  autoload  :TruncatedFinitePadicExpansion,   "hensel_code/truncated_finite_padic_expansion"
+  autoload  :Tools, "hensel_code/tools"
+  autoload  :PAdicBase, "hensel_code/padic_base"
+  autoload  :GAdicBase, "hensel_code/gadic_base"
+  autoload  :Polynomial, "hensel_code/polynomial"
+  autoload  :PAdicVerifier, "hensel_code/padic_verifier"
+  autoload  :GAdicVerifier, "hensel_code/gadic_verifier"
+  autoload  :ModularArithmetic, "hensel_code/modular_arithmetic"
+  autoload  :FinitePadicExpansion, "hensel_code/finite_padic_expansion"
+  autoload  :TruncatedFinitePadicExpansion, "hensel_code/truncated_finite_padic_expansion"
+  autoload  :TruncatedFiniteGadicExpansion, "hensel_code/truncated_finite_gadic_expansion"
 
   # aliases for classes with long names
   TFPE = TruncatedFinitePadicExpansion
   HCWDPAE = HenselCodesWithDifferentPrimesAndExponents
+  WHIT = WrongHenselCodeInputType
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hensel_code
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.3.0
 platform: ruby
 authors:
 - David William Silva
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2022-03-03 00:00:00.000000000 Z
+date: 2022-03-13 00:00:00.000000000 Z
 dependencies: []
 description: A Ruby library for homomorphically representing rational numbers as integers.
 email:
@@ -17,6 +17,7 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- ".codecov.yml"
 - ".rubocop.yml"
 - CHANGELOG.md
 - Gemfile
@@ -26,8 +27,15 @@ files:
 - Rakefile
 - codecov
 - lib/hensel_code.rb
-- lib/hensel_code/tfpe_verifier.rb
+- lib/hensel_code/finite_padic_expansion.rb
+- lib/hensel_code/gadic_base.rb
+- lib/hensel_code/gadic_verifier.rb
+- lib/hensel_code/modular_arithmetic.rb
+- lib/hensel_code/padic_base.rb
+- lib/hensel_code/padic_verifier.rb
+- lib/hensel_code/polynomial.rb
 - lib/hensel_code/tools.rb
+- lib/hensel_code/truncated_finite_gadic_expansion.rb
 - lib/hensel_code/truncated_finite_padic_expansion.rb
 - lib/hensel_code/version.rb
 - sig/hensel_code.rbs