Interface NodeDef.ExperimentalDebugInfoOrBuilder
- All Superinterfaces:
MessageLiteOrBuilder, MessageOrBuilder
- All Known Implementing Classes:
NodeDef.ExperimentalDebugInfo, NodeDef.ExperimentalDebugInfo.Builder
- Enclosing class:
NodeDef
-
Method Summary
Modifier and TypeMethodDescriptiongetOriginalFuncNames(int index) This is intended to store the list of names of the functions from the original graph that this node was derived.getOriginalFuncNamesBytes(int index) This is intended to store the list of names of the functions from the original graph that this node was derived.intThis is intended to store the list of names of the functions from the original graph that this node was derived.This is intended to store the list of names of the functions from the original graph that this node was derived.getOriginalNodeNames(int index) Opaque string inserted into error messages created by the runtime.getOriginalNodeNamesBytes(int index) Opaque string inserted into error messages created by the runtime.intOpaque string inserted into error messages created by the runtime.Opaque string inserted into error messages created by the runtime.Methods inherited from interface MessageLiteOrBuilder
isInitialized
-
Method Details
-
getOriginalNodeNamesList
Opaque string inserted into error messages created by the runtime. This is intended to store the list of names of the nodes from the original graph that this node was derived. For example if this node, say C, was result of a fusion of 2 nodes A and B, then 'original_node' would be {A, B}. This information can be used to map errors originating at the current node to some top level source code.repeated string original_node_names = 1;- Returns:
- A list containing the originalNodeNames.
-
getOriginalNodeNamesCount
int getOriginalNodeNamesCount()Opaque string inserted into error messages created by the runtime. This is intended to store the list of names of the nodes from the original graph that this node was derived. For example if this node, say C, was result of a fusion of 2 nodes A and B, then 'original_node' would be {A, B}. This information can be used to map errors originating at the current node to some top level source code.repeated string original_node_names = 1;- Returns:
- The count of originalNodeNames.
-
getOriginalNodeNames
Opaque string inserted into error messages created by the runtime. This is intended to store the list of names of the nodes from the original graph that this node was derived. For example if this node, say C, was result of a fusion of 2 nodes A and B, then 'original_node' would be {A, B}. This information can be used to map errors originating at the current node to some top level source code.repeated string original_node_names = 1;- Parameters:
index- The index of the element to return.- Returns:
- The originalNodeNames at the given index.
-
getOriginalNodeNamesBytes
Opaque string inserted into error messages created by the runtime. This is intended to store the list of names of the nodes from the original graph that this node was derived. For example if this node, say C, was result of a fusion of 2 nodes A and B, then 'original_node' would be {A, B}. This information can be used to map errors originating at the current node to some top level source code.repeated string original_node_names = 1;- Parameters:
index- The index of the value to return.- Returns:
- The bytes of the originalNodeNames at the given index.
-
getOriginalFuncNamesList
This is intended to store the list of names of the functions from the original graph that this node was derived. For example if this node, say C, was result of a fusion of node A in function FA and node B in function FB, then `original_funcs` would be {FA, FB}. If the node is in the top level graph, the `original_func` is empty. This information, with the `original_node_names` can be used to map errors originating at the current ndoe to some top level source code.repeated string original_func_names = 2;- Returns:
- A list containing the originalFuncNames.
-
getOriginalFuncNamesCount
int getOriginalFuncNamesCount()This is intended to store the list of names of the functions from the original graph that this node was derived. For example if this node, say C, was result of a fusion of node A in function FA and node B in function FB, then `original_funcs` would be {FA, FB}. If the node is in the top level graph, the `original_func` is empty. This information, with the `original_node_names` can be used to map errors originating at the current ndoe to some top level source code.repeated string original_func_names = 2;- Returns:
- The count of originalFuncNames.
-
getOriginalFuncNames
This is intended to store the list of names of the functions from the original graph that this node was derived. For example if this node, say C, was result of a fusion of node A in function FA and node B in function FB, then `original_funcs` would be {FA, FB}. If the node is in the top level graph, the `original_func` is empty. This information, with the `original_node_names` can be used to map errors originating at the current ndoe to some top level source code.repeated string original_func_names = 2;- Parameters:
index- The index of the element to return.- Returns:
- The originalFuncNames at the given index.
-
getOriginalFuncNamesBytes
This is intended to store the list of names of the functions from the original graph that this node was derived. For example if this node, say C, was result of a fusion of node A in function FA and node B in function FB, then `original_funcs` would be {FA, FB}. If the node is in the top level graph, the `original_func` is empty. This information, with the `original_node_names` can be used to map errors originating at the current ndoe to some top level source code.repeated string original_func_names = 2;- Parameters:
index- The index of the value to return.- Returns:
- The bytes of the originalFuncNames at the given index.
-