mirror of
https://github.com/less/less.js.git
synced 2026-02-07 05:25:04 -05:00
156 lines
4.8 KiB
JavaScript
156 lines
4.8 KiB
JavaScript
(function (tree) {
|
|
|
|
tree.Media = function (value, features, index, currentFileInfo) {
|
|
this.index = index;
|
|
this.currentFileInfo = currentFileInfo;
|
|
|
|
var selectors = this.emptySelectors();
|
|
|
|
this.features = new(tree.Value)(features);
|
|
this.ruleset = new(tree.Ruleset)(selectors, value);
|
|
this.ruleset.allowImports = true;
|
|
};
|
|
tree.Media.prototype = {
|
|
type: "Media",
|
|
accept: function (visitor) {
|
|
this.features = visitor.visit(this.features);
|
|
this.ruleset = visitor.visit(this.ruleset);
|
|
},
|
|
toCSS: function (env) {
|
|
var features = this.features.toCSS(env);
|
|
|
|
var content = this.ruleset.toCSS(env).trim().replace(/\n/g, '\n ');
|
|
|
|
if (content.match(/\S/)) {
|
|
return '@media ' + features + (env.compress ? '{' : ' {\n ') + content +
|
|
(env.compress ? '}': '\n}\n');
|
|
} else {
|
|
return "";
|
|
}
|
|
},
|
|
eval: function (env) {
|
|
if (!env.mediaBlocks) {
|
|
env.mediaBlocks = [];
|
|
env.mediaPath = [];
|
|
}
|
|
|
|
var media = new(tree.Media)([], [], this.index, this.currentFileInfo);
|
|
if(this.debugInfo) {
|
|
this.ruleset.debugInfo = this.debugInfo;
|
|
media.debugInfo = this.debugInfo;
|
|
}
|
|
var strictMathBypass = false;
|
|
if (!env.strictMath) {
|
|
strictMathBypass = true;
|
|
env.strictMath = true;
|
|
}
|
|
try {
|
|
media.features = this.features.eval(env);
|
|
}
|
|
finally {
|
|
if (strictMathBypass) {
|
|
env.strictMath = false;
|
|
}
|
|
}
|
|
|
|
env.mediaPath.push(media);
|
|
env.mediaBlocks.push(media);
|
|
|
|
env.frames.unshift(this.ruleset);
|
|
media.ruleset = this.ruleset.eval(env);
|
|
env.frames.shift();
|
|
|
|
env.mediaPath.pop();
|
|
|
|
return env.mediaPath.length === 0 ? media.evalTop(env) :
|
|
media.evalNested(env)
|
|
},
|
|
variable: function (name) { return tree.Ruleset.prototype.variable.call(this.ruleset, name) },
|
|
find: function () { return tree.Ruleset.prototype.find.apply(this.ruleset, arguments) },
|
|
rulesets: function () { return tree.Ruleset.prototype.rulesets.apply(this.ruleset) },
|
|
emptySelectors: function() {
|
|
var el = new(tree.Element)('', '&', 0);
|
|
return [new(tree.Selector)([el], null, null, this.index, this.currentFileInfo)];
|
|
},
|
|
markReferenced: function () {
|
|
var rule, i;
|
|
this.isReferenced = true;
|
|
for (i = 0; i < this.ruleset.rules.length; i++) {
|
|
rule = this.ruleset.rules[i];
|
|
if (rule.markReferenced) {
|
|
rule.markReferenced();
|
|
}
|
|
}
|
|
},
|
|
|
|
evalTop: function (env) {
|
|
var result = this;
|
|
|
|
// Render all dependent Media blocks.
|
|
if (env.mediaBlocks.length > 1) {
|
|
var selectors = this.emptySelectors();
|
|
result = new(tree.Ruleset)(selectors, env.mediaBlocks);
|
|
result.multiMedia = true;
|
|
}
|
|
|
|
delete env.mediaBlocks;
|
|
delete env.mediaPath;
|
|
|
|
return result;
|
|
},
|
|
evalNested: function (env) {
|
|
var i, value,
|
|
path = env.mediaPath.concat([this]);
|
|
|
|
// Extract the media-query conditions separated with `,` (OR).
|
|
for (i = 0; i < path.length; i++) {
|
|
value = path[i].features instanceof tree.Value ?
|
|
path[i].features.value : path[i].features;
|
|
path[i] = Array.isArray(value) ? value : [value];
|
|
}
|
|
|
|
// Trace all permutations to generate the resulting media-query.
|
|
//
|
|
// (a, b and c) with nested (d, e) ->
|
|
// a and d
|
|
// a and e
|
|
// b and c and d
|
|
// b and c and e
|
|
this.features = new(tree.Value)(this.permute(path).map(function (path) {
|
|
path = path.map(function (fragment) {
|
|
return fragment.toCSS ? fragment : new(tree.Anonymous)(fragment);
|
|
});
|
|
|
|
for(i = path.length - 1; i > 0; i--) {
|
|
path.splice(i, 0, new(tree.Anonymous)("and"));
|
|
}
|
|
|
|
return new(tree.Expression)(path);
|
|
}));
|
|
|
|
// Fake a tree-node that doesn't output anything.
|
|
return new(tree.Ruleset)([], []);
|
|
},
|
|
permute: function (arr) {
|
|
if (arr.length === 0) {
|
|
return [];
|
|
} else if (arr.length === 1) {
|
|
return arr[0];
|
|
} else {
|
|
var result = [];
|
|
var rest = this.permute(arr.slice(1));
|
|
for (var i = 0; i < rest.length; i++) {
|
|
for (var j = 0; j < arr[0].length; j++) {
|
|
result.push([arr[0][j]].concat(rest[i]));
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
},
|
|
bubbleSelectors: function (selectors) {
|
|
this.ruleset = new(tree.Ruleset)(selectors.slice(0), [this.ruleset]);
|
|
}
|
|
};
|
|
|
|
})(require('../tree'));
|