GraphDebugInfo.Builder

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.
 

استخدم أدوات الوصول البديلة للطفرات بدلاً من ذلك.

استخدم getTracesMap() بدلاً من ذلك.

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This maps a node name to a stack trace in the source code.
 The map key is a mangling of the containing function and op name with
 syntax:
   op.name '@' func_name
 For ops in the top-level graph, the func_name is the empty string.
 Note that op names are restricted to a small number of characters which
 exclude '@', making it impossible to collide keys of this form. Function
 names accept a much wider set of characters.
 It would be preferable to avoid mangling and use a tuple key of (op.name,
 func_name), but this is not supported with protocol buffers.
 

 This stores all the source code file names and can be indexed by the
 `file_index`.