def get_peers()

in gala/graph_manager.py [0:0]

• 12 lines of code
• 8 McCabe index (conditional complexity)

    def get_peers(self, rotate=False):
        """ Returns the out and in-peers corresponding to 'self.rank' """
        # cycle through in- and out-peers by updating group-index
        if rotate:
            self._rotate_group_indices()

        # get out- and in-peers using new group-indices
        out_peers, in_peers = [], []
        for group_index in self._group_indices:
            out_peers.append(self.phone_book[self.rank][group_index])
            for rank, peers in enumerate(self.phone_book):
                if rank == self.rank:
                    continue
                if self.rank == peers[group_index]:
                    in_peers.append(rank)
        return out_peers, in_peers