parameters: (self, x, h_0, w_ih, w_hh, b_ih, b_hh)
return_statement: return outputs, h
docstring: recurrent steps without sequence length
docstring_summary: recurrent steps without sequence length
docstring_tokens: recurrent steps without sequence length
function: def recurrent(self, x, h_0, w_ih, w_hh, b_ih, b_hh):
          '''recurrent steps without sequence length'''
          time_step = x.shape[0]
          outputs = []
          t = 0
          h = h_0
          while t < time_step:
              x_t = x[t:t + 1:1]
              x_t = P.Squeeze(0)(x_t)
              h = self.cell(x_t, h, w_ih, w_hh, b_ih, b_hh)
              if self.is_lstm:
                  outputs.append(h[0])
              else:
                  outputs.append(h)
              t += 1
          outputs = P.Stack()(outputs)
          return outputs, h
function_tokens: def recurrent ( self , x , h_0 , w_ih , w_hh , b_ih , b_hh ) : time_step = x . shape [ 0 ] outputs = [ ] t = 0 h = h_0 while t < time_step : x_t = x [ t : t + 1 : 1 ] x_t = P . Squeeze ( 0 ) ( x_t ) h = self . cell ( x_t , h , w_ih , w_hh , b_ih , b_hh ) if self . is_lstm : outputs . append ( h [ 0 ] ) else : outputs . append ( h ) t += 1 outputs = P . Stack ( ) ( outputs ) return outputs , h