Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
N
node-sass
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
楚学文
node-sass
Commits
9c16b179
Commit
9c16b179
authored
Oct 04, 2012
by
Aaron Leung
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
More eval edge cases.
parent
a64a5c48
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
11 additions
and
4 deletions
+11
-4
document_parser.cpp
document_parser.cpp
+2
-2
eval_apply.cpp
eval_apply.cpp
+9
-2
No files found.
document_parser.cpp
View file @
9c16b179
...
@@ -237,7 +237,7 @@ namespace Sass {
...
@@ -237,7 +237,7 @@ namespace Sass {
Node
var
(
context
.
new_Node
(
Node
::
variable
,
path
,
line
,
lexed
));
Node
var
(
context
.
new_Node
(
Node
::
variable
,
path
,
line
,
lexed
));
lex
<
exactly
<
':'
>
>
();
lex
<
exactly
<
':'
>
>
();
Node
val
(
parse_space_list
());
Node
val
(
parse_space_list
());
//
val.should_eval() = true;
val
.
should_eval
()
=
true
;
Node
assn
(
context
.
new_Node
(
Node
::
assignment
,
path
,
line
,
2
));
Node
assn
(
context
.
new_Node
(
Node
::
assignment
,
path
,
line
,
2
));
assn
<<
var
<<
val
;
assn
<<
var
<<
val
;
return
assn
;
return
assn
;
...
@@ -253,7 +253,7 @@ namespace Sass {
...
@@ -253,7 +253,7 @@ namespace Sass {
Node
var
(
context
.
new_Node
(
Node
::
variable
,
path
,
line
,
lexed
));
Node
var
(
context
.
new_Node
(
Node
::
variable
,
path
,
line
,
lexed
));
lex
<
exactly
<
':'
>
>
();
lex
<
exactly
<
':'
>
>
();
Node
val
(
parse_space_list
());
Node
val
(
parse_space_list
());
//
val.should_eval() = true;
val
.
should_eval
()
=
true
;
Node
assn
(
context
.
new_Node
(
Node
::
assignment
,
path
,
line
,
2
));
Node
assn
(
context
.
new_Node
(
Node
::
assignment
,
path
,
line
,
2
));
assn
<<
var
<<
val
;
assn
<<
var
<<
val
;
return
assn
;
return
assn
;
...
...
eval_apply.cpp
View file @
9c16b179
...
@@ -610,8 +610,10 @@ namespace Sass {
...
@@ -610,8 +610,10 @@ namespace Sass {
evaluated_args
<<
eval
(
args
[
i
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
evaluated_args
<<
eval
(
args
[
i
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
if
(
evaluated_args
.
back
().
type
()
==
Node
::
list
)
{
if
(
evaluated_args
.
back
().
type
()
==
Node
::
list
)
{
Node
arg_list
(
evaluated_args
.
back
());
Node
arg_list
(
evaluated_args
.
back
());
Node
new_arg_list
(
new_Node
(
Node
::
list
,
arg_list
.
path
(),
arg_list
.
line
(),
arg_list
.
size
()));
for
(
size_t
j
=
0
,
S
=
arg_list
.
size
();
j
<
S
;
++
j
)
{
for
(
size_t
j
=
0
,
S
=
arg_list
.
size
();
j
<
S
;
++
j
)
{
if
(
arg_list
[
j
].
should_eval
())
arg_list
[
j
]
=
eval
(
arg_list
[
j
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
if
(
arg_list
[
j
].
should_eval
())
new_arg_list
<<
eval
(
arg_list
[
j
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
else
new_arg_list
<<
arg_list
[
j
];
}
}
}
}
}
}
...
@@ -621,9 +623,12 @@ namespace Sass {
...
@@ -621,9 +623,12 @@ namespace Sass {
kwdarg
<<
eval
(
args
[
i
][
1
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
kwdarg
<<
eval
(
args
[
i
][
1
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
if
(
kwdarg
.
back
().
type
()
==
Node
::
list
)
{
if
(
kwdarg
.
back
().
type
()
==
Node
::
list
)
{
Node
arg_list
(
kwdarg
.
back
());
Node
arg_list
(
kwdarg
.
back
());
Node
new_arg_list
(
new_Node
(
Node
::
list
,
arg_list
.
path
(),
arg_list
.
line
(),
arg_list
.
size
()));
for
(
size_t
j
=
0
,
S
=
arg_list
.
size
();
j
<
S
;
++
j
)
{
for
(
size_t
j
=
0
,
S
=
arg_list
.
size
();
j
<
S
;
++
j
)
{
if
(
arg_list
[
j
].
should_eval
())
arg_list
[
j
]
=
eval
(
arg_list
[
j
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
if
(
arg_list
[
j
].
should_eval
())
new_arg_list
<<
eval
(
arg_list
[
j
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
else
new_arg_list
<<
arg_list
[
j
];
}
}
kwdarg
[
1
]
=
new_arg_list
;
}
}
evaluated_args
<<
kwdarg
;
evaluated_args
<<
kwdarg
;
}
}
...
@@ -631,6 +636,7 @@ namespace Sass {
...
@@ -631,6 +636,7 @@ namespace Sass {
// eval twice because args may be delayed
// eval twice because args may be delayed
for
(
size_t
i
=
0
,
S
=
evaluated_args
.
size
();
i
<
S
;
++
i
)
{
for
(
size_t
i
=
0
,
S
=
evaluated_args
.
size
();
i
<
S
;
++
i
)
{
if
(
evaluated_args
[
i
].
type
()
!=
Node
::
assignment
)
{
if
(
evaluated_args
[
i
].
type
()
!=
Node
::
assignment
)
{
evaluated_args
[
i
].
should_eval
()
=
true
;
evaluated_args
[
i
]
=
eval
(
evaluated_args
[
i
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
evaluated_args
[
i
]
=
eval
(
evaluated_args
[
i
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
if
(
evaluated_args
[
i
].
type
()
==
Node
::
list
)
{
if
(
evaluated_args
[
i
].
type
()
==
Node
::
list
)
{
Node
arg_list
(
evaluated_args
[
i
]);
Node
arg_list
(
evaluated_args
[
i
]);
...
@@ -641,6 +647,7 @@ namespace Sass {
...
@@ -641,6 +647,7 @@ namespace Sass {
}
}
else
{
else
{
Node
kwdarg
(
evaluated_args
[
i
]);
Node
kwdarg
(
evaluated_args
[
i
]);
kwdarg
[
1
].
should_eval
()
=
true
;
kwdarg
[
1
]
=
eval
(
kwdarg
[
1
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
kwdarg
[
1
]
=
eval
(
kwdarg
[
1
],
prefix
,
env
,
f_env
,
new_Node
,
ctx
);
if
(
kwdarg
[
1
].
type
()
==
Node
::
list
)
{
if
(
kwdarg
[
1
].
type
()
==
Node
::
list
)
{
Node
arg_list
(
kwdarg
[
1
]);
Node
arg_list
(
kwdarg
[
1
]);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment