rust/hyperswitch
1
0
Fork 0
mirror of https://github.com/juspay/hyperswitch.git synced 2025-10-29 00:49:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat(constraint_graph): make the constraint graph framework generic and move it into a separate crate (#3071)

Browse Source
This commit is contained in:
Shanks
2024-05-06 18:38:44 +05:30
committed by GitHub
parent b1cfef257a
commit a23a365cdf
25 changed files with 2060 additions and 1150 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
crates/euclid_macros/src/inner/knowledge.rs
View File

@ -329,19 +329,17 @@ impl ToString for Scope {
#[derive(Clone)]
struct Program {
rules: Vec<Rc<Rule>>,
scope: Scope,
}
impl Parse for Program {
fn parse(input: syn::parse::ParseStream<'_>) -> syn::Result<Self> {
let scope: Scope = input.parse()?;
let mut rules: Vec<Rc<Rule>> = Vec::new();
while !input.is_empty() {
rules.push(Rc::new(input.parse::<Rule>()?));
}
Ok(Self { rules, scope })
Ok(Self { rules })
}
}
@ -502,12 +500,12 @@ impl GenContext {
let key = format_ident!("{}", &atom.key);
let the_value = match &atom.value {
ValueType::Any => quote! {
NodeValue::Key(DirKey::new(DirKeyKind::#key,None))
cgraph::NodeValue::Key(DirKey::new(DirKeyKind::#key,None))
},
ValueType::EnumVariant(variant) => {
let variant = format_ident!("{}", variant);
quote! {
NodeValue::Value(DirValue::#key(#key::#variant))
cgraph::NodeValue::Value(DirValue::#key(#key::#variant))
}
}
ValueType::Number { number, comparison } => {
@ -530,7 +528,7 @@ impl GenContext {
};
quote! {
NodeValue::Value(DirValue::#key(NumValue {
cgraph::NodeValue::Value(DirValue::#key(NumValue {
number: #number,
refinement: #comp_type,
}))
@ -539,7 +537,7 @@ impl GenContext {
};
let compiled = quote! {
let #identifier = graph.make_value_node(#the_value, None, Vec::new(), None::<()>).expect("NodeId derivation failed");
let #identifier = graph.make_value_node(#the_value, None, None::<()>);
};
tokens.extend(compiled);
@ -581,7 +579,6 @@ impl GenContext {
Vec::from_iter([#(#values_tokens),*]),
None,
None::<()>,
Vec::new(),
).expect("Failed to make In aggregator");
};
@ -606,7 +603,7 @@ impl GenContext {
for (from_node, relation) in &node_details {
let relation = format_ident!("{}", relation.to_string());
tokens.extend(quote! {
graph.make_edge(#from_node, #rhs_ident, Strength::#strength, Relation::#relation)
graph.make_edge(#from_node, #rhs_ident, cgraph::Strength::#strength, cgraph::Relation::#relation, None::<cgraph::DomainId>)
.expect("Failed to make edge");
});
}
@ -614,16 +611,18 @@ impl GenContext {
let mut all_agg_nodes: Vec<TokenStream> = Vec::with_capacity(node_details.len());
for (from_node, relation) in &node_details {
let relation = format_ident!("{}", relation.to_string());
all_agg_nodes.push(quote! { (#from_node, Relation::#relation, Strength::Strong) });
all_agg_nodes.push(
quote! { (#from_node, cgraph::Relation::#relation, cgraph::Strength::Strong) },
);
}
let strength = format_ident!("{}", rule.strength.to_string());
let (agg_node_ident, _) = self.next_node_ident();
tokens.extend(quote! {
let #agg_node_ident = graph.make_all_aggregator(&[#(#all_agg_nodes),*], None, None::<()>, Vec::new())
let #agg_node_ident = graph.make_all_aggregator(&[#(#all_agg_nodes),*], None, None::<()>, None)
.expect("Failed to make all aggregator node");
graph.make_edge(#agg_node_ident, #rhs_ident, Strength::#strength, Relation::Positive)
graph.make_edge(#agg_node_ident, #rhs_ident, cgraph::Strength::#strength, cgraph::Relation::Positive, None::<cgraph::DomainId>)
.expect("Failed to create all aggregator edge");
});
@ -638,21 +637,10 @@ impl GenContext {
self.compile_rule(rule, &mut tokens)?;
}
let scope = match &program.scope {
Scope::Crate => quote! { crate },
Scope::Extern => quote! { euclid },
};
let compiled = quote! {{
use #scope::{
dssa::graph::*,
types::*,
frontend::dir::{*, enums::*},
};
use euclid_graph_prelude::*;
use rustc_hash::{FxHashMap, FxHashSet};
let mut graph = KnowledgeGraphBuilder::new();
let mut graph = cgraph::ConstraintGraphBuilder::new();
#tokens