Adding multi dimensional interpolation and test file.

src/function.js

@@ -20,6 +20,7 @@ var PDFFunction = (function pdfFunction() {
       var array = [];
       var codeSize = 0;
       var codeBuf = 0;
+      var sampleMul = 1.0 / (Math.pow(2.0, bps) - 1);
 
       var strBytes = str.getBytes((length * bps + 7) / 8);
       var strIdx = 0;
@@ -30,7 +31,7 @@ var PDFFunction = (function pdfFunction() {
           codeSize += 8;
         }
         codeSize -= bps;
-        array.push(codeBuf >> codeSize);
+        array.push((codeBuf >> codeSize) * sampleMul);
         codeBuf &= (1 << codeSize) - 1;
       }
       return array;
@@ -76,6 +77,17 @@ var PDFFunction = (function pdfFunction() {
     },
 
     constructSampled: function pdfFunctionConstructSampled(str, dict) {
+      function toMultiArray(arr) {
+        var inputLength = arr.length;
+        var outputLength = arr.length / 2;
+        var out = new Array(outputLength);
+        var index = 0;
+        for (var i = 0; i < inputLength; i += 2) {
+          out[index] = [arr[i], arr[i + 1]];
+          ++index;
+        }
+        return out;
+      }
       var domain = dict.get('Domain');
       var range = dict.get('Range');
 
@@ -85,9 +97,8 @@ var PDFFunction = (function pdfFunction() {
       var inputSize = domain.length / 2;
       var outputSize = range.length / 2;
 
-      if (inputSize != 1)
+      domain = toMultiArray(domain);
-        error('No support for multi-variable inputs to functions: ' +
+      range = toMultiArray(range);
-              inputSize);
 
       var size = dict.get('Size');
       var bps = dict.get('BitsPerSample');
@@ -105,15 +116,36 @@ var PDFFunction = (function pdfFunction() {
           encode.push(size[i] - 1);
         }
       }
+      encode = toMultiArray(encode);
+
       var decode = dict.get('Decode');
       if (!decode)
         decode = range;
+      else
+        decode = toMultiArray(decode);
+
+      // Precalc the multipliers
+      var inputMul = new Float64Array(inputSize);
+      for (var i = 0; i < inputSize; ++i) {
+        inputMul[i] = (encode[i][1] - encode[i][0]) /
+                  (domain[i][1] - domain[i][0]);
+      }
+
+      var idxMul = new Int32Array(inputSize);
+      idxMul[0] = outputSize;
+      for (i = 1; i < inputSize; ++i) {
+        idxMul[i] = idxMul[i - 1] * size[i - 1];
+      }
+
+      var nSamples = outputSize;
+      for (i = 0; i < inputSize; ++i)
+          nSamples *= size[i];
 
       var samples = this.getSampleArray(size, outputSize, bps, str);
 
       return [
         CONSTRUCT_SAMPLED, inputSize, domain, encode, decode, samples, size,
-        outputSize, bps, range
+        outputSize, bps, range, inputMul, idxMul, nSamples
       ];
     },
 
@@ -127,64 +159,74 @@ var PDFFunction = (function pdfFunction() {
       var outputSize = IR[7];
       var bps = IR[8];
       var range = IR[9];
+      var inputMul = IR[10];
+      var idxMul = IR[11];
+      var nSamples = IR[12];
 
       return function constructSampledFromIRResult(args) {
-        var clip = function constructSampledFromIRClip(v, min, max) {
-          if (v > max)
-            v = max;
-          else if (v < min)
-            v = min;
-          return v;
-        };
-
         if (inputSize != args.length)
           error('Incorrect number of arguments: ' + inputSize + ' != ' +
                 args.length);
+        // Most of the below is a port of Poppler's implementation.
+        // TODO: There's a few other ways to do multilinear interpolation such
+        // as piecewise, which is much faster but an approximation.
+        var out = new Float64Array(outputSize);
+        var x;
+        var e = new Array(inputSize);
+        var efrac0 = new Float64Array(inputSize);
+        var efrac1 = new Float64Array(inputSize);
+        var sBuf = new Float64Array(1 << inputSize);
+        var i, j, k, idx, t;
 
-        for (var i = 0; i < inputSize; i++) {
+        // map input values into sample array
-          var i2 = i * 2;
+        for (i = 0; i < inputSize; ++i) {
-
+          x = (args[i] - domain[i][0]) * inputMul[i] + encode[i][0];
-          // clip to the domain
+          if (x < 0) {
-          var v = clip(args[i], domain[i2], domain[i2 + 1]);
+            x = 0;
-
+          } else if (x > size[i] - 1) {
-          // encode
+            x = size[i] - 1;
-          v = encode[i2] + ((v - domain[i2]) *
+          }
-                            (encode[i2 + 1] - encode[i2]) /
+          e[i] = [Math.floor(x), 0];
-                            (domain[i2 + 1] - domain[i2]));
+          if ((e[i][1] = e[i][0] + 1) >= size[i]) {
-
+            // this happens if in[i] = domain[i][1]
-          // clip to the size
+            e[i][1] = e[i][0];
-          args[i] = clip(v, 0, size[i] - 1);
+          }
+          efrac1[i] = x - e[i][0];
+          efrac0[i] = 1 - efrac1[i];
         }
 
-        // interpolate to table
+        // for each output, do m-linear interpolation
-        TODO('Multi-dimensional interpolation');
+        for (i = 0; i < outputSize; ++i) {
-        var floor = Math.floor(args[0]);
-        var ceil = Math.ceil(args[0]);
-        var scale = args[0] - floor;
 
-        floor *= outputSize;
+          // pull 2^m values out of the sample array
-        ceil *= outputSize;
+          for (j = 0; j < (1 << inputSize); ++j) {
-
+            idx = i;
-        var output = [], v = 0;
+            for (k = 0, t = j; k < inputSize; ++k, t >>= 1) {
-        for (var i = 0; i < outputSize; ++i) {
+              idx += idxMul[k] * (e[k][t & 1]);
-          if (ceil == floor) {
+            }
-            v = samples[ceil + i];
+            if (idx >= 0 && idx < nSamples) {
+              sBuf[j] = samples[idx];
             } else {
-            var low = samples[floor + i];
+              sBuf[j] = 0; // TODO Investigate if this is what Adobe does
-            var high = samples[ceil + i];
+            }
-            v = low * scale + high * (1 - scale);
           }
 
-          var i2 = i * 2;
+          // do m sets of interpolations
-          // decode
+          for (j = 0, t = (1 << inputSize); j < inputSize; ++j, t >>= 1) {
-          v = decode[i2] + (v * (decode[i2 + 1] - decode[i2]) /
+            for (k = 0; k < t; k += 2) {
-                            ((1 << bps) - 1));
+              sBuf[k >> 1] = efrac0[j] * sBuf[k] + efrac1[j] * sBuf[k + 1];
-
+            }
-          // clip to the domain
-          output.push(clip(v, range[i2], range[i2 + 1]));
           }
 
-        return output;
+          // map output value to range
+          out[i] = (sBuf[0] * (decode[i][1] - decode[i][0]) + decode[i][0]);
+          if (out[i] < range[i][0]) {
+            out[i] = range[i][0];
+          } else if (out[i] > range[i][1]) {
+            out[i] = range[i][1];
+          }
+        }
+        return out;
       }
     },
 

test/pdfs/.gitignore

@@ -14,4 +14,5 @@
 !sizes.pdf
 !close-path-bug.pdf
 !alphatrans.pdf
+!devicen.pdf
 

test/test_manifest.json

@@ -268,5 +268,12 @@
        "link": false,
        "rounds": 1,
        "type": "eq"
+    },
+    {  "id": "devicen",
+       "file": "pdfs/devicen.pdf",
+       "md5": "b9dbf00ec6bf02fcbefbb40332713aad",
+       "link": false,
+       "rounds": 1,
+       "type": "eq"
     }
 ]