Baseline: tree as shared
This commit is contained in:
commit
659c03bbf8
1471 files changed
+990535
No files matched your search
@@ -0,0 +1,26 @@
|
||||
# probe: a FIFO queue with pop(0) and a fieldwise struct
|
||||
# status: the expected output is Programming+'s interpreter's prediction; corpus.py verify confirms or refutes it on godbolt
|
||||
# expect-stdout: first
|
||||
# expect-stdout: second
|
||||
# expect-stdout: third
|
||||
# expect-stdout: fourth
|
||||
@fieldwise_init
|
||||
struct Queue(Movable):
|
||||
var items: List[String]
|
||||
|
||||
def enqueue(mut self, x: String):
|
||||
self.items.append(x)
|
||||
|
||||
def dequeue(mut self) -> String:
|
||||
return self.items.pop(0)
|
||||
|
||||
|
||||
def main():
|
||||
var q = Queue(List[String]())
|
||||
q.enqueue("first")
|
||||
q.enqueue("second")
|
||||
q.enqueue("third")
|
||||
print(q.dequeue())
|
||||
q.enqueue("fourth")
|
||||
while len(q.items) > 0:
|
||||
print(q.dequeue())
|
||||
Reference in new issue
Block a user