Feature/graph rename optimization

[mmarineBlueQuartz]

• Redesigned the rename functionality for improved performance. Rather than being performed by iterating over the DataContainerArray after each filter preflights to determine what new DataArrayPaths exist and which were renamed, these checks are performed at the filter level during preflight on an opt-in basis. This reduced the rename functionality to a subset of its previous implementation, especially in cases where filters create an arbitrary number of new DataArrayPaths.
• Redesigned the Data Structure to move towards graph-based from the existing tree-based design. Nodes (DataContainer, AttributeMatrix, and IDataArray) can still only have one parent at the moment and will overwrite their existing parent if a new one is assigned. In addition, nodes now know about their parents and can construct a DataArrayPath to itself and all of its children based on that information.
• Implemented STL iterator support to Data Structure Nodes. Now all containers can be iterated over using range-based for loops, and DataArrays can be iterated over for component values using STL range-based for loops.
• Renamed add** methods in Data Structure containers to addOrReplace**. Added IDataStructureContainerNode::insertOrAssign(std::shared_ptr child) to keep functionality consistent and reduce the amount of copy-pasted code. Most add** method calls were replaced with this insertOrAssign. For cases where replacement is not desired, the IDataStructureContainerNode::push_back method will attempt to add without replacement. It returns a boolean value determining if it was successful.
• IDataStructureContainerNode has [] operators that can return the corresponding child based on either index or name. If the input is invalid, it throws an out_of_range exception.
• Removed QObject from DataArrayPath inheritance

[imikejackson]

This whole PR was discussed internally and all systems are building and passing tests.