(self: Dequeue<A, E>)
| 1883 | return core.exitSucceed(messages) |
| 1884 | } |
| 1885 | } |
| 1886 | |
| 1887 | const offerRemainingSingle = <A, E>(self: Enqueue<A, E>, message: A) => { |
| 1888 | return internalEffect.callback<boolean>((resume) => { |
| 1889 | if (self.state._tag !== "Open") { |
| 1890 | return resume(exitFalse) |
| 1891 | } |
| 1892 | const entry: Queue.OfferEntry<A> = { _tag: "Single", message, resume } |
| 1893 | self.state.offers.add(entry) |
| 1894 | return internalEffect.sync(() => { |
| 1895 | if (self.state._tag === "Open") { |
| 1896 | self.state.offers.delete(entry) |
| 1897 | } |
| 1898 | }) |
| 1899 | }) |
| 1900 | } |
| 1901 | |
| 1902 | const offerRemainingArray = <A, E>(self: Enqueue<A, E>, remaining: Array<A>) => { |
| 1903 | return internalEffect.callback<Array<A>>((resume) => { |
| 1904 | if (self.state._tag !== "Open") { |
| 1905 | return resume(core.exitSucceed(remaining)) |
| 1906 | } |
| 1907 | const entry: Queue.OfferEntry<A> = { |
| 1908 | _tag: "Array", |
| 1909 | remaining, |
| 1910 | offset: 0, |
| 1911 | resume |
| 1912 | } |
| 1913 | self.state.offers.add(entry) |
| 1914 | return internalEffect.sync(() => { |
| 1915 | if (self.state._tag === "Open") { |
| 1916 | self.state.offers.delete(entry) |
| 1917 | } |
| 1918 | }) |
| 1919 | }) |
| 1920 | } |
no outgoing calls
no test coverage detected
searching dependent graphs…