coma 0.2.1

Coma is a lightweight command-line tool designed for crawling websites
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

use crate::topology::Node;
use std::{
    collections::LinkedList,
    sync::{Arc, Mutex},
};

pub struct State {
    pub current_depth: i32,
    pub current_external: i32,
    visited: Vec<Arc<Mutex<Node>>>,
    layers: LinkedList<Vec<Arc<Mutex<Node>>>>,
    pub current_layer: Vec<Arc<Mutex<Node>>>,
}

impl State {
    pub fn new(root: Arc<Mutex<Node>>) -> Result<Self, Box<dyn std::error::Error>> {
        // Queue of vector of the discovered link at the current depth
        // Each node of the linkedlist is a depth
        let mut layers: LinkedList<Vec<Arc<Mutex<Node>>>> = LinkedList::new();
        layers.push_back(vec![root]);

        // This will never be used and could be None
        let current_layer = Vec::new();

        Ok(State {
            current_depth: 0,
            current_external: 0,
            visited: Vec::new(),
            layers,
            current_layer,
        })
    }

    pub fn pop_layer(&mut self) -> Option<()> {
        self.current_layer = self.layers.pop_front()?;
        Some(())
    }

    pub fn add_to_next_layer(&mut self, links: Vec<Arc<Mutex<Node>>>) {
        if self.layers.front().is_none() {
            self.layers.push_back(Vec::new());
        }
        self.layers.front_mut().unwrap().extend(links);
    }

    pub fn known(&mut self, node: &Arc<Mutex<Node>>) -> bool {
        for visited_node in self.visited.iter() {
            if visited_node.lock().unwrap().eq(&node.lock().unwrap()) {
                return true;
            }
        }
        self.visited.push(Arc::clone(node));
        false
    }
}