pidge 0.4.5

A fast CLI for e-mail and calendar
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113

//! `pidge mail search <query>` — full-text search using Graph's `$search` KQL.
//!
//! Results come back in Graph's relevance order (not date), and search is
//! across all mail folders, not just Inbox — which is generally what users
//! mean by "search e-mail".

use anyhow::{Result, anyhow};
use colored::Colorize;
use futures::future::join_all;

use pidge_client::{AuthClient, ClientError, GraphClient};
use pidge_core::{Config, Message, MessageCache, short_hash};

use crate::commands::mail::{MessageRow, account_labels, render};

pub async fn run(
    query: String,
    account_filter: Vec<String>,
    limit: usize,
    compact: bool,
    table: bool,
    full: bool,
    json: bool,
) -> Result<()> {
    let config = Config::load()?;
    if config.accounts.is_empty() {
        return Err(anyhow!(
            "No accounts signed in. Run `pidge account add` to add one."
        ));
    }

    let target_emails: Vec<String> = if account_filter.is_empty() {
        config.accounts.iter().map(|a| a.email.clone()).collect()
    } else {
        for f in &account_filter {
            if config.find(f).is_none() {
                return Err(anyhow!("not signed in to {f}"));
            }
        }
        account_filter
    };

    // Search each account in parallel; Graph caps each query at its own limit,
    // so we let every account return up to `limit` results, then trim the union.
    let graph = GraphClient::new(AuthClient::from_env()?)?;
    let futures = target_emails.iter().map(|email| {
        let graph = &graph;
        let e = email.clone();
        let q = query.clone();
        async move {
            let result = graph.search_messages(&e, &q, limit).await;
            (e, result)
        }
    });

    let mut had_success = false;
    let mut messages: Vec<Message> = Vec::new();
    for (email, result) in join_all(futures).await {
        match result {
            Ok(msgs) => {
                had_success = true;
                messages.extend(msgs);
            }
            Err(ClientError::SessionExpired { email: e }) => {
                eprintln!(
                    "{} {e}: session expired, run `pidge account add`",
                    "WARNING:".yellow().bold()
                );
            }
            Err(e) => eprintln!("{} {email}: {e}", "WARNING:".yellow().bold()),
        }
    }

    if !had_success {
        return Err(anyhow!("All searched accounts failed."));
    }

    // Graph search returns by relevance; trim to `limit` total across accounts
    // so a wide multi-account search doesn't flood the terminal.
    messages.truncate(limit);

    // Cache the IDs so the user can `pidge mail show <fragment>` straight from
    // the search results.
    {
        let mut cache = MessageCache::load()?;
        let pairs: Vec<(String, String)> = messages
            .iter()
            .map(|m| (m.id.clone(), m.account.clone()))
            .collect();
        cache.insert_many(&pairs);
        cache.save()?;
    }

    if messages.is_empty() && !json {
        println!("No matches.");
        return Ok(());
    }

    let rows: Vec<MessageRow> = messages
        .into_iter()
        .map(|m| {
            let h = short_hash(&m.id);
            MessageRow {
                message: m,
                short_hash: h,
            }
        })
        .collect();

    let single_account = target_emails.len() == 1;
    let labels = account_labels(&target_emails);
    render(&rows, single_account, &labels, compact, table, full, json)
}