Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Lazy
Guides
Guide
MainGuide
Symbols
LazyDirectoryTree
LazyExpression
LazyLength
LazyList
Lazy
LazySplits
LazyTraverse
LazyTreeEdges
LazyTree
LazyValueArray
LazyValue
MultiwayNest
Guide (internal)
Lazy constructors
L
a
z
y
V
a
l
u
e
— special symbol for delaying computation (
H
o
l
d
F
i
r
s
t
with formatting)
L
a
z
y
L
i
s
t
— lazy list constructor with up-to two argument head and
H
o
l
d
A
l
l
attribute
L
a
z
y
T
r
e
e
— lazy tree constructor, data with a lazy list of children
C
o
n
s
—
F
l
a
t
lazy list
Lazy functions with sub-values:
L
a
z
y
M
a
p
—
M
a
p
L
a
z
y
M
a
p
I
n
d
e
x
e
d
—
M
a
p
I
n
d
e
x
e
d
L
a
z
y
S
c
a
n
—
S
c
a
n
L
a
z
y
S
e
l
e
c
t
—
S
e
l
e
c
t
L
a
z
y
J
o
i
n
—
J
o
i
n
L
a
z
y
F
i
r
s
t
—
F
i
r
s
t
L
a
z
y
R
e
s
t
—
R
e
s
t
L
a
z
y
C
a
t
e
n
a
t
e
—
C
a
t
e
n
a
t
e
L
a
z
y
T
a
k
e
—
T
a
k
e
L
a
z
y
T
a
k
e
W
h
i
l
e
—
T
a
k
e
W
h
i
l
e
L
a
z
y
D
r
o
p
—
D
r
o
p
L
a
z
y
D
r
o
p
W
h
i
l
e
—
D
r
o
p
W
h
i
l
e
L
a
z
y
P
a
r
t
—
P
a
r
t
L
a
z
y
A
p
p
e
n
d
—
A
p
p
e
n
d
L
a
z
y
P
r
e
p
e
n
d
—
P
r
e
p
e
n
d
L
a
z
y
T
a
k
e
D
r
o
p
—
T
a
k
e
D
r
o
p
L
a
z
y
P
a
r
t
i
t
i
o
n
—
P
a
r
t
i
t
i
o
n
L
a
z
y
A
l
l
T
r
u
e
—
A
l
l
T
r
u
e
L
a
z
y
A
n
y
T
r
u
e
—
A
n
y
T
r
u
e
L
a
z
y
L
e
n
g
t
h
—
L
e
n
g
t
h
L
a
z
y
F
o
l
d
—
F
o
l
d
L
a
z
y
F
o
l
d
L
i
s
t
—
F
o
l
d
L
i
s
t
L
a
z
y
M
a
p
T
h
r
e
a
d
—
M
a
p
T
h
r
e
a
d
L
a
z
y
R
o
t
a
t
e
L
e
f
t
—
R
o
t
a
t
e
L
e
f
t
L
a
z
y
R
o
t
a
t
e
R
i
g
h
t
—
R
o
t
a
t
e
R
i
g
h
t
L
a
z
y
F
o
l
d
R
i
g
h
t
—
R
e
s
o
u
r
c
e
F
u
n
c
t
i
o
n
[
"
F
o
l
d
R
i
g
h
t
"
]
L
a
z
y
F
o
l
d
R
i
g
h
t
L
i
s
t
—
R
e
s
o
u
r
c
e
F
u
n
c
t
i
o
n
[
"
F
o
l
d
R
i
g
h
t
L
i
s
t
"
]
Lazy generators
T
o
L
a
z
y
L
i
s
t
— convert expression to a lazy list
L
a
z
y
R
a
n
g
e
—
R
a
n
g
e
L
a
z
y
T
a
b
l
e
—
T
a
b
l
e
L
a
z
y
A
r
r
a
y
—
A
r
r
a
y
L
a
z
y
C
o
n
s
t
a
n
t
A
r
r
a
y
—
C
o
n
s
t
a
n
t
A
r
r
a
y
L
a
z
y
N
e
s
t
—
N
e
s
t
L
a
z
y
N
e
s
t
L
i
s
t
—
N
e
s
t
L
i
s
t
L
a
z
y
N
e
s
t
W
h
i
l
e
—
N
e
s
t
W
h
i
l
e
L
a
z
y
N
e
s
t
W
h
i
l
e
L
i
s
t
—
N
e
s
t
W
h
i
l
e
L
i
s
t
L
a
z
y
T
u
p
l
e
s
—
T
u
p
l
e
s
L
a
z
y
S
u
b
s
e
t
s
—
S
u
b
s
e
t
s
L
a
z
y
P
e
r
m
u
t
a
t
i
o
n
s
—
P
e
r
m
u
t
a
t
i
o
n
s
L
a
z
y
S
u
b
d
i
v
i
d
e
—
S
u
b
d
i
v
i
d
e
L
a
z
y
S
p
l
i
t
s
— generate splits of a list
L
a
z
y
S
p
l
i
t
s
R
e
v
e
r
s
e
— splits in reverse order
L
a
z
y
R
e
p
e
a
t
— repeat an element indefinitely
L
a
z
y
C
l
o
n
e
— repeat a list
Lazy tree
T
r
e
e
D
a
t
a
—
T
r
e
e
D
a
t
a
T
r
e
e
C
h
i
l
d
r
e
n
—
T
r
e
e
C
h
i
l
d
r
e
n
T
r
e
e
E
x
t
r
a
c
t
—
T
r
e
e
E
x
t
r
a
c
t
L
a
z
y
N
e
s
t
T
r
e
e
—
N
e
s
t
T
r
e
e
Multicomputation
M
u
l
t
i
w
a
y
N
e
s
t
— lazy tree from a nesting function
M
u
l
t
i
w
a
y
R
e
p
l
a
c
e
— lazy tree from a list of rules
M
u
l
t
i
w
a
y
E
v
a
l
u
a
t
e
— lazy tree from definition rules
L
a
z
y
C
o
m
p
u
t
a
t
i
o
n
— abstraction over lazy computations
L
a
z
y
F
i
n
d
P
a
t
h
— search for a value in a lazy tree
Evaluation control
L
a
z
y
E
v
a
l
— evaluate lazy arguments
L
a
z
y
L
i
s
t
E
v
a
l
— evaluate lazy list elements
A
r
g
E
v
a
l
— evaluate first argument while it contains a held head
N
o
r
m
a
l
L
a
z
y
— repeatedly apply
N
o
r
m
a
l
to lazy subexpressions
R
e
l
e
a
s
e
L
a
z
y
V
a
l
u
e
— repeatedly release
L
a
z
y
V
a
l
u
e
Strict conversion
L
a
z
y
L
i
s
t
T
o
L
i
s
t
— construct a finite strict list from a lazy list,
N
o
r
m
a
l
for lazy lists
L
a
z
y
T
r
e
e
T
o
T
r
e
e
— construct a finite strict tree from a lazy tree,
N
o
r
m
a
l
for a lazy tree
C
o
n
s
F
o
r
m
— truncated strict list form of a lazy list
L
a
z
y
T
r
e
e
F
o
r
m
— truncated strict tree form of a lazy tree
Formatting
L
a
z
y
L
i
s
t
F
o
r
m
— dynamic expandable list
L
a
z
y
T
r
e
e
R
u
l
e
F
o
r
m
— dynamic expandable tree
R
e
l
a
t
e
d
L
i
n
k
s
D
e
l
a
y
e
d
▪
H
o
l
d
▪
H
o
l
d
C
o
m
p
l
e
t
e
▪
R
e
l
e
a
s
e
H
o
l
d
▪
D
e
f
e
r
▪
U
n
e
v
a
l
u
a
t
e
d
▪
I
n
a
c
t
i
v
e
▪
H
o
l
d
A
l
l
▪
H
o
l
d
A
l
l
C
o
m
p
l
e
t
e
▪
S
e
q
u
e
n
c
e
H
o
l
d
"
"