FilesExpand file tree

 universal-python

/

autodediffer.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

60 lines (51 loc) · 1.22 KB

 universal-python

/

autodediffer.py

Top

File metadata and controls

• Code
• Blame

60 lines (51 loc) · 1.22 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

'''

A semi-smart diff for autodebugger logs.

Run it with filenames of two autodebugger logs as parameters

'''

import os, sys

def process_line(line):

#AD:2041,0.900000

if not line.startswith('AD:'): return

line = line.split(':')[1]

num, val = line.split(',')

return [int(num), float(val)]

a = open(sys.argv[1], 'r').readlines()

b = open(sys.argv[2], 'r').readlines()

MIN = 0.0001 if len(sys.argv) < 4 else sys.argv[3]

ai = 0

bi = 0

maxx = max(len(a), len(b))

while max(ai, bi) < maxx:

while 1:

av = process_line(a[ai])

if av: break

ai += 1

while 1:

bv = process_line(b[bi])

if bv: break

bi += 1

#print 'curr:', ai, bi, av, bv

# Find the nearest matching num, if not already matched

if not av[0] == bv[0]:

tai = ai+1

tbi = bi+1

while 1:

tav = process_line(a[tai])

tbv = process_line(b[tbi])

#print 'seek:', tai, tbi, tav, tbv

if tav and tav[0] == bv[0]:

ai = tai

av = tav

break

elif tbv and tbv[0] == av[0]:

bi = tbi

bv = tbv

break

tai += 1

tbi += 1

assert av[0] == bv[0]

diff = abs(av[1] - bv[1])

if diff > MIN:

print '<<%d %d>> %d : %.5f' % (ai, bi, av[0], diff)

ai += 1

bi += 1