Skip to content

Commit 9d8cb41

Browse files
committed
fix: fixed tests for union_no_overlap
1 parent d6f783d commit 9d8cb41

File tree

2 files changed

+39
-38
lines changed

2 files changed

+39
-38
lines changed

aw_transform/union_no_overlap.py

Lines changed: 0 additions & 38 deletions
Original file line numberDiff line numberDiff line change
@@ -82,41 +82,3 @@ def union_no_overlap(events1: List[Event], events2: List[Event]) -> List[Event]:
8282
events_union += events1[e1_i:]
8383
events_union += events2[e2_i:]
8484
return events_union
85-
86-
87-
def test_union_no_overlap():
88-
from pprint import pprint
89-
90-
now = datetime(2018, 1, 1, 0, 0)
91-
td1h = timedelta(hours=1)
92-
events1 = [
93-
Event(timestamp=now + 2 * i * td1h, duration=td1h, data={"test": 1})
94-
for i in range(3)
95-
]
96-
events2 = [
97-
Event(timestamp=now + (2 * i + 0.5) * td1h, duration=td1h, data={"test": 2})
98-
for i in range(3)
99-
]
100-
101-
events_union = _union_no_overlap(events1, events2)
102-
# pprint(events_union)
103-
dur = sum((e.duration for e in events_union), timedelta(0))
104-
assert dur == timedelta(hours=4, minutes=30)
105-
assert sorted(events_union, key=lambda e: e.timestamp)
106-
107-
events_union = _union_no_overlap(events2, events1)
108-
# pprint(events_union)
109-
dur = sum((e.duration for e in events_union), timedelta(0))
110-
assert dur == timedelta(hours=4, minutes=30)
111-
assert sorted(events_union, key=lambda e: e.timestamp)
112-
113-
events1 = [
114-
Event(timestamp=now + (2 * i) * td1h, duration=td1h, data={"test": 1})
115-
for i in range(3)
116-
]
117-
events2 = [Event(timestamp=now, duration=5 * td1h, data={"test": 2})]
118-
events_union = _union_no_overlap(events1, events2)
119-
pprint(events_union)
120-
dur = sum((e.duration for e in events_union), timedelta(0))
121-
assert dur == timedelta(hours=5, minutes=0)
122-
assert sorted(events_union, key=lambda e: e.timestamp)

tests/test_transforms.py

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,6 +15,7 @@
1515
split_url_events,
1616
simplify_string,
1717
union,
18+
union_no_overlap,
1819
categorize,
1920
tag,
2021
Rule,
@@ -410,3 +411,41 @@ def test_tags():
410411

411412
assert len(events[0].data["$tags"]) == 2
412413
assert len(events[1].data["$tags"]) == 0
414+
415+
416+
def test_union_no_overlap():
417+
from pprint import pprint
418+
419+
now = datetime(2018, 1, 1, 0, 0)
420+
td1h = timedelta(hours=1)
421+
events1 = [
422+
Event(timestamp=now + 2 * i * td1h, duration=td1h, data={"test": 1})
423+
for i in range(3)
424+
]
425+
events2 = [
426+
Event(timestamp=now + (2 * i + 0.5) * td1h, duration=td1h, data={"test": 2})
427+
for i in range(3)
428+
]
429+
430+
events_union = union_no_overlap(events1, events2)
431+
# pprint(events_union)
432+
dur = sum((e.duration for e in events_union), timedelta(0))
433+
assert dur == timedelta(hours=4, minutes=30)
434+
assert sorted(events_union, key=lambda e: e.timestamp)
435+
436+
events_union = union_no_overlap(events2, events1)
437+
# pprint(events_union)
438+
dur = sum((e.duration for e in events_union), timedelta(0))
439+
assert dur == timedelta(hours=4, minutes=30)
440+
assert sorted(events_union, key=lambda e: e.timestamp)
441+
442+
events1 = [
443+
Event(timestamp=now + (2 * i) * td1h, duration=td1h, data={"test": 1})
444+
for i in range(3)
445+
]
446+
events2 = [Event(timestamp=now, duration=5 * td1h, data={"test": 2})]
447+
events_union = union_no_overlap(events1, events2)
448+
pprint(events_union)
449+
dur = sum((e.duration for e in events_union), timedelta(0))
450+
assert dur == timedelta(hours=5, minutes=0)
451+
assert sorted(events_union, key=lambda e: e.timestamp)

0 commit comments

Comments
 (0)