Arithmetic coding/As a generalized change of radix: Difference between revisions

Content added Content deleted

Inline

@@ Line 71: / Line 71: @@
     // Lower bound
-    auto lower = BigInt("0");
+    BigInt lower = 0;
     // Product of all frequencies
-    auto pf = BigInt("1");
+    BigInt pf = 1;
     // Each term is multiplied by the product of the
@@ Line 109: / Line 109: @@
     BigInt enc = num * bigPow(powr, pow);
-    auto base = BigInt("0");
+    BigInt base = 0;
     foreach (v; freq) {
         base += v;
@@ Line 137: / Line 137: @@
     for (BigInt i=base-1; i>=0; i--) {
         pow = bigPow(base, i);
-        assert(pow != 0, "WAT");
         auto div = enc / pow;