-
Notifications
You must be signed in to change notification settings - Fork 158
/
Copy pathtimeline.py
1147 lines (886 loc) · 33.7 KB
/
timeline.py
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# Copyright (c) Microsoft Corporation. All rights reserved.
# Licensed under the MIT License. See LICENSE in the project root
# for license information.
import collections
import contextlib
import itertools
import queue
import threading
from debugpy.common import json, log, messaging, timestamp
from tests.patterns import some
SINGLE_LINE_REPR_LIMIT = 120
"""If repr() of an expectation or an occurrence is longer than this value, it will
be formatted to use multiple shorter lines if possible.
"""
# For use by Expectation.__repr__. Uses format() to create unique instances.
_INDENT = "{0}".format("_INDENT")
_DEDENT = "{0}".format("_DEDENT")
class Timeline(object):
def __init__(self, name=None):
self.name = str(name if name is not None else id(self))
self.ignore_unobserved = []
self._listeners = [] # [(expectation, callable)]
self._index_iter = itertools.count(1)
self._accepting_new = threading.Event()
self._finalized = threading.Event()
self._recorded_new = threading.Condition()
self._record_queue = queue.Queue()
self._recorder_thread = threading.Thread(
target=self._recorder_worker, name=f"{self} recorder"
)
self._recorder_thread.daemon = True
self._recorder_thread.start()
# Set up initial environment for our first mark()
self._last = None
self._beginning = None
self._accepting_new.set()
self._beginning = self.mark("START")
assert self._last is self._beginning
self._proceeding_from = self._beginning
def expect_frozen(self):
if not self.is_frozen:
raise Exception("Timeline can only be inspected while frozen.")
def __iter__(self):
self.expect_frozen()
return self._beginning.and_following()
def __len__(self):
return len(self.history())
@property
def beginning(self):
return self._beginning
@property
def last(self):
self.expect_frozen()
return self._last
def history(self):
self.expect_frozen()
return list(iter(self))
def __contains__(self, expectation):
self.expect_frozen()
return any(expectation.test(self.beginning, self.last))
def all_occurrences_of(self, expectation):
return tuple(occ for occ in self if occ == expectation)
def __getitem__(self, index):
assert isinstance(index, slice)
assert index.step is None
return Interval(self, index.start, index.stop)
def __reversed__(self):
self.expect_frozen()
return self.last.and_preceding()
@property
def is_frozen(self):
return not self._accepting_new.is_set()
def freeze(self):
self._accepting_new.clear()
def unfreeze(self):
if not self.is_final:
self._accepting_new.set()
@contextlib.contextmanager
def frozen(self):
was_frozen = self.is_frozen
self.freeze()
yield
if not was_frozen and not self.is_final:
self.unfreeze()
@contextlib.contextmanager
def unfrozen(self):
was_frozen = self.is_frozen
self.unfreeze()
yield
if was_frozen or self.is_final:
self.freeze()
@property
def is_final(self):
return self._finalized.is_set()
def finalize(self):
if self.is_final:
return
log.info("Finalizing timeline...")
with self.unfrozen():
self.mark("FINISH")
with self.unfrozen():
self._finalized.set()
# Drain the record queue.
self._record_queue.join()
# Tell the recorder to shut itself down.
self._record_queue.put(None)
self._recorder_thread.join()
assert self._record_queue.empty(), "Finalized timeline had pending records"
def close(self):
self.finalize()
self[:].expect_no_unobserved()
def __enter__(self):
return self
def __leave__(self, *args):
self.close()
def observe(self, *occurrences):
for occ in occurrences:
occ.observed = True
def observe_all(self, expectation=None):
self.expect_frozen()
occs = (
list(self)
if expectation is None
else [occ for occ in self if occ == expectation]
)
self.observe(*occs)
def wait_until(self, condition, freeze=None):
freeze = freeze or self.is_frozen
try:
with self._recorded_new:
# First, test the condition against the timeline as it currently is.
with self.frozen():
result = condition()
if result:
return result
# Now keep spinning waiting for new occurrences to come, and test the
# condition against every new batch in turn.
self.unfreeze()
while True:
self._recorded_new.wait()
with self.frozen():
result = condition()
if result:
return result
assert not self.is_final
finally:
if freeze:
self.freeze()
def _wait_until_realized(
self, expectation, freeze=None, explain=True, observe=True
):
def has_been_realized():
for reasons in expectation.test(self.beginning, self.last):
if observe:
self.expect_realized(expectation, explain=explain, observe=observe)
return reasons
reasons = self.wait_until(has_been_realized, freeze)
return latest_of(reasons.values())
def wait_until_realized(self, expectation, freeze=None, explain=True, observe=True):
if explain:
log.info("Waiting for {0!r}", expectation)
return self._wait_until_realized(expectation, freeze, explain, observe)
def wait_for(self, expectation, freeze=None, explain=True):
assert expectation.has_lower_bound, (
"Expectation must have a lower time bound to be used with wait_for()! "
"Use >> to sequence an expectation against an occurrence to establish a lower bound, "
"or wait_for_next() to wait for the next expectation since the timeline was last "
"frozen, or wait_until_realized() when a lower bound is really not necessary."
)
if explain:
log.info("Waiting for {0!r}", expectation)
return self._wait_until_realized(expectation, freeze, explain=explain)
def wait_for_next(self, expectation, freeze=True, explain=True, observe=True):
if explain:
log.info("Waiting for next {0!r}", expectation)
return self._wait_until_realized(
self._proceeding_from >> expectation, freeze, explain, observe
)
def new(self):
self.expect_frozen()
first_new = self._proceeding_from.next
if first_new is not None:
return self[first_new:]
else:
return self[self.last : self.last]
def proceed(self):
self.expect_frozen()
self.new().expect_no_unobserved()
self._proceeding_from = self.last
self.unfreeze()
def _expect_realized(self, expectation, first, explain=True, observe=True):
self.expect_frozen()
try:
reasons = next(expectation.test(first, self.last))
except StopIteration:
log.info("No matching {0!r}", expectation)
occurrences = list(first.and_following())
log.info("Occurrences considered: {0!r}", occurrences)
raise AssertionError("Expectation not matched")
occs = tuple(reasons.values())
assert occs
if observe:
self.observe(*occs)
if explain:
self._explain_how_realized(expectation, reasons)
return occs if len(occs) > 1 else occs[0]
def expect_realized(self, expectation, explain=True, observe=True):
return self._expect_realized(expectation, self.beginning, explain, observe)
def expect_new(self, expectation, explain=True, observe=True):
assert (
self._proceeding_from.next is not None
), "No new occurrences since last proceed()"
return self._expect_realized(
expectation, self._proceeding_from.next, explain, observe
)
def expect_not_realized(self, expectation):
self.expect_frozen()
assert expectation not in self
def expect_no_new(self, expectation):
self.expect_frozen()
assert expectation not in self.new()
def _explain_how_realized(self, expectation, reasons):
message = f"Realized {expectation!r}"
# For the breakdown, we want to skip any expectations that were exact occurrences,
# since there's no point explaining that occurrence was realized by itself.
skip = [exp for exp in reasons.keys() if isinstance(exp, Occurrence)]
for exp in skip:
reasons.pop(exp, None)
if reasons == {expectation: some.object}:
# If there's only one expectation left to explain, and it's the top-level
# one, then we have already printed it, so just add the explanation.
reason = reasons[expectation]
if "\n" in message:
message += f" == {reason!r}"
else:
message += f"\n == {reason!r}"
elif reasons:
# Otherwise, break it down expectation by expectation.
message += ":"
for exp, reason in reasons.items():
message += f"\n\n where {exp!r}\n == {reason!r}"
else:
message += "."
log.info("{0}", message)
def _record(self, occurrence, block=True):
assert isinstance(occurrence, Occurrence)
assert occurrence.timeline is None
assert occurrence.timestamp is None
assert (
not self.is_final
), "Trying to record a new occurrence in a finalized timeline"
self._record_queue.put(occurrence, block=block)
if block:
self._record_queue.join()
return occurrence
def _recorder_worker(self):
while True:
occ = self._record_queue.get()
if occ is None:
self._record_queue.task_done()
break
self._accepting_new.wait()
with self._recorded_new:
occ.timeline = self
occ.timestamp = timestamp.current()
occ.index = next(self._index_iter)
if self._last is None:
self._beginning = occ
self._last = occ
else:
assert self._last.timestamp <= occ.timestamp
occ.previous = self._last
self._last._next = occ
self._last = occ
self._recorded_new.notify_all()
self._record_queue.task_done()
for exp, callback in tuple(self._listeners):
if exp == occ:
callback(occ)
def mark(self, id, block=True):
occ = Occurrence("mark", id)
occ.id = id
occ.observed = True
return self._record(occ, block)
def record_event(self, message, block=True):
occ = EventOccurrence(message)
return self._record(occ, block)
def record_request(self, message, block=True):
occ = RequestOccurrence(message)
occ.observed = True
return self._record(occ, block)
def record_response(self, request_occ, message, block=True):
occ = ResponseOccurrence(request_occ, message)
return self._record(occ, block)
def when(self, expectation, callback):
"""For every occurrence recorded after this call, invokes callback(occurrence)
if occurrence == expectation.
"""
self._listeners.append((expectation, callback))
def _snapshot(self):
last = self._last
occ = self._beginning
while True:
yield occ
if occ is last:
break
occ = occ._next
def __repr__(self):
return "|" + " >> ".join(repr(occ) for occ in self._snapshot()) + "|"
def __str__(self):
return "Timeline-" + self.name
class Interval(tuple):
def __new__(cls, timeline, start, stop):
assert start is None or isinstance(start, Expectation)
assert stop is None or isinstance(stop, Expectation)
if not isinstance(stop, Occurrence):
timeline.expect_frozen()
occs = ()
if start is None:
start = timeline._beginning
for occ in start.and_following(up_to=stop):
if occ == stop:
break
if occ == start:
occs = occ.and_following(up_to=stop)
break
result = super().__new__(cls, occs)
result.timeline = timeline
result.start = start
result.stop = stop
return result
def __contains__(self, expectation):
return any(expectation.test(self[0], self[-1])) if len(self) > 0 else False
def all_occurrences_of(self, expectation):
return tuple(occ for occ in self if occ == expectation)
def expect_no_unobserved(self):
if not self:
return
unobserved = [
occ
for occ in self
if not occ.observed
and all(exp != occ for exp in self.timeline.ignore_unobserved)
]
if not unobserved:
return
raise log.error(
"Unobserved occurrences detected:\n\n{0}\n\nignoring unobserved:\n\n{1}",
"\n\n".join(repr(occ) for occ in unobserved),
"\n\n".join(repr(exp) for exp in self.timeline.ignore_unobserved),
)
class Expectation(object):
timeline = None
has_lower_bound = False
def test(self, first, last):
raise NotImplementedError()
def wait(self, freeze=None, explain=True):
assert (
self.timeline is not None
), "Expectation must be bound to a timeline to be waited on."
return self.timeline.wait_for(self, freeze, explain)
def wait_until_realized(self, freeze=None):
return self.timeline.wait_until_realized(self, freeze)
def __eq__(self, other):
if self is other:
return True
elif isinstance(other, Occurrence) and any(self.test(other, other)):
return True
else:
return NotImplemented
def __ne__(self, other):
return not self == other
def after(self, other):
return SequencedExpectation(other, self)
def when(self, condition):
return ConditionalExpectation(self, condition)
def __rshift__(self, other):
return self if other is None else other.after(self)
def __and__(self, other):
assert isinstance(other, Expectation)
return AndExpectation(self, other)
def __or__(self, other):
assert isinstance(other, Expectation)
return OrExpectation(self, other)
def __xor__(self, other):
assert isinstance(other, Expectation)
return XorExpectation(self, other)
def __hash__(self):
return hash(id(self))
def __repr__(self):
raise NotImplementedError
class DerivativeExpectation(Expectation):
def __init__(self, *expectations):
self.expectations = expectations
assert len(expectations) > 0
assert all(isinstance(exp, Expectation) for exp in expectations)
timelines = {id(exp.timeline): exp.timeline for exp in expectations}
timelines.pop(id(None), None)
if len(timelines) > 1:
offending_expectations = ""
for tl_id, tl in timelines.items():
offending_expectations += f"\n {tl_id}: {tl!r}\n"
raise log.error(
"Cannot mix expectations from multiple timelines:\n{0}",
offending_expectations,
)
for tl in timelines.values():
self.timeline = tl
@property
def has_lower_bound(self):
return all(exp.has_lower_bound for exp in self.expectations)
def flatten(self):
"""Flattens nested expectation chains.
If self is of type E, and given an expectation like::
E(E(e1, E(e2, e3)), E(E(e4, e5), E(e6)))
flatten() produces an iterator over::
e1, e2, e3, e4, e5, e6
"""
for exp in self.expectations:
if type(exp) is type(self):
for exp in exp.flatten():
yield exp
else:
yield exp
def describe(self, newline):
"""Returns an iterator describing this expectation. This method is used
to implement repr().
For every yielded _INDENT and _DEDENT, a newline and the appropriate amount
of spaces for correct indentation at the current level is added to the repr.
For every yielded Expectation, describe() is invoked recursively.
For every other yielded value, str(value) added to the repr.
newline is set to either "" or "\n", depending on whether the repr must be
single-line or multiline. Implementations of describe() should use it in
lieu of raw "\n" insofar as possible; however, repr() will automatically
fall back to multiline mode if "\n" occurs in single-line mode.
The default implementation produces a description that looks like::
(e1 OP e2 OP e3 OP ...)
where OP is the value of self.OPERATOR.
"""
op = self.OPERATOR
yield "("
yield _INDENT
first = True
for exp in self.flatten():
if first:
first = False
else:
yield " " + op + " "
yield newline
yield exp
yield _DEDENT
yield ")"
def __repr__(self):
def indent():
return indent.level * " " if newline else ""
def recurse(exp):
for item in exp.describe(newline):
if isinstance(item, DerivativeExpectation):
recurse(item)
elif item is _INDENT:
indent.level += 1
result.append(newline + indent())
elif item is _DEDENT:
assert indent.level > 0, "_DEDENT without matching _INDENT"
indent.level -= 1
result.append(newline + indent())
else:
item = str(item).replace("\n", "\n" + indent())
result.append(item)
# Try single-line repr first.
indent.level = 0
newline = ""
result = []
recurse(self)
s = "".join(result)
if len(s) <= SINGLE_LINE_REPR_LIMIT and "\n" not in s:
return s
# If it was too long, or had newlines anyway, fall back to multiline.
assert indent.level == 0
newline = "\n"
result[:] = []
recurse(self)
return "".join(result)
class SequencedExpectation(DerivativeExpectation):
OPERATOR = ">>"
def __init__(self, first, second):
super().__init__(first, second)
@property
def first(self):
return self.expectations[0]
@property
def second(self):
return self.expectations[1]
def test(self, first, last):
assert isinstance(first, Occurrence)
assert isinstance(last, Occurrence)
for first_reasons in self.first.test(first, last):
first_occs = first_reasons.values()
lower_bound = latest_of(first_occs).next
if lower_bound is not None:
for second_reasons in self.second.test(lower_bound, last):
reasons = second_reasons.copy()
reasons.update(first_reasons)
yield reasons
@property
def has_lower_bound(self):
return self.first.has_lower_bound or self.second.has_lower_bound
class OrExpectation(DerivativeExpectation):
OPERATOR = "|"
def test(self, first, last):
assert isinstance(first, Occurrence)
assert isinstance(last, Occurrence)
for exp in self.expectations:
for reasons in exp.test(first, last):
yield reasons
def __or__(self, other):
assert isinstance(other, Expectation)
return OrExpectation(*(self.expectations + (other,)))
class AndExpectation(DerivativeExpectation):
OPERATOR = "&"
def test(self, first, last):
assert isinstance(first, Occurrence)
assert isinstance(last, Occurrence)
if len(self.expectations) <= 1:
for exp in self.expectations:
for reasons in exp.test(first, last):
yield reasons
return
lhs = self.expectations[0]
rhs = AndExpectation(*self.expectations[1:])
for lhs_reasons in lhs.test(first, last):
for rhs_reasons in rhs.test(first, last):
reasons = lhs_reasons.copy()
reasons.update(rhs_reasons)
yield reasons
@property
def has_lower_bound(self):
return any(exp.has_lower_bound for exp in self.expectations)
def __and__(self, other):
assert isinstance(other, Expectation)
return AndExpectation(*(self.expectations + (other,)))
def __repr__(self):
return "(" + " & ".join(repr(exp) for exp in self.expectations) + ")"
class XorExpectation(DerivativeExpectation):
OPERATOR = "^"
def test(self, first, last):
assert isinstance(first, Occurrence)
assert isinstance(last, Occurrence)
reasons = None
for exp in self.expectations:
for exp_reasons in exp.test(first, last):
if reasons is None:
reasons = exp_reasons
else:
return
if reasons is not None:
yield reasons
@property
def has_lower_bound(self):
return all(exp.has_lower_bound for exp in self.expectations)
def __xor__(self, other):
assert isinstance(other, Expectation)
return XorExpectation(*(self.expectations + (other,)))
class ConditionalExpectation(DerivativeExpectation):
def __init__(self, expectation, condition):
self.condition = condition
super().__init__(expectation)
@property
def expectation(self):
return self.expectations[0]
def test(self, first, last):
assert isinstance(first, Occurrence)
assert isinstance(last, Occurrence)
for reasons in self.expectation.test(first, last):
occs = reasons.values()
if self.condition(*occs):
yield reasons
def describe(self, newline):
yield "?"
yield self.expectation
class PatternExpectation(Expectation):
def __init__(self, *circumstances):
self.circumstances = circumstances
def test(self, first, last):
assert isinstance(first, Occurrence)
assert isinstance(last, Occurrence)
for occ in first.and_following(up_to=last, inclusive=True):
if occ.circumstances == self.circumstances:
yield {self: occ}
def describe(self):
rest = repr(self.circumstances[1:])
if rest.endswith(",)"):
rest = rest[:-2] + ")"
return f"<{self.circumstances[0]}{rest}>"
def __repr__(self):
return self.describe()
def Mark(id):
return PatternExpectation("mark", id)
def _describe_message(message_type, *items):
items = (("type", message_type),) + items
d = collections.OrderedDict(items)
# Keep it all on one line if it's short enough, but indent longer ones.
for format_string in "{0:indent=None}", "{0}":
s = format_string.format(json.repr(d))
s = "{..., " + s[1:]
# Used by some.dict.containing to inject ... as needed.
s = s.replace('"\\u0002...": "...\\u0003"', "...")
# Used by some.* and by Event/Request/Response expectations below.
s = s.replace('"\\u0002', "")
s = s.replace('\\u0003"', "")
if len(s) <= SINGLE_LINE_REPR_LIMIT:
break
return s
def Event(event, body=some.object):
exp = PatternExpectation("event", event, body)
items = (("event", event),)
if body is some.object:
items += (("\002...", "...\003"),)
else:
items += (("body", body),)
exp.describe = lambda: _describe_message("event", *items)
return exp
def Request(command, arguments=some.object):
exp = PatternExpectation("request", command, arguments)
items = (("command", command),)
if arguments is some.object:
items += (("\002...", "...\003"),)
else:
items += (("arguments", arguments),)
exp.describe = lambda: _describe_message("request", *items)
return exp
def Response(request, body=some.object):
assert isinstance(request, Expectation) or isinstance(request, RequestOccurrence)
exp = PatternExpectation("response", request, body)
exp.timeline = request.timeline
exp.has_lower_bound = request.has_lower_bound
# Try to be as specific as possible.
if isinstance(request, Expectation):
if request.circumstances[0] != "request":
exp.describe = lambda: f"response to {request!r}"
return
else:
items = (("command", request.circumstances[1]),)
else:
items = (("command", request.command),)
if isinstance(request, Occurrence):
items += (("request_seq", request.seq),)
if body is some.object:
items += (("\002...", "...\003"),)
elif body is some.error or body == some.error:
items += (("success", False),)
if body == some.error:
items += (("message", str(body)),)
else:
items += (("body", body),)
exp.describe = lambda: _describe_message("response", *items)
return exp
class Occurrence(Expectation):
has_lower_bound = True
def __init__(self, *circumstances):
assert circumstances
self.circumstances = circumstances
self.timeline = None
self.timestamp = None
self.index = None
self.previous = None
self._next = None
self.observed = False
@property
def next(self):
if self.timeline is None:
return None
with self.timeline.frozen():
was_last = self is self.timeline.last
occ = self._next
if was_last:
# The .next property of the last occurrence in a timeline can change
# at any moment when timeline isn't frozen. So if it wasn't frozen by
# the caller, this was an unsafe operation, and we should complain.
self.timeline.expect_frozen()
return occ
def preceding(self):
it = self.and_preceding()
next(it)
return it
def and_preceding(self, up_to=None, inclusive=False):
assert self.timeline is not None
assert up_to is None or isinstance(up_to, Expectation)
if isinstance(up_to, Occurrence) and self < up_to:
return
occ = self
while occ != up_to:
yield occ
occ = occ.previous
if inclusive:
yield occ
def following(self):
it = self.and_following()
next(it)
return it
def and_following(self, up_to=None, inclusive=False):
assert self.timeline is not None
assert up_to is None or isinstance(up_to, Expectation)
if up_to is None:
self.timeline.expect_frozen()
if isinstance(up_to, Occurrence) and up_to < self:
return
occ = self
while occ != up_to:
yield occ
occ = occ.next
if inclusive:
yield occ
def precedes(self, occurrence):
assert isinstance(occurrence, Occurrence)
return any(occ is self for occ in occurrence.preceding())
def follows(self, occurrence):
return occurrence.precedes(self)
def realizes(self, expectation):
assert isinstance(expectation, Expectation)
return expectation == self
def test(self, first, last):
assert isinstance(first, Occurrence)
assert isinstance(last, Occurrence)
for occ in first.and_following(up_to=last, inclusive=True):
if occ is self:
yield {self: self}
def __lt__(self, occurrence):
return self.precedes(occurrence)
def __gt__(self, occurrence):
return occurrence.precedes(self)
def __le__(self, occurrence):
return self is occurrence or self < occurrence
def __ge__(self, occurrence):
return self is occurrence or self > occurrence
def __rshift__(self, expectation):
assert isinstance(expectation, Expectation)
return expectation.after(self)
def __hash__(self):
return hash(id(self))
def __repr__(self):
return (
"" if self.observed else "*"
) + f"{self.index}.{self.describe_circumstances()}"
def describe_circumstances(self):
rest = repr(self.circumstances[1:])
if rest.endswith(",)"):
rest = rest[:-2] + ")"
return f"{self.circumstances[0]}{rest}"
class MessageOccurrence(Occurrence):
"""An occurrence representing a DAP message (event, request, or response).
Its circumstances == (self.TYPE, self._key, self._data).
"""
TYPE = None
"""Used for self.circumstances[0].
Must be defined by subclasses.
"""
def __init__(self, message):
assert self.TYPE
assert isinstance(message, messaging.Message)
# Assign message first for the benefit of self._data in child classes.
self.message = message
super().__init__(self.TYPE, self._key, self._data)
@property
def seq(self):
return self.message.seq
@property
def _key(self):
"""The part of the message that describes it in general terms - e.g. for
an event, it's the name of the event.
"""
raise NotImplementedError
@property
def _data(self):
"""The part of the message that is used for matching expectations, excluding
self._key.
"""