How could I translate this Python code to Matlab?

Question

dave 2018-8-5

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/413657-how-could-i-translate-this-python-code-to-matlab

评论： dave 2018-8-6

I have this python code that I would like to convert to Matlab code. Could anyone help me convert from one language to the other?

The code is as follows:

class Peak:
    def __init__(self, startidx):
        self.born = self.left = self.right = startidx
        self.died = None
      def get_persistence(self, seq):
          return float("inf") if self.died is None else seq[self.born] - seq[self.died]
def get_persistent_homology(seq):
    peaks = []
    # Maps indices to peaks
    idxtopeak = [None for s in seq]
    # Sequence indices sorted by values
    indices = range(len(seq))
    indices = sorted(indices, key = lambda i: seq[i], reverse=True)
      # Process each sample in descending order
      for idx in indices:
          lftdone = (idx > 0 and idxtopeak[idx-1] is not None)
          rgtdone = (idx < len(seq)-1 and idxtopeak[idx+1] is not None)
          il = idxtopeak[idx-1] if lftdone else None
          ir = idxtopeak[idx+1] if rgtdone else None
          # New peak born
          if not lftdone and not rgtdone:
              peaks.append(Peak(idx))
              idxtopeak[idx] = len(peaks)-1
          # Directly merge to next peak left
          if lftdone and not rgtdone:
              peaks[il].right += 1
              idxtopeak[idx] = il
          # Directly merge to next peak right
          if not lftdone and rgtdone:
              peaks[ir].left -= 1
              idxtopeak[idx] = ir
          # Merge left and right peaks
          if lftdone and rgtdone:
              # Left was born earlier: merge right to left
              if seq[peaks[il].born] > seq[peaks[ir].born]:
                  peaks[ir].died = idx
                  peaks[il].right = peaks[ir].right
                  idxtopeak[peaks[il].right] = idxtopeak[idx] = il
              else:
                  peaks[il].died = idx
                  peaks[ir].left = peaks[il].left
                  idxtopeak[peaks[ir].left] = idxtopeak[idx] = ir
      # This is optional convenience
      return sorted(peaks, key=lambda p: p.get_persistence(seq), reverse=True)