1.1 --- a/rt/emul/zip/src/main/java/org/apidesign/bck2brwsr/emul/zip/InfTree.java	Wed May 07 16:47:24 2014 +0200
     1.2 +++ b/rt/emul/zip/src/main/java/org/apidesign/bck2brwsr/emul/zip/InfTree.java	Sun May 11 08:10:28 2014 +0200
     1.3 @@ -372,7 +372,7 @@
     1.4              r[1]=(byte)l;     // bits to dump before this table
     1.5              j=i>>>(w - l);
     1.6              r[2] = (int)(q - u[h-1] - j);               // offset to this table
     1.7 -            System.arraycopy(r, 0, hp, (u[h-1]+j)*3, 3); // connect to last table
     1.8 +            FastJar.arraycopy(r, 0, hp, (u[h-1]+j)*3, 3); // connect to last table
     1.9            }
    1.10            else{
    1.11              t[0] = q;               // first table is returned result
    1.12 @@ -396,7 +396,7 @@
    1.13          // fill code-like entries with r
    1.14          f=1<<(k-w);
    1.15          for (j=i>>>w;j<z;j+=f){
    1.16 -          System.arraycopy(r, 0, hp, (q+j)*3, 3);
    1.17 +          FastJar.arraycopy(r, 0, hp, (q+j)*3, 3);
    1.18  	}
    1.19  
    1.20  	// backwards increment the k-bit code i
    1.21 @@ -514,7 +514,7 @@
    1.22      for(int i=0; i<vsize; i++){v[i]=0;}
    1.23      for(int i=0; i<BMAX+1; i++){c[i]=0;}
    1.24      for(int i=0; i<3; i++){r[i]=0;}
    1.25 -    System.arraycopy(c, 0, u, 0, BMAX);
    1.26 -    System.arraycopy(c, 0, x, 0, BMAX+1);
    1.27 +    FastJar.arraycopy(c, 0, u, 0, BMAX);
    1.28 +    FastJar.arraycopy(c, 0, x, 0, BMAX+1);
    1.29    }
    1.30  }