view.rs 1.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  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::{collections::HashMap, sync::Arc};
  19. use darkfi_serial::{Decodable, Encodable};
  20. use smol::lock::Mutex;
  21. use crate::{
  22. event_graph::{
  23. events_queue::EventsQueuePtr,
  24. model::{Event, EventId},
  25. },
  26. Result,
  27. };
  28. use super::EventMsg;
  29. pub type ViewPtr<T> = Arc<Mutex<View<T>>>;
  30. pub struct View<T: Send + Sync> {
  31. pub seen: HashMap<EventId, Event<T>>,
  32. pub events_queue: EventsQueuePtr<T>,
  33. }
  34. impl<T> View<T>
  35. where
  36. T: Send + Sync + Encodable + Decodable + Clone + EventMsg,
  37. {
  38. pub fn new(events_queue: EventsQueuePtr<T>) -> Self {
  39. Self { seen: HashMap::new(), events_queue }
  40. }
  41. pub async fn process(&mut self) -> Result<Event<T>> {
  42. // loop {
  43. let new_event = self.events_queue.fetch().await?;
  44. Ok(new_event)
  45. // }
  46. }
  47. }