Skip to content

Commit b06d82f

Browse files
committed
docs: clarify is experimental
1 parent ac8e704 commit b06d82f

File tree

2 files changed

+4
-4
lines changed

2 files changed

+4
-4
lines changed

src/Expression.jl

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ end
2727
"""
2828
AbstractExpression{T}
2929
30-
Abstract type for user-facing expression types, which contain
30+
(Experimental) Abstract type for user-facing expression types, which contain
3131
both the raw expression tree operating on a value type of `T`,
3232
as well as associated metadata to evaluate and render the expression.
3333
@@ -73,7 +73,7 @@ abstract type AbstractExpression{T} end
7373
"""
7474
Expression{T, N, D} <: AbstractExpression{T}
7575
76-
Defines a high level, user-facing, expression type that encapsulates an
76+
(Experimental) Defines a high-level, user-facing, expression type that encapsulates an
7777
expression tree (like `Node`) along with associated metadata for evaluation and rendering.
7878
7979
# Fields

src/Parse.jl

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,13 +2,13 @@ module ParseModule
22

33
using ..NodeModule: AbstractExpressionNode, Node, constructorof
44
using ..OperatorEnumModule: AbstractOperatorEnum
5-
using ..OperatorEnumConstructionModule: empty_all_globals!
5+
using ..OperatorEnumConstructionModule: OperatorEnum, empty_all_globals!
66
using ..ExpressionModule: AbstractExpression, Expression
77

88
"""
99
@parse_expression(expr; operators, variable_names, node_type=Node, evaluate_on=[])
1010
11-
Parse a symbolic expression `expr` into a computational graph where nodes represent operations or variables.
11+
(Experimental) Parse a symbolic expression `expr` into a computational graph where nodes represent operations or variables.
1212
1313
## Arguments
1414

0 commit comments

Comments
 (0)