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 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260
// 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 crate::raw::*;
use crate::*;
/// FlatLister will walk dir in bottom up way:
///
/// - List nested dir first
/// - Go back into parent dirs one by one
///
/// Given the following file tree:
///
/// ```txt
/// .
/// ├── dir_x/
/// │ ├── dir_y/
/// │ │ ├── dir_z/
/// │ │ └── file_c
/// │ └── file_b
/// └── file_a
/// ```
///
/// ToFlatLister will output entries like:
///
/// ```txt
/// dir_x/dir_y/dir_z/file_c
/// dir_x/dir_y/dir_z/
/// dir_x/dir_y/file_b
/// dir_x/dir_y/
/// dir_x/file_a
/// dir_x/
/// ```
///
/// # Note
///
/// There is no guarantee about the order between files and dirs at the same level.
/// We only make sure the nested dirs will show up before parent dirs.
///
/// Especially, for storage services that can't return dirs first, ToFlatLister
/// may output parent dirs' files before nested dirs, this is expected because files
/// always output directly while listing.
pub struct FlatLister<A: Access, L> {
acc: A,
next_dir: Option<oio::Entry>,
active_lister: Vec<(Option<oio::Entry>, L)>,
}
/// # Safety
///
/// wasm32 is a special target that we only have one event-loop for this FlatLister.
unsafe impl<A: Access, L> Send for FlatLister<A, L> {}
/// # Safety
///
/// We will only take `&mut Self` reference for FsLister.
unsafe impl<A: Access, L> Sync for FlatLister<A, L> {}
impl<A, L> FlatLister<A, L>
where
A: Access,
{
/// Create a new flat lister
pub fn new(acc: A, path: &str) -> FlatLister<A, L> {
FlatLister {
acc,
next_dir: Some(oio::Entry::new(path, Metadata::new(EntryMode::DIR))),
active_lister: vec![],
}
}
}
impl<A, L> oio::List for FlatLister<A, L>
where
A: Access<Lister = L>,
L: oio::List,
{
async fn next(&mut self) -> Result<Option<oio::Entry>> {
loop {
if let Some(de) = self.next_dir.take() {
let (_, l) = self.acc.list(de.path(), OpList::new()).await?;
self.active_lister.push((Some(de), l));
}
let (de, lister) = match self.active_lister.last_mut() {
Some((de, lister)) => (de, lister),
None => return Ok(None),
};
match lister.next().await? {
Some(v) if v.mode().is_dir() => {
// should not loop itself again
if v.path() != de.as_ref().expect("de should not be none here").path() {
self.next_dir = Some(v);
continue;
}
}
Some(v) => return Ok(Some(v)),
None => match de.take() {
Some(de) => {
return Ok(Some(de));
}
None => {
let _ = self.active_lister.pop();
continue;
}
},
}
}
}
}
impl<A, P> oio::BlockingList for FlatLister<A, P>
where
A: Access<BlockingLister = P>,
P: oio::BlockingList,
{
fn next(&mut self) -> Result<Option<oio::Entry>> {
loop {
if let Some(de) = self.next_dir.take() {
let (_, l) = self.acc.blocking_list(de.path(), OpList::new())?;
self.active_lister.push((Some(de), l))
}
let (de, lister) = match self.active_lister.last_mut() {
Some((de, lister)) => (de, lister),
None => return Ok(None),
};
match lister.next()? {
Some(v) if v.mode().is_dir() => {
if v.path() != de.as_ref().expect("de should not be none here").path() {
self.next_dir = Some(v);
continue;
}
}
Some(v) => return Ok(Some(v)),
None => match de.take() {
Some(de) => {
return Ok(Some(de));
}
None => {
let _ = self.active_lister.pop();
continue;
}
},
}
}
}
}
#[cfg(test)]
mod tests {
use std::collections::HashMap;
use std::sync::Arc;
use std::vec;
use std::vec::IntoIter;
use log::debug;
use oio::BlockingList;
use super::*;
#[derive(Debug)]
struct MockService {
map: HashMap<&'static str, Vec<&'static str>>,
}
impl MockService {
fn new() -> Self {
let mut map = HashMap::default();
map.insert("x/", vec!["x/x/"]);
map.insert("x/x/", vec!["x/x/x/"]);
map.insert("x/x/x/", vec!["x/x/x/x"]);
Self { map }
}
fn get(&self, path: &str) -> MockLister {
let inner = self.map.get(path).expect("must have value").to_vec();
MockLister {
inner: inner.into_iter(),
}
}
}
impl Access for MockService {
type Reader = ();
type BlockingReader = ();
type Writer = ();
type BlockingWriter = ();
type Lister = ();
type BlockingLister = MockLister;
fn info(&self) -> Arc<AccessorInfo> {
let mut am = AccessorInfo::default();
am.full_capability_mut().list = true;
am.into()
}
fn blocking_list(&self, path: &str, _: OpList) -> Result<(RpList, Self::BlockingLister)> {
debug!("visit path: {path}");
Ok((RpList::default(), self.get(path)))
}
}
struct MockLister {
inner: IntoIter<&'static str>,
}
impl BlockingList for MockLister {
fn next(&mut self) -> Result<Option<oio::Entry>> {
Ok(self.inner.next().map(|path| {
if path.ends_with('/') {
oio::Entry::new(path, Metadata::new(EntryMode::DIR))
} else {
oio::Entry::new(path, Metadata::new(EntryMode::FILE))
}
}))
}
}
#[test]
fn test_blocking_list() -> Result<()> {
let _ = tracing_subscriber::fmt().with_test_writer().try_init();
let acc = MockService::new();
let mut lister = FlatLister::new(acc, "x/");
let mut entries = Vec::default();
while let Some(e) = lister.next()? {
entries.push(e)
}
assert_eq!(
entries[0],
oio::Entry::new("x/x/x/x", Metadata::new(EntryMode::FILE))
);
Ok(())
}
}