@@ -48,13 +48,13 @@ public abstract class SpelNodeImpl implements SpelNode, Opcodes {
48
48
private SpelNodeImpl parent ;
49
49
50
50
/**
51
- * Indicates the type descriptor for the result of this expression node. This is
52
- * set as soon as it is known. For a literal node it is known immediately. For
53
- * a property access or method invocation it is known after one evaluation of
51
+ * Indicates the type descriptor for the result of this expression node.
52
+ * This is set as soon as it is known. For a literal node it is known immediately.
53
+ * For a property access or method invocation it is known after one evaluation of
54
54
* that node.
55
- * The descriptor is like the bytecode form but is slightly easier to work with. It
56
- * does not include the trailing semicolon (for non array reference types). Some examples:
57
- * Ljava/lang/String, I, [I
55
+ * <p> The descriptor is like the bytecode form but is slightly easier to work with.
56
+ * It does not include the trailing semicolon (for non array reference types).
57
+ * Some examples: Ljava/lang/String, I, [I
58
58
*/
59
59
protected volatile String exitTypeDescriptor ;
60
60
@@ -183,7 +183,7 @@ protected ValueRef getValueRef(ExpressionState state) throws EvaluationException
183
183
* Check whether a node can be compiled to bytecode. The reasoning in each node may
184
184
* be different but will typically involve checking whether the exit type descriptor
185
185
* of the node is known and any relevant child nodes are compilable.
186
- * @return true if this node can be compiled to bytecode
186
+ * @return {@code true} if this node can be compiled to bytecode
187
187
*/
188
188
public boolean isCompilable () {
189
189
return false ;
0 commit comments