mikunyan 3.9.4 → 3.9.5

data/lib/mikunyan/version.rb

@@ -1,4 +1,4 @@
 module Mikunyan
     # version string
-    VERSION = "3.9.4"
+    VERSION = "3.9.5"
 end

data/mikunyan.gemspec

@@ -20,6 +20,7 @@ Gem::Specification.new do |spec|
   spec.bindir        = "exe"
   spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
   spec.require_paths = ["lib"]
+  spec.extensions    = ["ext/decoders/native/extconf.rb"]
 
   spec.add_dependency 'extlz4', '~> 0'
   spec.add_dependency 'bin_utils', '~> 0'

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mikunyan
 version: !ruby/object:Gem::Version
-  version: 3.9.4
+  version: 3.9.5
 platform: ruby
 authors:
 - Ishotihadus
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2018-01-31 00:00:00.000000000 Z
+date: 2018-05-27 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: extlz4
@@ -100,7 +100,8 @@ email:
 executables:
 - mikunyan-image
 - mikunyan-json
-extensions: []
+extensions:
+- ext/decoders/native/extconf.rb
 extra_rdoc_files: []
 files:
 - ".gitignore"
@@ -113,24 +114,35 @@ files:
 - bin/setup
 - exe/mikunyan-image
 - exe/mikunyan-json
+- ext/decoders/native/astc.c
+- ext/decoders/native/astc.h
+- ext/decoders/native/dxtc.c
+- ext/decoders/native/dxtc.h
+- ext/decoders/native/etc.c
+- ext/decoders/native/etc.h
+- ext/decoders/native/extconf.rb
+- ext/decoders/native/main.c
+- ext/decoders/native/rgb.c
+- ext/decoders/native/rgb.h
 - lib/mikunyan.rb
 - lib/mikunyan/asset.rb
 - lib/mikunyan/asset_bundle.rb
 - lib/mikunyan/binary_reader.rb
 - lib/mikunyan/constants.rb
 - lib/mikunyan/decoders.rb
-- lib/mikunyan/decoders/astc_block_decoder.rb
 - lib/mikunyan/decoders/image_decoder.rb
 - lib/mikunyan/object_value.rb
 - lib/mikunyan/type_tree.rb
 - lib/mikunyan/typetrees/0005ee889bd7f6b79a25da117f739c52.dat
 - lib/mikunyan/typetrees/005cae4626b69aa0d1bd6fd3677642d0.dat
 - lib/mikunyan/typetrees/0065ac6da4da61da4e46189f1b77b002.dat
+- lib/mikunyan/typetrees/00ad972a9b8de1baeacb62e297cbb968.dat
 - lib/mikunyan/typetrees/00b2dd52d07280ff931ca2ce840c6c5f.dat
 - lib/mikunyan/typetrees/00f3fced245b297f9ac50a0d4903fb6a.dat
 - lib/mikunyan/typetrees/01053c13f5acc24d9236a5e6e7e1410d.dat
 - lib/mikunyan/typetrees/01266d578502b6b76488f3bd3d604eef.dat
 - lib/mikunyan/typetrees/016a05ed91534852640fa073275aca15.dat
+- lib/mikunyan/typetrees/01ccfe05c6fbc7ff03dcf8afa8213ff5.dat
 - lib/mikunyan/typetrees/02121256d773b25c5090287b274c2b00.dat
 - lib/mikunyan/typetrees/02151504e19732024609e7cca6c0fc96.dat
 - lib/mikunyan/typetrees/026979ad7a2cb1623d33ebc2dcb307bc.dat
@@ -155,6 +167,7 @@ files:
 - lib/mikunyan/typetrees/0816a72ba3f00b1bb13b23f8799619af.dat
 - lib/mikunyan/typetrees/0827148b052dd69232c20460ddde3d1a.dat
 - lib/mikunyan/typetrees/0857307b3a8cb783c311d8ff42959462.dat
+- lib/mikunyan/typetrees/086efb68ee41abe4e98e1ae93ae96290.dat
 - lib/mikunyan/typetrees/087e32a39c822978a1c5e410162b381b.dat
 - lib/mikunyan/typetrees/08a0f671ed575df2b956a9523f3389b4.dat
 - lib/mikunyan/typetrees/08b842bfb6779a99abd9772f354c4592.dat
@@ -174,6 +187,7 @@ files:
 - lib/mikunyan/typetrees/0eb12c7055a972aec53d53a646cc4fec.dat
 - lib/mikunyan/typetrees/0f7da8d76d164df704e661b2f926d0ba.dat
 - lib/mikunyan/typetrees/0fdbf6896f263df755a7392766cd7bd5.dat
+- lib/mikunyan/typetrees/10355709bc95355f57466913ac850d0b.dat
 - lib/mikunyan/typetrees/1047dc8a46bd55bbc47ee36971fbc899.dat
 - lib/mikunyan/typetrees/1101c105388a97c11253c9138a48b054.dat
 - lib/mikunyan/typetrees/116f6e5f5e2f9936f14b3e7afdaeebe0.dat
@@ -221,6 +235,7 @@ files:
 - lib/mikunyan/typetrees/1e347d6a49dd26eca64146d8d1629c16.dat
 - lib/mikunyan/typetrees/1e831f2ccbb8f0cceabd75e4ae614edd.dat
 - lib/mikunyan/typetrees/1e8486720809f1f1134ad46a75855191.dat
+- lib/mikunyan/typetrees/1e87d82d4fd058509a3c7866db0e7356.dat
 - lib/mikunyan/typetrees/1eaa927fe597a5c984688ede0d7e0c46.dat
 - lib/mikunyan/typetrees/1ebcb3bc9f2a38130d9e3274f3c00201.dat
 - lib/mikunyan/typetrees/1ef8dc1e91e0cd01bd07036e6665ea40.dat
@@ -255,6 +270,8 @@ files:
 - lib/mikunyan/typetrees/24e89a7207828509d5c5875a93b2106e.dat
 - lib/mikunyan/typetrees/252b1dbbc4b7cfed2594e04d6ff33e9a.dat
 - lib/mikunyan/typetrees/255352c3db1172a6a9c5c2605486d937.dat
+- lib/mikunyan/typetrees/26165a24a953362edb6a7078f6536c4b.dat
+- lib/mikunyan/typetrees/266d53113fa30d2b858f2768f92eaa14.dat
 - lib/mikunyan/typetrees/26b86854c33bca2efc9692ce14f5966d.dat
 - lib/mikunyan/typetrees/26edfe99eae8bb02d8148494ac056b19.dat
 - lib/mikunyan/typetrees/2706c8356160cd6aaa396532b3ce39ab.dat
@@ -283,6 +300,7 @@ files:
 - lib/mikunyan/typetrees/2bf1eebd069f0d939216d45cc299be85.dat
 - lib/mikunyan/typetrees/2c303ef7be71806aaffa0121527d7fea.dat
 - lib/mikunyan/typetrees/2d0f68bd23c44c2815f9d5376ace084f.dat
+- lib/mikunyan/typetrees/2d2b1d63eb2a68ed94bbf7f50fc21d7b.dat
 - lib/mikunyan/typetrees/2d33f228d257f7b0b88c98914786292c.dat
 - lib/mikunyan/typetrees/2da9c96f9efc8b31a480d5b8858755f3.dat
 - lib/mikunyan/typetrees/2dbcc357c62060bea7491f02a0a3d0fa.dat
@@ -359,6 +377,7 @@ files:
 - lib/mikunyan/typetrees/41cdd7329b57ba13590d9321a595218f.dat
 - lib/mikunyan/typetrees/41fae1321bd7ad1650d7cecc8b7738f4.dat
 - lib/mikunyan/typetrees/42cb37e0be59eee623e414924928a40b.dat
+- lib/mikunyan/typetrees/434b934f757d042e20f52d8c2ae20843.dat
 - lib/mikunyan/typetrees/43688f077be008681d7eb9c994a18319.dat
 - lib/mikunyan/typetrees/43796121850ca62303af099e74b78099.dat
 - lib/mikunyan/typetrees/439e66a89c7fdef6f0927c9256c0773a.dat
@@ -377,10 +396,12 @@ files:
 - lib/mikunyan/typetrees/47ec19649a1286158a8473b98a437ad9.dat
 - lib/mikunyan/typetrees/4837f860c05f8a94a4f956b92e3dad20.dat
 - lib/mikunyan/typetrees/4855c8964e40430d995b0b5a16b06c29.dat
+- lib/mikunyan/typetrees/486ba4e15dbd6aea8ac1a064305889c8.dat
 - lib/mikunyan/typetrees/486fa2a06d3c4322486ff9d1ae9a91d8.dat
 - lib/mikunyan/typetrees/48d16bd72d4e00f18fcf7f164ca78fcf.dat
 - lib/mikunyan/typetrees/4978b2bc5bfb76f1d26d687ea1bd8be3.dat
 - lib/mikunyan/typetrees/49bb43122aea696618d75afae92c2b3d.dat
+- lib/mikunyan/typetrees/49ff511929094ac12ffaa4ab38ed7bd1.dat
 - lib/mikunyan/typetrees/4b93aa1a138b912b0c421019169acf04.dat
 - lib/mikunyan/typetrees/4bb640239fe9179b3fe914ef2ad73248.dat
 - lib/mikunyan/typetrees/4bfc6b1eb274517782a296ebc8d1af84.dat
@@ -390,6 +411,7 @@ files:
 - lib/mikunyan/typetrees/4c9efaab9658908236c454765ba987c8.dat
 - lib/mikunyan/typetrees/4d47eb52c44b5042b1d33f9885218658.dat
 - lib/mikunyan/typetrees/4da3f794df175c929b97594573801119.dat
+- lib/mikunyan/typetrees/4dbfaa1def6adb569b550804b19b4305.dat
 - lib/mikunyan/typetrees/4e2656508795cad0cb5c8aa02bd550b6.dat
 - lib/mikunyan/typetrees/4e3ad1f5059719dbf410367459b499a5.dat
 - lib/mikunyan/typetrees/4e588b6332554634ea7e07f6680f0582.dat
@@ -424,6 +446,7 @@ files:
 - lib/mikunyan/typetrees/5aa0b5d1e3115ca6e2087ab05a7bba32.dat
 - lib/mikunyan/typetrees/5b1b6bf0de1c285996cbfcf535f79a8b.dat
 - lib/mikunyan/typetrees/5bbb1d896df4d71b93d2eb023283c967.dat
+- lib/mikunyan/typetrees/5bc42b93159267aabba724a6a7923603.dat
 - lib/mikunyan/typetrees/5bcd76d798e7b9f2f3ffd398fd2aa6d0.dat
 - lib/mikunyan/typetrees/5be518883c8348ae95891bc413f25d9a.dat
 - lib/mikunyan/typetrees/5c5443aa48dc982498dc45b407dd366c.dat
@@ -461,6 +484,7 @@ files:
 - lib/mikunyan/typetrees/64eff32a9399a62c0c1ff38ffc206094.dat
 - lib/mikunyan/typetrees/657663fcc23615b4f420398b9cf66800.dat
 - lib/mikunyan/typetrees/65d43587d7c352e4bd0630c5e2d2b298.dat
+- lib/mikunyan/typetrees/66405447c6973a81e978410c391172fe.dat
 - lib/mikunyan/typetrees/66699f4e7c97d82ff8b9383b2509b87e.dat
 - lib/mikunyan/typetrees/668204d5ecec40adf49520ed6a9025d2.dat
 - lib/mikunyan/typetrees/66c04efe53dbe7127cfdf869a8f95b15.dat
@@ -476,7 +500,10 @@ files:
 - lib/mikunyan/typetrees/6883009ec58a82ea61000b9c42c5c162.dat
 - lib/mikunyan/typetrees/68d2447015cd020e38d89e52e297f90b.dat
 - lib/mikunyan/typetrees/68dffa1eee93c91703996387b600aa7e.dat
+- lib/mikunyan/typetrees/6932d6d1d46264c8680a181056f98be2.dat
+- lib/mikunyan/typetrees/6974f6c74321933ec4ba7437a55be2c3.dat
 - lib/mikunyan/typetrees/69930e70a6ce1751fde0232474bd6ee0.dat
+- lib/mikunyan/typetrees/69b01db128625aa95f1f92fb890ff045.dat
 - lib/mikunyan/typetrees/69c8dbb0802cc4bc9be68d5c7309b764.dat
 - lib/mikunyan/typetrees/69d2caf8f9638b6169d920c89d9ef16f.dat
 - lib/mikunyan/typetrees/6a315ab47bbb18fc937ba08523937b61.dat
@@ -502,6 +529,7 @@ files:
 - lib/mikunyan/typetrees/6ed2fb56a9c16fd1781896a923bc5110.dat
 - lib/mikunyan/typetrees/6ef34d0e751e6b1699a5ea302b822e33.dat
 - lib/mikunyan/typetrees/6f0618d26354f0289c7090aaf688981a.dat
+- lib/mikunyan/typetrees/6f10d8f832d5adde6982d4515b3f0bb3.dat
 - lib/mikunyan/typetrees/6f5cd06250f9dcc3ca6c3bca26c54a4a.dat
 - lib/mikunyan/typetrees/6fe7137b38c0f129e598c03aabcd1b7d.dat
 - lib/mikunyan/typetrees/706686d4d71b0e1bf7c80acdaa4ee6f5.dat
@@ -527,8 +555,10 @@ files:
 - lib/mikunyan/typetrees/75d2f1d383a6d305cf13e74d9fbcbe27.dat
 - lib/mikunyan/typetrees/75e5f675169cf0850fafafa08a65cb38.dat
 - lib/mikunyan/typetrees/7602eb8dc1aab6b53a21f0eec61dcf50.dat
+- lib/mikunyan/typetrees/761ca81f78491542badc37f810ab3455.dat
 - lib/mikunyan/typetrees/762765b0cbe6e45e90e5327a46f736f3.dat
 - lib/mikunyan/typetrees/766ecf7bc48297e7896ab27f26a20718.dat
+- lib/mikunyan/typetrees/76ce55d4dbaf38f5c674ea9f0a344951.dat
 - lib/mikunyan/typetrees/76f4b627feb164db63eb7309397cc41c.dat
 - lib/mikunyan/typetrees/774f723655447fbac1acb3d6e2efe779.dat
 - lib/mikunyan/typetrees/77e140a777f2dcacb51121e0a5bd1f53.dat
@@ -558,6 +588,7 @@ files:
 - lib/mikunyan/typetrees/7d2188e085d3917ebec9a1067d74de59.dat
 - lib/mikunyan/typetrees/7d7186ff509eeb1be635ead41f130cbb.dat
 - lib/mikunyan/typetrees/7db9444f76a2b8f439e4581d2274d36b.dat
+- lib/mikunyan/typetrees/7e050781d08ca9d10bc74beb7e91c3b5.dat
 - lib/mikunyan/typetrees/7e328a225b72b97191b52d631ccf62d2.dat
 - lib/mikunyan/typetrees/7ec49b5572da843e0e7d21ab5459a2da.dat
 - lib/mikunyan/typetrees/7ef50d120c6291f8451b25ad8abf0965.dat
@@ -571,6 +602,7 @@ files:
 - lib/mikunyan/typetrees/80ba7945b19e87c90c6aa46fb4c7b9b2.dat
 - lib/mikunyan/typetrees/8146f1f01d4bf220c339260799ed1bb6.dat
 - lib/mikunyan/typetrees/818ddfe606de30c07daa36d729f982e2.dat
+- lib/mikunyan/typetrees/8198e72b2e2a96b9cfa38636b5565e13.dat
 - lib/mikunyan/typetrees/81d6f63da53d28f32efd4d3f6b1d3da8.dat
 - lib/mikunyan/typetrees/81e28d3a4102fabc98ac701e6a192ad4.dat
 - lib/mikunyan/typetrees/827f095b42d421f9185c642342736534.dat
@@ -584,6 +616,8 @@ files:
 - lib/mikunyan/typetrees/8473edbc0acb04069b62cedcb384b5b3.dat
 - lib/mikunyan/typetrees/849b9d0ee2b45ed2b7ad871a6e9e7829.dat
 - lib/mikunyan/typetrees/849d2b6794bdc167b0ed4680bad500a8.dat
+- lib/mikunyan/typetrees/84c6ac46ef89030991cbbb3fd21d2889.dat
+- lib/mikunyan/typetrees/852794becbcf95f66992da2b96a69704.dat
 - lib/mikunyan/typetrees/863223fe4e4f151f9fac463e584de569.dat
 - lib/mikunyan/typetrees/86897fc97905918dc891437fa7a15696.dat
 - lib/mikunyan/typetrees/86d77ad7cf81dd25dd72cba6c8c6469f.dat
@@ -630,13 +664,17 @@ files:
 - lib/mikunyan/typetrees/94d6c861f2b382fd81a12d2a1b1e7ce2.dat
 - lib/mikunyan/typetrees/954706197f5ed745cd14444d281f1516.dat
 - lib/mikunyan/typetrees/959ce281abde8687d3ab1adce9e00f5a.dat
+- lib/mikunyan/typetrees/961be27d12d60b1b3421191d5256a876.dat
 - lib/mikunyan/typetrees/964c223b82bb8bac12cd3e53186a3e13.dat
 - lib/mikunyan/typetrees/9657457af3bc45d81a0b5871a0d18e77.dat
 - lib/mikunyan/typetrees/96785e58aac89a09fce6ca2c9448311b.dat
+- lib/mikunyan/typetrees/96a47566b4e135078f690a4a69935d58.dat
 - lib/mikunyan/typetrees/96bc046967bdbe77c417e21eb49ce1ae.dat
 - lib/mikunyan/typetrees/96c46d945b3cc21e2a5ca09659ae4ef2.dat
 - lib/mikunyan/typetrees/974cb1de01d7acb61e52fe38b84e0ee0.dat
+- lib/mikunyan/typetrees/97da5f4688e45a57c8b42d4f42497297.dat
 - lib/mikunyan/typetrees/97dc11471130df660f6d50adbeb2d686.dat
+- lib/mikunyan/typetrees/97ec0712102a3ea3f1cf8c0a4e47c070.dat
 - lib/mikunyan/typetrees/9805cf0348f163ad092ab00ca9d122d1.dat
 - lib/mikunyan/typetrees/983db003d56cd893ea50a9b80e743a79.dat
 - lib/mikunyan/typetrees/99359255da094b94c150311921ba4420.dat
@@ -656,6 +694,7 @@ files:
 - lib/mikunyan/typetrees/9d1630b1d7e3bc24abe46e5860a2a179.dat
 - lib/mikunyan/typetrees/9e0ab8d396f3249a3958dd930f81f61b.dat
 - lib/mikunyan/typetrees/9e26f96591d351c8dfe911b5dc239000.dat
+- lib/mikunyan/typetrees/9eabac6ec66ffe818e008883728fcc1b.dat
 - lib/mikunyan/typetrees/9ec70d7af96c9625d1bfca15d188b85c.dat
 - lib/mikunyan/typetrees/9ee328006f16e91aebcb4f27698f145a.dat
 - lib/mikunyan/typetrees/9f1c6f94c1da7e8f10bb554b37c6790b.dat
@@ -677,6 +716,7 @@ files:
 - lib/mikunyan/typetrees/a2dc9dbb5b830efd10b60100b47d8d36.dat
 - lib/mikunyan/typetrees/a3125dde8c910a6d078682616f144a80.dat
 - lib/mikunyan/typetrees/a3523f5739a17bb6054dde6c088584ce.dat
+- lib/mikunyan/typetrees/a372646834bcaf26eab1d21b29e39553.dat
 - lib/mikunyan/typetrees/a3c506becc8f7d25351b47778de7ebb5.dat
 - lib/mikunyan/typetrees/a3d63d57b4f43b62a77e83e05699a5f6.dat
 - lib/mikunyan/typetrees/a439ae65edce4289e3ff832904fea27d.dat
@@ -684,6 +724,7 @@ files:
 - lib/mikunyan/typetrees/a46a51168885aa63162102ca3f63007a.dat
 - lib/mikunyan/typetrees/a47e8a7b7a1ef3aba7372439af5d26a7.dat
 - lib/mikunyan/typetrees/a49b27a93f3de2ad5ef668735e5042b2.dat
+- lib/mikunyan/typetrees/a4f194097b08bc4c5019c3a4ea6f5cbd.dat
 - lib/mikunyan/typetrees/a52792d409265e0e596cf29f070ecb5d.dat
 - lib/mikunyan/typetrees/a545a5020d58adc9f675e7c540cc8528.dat
 - lib/mikunyan/typetrees/a5610d8eea1dd355fe6d1abe467ef169.dat
@@ -713,10 +754,13 @@ files:
 - lib/mikunyan/typetrees/ae12c8f4663719b3d423361a8b8a62d2.dat
 - lib/mikunyan/typetrees/aeadce2965a198a87587c0beac675004.dat
 - lib/mikunyan/typetrees/aeeebbdbd802239fdfc3aaf98ffc5d01.dat
+- lib/mikunyan/typetrees/af863b6969b9b82be9450f0574339f65.dat
 - lib/mikunyan/typetrees/af9a16c5c3d9f5104290fff6305334e2.dat
 - lib/mikunyan/typetrees/aff142075870161380a891d11baeb767.dat
 - lib/mikunyan/typetrees/b093ef1cb958a6b1cf5a00c31b6e05c4.dat
+- lib/mikunyan/typetrees/b0adafbe24f8148ebf01794ee6679925.dat
 - lib/mikunyan/typetrees/b0f22973848e1cf655dfdf8064bfa400.dat
+- lib/mikunyan/typetrees/b14bcb0865632d1b2d6e215a000e4c0f.dat
 - lib/mikunyan/typetrees/b1fe84b5bfdc47e2b1b930db296afb2f.dat
 - lib/mikunyan/typetrees/b20231c215c4c1b82b98bb49418c5cbe.dat
 - lib/mikunyan/typetrees/b204c22c22b1a08f780435c2cb4e6e36.dat
@@ -729,6 +773,7 @@ files:
 - lib/mikunyan/typetrees/b31c04cde0ffadc258d46846966594b1.dat
 - lib/mikunyan/typetrees/b3290db9f9d2e2862a1367d32838130e.dat
 - lib/mikunyan/typetrees/b354679381971a70db4d0035cc730543.dat
+- lib/mikunyan/typetrees/b35bf02952f2946208ff6b4deca3a6a9.dat
 - lib/mikunyan/typetrees/b36337bd6d2e99167473b8a383361c21.dat
 - lib/mikunyan/typetrees/b38ca8dbedd791b7ca3ca07095a9f312.dat
 - lib/mikunyan/typetrees/b38d9554723d82e3bc95c076ca902704.dat
@@ -738,8 +783,10 @@ files:
 - lib/mikunyan/typetrees/b51e06b75a0e28a9f2f242726a3814d4.dat
 - lib/mikunyan/typetrees/b53f2d12e7a6d302f50ad4162070fe13.dat
 - lib/mikunyan/typetrees/b684fb202e70b6d6c9fa64988e29576e.dat
+- lib/mikunyan/typetrees/b6bbd0e88d1feb636d89bd766ea5934f.dat
 - lib/mikunyan/typetrees/b6cc407b2d3c753bf79661a477113977.dat
 - lib/mikunyan/typetrees/b7056b24cf06fc6058b412a2c2dad2bb.dat
+- lib/mikunyan/typetrees/b78821b6aeb5b79c8961728a9f068024.dat
 - lib/mikunyan/typetrees/b79aed1f22f656993386add127833156.dat
 - lib/mikunyan/typetrees/b7b8ff0c7ec96a3bd77eabf9525d4f06.dat
 - lib/mikunyan/typetrees/b7d7910ac57c74d889686f738faa2129.dat
@@ -771,11 +818,13 @@ files:
 - lib/mikunyan/typetrees/be521590c2a7e119c31979e36c98789e.dat
 - lib/mikunyan/typetrees/be9c29138eea51e485e58ae7d0ee5eda.dat
 - lib/mikunyan/typetrees/bea7fa6dbf25a492093fec0b0b12c49f.dat
+- lib/mikunyan/typetrees/bea915a8ab3d9b55e80c969a22e692d3.dat
 - lib/mikunyan/typetrees/bf70bb56d86ace6047252688d663d8c4.dat
 - lib/mikunyan/typetrees/bf9dd695d7f2b4c1f07279f58362d4a5.dat
 - lib/mikunyan/typetrees/bfc41466cf63095c9a89e4defeea56f5.dat
 - lib/mikunyan/typetrees/c097c2178bc05715274a8513f32f5e2d.dat
 - lib/mikunyan/typetrees/c135fdff1ecf351ff2968c0c575a93fc.dat
+- lib/mikunyan/typetrees/c184743520186f546000de20f4d19736.dat
 - lib/mikunyan/typetrees/c1bd7854033214a22ac0e141089fbb2d.dat
 - lib/mikunyan/typetrees/c1e394cb8e3b83562307194fb6d429af.dat
 - lib/mikunyan/typetrees/c2c15e3018e440dfbc88ab67b75f4c1d.dat
@@ -839,6 +888,7 @@ files:
 - lib/mikunyan/typetrees/d463e5d17a1b3f4e2e2f1eb758afc38e.dat
 - lib/mikunyan/typetrees/d49ddfcb81983289b99cecbffd99d8d2.dat
 - lib/mikunyan/typetrees/d4e580aaf357b26f4871f454ab582ad2.dat
+- lib/mikunyan/typetrees/d50ed13362e98df8096b2f735131fce5.dat
 - lib/mikunyan/typetrees/d5b7bfdef1a7f9dcf49d5de2c66fb8fd.dat
 - lib/mikunyan/typetrees/d5d86f79c1252a3e0a705f20245b62b8.dat
 - lib/mikunyan/typetrees/d5e4d09396f117b44668f6c8641951fc.dat
@@ -856,7 +906,9 @@ files:
 - lib/mikunyan/typetrees/d8129cfedf80a401fc1b3ce0483b6193.dat
 - lib/mikunyan/typetrees/d819fe24897f62ed37bcd142f64cec80.dat
 - lib/mikunyan/typetrees/d82c324c1e384bdc4d7aabbdbf8dd810.dat
+- lib/mikunyan/typetrees/d871346d990bbc294d02f4c366bf1b6d.dat
 - lib/mikunyan/typetrees/d898fab65c5d063bc9112924123b5a04.dat
+- lib/mikunyan/typetrees/d8e8eeb43589ccd7019398e56f6c16b0.dat
 - lib/mikunyan/typetrees/d8f1b25bf145804bd41da2d64684d605.dat
 - lib/mikunyan/typetrees/d9333d68827fe2bdc8fa96fe1ce7999e.dat
 - lib/mikunyan/typetrees/d9b4fdc987ccf6d8f51cad51e0c670c6.dat
@@ -866,7 +918,9 @@ files:
 - lib/mikunyan/typetrees/da594265aaa32ec1513c20e38a22fa2e.dat
 - lib/mikunyan/typetrees/da773af1b759eb7b7e78287900688f5d.dat
 - lib/mikunyan/typetrees/dad240b3d990c591b278699ec10e2713.dat
+- lib/mikunyan/typetrees/daea1bb1bba6613afb2cb001ca8fa0d4.dat
 - lib/mikunyan/typetrees/dafc7f89ba2f5601cd2526021334cfcd.dat
+- lib/mikunyan/typetrees/db088f9c2f2224da9f488879467856e5.dat
 - lib/mikunyan/typetrees/db262b9303bf96c55e2659bd9160e777.dat
 - lib/mikunyan/typetrees/db26e3ff617afe3cca8a02d00552384e.dat
 - lib/mikunyan/typetrees/dbc0e1ec44a805978e86400d908d4d5a.dat
@@ -914,6 +968,7 @@ files:
 - lib/mikunyan/typetrees/e6ccb0d2545a8b68470d8d4d75d1f393.dat
 - lib/mikunyan/typetrees/e70da99ccfbec08ec2d115a9f0ef2fd5.dat
 - lib/mikunyan/typetrees/e7920ac1d49d79dc3f687686799e0ecb.dat
+- lib/mikunyan/typetrees/e7c5c01b0369574e9346ce846e1e8e63.dat
 - lib/mikunyan/typetrees/e81731c627c30de466ff682b23d7c632.dat
 - lib/mikunyan/typetrees/e82f8100e40450d13763382e74934faa.dat
 - lib/mikunyan/typetrees/e8745221bf0bd118c59f77acbe2de613.dat
@@ -952,6 +1007,7 @@ files:
 - lib/mikunyan/typetrees/f0dca30b01b82a4ab96277658e0d881b.dat
 - lib/mikunyan/typetrees/f0e0e320fc2816897ac3195551d8e4c5.dat
 - lib/mikunyan/typetrees/f0e3106a5e7d38edfe031abc0c11ce2a.dat
+- lib/mikunyan/typetrees/f123b055a61dfa7dc679d78cdaecd383.dat
 - lib/mikunyan/typetrees/f18647acbd67659ea3f45a97872f757b.dat
 - lib/mikunyan/typetrees/f1d3f171c0a6aa755d45ffe681516b65.dat
 - lib/mikunyan/typetrees/f2357d4424504d3797409ff6565e8e68.dat
@@ -980,12 +1036,14 @@ files:
 - lib/mikunyan/typetrees/f811a923135bc4ee86dd31237b2ab06a.dat
 - lib/mikunyan/typetrees/f8377d7fe2ca5564e137d9f82a5b7fe5.dat
 - lib/mikunyan/typetrees/f83f9a801dfbac3b28bcee57ff29182f.dat
+- lib/mikunyan/typetrees/f92d618c5266ea3a8ca770b6eca728c8.dat
 - lib/mikunyan/typetrees/f983b0102ccb04ded5fd745943e862be.dat
 - lib/mikunyan/typetrees/f9a5bbb8c5391b4f94fc32542ab1f981.dat
 - lib/mikunyan/typetrees/faa71a41455d0e928529ff5b0b036af3.dat
 - lib/mikunyan/typetrees/fab5d0fd4c471ada3931c6ec7cf983ec.dat
 - lib/mikunyan/typetrees/fab9ae76e42df0fda7b88a0b103ac202.dat
 - lib/mikunyan/typetrees/face58ace35dbc4d23883cc9f9625a4f.dat
+- lib/mikunyan/typetrees/fad2d0a58e9174708176102b418facf1.dat
 - lib/mikunyan/typetrees/faf23bf08eb2a9759598748b2ed55c7a.dat
 - lib/mikunyan/typetrees/fb0635f60817266fc2448281f0e1bf8e.dat
 - lib/mikunyan/typetrees/fb734904d47701a0f2042181d6018c2f.dat
@@ -1008,6 +1066,7 @@ files:
 - lib/mikunyan/typetrees/feb462635cb14d7fc886781f76647359.dat
 - lib/mikunyan/typetrees/febce05d662e846d44276cb3ead554a9.dat
 - lib/mikunyan/typetrees/fefc3f27b196eb018086c22cba376f75.dat
+- lib/mikunyan/typetrees/ff001a2e51937aa5add9eaf9cd3d8ae4.dat
 - lib/mikunyan/typetrees/ff382d6c2780a3e68481688cce904104.dat
 - lib/mikunyan/typetrees/ff3a8cf3da343f8722464c416e3479ee.dat
 - lib/mikunyan/typetrees/ff8fa01e9243c910f7d7301b7586a1b1.dat

data/lib/mikunyan/decoders/astc_block_decoder.rb

@@ -1,526 +0,0 @@
-require 'bin_utils'
-require 'fiddle'
-
-module Mikunyan
-    module DecodeHelper
-        # Class for decode ASTC block
-        # @attr_reader [String] data decoded data
-        class AstcBlockDecoder
-            attr_reader :data
-
-            # Decode block
-            # @param [String] bin binary
-            # @param [Integer] bw block width
-            # @param [Integer] bh block height
-            def initialize(bin, bw, bh)
-                if bin[0].ord == 0xfc && bin[1].ord % 2 == 1
-                    @data = (bin[9] + bin[11] + bin[13] + bin[15]) * bw * bh
-                else
-                    @d2 = BinUtils.get_int64_le(bin)
-                    @d1 = BinUtils.get_int64_le(bin, 8)
-                    @bw = bw
-                    @bh = bh
-
-                    decode_block_params
-                    decode_endpoints
-                    decode_weights
-                    select_partition
-                    applicate_color
-                end
-            end
-
-            private
-
-            WeightPrecTableA = [nil, nil, 0, 3, 0, 5, 3, 0, nil, nil, 5, 3, 0, 5, 3, 0]
-            WeightPrecTableB = [nil, nil, 1, 0, 2, 0, 1, 3, nil, nil, 1, 2, 4, 2, 3, 5]
-
-            CemTableA = [0, 0, 3, 0, 5, 3, 0, 5, 3, 0, 5, 3, 0, 5, 3, 0, 5, 3, 0]
-            CemTableB = [1, 2, 1, 3, 1, 2, 4, 2, 3, 5, 3, 4, 6, 4, 5, 7, 5, 6, 8]
-
-            TritsTable = [
-                [0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 1, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 1, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 2, 2],
-                [0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 0, 0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 0, 0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1],
-                [0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2],
-                [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2],
-                [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
-            ]
-
-            QuintsTable = [
-                [0, 1, 2, 3, 4, 0, 4, 4, 0, 1, 2, 3, 4, 1, 4, 4, 0, 1, 2, 3, 4, 2, 4, 4, 0, 1, 2, 3, 4, 3, 4, 4, 0, 1, 2, 3, 4, 0, 4, 0, 0, 1, 2, 3, 4, 1, 4, 1, 0, 1, 2, 3, 4, 2, 4, 2, 0, 1, 2, 3, 4, 3, 4, 3, 0, 1, 2, 3, 4, 0, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 0, 1, 2, 3, 4, 2, 2, 3, 0, 1, 2, 3, 4, 3, 2, 3, 0, 1, 2, 3, 4, 0, 0, 1, 0, 1, 2, 3, 4, 1, 0, 1, 0, 1, 2, 3, 4, 2, 0, 1, 0, 1, 2, 3, 4, 3, 0, 1],
-                [0, 0, 0, 0, 0, 4, 4, 4, 1, 1, 1, 1, 1, 4, 4, 4, 2, 2, 2, 2, 2, 4, 4, 4, 3, 3, 3, 3, 3, 4, 4, 4, 0, 0, 0, 0, 0, 4, 0, 4, 1, 1, 1, 1, 1, 4, 1, 4, 2, 2, 2, 2, 2, 4, 2, 4, 3, 3, 3, 3, 3, 4, 3, 4, 0, 0, 0, 0, 0, 4, 0, 0, 1, 1, 1, 1, 1, 4, 1, 1, 2, 2, 2, 2, 2, 4, 2, 2, 3, 3, 3, 3, 3, 4, 3, 3, 0, 0, 0, 0, 0, 4, 0, 0, 1, 1, 1, 1, 1, 4, 1, 1, 2, 2, 2, 2, 2, 4, 2, 2, 3, 3, 3, 3, 3, 4, 3, 3],
-                [0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 1, 4, 0, 0, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 0, 0, 3, 4, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 1, 1, 4, 4, 2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 4, 4, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 4, 4]
-            ]
-
-            def [](i, j = 1)
-                if j < 1
-                    0
-                elsif j == 1
-                    i < 64 ? @d2[i] : @d1[i - 64]
-                else
-                    if i + j <= 64
-                        @d2 >> i & (1 << j) - 1
-                    elsif i >= 64
-                        @d1 >> (i - 64) & (1 << j) - 1
-                    else
-                        @d2 >> i | (@d1 & (1 << i + j - 64) - 1) << 64 - i
-                    end
-                end
-            end
-
-            def decode_block_params
-                # Block Mode
-                @weight_range = @d2 >> 4 & 1 | @d2 >> 6 & 8
-                @dual_plane = @d2 & 0x400 == 0x400
-                if @d2 & 0x3 != 0
-                    @weight_range |= @d2 << 1 & 6
-                    case @d2 & 0xc
-                    when 0
-                        @width = (@d2 >> 7 & 3) + 4
-                        @height = (@d2 >> 5 & 3) + 2
-                    when 0x4
-                        @width = (@d2 >> 7 & 3) + 8
-                        @height = (@d2 >> 5 & 3) + 2
-                    when 0x8
-                        @width = (@d2 >> 5 & 3) + 2
-                        @height = (@d2 >> 7 & 3) + 8
-                    else # 0xc
-                        if @d2 & 0x100 == 0
-                            @width = (@d2 >> 5 & 3) + 2
-                            @height = @d2[7] + 6
-                        else
-                            @width = @d2[7] + 2
-                            @height = (@d2 >> 5 & 3) + 2
-                        end
-                    end
-                else
-                    @weight_range |= @d2 >> 1 & 6
-                    case @d2 & 0x180
-                    when 0
-                        @width = 12
-                        @height = (@d2 >> 5 & 3) + 2
-                    when 0x80
-                        @width = (@d2 >> 5 & 3) + 2
-                        @height = 12
-                    when 0x180
-                        @width = (@d2 & 0x20 == 0) ? 6 : 10
-                        @height = 16 - @width
-                    else # 0x100
-                        @width = (@d2 >> 5 & 3) + 6
-                        @height = (@d2 >> 9 & 3) + 6
-                        @dual_plane = false
-                        @weight_range &= 7
-                    end
-                end
-
-                # Count Partitions
-                @part_num = (@d2 >> 11 & 3) + 1
-
-                # Count Weight Bits
-                @weight_num = @width * @height
-                @weight_num *= 2 if @dual_plane
-                case WeightPrecTableA[@weight_range]
-                when 3
-                    @weight_bit = @weight_num * WeightPrecTableB[@weight_range] + (@weight_num * 8 + 4) / 5
-                when 5
-                    @weight_bit = @weight_num * WeightPrecTableB[@weight_range] + (@weight_num * 7 + 2) / 3
-                else # 0
-                    @weight_bit = @weight_num * WeightPrecTableB[@weight_range]
-                end
-
-                # CEM
-                if @part_num == 1
-                    @cem = [@d2 >> 13 & 0xf]
-                    config_bit = 17
-                else
-                    cembase = @d2 >> 23 & 3
-                    if cembase == 0
-                        @cem = Array.new(@part_num, @d2 >> 25 & 0xf)
-                        config_bit = 29
-                    else
-                        @cem = (0...@part_num).map{|i| ((@d2 >> (25 + i) & 1) + cembase - 1) << 2}
-
-                        case @part_num
-                        when 2
-                            @cem[0] |= @d2 >> 27 & 3
-                            @cem[1] |= self[126 - @weight_bit, 2]
-                        when 3
-                            @cem[0] |= @d2[28]
-                            @cem[0] |= self[123 - @weight_bit] << 1
-                            @cem[1] |= self[124 - @weight_bit, 2]
-                            @cem[2] |= self[126 - @weight_bit, 2]
-                        else # 4
-                            4.times do |i|
-                                @cem[i] |= self[120 + 2 * i - @weight_bit, 2]
-                            end
-                        end
-
-                        config_bit = 25 + @part_num * 3
-                    end
-                end
-
-                # Count Color Endpoint Bits
-                config_bit += 2 if @dual_plane
-                remain_bit = 128 - config_bit - @weight_bit
-                @cem_num = @cem.map{|i| (i >> 1 & 6) + 2}.inject(:+)
-
-                CemTableA.count.times do |n|
-                    i = CemTableA.count - n - 1
-                    case CemTableA[i]
-                    when 3
-                        @cem_bit = @cem_num * CemTableB[i] + (@cem_num * 8 + 4) / 5
-                    when 5
-                        @cem_bit = @cem_num * CemTableB[i] + (@cem_num * 7 + 2) / 3
-                    else # 0
-                        @cem_bit = @cem_num * CemTableB[i]
-                    end
-
-                    if @cem_bit <= remain_bit
-                        @cem_range = i
-                        break
-                    end
-                end
-
-                if @dual_plane
-                    if @part_num == 1 || cembase == 0
-                        @plane_selector = self[126 - @weight_bit, 2]
-                    else
-                        @plane_selector = self[130 - @weight_bit - @part_num * 3, 2]
-                    end
-                end
-            end
-
-            def decode_endpoints
-                values = decode_intseq_raw(self[@part_num == 1 ? 17 : 29, @cem_bit], CemTableA[@cem_range], CemTableB[@cem_range], @cem_num).map do |e|
-                    unquantize_endpoint(CemTableA[@cem_range], CemTableB[@cem_range], e[0], e[1])
-                end
-
-                @endpoint = @cem.map do |cem|
-                    v = values.slice!(0, (cem >> 1 & 6) + 2)
-                    case cem
-                    when 0
-                        [v[0], v[0], v[0], 255, v[1], v[1], v[1], 255]
-                    when 1
-                        l0 = (v[0] >> 2) | (v[1] & 0xc0)
-                        l1 = (l0 + (v[1] & 0x3f)).clamp(0, 255)
-                        [l0, l0, l0, 255, l1, l1, l1, 255]
-                    when 4
-                        [v[0], v[0], v[0], v[2], v[1], v[1], v[1], v[3]]
-                    when 5
-                        v[1], v[0] = bit_transfer_signed(v[1], v[0])
-                        v[3], v[2] = bit_transfer_signed(v[3], v[2])
-                        [v[0], v[0], v[0], v[2], v[0] + v[1], v[0] + v[1], v[0] + v[1], v[2] + v[3]].map{|i| i.clamp(0, 255)}
-                    when 6
-                        [v[0] * v[3] >> 8, v[1] * v[3] >> 8, v[2] * v[3] >> 8, 255, v[0], v[1], v[2], 255]
-                    when 8
-                        if v[0] + v[2] + v[4] <= v[1] + v[3] + v[5]
-                            [v[0], v[2], v[4], 255, v[1], v[3], v[5], 255]
-                        else
-                            blue_contract(v[1], v[3], v[5], 255, v[0], v[2], v[4], 255)
-                        end
-                    when 9
-                        v[1], v[0] = bit_transfer_signed(v[1], v[0])
-                        v[3], v[2] = bit_transfer_signed(v[3], v[2])
-                        v[5], v[4] = bit_transfer_signed(v[5], v[4])
-                        if v[1] + v[3] + v[5] >= 0
-                            [v[0], v[2], v[4], 255, v[0] + v[1], v[2] + v[3], v[4] + v[5], 255].map{|i| i.clamp(0, 255)}
-                        else
-                            blue_contract(v[0] + v[1], v[2] + v[3], v[4] + v[5], 255, v[0], v[2], v[4], 255).map{|i| i.clamp(0, 255)}
-                        end
-                    when 10
-                        [v[0] * v[3] >> 8, v[1] * v[3] >> 8, v[2] * v[3] >> 8, v[4], v[0], v[1], v[2], v[5]]
-                    when 12
-                        if v[0] + v[2] + v[4] <= v[1] + v[3] + v[5]
-                            [v[0], v[2], v[4], v[6], v[1], v[3], v[5], v[7]]
-                        else
-                            blue_contract(v[1], v[3], v[5], v[7], v[0], v[2], v[4], v[6])
-                        end
-                    when 13
-                        v[1], v[0] = bit_transfer_signed(v[1], v[0])
-                        v[3], v[2] = bit_transfer_signed(v[3], v[2])
-                        v[5], v[4] = bit_transfer_signed(v[5], v[4])
-                        v[7], v[6] = bit_transfer_signed(v[7], v[6])
-                        if v[1] + v[3] + v[5] >= 0
-                            [v[0], v[2], v[4], v[6], v[0] + v[1], v[2] + v[3], v[4] + v[5], v[6] + v[7]].map{|i| i.clamp(0, 255)}
-                        else
-                            blue_contract(v[0] + v[1], v[2] + v[3], v[4] + v[5], v[6] + v[7], v[0], v[2], v[4], v[6]).map{|i| i.clamp(0, 255)}
-                        end
-                    else
-                        throw NotImplementedError.new("HDR image is not supported. (CEM: #{cem})")
-                    end
-                end
-            end
-
-            def bit_transfer_signed(a, b)
-                b = (b >> 1) | (a & 0x80)
-                a = (a >> 1) & 0x3f
-                [a[5] == 1 ? a - 0x40 : a, b]
-            end
-
-            def blue_contract(r1, g1, b1, a1, r2, g2, b2, a2)
-                [(r1 + b1) >> 1, (g1 + b1) >> 1, b1, a1, (r2 + b2) >> 1, (g2 + b2) >> 1, b2, a2]
-            end
-
-            def decode_weights
-                data = (0...(@weight_bit + 7) / 8).map{|i| (((self[120 - i * 8, 8]) * 0x80200802) & 0x0884422110) * 0x0101010101 >> 32 & 0xff}
-                    .map.with_index{|e, i| e << i * 8}.inject(:|) & (1 << @weight_bit) - 1
-
-                weight_point = decode_intseq_raw(data, WeightPrecTableA[@weight_range], WeightPrecTableB[@weight_range], @weight_num).map do |e|
-                    unquantize_weight(WeightPrecTableA[@weight_range], WeightPrecTableB[@weight_range], e[0], e[1])
-                end
-
-                ds = (1024 + @bw / 2) / (@bw - 1)
-                dt = (1024 + @bh / 2) / (@bh - 1)
-
-                if @dual_plane
-                    @weight0 = Fiddle::Pointer.malloc(@bw * @bh)
-                    @weight1 = Fiddle::Pointer.malloc(@bw * @bh)
-
-                    for t in 0...@bh
-                        for s in 0...@bw
-                            gs = (ds * s * (@width - 1) + 32) >> 6
-                            gt = (dt * t * (@height - 1) + 32) >> 6
-                            fs = gs & 0xf
-                            ft = gt & 0xf
-                            v = (gs >> 4) + (gt >> 4) * @width
-                            w11 = (fs * ft + 8) >> 4
-                            w10 = ft - w11
-                            w01 = fs - w11
-                            w00 = 16 - fs - ft + w11
-
-                            p00 = weight_point[v * 2] || 0
-                            p01 = weight_point[(v + 1) * 2] || 0
-                            p10 = weight_point[(v + @width) * 2] || 0
-                            p11 = weight_point[(v + @width + 1) * 2] || 0
-                            @weight0[s + t * @bw] = (p00 * w00 + p01 * w01 + p10 * w10 + p11 * w11 + 8) >> 4
-
-                            p00 = weight_point[v * 2 + 1] || 0
-                            p01 = weight_point[(v + 1) * 2 + 1] || 0
-                            p10 = weight_point[(v + @width) * 2 + 1] || 0
-                            p11 = weight_point[(v + @width + 1) * 2 + 1] || 0
-                            @weight1[s + t * @bw] = (p00 * w00 + p01 * w01 + p10 * w10 + p11 * w11 + 8) >> 4
-                        end
-                    end
-                else
-                    @weight = Fiddle::Pointer.malloc(@bw * @bh)
-
-                    for t in 0...@bh
-                        for s in 0...@bw
-                            gs = (ds * s * (@width - 1) + 32) >> 6
-                            gt = (dt * t * (@height - 1) + 32) >> 6
-                            fs = gs & 0xf
-                            ft = gt & 0xf
-                            v = (gs >> 4) + (gt >> 4) * @width
-                            w11 = (fs * ft + 8) >> 4
-
-                            p00 = weight_point[v] || 0
-                            p01 = weight_point[v + 1] || 0
-                            p10 = weight_point[v + @width] || 0
-                            p11 = weight_point[v + @width + 1] || 0
-                            @weight[s + t * @bw] = (p00 * (16 - fs - ft + w11) + p01 * (fs - w11) + p10 * (ft - w11) + p11 * w11 + 8) >> 4
-                        end
-                    end
-                end
-            end
-
-            def select_partition
-                if @part_num > 1
-                    small_block = @bw * @bh < 31
-
-                    seed = (@d2 >> 13 & 0x3ff) | ((@part_num - 1) << 10)
-
-                    rnum = seed
-                    rnum ^= (rnum >> 15)
-                    rnum = (rnum - (rnum << 17)) & 0xffffffff
-                    rnum = (rnum + (rnum << 7)) & 0xffffffff
-                    rnum = (rnum + (rnum << 4)) & 0xffffffff
-                    rnum ^= rnum >> 5
-                    rnum = (rnum + (rnum << 16)) & 0xffffffff
-                    rnum ^= rnum >> 7
-                    rnum ^= rnum >> 3
-                    rnum = (rnum ^ (rnum << 6)) & 0xffffffff
-                    rnum = rnum ^ (rnum >> 17)
-
-                    seeds = [0, 4, 8, 12, 16, 20, 24, 28].map{|i| (rnum >> i) & 0xf}.map!{|e| e * e}
-                    sh = [seed & 2 == 2 ? 4 : 5, @part_num == 3 ? 6 : 5]
-                    sh.reverse! if seed & 1 == 0
-                    seeds.map!.with_index{|e, i| e >> sh[i % 2]}
-
-                    @partition = (0...@bw * @bh).map do |i|
-                        x = i % @bw
-                        y = i / @bw
-                        if small_block
-                            x <<= 1
-                            y <<= 1
-                        end
-
-                        a = (seeds[0] * x + seeds[1] * y + (rnum >> 14)) & 0x3f
-                        b = (seeds[2] * x + seeds[3] * y + (rnum >> 10)) & 0x3f
-                        c = @part_num < 3 ? 0 : (seeds[4] * x + seeds[5] * y + (rnum >> 6)) & 0x3f
-                        d = @part_num < 4 ? 0 : (seeds[6] * x + seeds[7] * y + (rnum >> 2)) & 0x3f
-
-                        3 - [d, c, b, a].each_with_index.max[1]
-                    end
-                end
-            end
-
-            def applicate_color
-                mem = Fiddle::Pointer.malloc(@bw * @bh * 4)
-
-                if @dual_plane
-                    plane_arr = [0, 1, 2, 3]
-                    plane_arr.delete_at(@plane_selector)
-
-                    if @partition
-                        (@bw * @bh).times do |i|
-                            part = @partition[i]
-                            plane_arr.each{|c| mem[i * 4 + c] = select_color(@endpoint[part][c], @endpoint[part][4 + c], @weight0[i])}
-                            mem[i * 4 + @plane_selector] = select_color(@endpoint[part][@plane_selector], @endpoint[part][4 + @plane_selector], @weight1[i])
-                        end
-                    else
-                        (@bw * @bh).times do |i|
-                            plane_arr.each{|c| mem[i * 4 + c] = select_color(@endpoint[0][c], @endpoint[0][4 + c], @weight0[i])}
-                            mem[i * 4 + @plane_selector] = select_color(@endpoint[0][@plane_selector], @endpoint[0][4 + @plane_selector], @weight1[i])
-                        end
-                    end
-                elsif @partition
-                    (@bw * @bh).times do |i|
-                        part = @partition[i]
-                        4.times{|c| mem[i * 4 + c] = select_color(@endpoint[part][c], @endpoint[part][4 + c], @weight[i])}
-                    end
-                else
-                    (@bw * @bh).times do |i|
-                        4.times{|c| mem[i * 4 + c] = select_color(@endpoint[0][c], @endpoint[0][4 + c], @weight[i])}
-                    end
-                end
-
-                @data = mem.to_str
-            end
-
-            def select_color(v0, v1, weight)
-                v0 |= v0 << 8
-                v1 |= v1 << 8
-                v = (v0 * (64 - weight) + v1 * weight + 32) >> 6
-                (v * 255 + 32768) / 65536
-            end
-
-            def decode_intseq_raw(data, a, b, count)
-                mask = (1 << b) - 1
-                case a
-                when 3
-                    rc = (count + 4) / 5
-                    ret = Array.new(rc * 5)
-                    m = [0, 2 + b, 4 + b * 2, 5 + b * 3, 7 + b * 4]
-                    rc.times do |i|
-                        t = (data >> b & 3) | (data >> b * 2 & 0xc) | (data >> b * 3 & 0x10) | (data >> b * 4 & 0x60) | (data >> b * 5 & 0x80)
-                        5.times do |j|
-                            ret[i * 5 + j] = [data >> m[j] & mask, TritsTable[j][t]]
-                        end
-                        data >>= b * 5 + 8
-                    end
-                    ret[0, count]
-                when 5
-                    rc = (count + 2) / 3
-                    ret = Array.new(rc * 3)
-                    m = [0, 3 + b, 5 + b * 2]
-                    rc.times do |i|
-                        q = (data >> b & 7) | (data >> b * 2 & 0x18) | (data >> b * 3 & 0x60)
-                        3.times do |j|
-                            ret[i * 3 + j] = [data >> m[j] & mask, QuintsTable[j][q]]
-                        end
-                        data >>= b * 3 + 7
-                    end
-                    ret[0, count]
-                else # 0
-                    (0...count).map do |i|
-                        [data >> b * i & mask, 0]
-                    end
-                end
-            end
-
-            def unquantize_endpoint(a, b, bit, val_d)
-                if a == 0
-                    case b
-                    when 1
-                        bit * 0xff
-                    when 2
-                        bit * 0x55
-                    when 3
-                        bit << 5 | bit << 2 | bit >> 1
-                    when 4
-                        bit << 4 | bit
-                    when 5
-                        bit << 3 | bit >> 2
-                    when 6
-                        bit << 2 | bit >> 4
-                    when 7
-                        bit << 1 | bit >> 6
-                    else # 8
-                        bit
-                    end
-                else
-                    val_a = (bit & 1) * 0x1ff
-                    tmp_b = bit >> 1
-                    case b
-                    when 1
-                        val_b = 0
-                        val_c = a == 3 ? 204 : 113
-                    when 2
-                        val_b = a == 3 ? (0b100010110) * tmp_b : (0b100001100) * tmp_b
-                        val_c = a == 3 ? 93 : 54
-                    when 3
-                        val_b = a == 3 ? tmp_b << 7 | tmp_b << 2 | tmp_b : tmp_b << 7 | tmp_b << 1 | tmp_b >> 1
-                        val_c = a == 3 ? 44 : 26
-                    when 4
-                        val_b = tmp_b << 6 | tmp_b >> (a == 3 ? 0 : 1)
-                        val_c = a == 3 ? 22 : 13
-                    when 5
-                        val_b = tmp_b << 5 | tmp_b >> (a == 3 ? 2 : 3)
-                        val_c = a == 3 ? 11 : 6
-                    else # 6
-                        val_b = tmp_b << 4 | tmp_b >> 4
-                        val_c = 5
-                    end
-                    t = val_d * val_c + val_b
-                    t ^= val_a
-                    (val_a & 0x80) | (t >> 2)
-                end
-            end
-
-            def unquantize_weight(a, b, bit, val_d)
-                if a == 0
-                    case b
-                    when 1
-                        t = bit == 1 ? 63 : 0
-                    when 2
-                        t = bit << 4 | bit << 2 | bit
-                    when 3
-                        t = bit << 3 | bit
-                    when 4
-                        t = bit << 2 | bit >> 2
-                    else # 5
-                        t = bit << 1 | bit >> 4
-                    end
-                elsif b == 0
-                    t = (a == 3 ? [0, 32, 63] : [0, 16, 32, 47, 63])[val_d]
-                else
-                    val_a = (bit & 1) * 0x7f
-                    case b
-                    when 1
-                        val_b = 0
-                        val_c = a == 3 ? 50 : 28
-                    when 2
-                        val_b = (a == 3 ? 0b1000101 : 0b1000010) * bit[1]
-                        val_c = a == 3 ? 23 : 13
-                    else # 3
-                        val_b = (bit << 4 | bit >> 1) & 0b1100011
-                        val_c = 11
-                    end
-                    t = val_d * val_c + val_b
-                    t ^= val_a
-                    t = (val_a & 0x20) | (t >> 2)
-                end
-                t > 32 ? t + 1 : t
-            end
-        end
-    end
-end