datasources 0.1.47

Async datasource interfaces, middleware, registry, and test doubles
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

use crate::entity::{assign_one, assign_related, Entity};
use crate::enrichment::Enrichment;
use crate::readonly_enrichment_strategy::{
    key_of, source_at, source_key_of, ReadonlyEnrichmentStrategy,
};
use crate::repository::IReadonlyRepository;
use crate::result::Result;
use crate::row::Row;
use crate::value::Value;
use crate::{Operator, Where};
use async_trait::async_trait;
use futures_util::TryStreamExt;
use std::collections::HashMap;
use std::sync::Arc;

pub struct HashsetOptimizedReadonlyEnrichmentStrategy;

#[async_trait]
impl<T: Entity, TRelated: Entity> ReadonlyEnrichmentStrategy<T, TRelated>
    for HashsetOptimizedReadonlyEnrichmentStrategy
{
    async fn apply_object(
        &self,
        via: Arc<dyn IReadonlyRepository<TRelated>>,
        enrichment: &Enrichment,
        parents: &mut Vec<T>,
        sources: Option<&[Option<Row>]>,
    ) -> Result<()> {
        let keys = keys(parents, sources, &enrichment.source_property);
        if keys.is_empty() {
            return Ok(());
        }
        let loaded = via
            .read(&Where::new(Operator::in_list(
                enrichment.related_key.clone(),
                keys.values().cloned().collect(),
            )), None)
            .try_collect::<Vec<_>>()
            .await?;
        let mut index = HashMap::new();
        for related in loaded {
            if let Some(by) = related.cell(&enrichment.related_key) {
                index.insert(key_of(&by), related);
            }
        }
        for (index_i, parent) in parents.iter_mut().enumerate() {
            let Some(key) = source_key_of(
                parent,
                &enrichment.source_property,
                source_at(sources, index_i),
            ) else {
                continue;
            };
            let Some(related) = index.get(&key_of(&key)).cloned() else {
                continue;
            };
            match enrichment.related_property.as_deref() {
                Some(select) => {
                    if let Some(cell) = related.cell(select) {
                        parent.set_cell(&enrichment.destination_property, cell)?;
                    }
                }
                None => assign_one(parent, &enrichment.destination_property, related)?,
            }
        }
        Ok(())
    }

    async fn apply_list(
        &self,
        via: Arc<dyn IReadonlyRepository<TRelated>>,
        enrichment: &Enrichment,
        parents: &mut Vec<T>,
        sources: Option<&[Option<Row>]>,
    ) -> Result<()> {
        let keys = keys(parents, sources, &enrichment.source_property);
        if keys.is_empty() {
            return Ok(());
        }
        let loaded = via
            .read(&Where::new(Operator::in_list(
                enrichment.related_key.clone(),
                keys.values().cloned().collect(),
            )), None)
            .try_collect::<Vec<_>>()
            .await?;
        let mut index: HashMap<String, Vec<TRelated>> = HashMap::new();
        for related in loaded {
            if let Some(by) = related.cell(&enrichment.related_key) {
                index.entry(key_of(&by)).or_default().push(related);
            }
        }
        for (index_i, parent) in parents.iter_mut().enumerate() {
            let Some(key) = source_key_of(
                parent,
                &enrichment.source_property,
                source_at(sources, index_i),
            ) else {
                continue;
            };
            let related = index.get(&key_of(&key)).cloned().unwrap_or_default();
            assign_related(parent, &enrichment.destination_property, related)?;
        }
        Ok(())
    }
}

fn keys<T: Entity>(parents: &[T], sources: Option<&[Option<Row>]>, from: &str) -> HashMap<String, Value> {
    let mut keys = HashMap::new();
    for (index, parent) in parents.iter().enumerate() {
        if let Some(key) = source_key_of(parent, from, source_at(sources, index)) {
            keys.entry(key_of(&key)).or_insert(key);
        }
    }
    keys
}