File: analyze_safe_buffer_debug_notes.py

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (39 lines) | stat: -rw-r--r-- 959 bytes parent folder | download | duplicates (9) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
 
import sys
from collections import OrderedDict

class Trie:
    def __init__(self, name):
        self.name = name
        self.children = OrderedDict()
        self.count = 1

    def add(self, name):
        if name in self.children:
            self.children[name].count += 1
        else:
            self.children[name] = Trie(name)
        return self.children[name]

    def print(self, depth):
        if depth > 0:
            print('|', end="")
        for i in range(depth):
            print('-', end="")
        if depth > 0:
            print(end=" ")
        print(self.name, '#', self.count)
        for key, child in self.children.items():
            child.print(depth + 1)


Root = Trie("Root")

if __name__ == "__main__":
    for line in sys.stdin:
        words = line.split('==>')
        words = [word.strip() for word in words]
        MyTrie = Root;
        for word in words:
            MyTrie = MyTrie.add(word)

    Root.print(0)