refactor!
https://blockly-demo.appspot.com/static/demos/code/index.html#xhyzuf

tree = ['']
window_start = 1
window_end = 4
for count2 in range(8000000):
  window = text[window_start - 1 : window_end]
  window_start = window_start + 1
  window_end = window_end + 1
  char_location = 1
  node = 1
  for count in range(4):
    char_in_window = window[char_location - 1]
    char_location = char_location + 1
    char_index = tree[node - 1].find(char_in_window) + 1
    if char_index == 0:
      tree[node - 1] = str(tree[node - 1]) + str(char_in_window)
      if node == len(tree):
        tree.append([])
      tree[(node + 1 - 1)].append(len(tree) + 1)
      tree.append('')
      node = len(tree)
    else:
      if char_location != 5:
        goto = node + 1
      else:
        goto = node
      node = tree[goto - 1][char_index - 1]
print(tree)
------------------------------------------
Artificial General Intelligence List: AGI
Permalink: 
https://agi.topicbox.com/groups/agi/T11f5dc3052b454b3-M35e3f25bc52beef2c19c053f
Delivery options: https://agi.topicbox.com/groups/agi/subscription

Reply via email to