phabricator 0.0.4

Crate to work with Phabricator web APIs
Documentation 
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167

use crate::search;
use crate::Client;
use crate::Task;
use futures::prelude::*;
use phabricator_api::maniphest::search::Search;
use phabricator_api::maniphest::search::SearchCursor;
use phabricator_api::types::Cursor;
use phabricator_api::types::Phid;
use phabricator_api::RequestError;
use std::collections::HashSet;
use std::sync::Arc;

async fn get(
    client: &Client,
    search: Arc<Search>,
    cursor: Option<Cursor>,
) -> Result<search::QueryData<Task>, RequestError> {
    let mut data = match cursor {
        Some(cursor) => {
            let s = SearchCursor {
                cursor: &cursor,
                search: &*search,
            };
            client.client().request(&s).await?
        }
        None => client.client().request(&*search).await?,
    };
    let projects: HashSet<_> = data
        .data
        .iter()
        .filter_map(|d| d.attachments.projects.as_ref().map(|p| &p.projects))
        .flatten()
        .collect();

    if !projects.is_empty() {
        client
            .projects_by_phid(projects)
            .query()
            .try_for_each(|_| future::ready(Ok(())))
            .await?;
    }

    let tasks = data
        .data
        .drain(..)
        .map(|d| Task::update_from_searchdata(d, client))
        .collect();

    let cursor = if data.cursor.after.is_some() {
        Some(data.cursor)
    } else {
        None
    };

    Ok((tasks, cursor))
}

enum Constraint<'a> {
    Tasks(Vec<u32>),
    Phids(Vec<&'a Phid>),
}

pub struct TasksBuilder<'c> {
    client: &'c Client,
    constraints: Constraint<'c>,
    resolve_projects: bool,
}

impl<'a, 'c> TasksBuilder<'c> {
    pub(crate) fn new(client: &'c Client, tasks: &mut dyn Iterator<Item = &u32>) -> Self {
        TasksBuilder {
            client,
            constraints: Constraint::Tasks(tasks.copied().collect()),
            resolve_projects: false,
        }
    }

    pub(crate) fn new_by_phids(
        client: &'c Client,
        phids: &'c mut dyn Iterator<Item = &'c Phid>,
    ) -> Self {
        TasksBuilder {
            client,
            constraints: Constraint::Phids(phids.collect()),
            resolve_projects: false,
        }
    }

    pub fn projects(mut self) -> Self {
        self.resolve_projects = true;
        self
    }

    pub fn query(self) -> impl Stream<Item = Result<Task, RequestError>> + 'c {
        let client = &self.client;
        let resolve_projects = self.resolve_projects;

        let mut constraints = self.constraints;
        let (search, cached) = match constraints {
            Constraint::Tasks(ref mut tasks) => {
                let (lookup, cached) =
                    tasks
                        .iter()
                        .fold((vec![], vec![]), |(mut lookup, mut cached), t| {
                            let task = client.cached_task(*t).filter(|t| {
                                if resolve_projects {
                                    t.projects_resolved()
                                } else {
                                    true
                                }
                            });

                            match task {
                                Some(t) => cached.push(t),
                                None => lookup.push(*t),
                            }
                            (lookup, cached)
                        });
                let search = if lookup.is_empty() {
                    None
                } else {
                    let mut search: Search = Default::default();
                    search.constraints.ids = Some(lookup);
                    search.attachments.projects = self.resolve_projects;
                    Some(search)
                };
                (search, cached)
            }
            Constraint::Phids(ref mut phids) => {
                let (lookup, cached) =
                    phids
                        .iter()
                        .fold((vec![], vec![]), |(mut lookup, mut cached), p| {
                            let task = client.cached_task_by_phid(p).filter(|t| {
                                if resolve_projects {
                                    t.projects_resolved()
                                } else {
                                    true
                                }
                            });

                            match task {
                                Some(t) => cached.push(t),
                                None => lookup.push((*p).clone()),
                            }
                            (lookup, cached)
                        });
                let search = if lookup.is_empty() {
                    None
                } else {
                    let mut search: Search = Default::default();
                    search.constraints.phids = Some(lookup);
                    search.attachments.projects = self.resolve_projects;
                    Some(search)
                };
                (search, cached)
            }
        };

        search::Search::new(
            self.client,
            cached,
            search,
            Box::new(|client, search, cursor| get(client, search, cursor).boxed()),
        )
    }
}