Handbook
Glossary
node>quot ( node -- )
Vocabulary
compiler
.
tree
.
debugger
Inputs
node
an
object
Outputs
None
Definition
IN:
compiler.tree.debugger
GENERIC:
node>quot
( node -- )
Methods
USING:
accessors
compiler.tree
compiler.tree.debugger
make
;
M:
#alien-assembly
node>quot
params>>
,
#alien-assembly
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
kernel
make
;
M:
#alien-callback
node>quot
[
params>>
,
]
[
child>>
nodes>quot
,
]
bi
#alien-callback
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
make
;
M:
#alien-indirect
node>quot
params>>
,
#alien-indirect
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
make
;
M:
#alien-invoke
node>quot
params>>
,
#alien-invoke
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
make
;
M:
#call-recursive
node>quot
label>>
id>>
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
make
;
M:
#call
node>quot
word>>
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
make
sequences
sequences.private
;
M:
#dispatch
node>quot
children>>
[
nodes>quot
]
map
,
\
dispatch
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
kernel
make
sequences
;
M:
#if
node>quot
children>>
[
nodes>quot
]
map
%
\
if
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
make
quotations
;
M:
#push
node>quot
literal>>
literalize
,
;
USING:
accessors
compiler.tree
compiler.tree.debugger
kernel
make
quotations
;
M:
#recursive
node>quot
[
label>>
id>>
literalize
,
]
[
child>>
nodes>quot
,
\
label
,
]
bi
;
USING:
accessors
combinators
combinators.short-circuit
compiler.tree
compiler.tree.debugger
kernel
make
sequences
;
M:
#shuffle
node>quot
{
{
[
dup
#>r?
]
[
drop
\
>R
,
]
}
{
[
dup
#r>?
]
[
drop
\
R>
,
]
}
{
[
dup
{
[
in-r>>
empty?
]
[
out-r>>
empty?
]
}
1&&
]
[
shuffle-effect
[
pretty-shuffle
]
[
%
]
[
shuffle-node
boa
,
]
?if
]
}
[
drop
"COMPLEX SHUFFLE"
,
]
}
cond
;
USING:
compiler.tree
compiler.tree.debugger
kernel
;
M:
node
node>quot
drop
;