(self: Dequeue<A, E>)
| 1930 | finalize(self, self.state.exit) |
| 1931 | return Pull.isDoneCause(self.state.exit.cause) |
| 1932 | } |
| 1933 | return false |
| 1934 | } |
| 1935 | let n = self.capacity - self.messages.length |
| 1936 | for (const entry of self.state.offers) { |
| 1937 | if (n === 0) break |
| 1938 | else if (entry._tag === "Single") { |
| 1939 | MutableList.append(self.messages, entry.message) |
| 1940 | n-- |
| 1941 | entry.resume(exitTrue) |
| 1942 | self.state.offers.delete(entry) |
| 1943 | } else { |
| 1944 | for (; entry.offset < entry.remaining.length; entry.offset++) { |
| 1945 | if (n === 0) return false |
| 1946 | MutableList.append(self.messages, entry.remaining[entry.offset]) |
| 1947 | n-- |
| 1948 | } |
| 1949 | entry.resume(core.exitSucceed([])) |
no test coverage detected
searching dependent graphs…