ac-library-rb 0.6.0 → 0.6.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f191f90563fea038c7181e2bf9d13e1dc8caa0e816a364176e46b67c8d63f471
-  data.tar.gz: c89db082816046146cb60faa3747e046877394bfff776a3defe8063fb2d1c390
+  metadata.gz: 7f7674ea5a0a95f6cad7945415632a06bf91a515cde31d1c08320d5e9561fc0e
+  data.tar.gz: d6bb650ec23b99f6180f5e8413644863dae78c7923d79249bcadcb9a8a1fcaa0
 SHA512:
-  metadata.gz: '0114099d09f9566741d84ed2b5e43427b62592bb8b2a6b90d25b9f68288d2a387f34899351d18a7b3e0c93ec72af9cae4aac2f1d38f5fe517e30ec850e33429e'
-  data.tar.gz: cdb1eac1808855f86c00c991b4c66ae3489035420ef0fdb8c88915712ace8faa5db02da074a78734e0c4235058ac1e2a62a0fc9cc0523e6c85aff4617b47ae39
+  metadata.gz: d549b2be1fa15a519b8e1d692bbbd03ccd6c0f0b2d94787dbdc48c44ce9274c92ed5e7d6148c195ef73a545ba9951a64f74e84f39eed62e6c12a2eaaf386fcb9
+  data.tar.gz: 5f2b39beb3aacb21ac0fec142b550baf20b6343ed4fabce3ca303d8466bd632af71ce33d911b6a0494425234afa928949d33a670d490a91f9f5441c535586ae4

data/lib/ac-library-rb/version.rb

@@ -1,3 +1,3 @@
 module AcLibraryRb
-  VERSION = "0.6.0".freeze
+  VERSION = "0.6.1".freeze
 end

data/lib/crt.rb

@@ -1,6 +1,8 @@
 # return [rem, mod] or [0, 0] (if no solution)
 def crt(r, m)
-  raise ArgumentError if r.size != m.size
+  unless r.size == m.size
+    raise ArgumentError.new("size of r and m must be equal for crt(r, m)")
+  end
 
   n = r.size
   r0, m0 = 0, 1

data/lib/dsu.rb

@@ -20,10 +20,10 @@ class DSU
   end
   alias unite merge
 
-  def same(a, b)
+  def same?(a, b)
     leader(a) == leader(b)
   end
-  alias same? same
+  alias same same?
 
   def leader(a)
     unless 0 <= a && a < @n

data/lib/fenwick_tree.rb

@@ -2,7 +2,7 @@
 class FenwickTree
   attr_reader :data, :size
 
-  def initialize(arg = nil)
+  def initialize(arg)
     case arg
     when Array
       @size = arg.size

data/lib/two_sat.rb

@@ -13,7 +13,7 @@ class TwoSAT
 
   def add_clause(i, f, j, g)
     unless 0 <= i && i < @n and 0 <= j && j < @n
-      raise RangeError.new
+      raise ArgumentError.new("i:#{i} and j:#{j} must be in (0...#{@n})")
     end
 
     @scc.add_edge(2 * i + (f ? 0 : 1), 2 * j + (g ? 1 : 0))
@@ -21,7 +21,7 @@ class TwoSAT
     nil
   end
 
-  def satisfiable
+  def satisfiable?
     id = @scc.send(:scc_ids)[1]
     @n.times do |i|
       return false if id[2 * i] == id[2 * i + 1]
@@ -30,7 +30,7 @@ class TwoSAT
     end
     true
   end
-  alias satisfiable? satisfiable
+  alias satisfiable satisfiable?
 end
 
 TwoSat = TwoSAT

data/lib_helpers/ac-library-rb.rb

@@ -0,0 +1,24 @@
+module AcLibraryRb
+end
+include AcLibraryRb
+
+require_relative '../lib_lock/ac-library-rb/core_ext/all.rb'
+
+require_relative '../lib_lock/ac-library-rb/convolution'
+require_relative '../lib_lock/ac-library-rb/crt'
+require_relative '../lib_lock/ac-library-rb/dsu'
+require_relative '../lib_lock/ac-library-rb/fenwick_tree'
+require_relative '../lib_lock/ac-library-rb/floor_sum'
+require_relative '../lib_lock/ac-library-rb/inv_mod'
+require_relative '../lib_lock/ac-library-rb/lazy_segtree'
+require_relative '../lib_lock/ac-library-rb/lcp_array'
+require_relative '../lib_lock/ac-library-rb/max_flow'
+require_relative '../lib_lock/ac-library-rb/min_cost_flow'
+require_relative '../lib_lock/ac-library-rb/modint'
+require_relative '../lib_lock/ac-library-rb/pow_mod'
+require_relative '../lib_lock/ac-library-rb/priority_queue'
+require_relative '../lib_lock/ac-library-rb/scc'
+require_relative '../lib_lock/ac-library-rb/segtree'
+require_relative '../lib_lock/ac-library-rb/suffix_array'
+require_relative '../lib_lock/ac-library-rb/two_sat'
+require_relative '../lib_lock/ac-library-rb/z_algorithm'

data/lib_lock/ac-library-rb/crt.rb

@@ -1,7 +1,9 @@
 module AcLibraryRb
   # return [rem, mod] or [0, 0] (if no solution)
   def crt(r, m)
-    raise ArgumentError if r.size != m.size
+    unless r.size == m.size
+      raise ArgumentError.new("size of r and m must be equal for crt(r, m)")
+    end
 
     n = r.size
     r0, m0 = 0, 1

data/lib_lock/ac-library-rb/dsu.rb

@@ -21,10 +21,10 @@ module AcLibraryRb
     end
     alias unite merge
 
-    def same(a, b)
+    def same?(a, b)
       leader(a) == leader(b)
     end
-    alias same? same
+    alias same same?
 
     def leader(a)
       unless 0 <= a && a < @n

data/lib_lock/ac-library-rb/fenwick_tree.rb

@@ -3,7 +3,7 @@ module AcLibraryRb
   class FenwickTree
     attr_reader :data, :size
 
-    def initialize(arg = nil)
+    def initialize(arg)
       case arg
       when Array
         @size = arg.size

data/lib_lock/ac-library-rb/two_sat.rb

@@ -14,7 +14,7 @@ module AcLibraryRb
 
     def add_clause(i, f, j, g)
       unless 0 <= i && i < @n and 0 <= j && j < @n
-        raise RangeError.new
+        raise ArgumentError.new("i:#{i} and j:#{j} must be in (0...#{@n})")
       end
 
       @scc.add_edge(2 * i + (f ? 0 : 1), 2 * j + (g ? 1 : 0))
@@ -22,7 +22,7 @@ module AcLibraryRb
       nil
     end
 
-    def satisfiable
+    def satisfiable?
       id = @scc.send(:scc_ids)[1]
       @n.times do |i|
         return false if id[2 * i] == id[2 * i + 1]
@@ -31,7 +31,7 @@ module AcLibraryRb
       end
       true
     end
-    alias satisfiable? satisfiable
+    alias satisfiable satisfiable?
   end
 
   TwoSat = TwoSAT

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ac-library-rb
 version: !ruby/object:Gem::Version
-  version: 0.6.0
+  version: 0.6.1
 platform: ruby
 authors:
 - universato
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2021-06-15 00:00:00.000000000 Z
+date: 2021-08-09 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: minitest
@@ -123,8 +123,8 @@ files:
 - lib/suffix_array.rb
 - lib/two_sat.rb
 - lib/z_algorithm.rb
+- lib_helpers/ac-library-rb.rb
 - lib_helpers/ac-library-rb/all.rb
-- lib_lock/ac-library-rb.rb
 - lib_lock/ac-library-rb/convolution.rb
 - lib_lock/ac-library-rb/core_ext/all.rb
 - lib_lock/ac-library-rb/core_ext/modint.rb
@@ -167,7 +167,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.15
+rubygems_version: 3.2.22
 signing_key:
 specification_version: 4
 summary: ac-library-rb is a ruby port of AtCoder Library (ACL).

data/lib_lock/ac-library-rb.rb

@@ -1,24 +0,0 @@
-module AcLibraryRb
-end
-include AcLibraryRb
-
-require_relative './lib_lock/ac-library-rb/all.rb'
-
-require_relative './ac-library-rb/convolution'
-require_relative './ac-library-rb/crt'
-require_relative './ac-library-rb/dsu'
-require_relative './ac-library-rb/fenwick_tree'
-require_relative './ac-library-rb/floor_sum'
-require_relative './ac-library-rb/inv_mod'
-require_relative './ac-library-rb/lazy_segtree'
-require_relative './ac-library-rb/lcp_array'
-require_relative './ac-library-rb/max_flow'
-require_relative './ac-library-rb/min_cost_flow'
-require_relative './ac-library-rb/modint'
-require_relative './ac-library-rb/pow_mod'
-require_relative './ac-library-rb/priority_queue'
-require_relative './ac-library-rb/scc'
-require_relative './ac-library-rb/segtree'
-require_relative './ac-library-rb/suffix_array'
-require_relative './ac-library-rb/two_sat'
-require_relative './ac-library-rb/z_algorithm'