old_contents: #######################################################################
  # Copyright (C) 2017 Shangtong Zhang(zhangshangtong.cpp@gmail.com)    #
  # Permission given to modify the code as long as you keep this        #
  # declaration at the top                                              #
  #######################################################################
  
  class ConstantSchedule:
      def __init__(self, val):
          self.val = val
  
      def __call__(self):
          return self.val
  
  class LinearSchedule:
      def __init__(self, start, end=None, steps=None):
          if end is None:
              end = start
              steps = 1
          self.inc = (end - start) / float(steps)
          self.current = start
          self.end = end
          if end > start:
              self.bound = min
          else:
              self.bound = max
  
      def __call__(self):
          val = self.current
          self.current = self.bound(self.current + self.inc, self.end)
          return val
  
new_contents: #######################################################################
  # Copyright (C) 2017 Shangtong Zhang(zhangshangtong.cpp@gmail.com)    #
  # Permission given to modify the code as long as you keep this        #
  # declaration at the top                                              #
  #######################################################################
  
  class ConstantSchedule:
      def __init__(self, val):
          self.val = val
  
      def __call__(self, steps=1):
          return self.val
  
  class LinearSchedule:
      def __init__(self, start, end=None, steps=None):
          if end is None:
              end = start
              steps = 1
          self.inc = (end - start) / float(steps)
          self.current = start
          self.end = end
          if end > start:
              self.bound = min
          else:
              self.bound = max
  
      def __call__(self, steps=1):
          val = self.current
          self.current = self.bound(self.current + self.inc * steps, self.end)
          return val
  
subject: Update schedule