/* This file is part of DarkFi (https://dark.fi) * * Copyright (C) 2020-2022 Dyne.org foundation * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU Affero General Public License as * published by the Free Software Foundation, either version 3 of the * License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Affero General Public License for more details. * * You should have received a copy of the GNU Affero General Public License * along with this program. If not, see . */ use std::collections::HashMap; use darkfi::Result; use crate::model::{Event, EventId, EventsQueueArc}; #[allow(dead_code)] struct View { seen: HashMap, } impl View { pub fn _new() -> Self { Self { seen: HashMap::new() } } pub async fn _process(&mut self, events_queue: EventsQueueArc) -> Result<()> { loop { let new_event = events_queue.fetch().await?; // TODO sort the events self.seen.insert(new_event.hash(), new_event); } } }