fn dlqList
The entries of the dead-letter queue of a pipeline (qualified name), oldest first.
Example:
@error data Rejected { why: str }
fn moderate(n: i32) -> i32 | Rejected {
if n % 2 == 1 { fail Rejected{ why: "odd" } }
n
}
pipeline photo(n: i32) -> i32 {
respond it
-> moderate
-> moderate
}
fn main() io, net, time, db {
let _ = photo(3)
sleep(300ms)
print("{std.saga.dlqList("main.photo").len()}")
}Вывод
1
pub(api) fn dlqList(pipe: str) -> List<DlqEntry> net, db, timeСложность. O(n) in the number of entries of the queue.
С версии. 1.0.0-beta
Параметры
| Имя | Тип |
|---|---|
pipe | str |
Возвращает
Эффекты
net, db, time
Определено в: std/saga/saga.oxl:1567