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

// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements.  See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership.  The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License.  You may obtain a copy of the License at
//
//   http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied.  See the License for the
// specific language governing permissions and limitations
// under the License.

use std::sync::Arc;

use super::core::GithubCore;
use crate::raw::oio::Entry;
use crate::raw::*;
use crate::*;

pub struct GithubLister {
    core: Arc<GithubCore>,

    path: String,
    recursive: bool,
}

impl GithubLister {
    pub fn new(core: Arc<GithubCore>, path: &str, recursive: bool) -> Self {
        Self {
            core,

            path: path.to_string(),
            recursive,
        }
    }
}

impl oio::PageList for GithubLister {
    async fn next_page(&self, ctx: &mut oio::PageContext) -> Result<()> {
        let resp = self.core.list(&self.path).await?;

        // Record whether there is a dir in the list so that we need recursive later.
        let has_dir = resp.entries.iter().any(|e| e.type_field == "dir");

        ctx.done = true;

        if !self.recursive || !has_dir {
            for entry in resp.entries {
                let path = build_rel_path(&self.core.root, &entry.path);
                let entry = if entry.type_field == "dir" {
                    let path = format!("{}/", path);
                    Entry::new(&path, Metadata::new(EntryMode::DIR))
                } else {
                    if path.ends_with(".gitkeep") {
                        continue;
                    }
                    let m = Metadata::new(EntryMode::FILE)
                        .with_content_length(entry.size)
                        .with_etag(entry.sha);
                    Entry::new(&path, m)
                };
                ctx.entries.push_back(entry);
            }
            if !self.path.ends_with('/') {
                ctx.entries.push_back(Entry::new(
                    &format!("{}/", self.path),
                    Metadata::new(EntryMode::DIR),
                ));
            }
            return Ok(());
        }

        // if recursive is true and there is a dir in the list, we need to list it recursively.

        let tree = self.core.list_with_recursive(&resp.git_url).await?;
        for t in tree {
            let path = if self.path == "/" {
                t.path
            } else {
                format!("{}/{}", self.path, t.path)
            };
            let entry = if t.type_field == "tree" {
                let path = format!("{}/", path);
                Entry::new(&path, Metadata::new(EntryMode::DIR))
            } else {
                if path.ends_with(".gitkeep") {
                    continue;
                }
                let mut m = Metadata::new(EntryMode::FILE).with_etag(t.sha);

                if let Some(size) = t.size {
                    m = m.with_content_length(size);
                }
                Entry::new(&path, m)
            };
            ctx.entries.push_back(entry);
        }
        if !self.path.ends_with('/') {
            ctx.entries.push_back(Entry::new(
                &format!("{}/", self.path),
                Metadata::new(EntryMode::DIR),
            ));
        }

        Ok(())
    }
}