1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
<?php
/**
* @private
* @see less-3.13.1.js#Expression.prototype
*/
class Less_Tree_Expression extends Less_Tree implements Less_Tree_HasValueProperty {
/** @var Less_Tree[] */
public $value = [];
public $noSpacing;
public $parens = null;
public function __construct( $value, $noSpacing = false ) {
$this->value = $value;
$this->noSpacing = $noSpacing;
}
public function accept( $visitor ) {
$this->value = $visitor->visitArray( $this->value );
}
public function compile( $env ) {
$mathOn = $env->isMathOn();
// NOTE: We don't support STRICT_LEGACY (Less.js 3.13)
$inParenthesis = $this->parens && ( true || !$this->parensInOp );
$doubleParen = false;
if ( $inParenthesis ) {
$env->inParenthesis();
}
if ( $this->value ) {
if ( count( $this->value ) > 1 ) {
$ret = [];
foreach ( $this->value as $e ) {
$ret[] = $e->compile( $env );
}
$returnValue = new self( $ret, $this->noSpacing );
} else {
// Implied `if ( count() === 1 )`
if ( ( $this->value[0] instanceof self ) && $this->value[0]->parens && !$this->value[0]->parensInOp && !$env->inCalc ) {
$doubleParen = true;
}
$returnValue = $this->value[0]->compile( $env );
}
} else {
$returnValue = $this;
}
if ( $inParenthesis ) {
$env->outOfParenthesis();
}
if ( $this->parens && $this->parensInOp && !$mathOn && !$doubleParen &&
( !( $returnValue instanceof Less_Tree_Dimension ) )
) {
$returnValue = new Less_Tree_Paren( $returnValue );
}
return $returnValue;
}
/**
* @see Less_Tree::genCSS
*/
public function genCSS( $output ) {
$val_len = count( $this->value );
for ( $i = 0; $i < $val_len; $i++ ) {
$this->value[$i]->genCSS( $output );
if ( !$this->noSpacing && ( $i + 1 < $val_len ) ) {
$output->add( ' ' );
}
}
}
public function throwAwayComments() {
if ( is_array( $this->value ) ) {
$new_value = [];
foreach ( $this->value as $v ) {
if ( $v instanceof Less_Tree_Comment ) {
continue;
}
$new_value[] = $v;
}
$this->value = $new_value;
}
}
public function markReferenced() {
if ( is_array( $this->value ) ) {
foreach ( $this->value as $v ) {
if ( method_exists( $v, 'markReferenced' ) ) {
$v->markReferenced();
}
}
}
}
/**
* Should be used only in Less_Tree_Call::functionCaller()
* to retrieve expression without comments
* @internal
*/
public function mapToFunctionCallArgument() {
if ( is_array( $this->value ) ) {
$subNodes = [];
foreach ( $this->value as $subNode ) {
if ( !( $subNode instanceof Less_Tree_Comment ) ) {
$subNodes[] = $subNode;
}
}
return count( $subNodes ) === 1
? $subNodes[0]
: new Less_Tree_Expression( $subNodes );
}
return $this;
}
}
|
