Quantcast
Channel: ajaxmin Issue Tracker Rss Feed
Viewing all articles
Browse latest Browse all 683

Commented Issue: AjaxMinTask not working as expected [19459]

$
0
0
I am using AjaxMinTask and ajaxmin files from a .NET project in VS2010 to concatenate and compress both css and js files.

1. First problem is that the js code is broken once minified. I am using 14 files as input, JQuery, Knockout, YUI, etc., as well as my own code. One thing I am doing though is that I am using the already minified versions of the vendors' files listed above. Not sure if this is allowed but it would be handy (if not, why?). I have tried to use the following switches to no evail:

–global:YUI,JQuery,$,ko -evals:safeall -fnames:keep<

I am doing many Ajax calls and I wonder if this is not what gets broken (I saw there was a problem with that; not sure if it's been fixed).

2. Another problem is that the output files do not get overwritten with every build even though I use the "-clobber:true" switch. If not resolved, this problem would be definitely a show stopper (i.e. find another solution) as we do automatic builds on a build server and need to be sure the files will be renewed every time.

Thanks, Yves
Comments: ** Comment from web user: ronlo **

What's that whole containing function for the error line end up looking like to you? When I minify jquery.dataTables.min.js, I end up with this. Notice that the var statement at the top has different variables names for the two fields ("c" and "h" in the minified source, "nTrs" and "$" in the unminified version) -- I'm not seeing them both named to "h" as you are:

```
function ht(n, t)
{
var c = r(t).children("tr"),
l,
u,
i,
f,
s,
h,
a,
e,
o,
v;
for (n.splice(0, n.length), i = 0, h = c.length; i < h; i++)
n.push([]);
for (i = 0, h = c.length; i < h; i++)
for (l = c[i], u = l.firstChild; u; )
{
if ("TD" == u.nodeName.toUpperCase() || "TH" == u.nodeName.toUpperCase())
{
for (e = 1 * u.getAttribute("colspan"), o = 1 * u.getAttribute("rowspan"), e = !e || 0 === e || 1 === e ? 1 : e, o = !o || 0 === o || 1 === o ? 1 : o, f = 0, s = n[i]; s[f]; )
f++;
for (a = f, v = 1 === e ? !0 : !1, s = 0; s < e; s++)
for (f = 0; f < o; f++)
n[i + f][a + s] = {
cell: u, unique: v
},
n[i + f].nTr = l
}
u = u.nextSibling
}
}
```

(Also, it might be easier to debug if you put the -line:M switch on your build task; that will still minify, but output the results on multiple lines so you don't have to hunt through really long lines of text.)


Viewing all articles
Browse latest Browse all 683

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>