events_queue.rs 1.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950
  1. /* This file is part of DarkFi (https://dark.fi)
  2. *
  3. * Copyright (C) 2020-2023 Dyne.org foundation
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU Affero General Public License as
  7. * published by the Free Software Foundation, either version 3 of the
  8. * License, or (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU Affero General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Affero General Public License
  16. * along with this program. If not, see <https://www.gnu.org/licenses/>.
  17. */
  18. use std::sync::Arc;
  19. use darkfi_serial::{Decodable, Encodable};
  20. use crate::{event_graph::model::Event, Error, Result};
  21. use super::EventMsg;
  22. pub type EventsQueuePtr<T> = Arc<EventsQueue<T>>;
  23. pub struct EventsQueue<T: Send + Sync>(
  24. smol::channel::Sender<Event<T>>,
  25. smol::channel::Receiver<Event<T>>,
  26. );
  27. impl<T> EventsQueue<T>
  28. where
  29. T: Send + Sync + Encodable + Decodable + Clone + EventMsg,
  30. {
  31. pub fn new() -> EventsQueuePtr<T> {
  32. let (sn, rv) = smol::channel::unbounded();
  33. Arc::new(Self(sn, rv))
  34. }
  35. pub async fn fetch(&self) -> Result<Event<T>> {
  36. self.1.recv().await.map_err(Error::from)
  37. }
  38. pub async fn dispatch(&self, event: &Event<T>) -> Result<()> {
  39. self.0.send(event.clone()).await.map_err(Error::from)
  40. }
  41. }