def METHOD_NAME(self):
    if self.nothing_to_process():
        return
    inputs = self.inputs
    def get_socket(x):
        r = inputs[x].sv_get()
        r = dataCorrect(r)
        return r
    socket_names = ['Verts', 'cent', 'axis', 'dvec', 'Degrees', 'Steps']
    data = list(map(get_socket, socket_names))
    mverts, mcent, maxis, mdvec, mDegrees, mSteps = data
    medges = inputs['Edges'].sv_get(default=[])
    verts_match_edges = medges and (len(medges) == len(mverts))
    verts_out, faces_out = [], []
    for idx, verts in enumerate(mverts):
        if not verts:
            continue
        # here we find defaults if the node gets incongruent input
        final_values = {
            'verts': verts,
            'edges': [],
            'cent': [0, 0, 0],
            'axis': [0, 0, 1],
            'dvec': [0, 0, 0],
            'angle': radians(self.Degrees),
            'steps': self.Steps
        }
        ''' [], or by idx, if idx present -- will treat verts as sequential if not supplied'''
        if medges:
            if verts_match_edges or (idx <= len(medges) - 1):
                final_values['edges'] = medges[idx]
        else:
            final_values['edges'] = [(i, i+1) for i in range(len(verts)-1)]
        ''' by idx, if idx present, else last. if none then default'''
        if mcent:
            idxr = idx if (idx <= len(mcent[0]) - 1) else -1
            final_values['cent'] = mcent[0][idxr]
        if maxis:
            idxr = idx if (idx <= len(maxis[0]) - 1) else -1
            final_values['axis'] = maxis[0][idxr]
        if mdvec:
            idxr = idx if (idx <= len(mdvec[0]) - 1) else -1
            final_values['dvec'] = mdvec[0][idxr]
        if mDegrees:
            if isinstance(mDegrees, list):
                neatList = mDegrees[0][0]
                idxr = min(len(neatList) - 1, idx)
                angle = neatList[idxr]
                final_values['angle'] = radians(float(angle))
        if mSteps:
            if isinstance(mSteps, list):
                neatList = mSteps[0][0]
                idxr = min(len(neatList) - 1, idx)
                steps = neatList[idxr]
                final_values['steps'] = max(0, int(steps))
        v, p = get_lathed_geometry(self, **final_values)
        verts_out.append(v)
        faces_out.append(p)
    self.outputs['Verts'].sv_set(verts_out)
    self.outputs['Poly'].sv_set(faces_out)