code: def _generate_wilcoxon_exact_table_fast(N):
      """
      Same functionality as _generate_wilcoxon_exact_table, but about 20% faster,
      but harder to follow.
      """
      res_dict = {}
      for n in range(1, N + 1):
          ranks = np.arange(n) + 1
          M = int(n * (n + 1) / 2)
          res = np.zeros(M + 1, dtype=int)
          for x in itertools.product((0, 1), repeat=n):
              if x[0] == 1:
                  rank_sum = int(np.sum(x * ranks))
                  res[rank_sum] += 1
          # flip array to get counts of symmetric sequences starting with 0
          res_dict[n] = list(res + np.flip(res))
      return res_dict
  
label_desc: Use image node_id 2 for calling a global function with example usage: _generate_wilcoxon_exact_table_fast(N) and returns: res_dict