FreeOpcUa /
python-opcua
| Conditions | 12 |
| Total Lines | 54 |
| Lines | 0 |
| Ratio | 0 % |
| Tests | 33 |
| CRAP Score | 12.5238 |
| Changes | 4 | ||
| Bugs | 0 | Features | 0 |
Small methods make your code easier to understand, in particular if combined with a good name. Besides, if your method is small, finding a good name is usually much easier.
For example, if you find yourself adding comments to a method's body, this is usually a good sign to extract the commented part to a new method, and use the comment as a starting point when coming up with a good name for this new method.
Commonly applied refactorings include:
If many parameters/temporary variables are present:
Complex classes like _instantiate_node() often do a lot of different things. To break such a class down, we need to identify a cohesive component within that class. A common approach to find such a component is to look for fields/methods that share the same prefixes, or suffixes.
Once you have determined the fields that belong together, you can apply the Extract Class refactoring. If the component makes sense as a sub-class, Extract Subclass is also a candidate, and is often faster.
| 1 | """ |
||
| 38 | 1 | def _instantiate_node(server, parentid, rdesc, nodeid, bname, dname=None, recursive=True): |
|
| 39 | """ |
||
| 40 | instantiate a node type under parent |
||
| 41 | """ |
||
| 42 | 1 | node_type = Node(server, rdesc.NodeId) |
|
| 43 | 1 | refs = node_type.get_referenced_nodes(refs=ua.ObjectIds.HasModellingRule) |
|
| 44 | |||
| 45 | # skip optional elements |
||
| 46 | 1 | if len(refs) == 1 and refs[0].nodeid == ua.NodeId(ua.ObjectIds.ModellingRule_Optional): |
|
| 47 | return [] |
||
| 48 | |||
| 49 | 1 | addnode = ua.AddNodesItem() |
|
| 50 | 1 | addnode.RequestedNewNodeId = nodeid |
|
| 51 | 1 | addnode.BrowseName = bname |
|
| 52 | 1 | addnode.ParentNodeId = parentid |
|
| 53 | 1 | addnode.ReferenceTypeId = rdesc.ReferenceTypeId |
|
| 54 | 1 | addnode.TypeDefinition = rdesc.TypeDefinition |
|
| 55 | |||
| 56 | 1 | if rdesc.NodeClass in (ua.NodeClass.Object, ua.NodeClass.ObjectType): |
|
| 57 | 1 | addnode.NodeClass = ua.NodeClass.Object |
|
| 58 | 1 | _read_and_copy_attrs(node_type, ua.ObjectAttributes(), addnode) |
|
| 59 | |||
| 60 | 1 | elif rdesc.NodeClass in (ua.NodeClass.Variable, ua.NodeClass.VariableType): |
|
| 61 | 1 | addnode.NodeClass = ua.NodeClass.Variable |
|
| 62 | 1 | _read_and_copy_attrs(node_type, ua.VariableAttributes(), addnode) |
|
| 63 | elif rdesc.NodeClass in (ua.NodeClass.Method,): |
||
| 64 | addnode.NodeClass = ua.NodeClass.Method |
||
| 65 | _read_and_copy_attrs(node_type, ua.MethodAttributes(), addnode) |
||
| 66 | else: |
||
| 67 | logger.warning("Instantiate: Node class not supported: %s", rdesc.NodeClass) |
||
| 68 | return |
||
| 69 | 1 | if dname is not None: |
|
| 70 | 1 | addnode.NodeAttributes.DisplayName = dname |
|
| 71 | |||
| 72 | 1 | res = server.add_nodes([addnode])[0] |
|
| 73 | 1 | added_nodes = [res.AddedNodeId] |
|
| 74 | |||
| 75 | 1 | if recursive: |
|
| 76 | 1 | parents = ua_utils.get_node_supertypes(node_type, includeitself=True) |
|
| 77 | 1 | node = Node(server, res.AddedNodeId) |
|
| 78 | 1 | for parent in parents: |
|
| 79 | 1 | descs = parent.get_children_descriptions(includesubtypes=False) |
|
| 80 | 1 | for c_rdesc in descs: |
|
| 81 | # skip items that already exists, prefer the 'lowest' one in object hierarchy |
||
| 82 | 1 | if not ua_utils.is_child_present(node, c_rdesc.BrowseName): |
|
| 83 | # if root node being instantiated has a String NodeId, create the children with a String NodeId |
||
| 84 | 1 | if res.AddedNodeId.NodeIdType is ua.NodeIdType.String: |
|
| 85 | 1 | inst_nodeid = res.AddedNodeId.Identifier + "." + c_rdesc.BrowseName.Name |
|
| 86 | 1 | nodeids = _instantiate_node(server, res.AddedNodeId, c_rdesc, nodeid=ua.NodeId(identifier=inst_nodeid, namespaceidx=res.AddedNodeId.NamespaceIndex), bname=c_rdesc.BrowseName) |
|
| 87 | else: |
||
| 88 | 1 | nodeids = _instantiate_node(server, res.AddedNodeId, c_rdesc, nodeid=ua.NodeId(namespaceidx=res.AddedNodeId.NamespaceIndex), bname=c_rdesc.BrowseName) |
|
| 89 | 1 | added_nodes.extend(nodeids) |
|
| 90 | |||
| 91 | 1 | return added_nodes |
|
| 92 | |||
| 94 |
