1import{_,u as f,r,o as A,c as g,a as s,w as c,b as o,n as l,g as d,d as e}from"./index-BCct5f0E.js";const v={setup(){const a=f();a.article.log=[{status:["M"],files:["src/prose/logic/pipes/directed-acyclic-async-common-ancestors.md"],abbrevHash:"f2a184e",hash:"f2a184e7ea9bda0e67a1c501a11c58e47902efc9",subject:"feat: Start overhauling Baleada Features docs for v0.14, and redesign the site",authorName:"Alex Vipond",authorDate:"2024-08-21 19:50:00 -0500"}],a.article.frontMatter={title:"directed acyclic async common ancestors",source:"directed-acyclic-async-node.ts",tests:"node/directed-acyclic-async-node.test.ts",publish:!1,order:0},a.article.relativePath="src/prose/logic/pipes/directed-acyclic-async-common-ancestors.md",a.article.source="https://github.com/baleada/logic/tree/main/src/pipes/directed-acyclic-async-node.ts",a.article.tests="https://github.com/baleada/logic/tree/main/tests/node/directed-acyclic-async-node.test.ts",a.article.stub=!1}},b={class:"baleada-prose-article"},L={class:"mb-7 flex flex-col gap-2"},w=e("code",null,"createDirectedAcyclicAsyncCommonAncestors",-1),C=e("p",null,[o("Your created "),e("code",null,"directedAcyclicAsyncCommonAncestors"),o(" function is a "),e("a",{href:"https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Generator",rel:"noopener"},"generator"),o(" that yields each common ancestor separately, starting with the one that is deepest in the graph (closest to the two nodes) and ending with the one that is shallowest in the graph (furthest from the two nodes).")],-1),B=e("p",null,[o("Call "),e("code",null,"createDirectedAcyclicAsyncCommonAncestors"),o(" with no parameters to create your "),e("code",null,"directedAcyclicAsyncCommonAncestors"),o(" function.")],-1),k=e("p",null,[o("Call "),e("code",null,"createDirectedAcyclicAsyncCommonAncestors"),o(" with these parameters to create your "),e("code",null,"directedAcyclicAsyncCommonAncestors"),o(" function:")],-1),x=e("code",null,"directedAcyclicAsync",-1),P=[x];function D(a,R,T,j,N,S){const i=r("BaleadaProseHeading"),p=r("LayoutArticleLog"),m=r("LayoutArticleLinks"),n=r("RouterLink"),u=r("BaleadaProseTable"),y=r("LayoutAdjacentArticleLinks"),h=r("LayoutArticleEdit");return A(),g("article",b,[s(i,l(d({level:1,isFirst:!0})),{default:c(()=>[o(" directed acyclic async common ancestors")]),_:1},16),e("p",L,[s(p),s(m)]),e("p",null,[w,o(" is a "),s(n,{to:"/docs/logic/pipes-overview",rel:"noopener"},{default:c(()=>[o("pipe")]),_:1}),o(" that asynchronously transforms two "),s(n,{to:"/docs/logic/graph-overview#graph-node-and-edge",rel:"noopener"},{default:c(()=>[o("nodes")]),_:1}),o(" in a directed acyclic graph to all of the "),s(n,{to:"/docs/logic/graph-overview#common-ancestor",rel:"noopener"},{default:c(()=>[o("common ancestors")]),_:1}),o(" of both.")]),C,s(i,l(d({level:2,isFirst:!1})),{default:c(()=>[o(" Create common ancestors")]),_:1},16),B,k,s(u,l(d({ariaLabel:"createDirectedAcyclicAsyncCommonAncestors parameters",classes:"wide-4",totalBodyRows:1,totalColumns:4})),{"looped-0-looped-0-looped-0":c(({ref:t})=>[e("div",{ref:t},"Parameter",512)]),"looped-0-looped-0-looped-1":c(({ref:t})=>[e("div",{ref:t},"Type",512)]),"looped-0-looped-0-looped-2":c(({ref:t})=>[e("div",{ref:t},"Required",512)]),"looped-0-looped-0-looped-3":c(({ref:t})=>[e("div",{ref:t},"Description",512)]),"looped-1-looped-0-looped-0":c(({ref:t})=>[e("div",{ref:t},P,512)]),"looped-1-looped-0-looped-1":c(({ref:t})=>[e("div",{ref:t},"GraphAsync",512)]),"looped-1-looped-0-looped-2":c(({ref:t})=>[e("div",{ref:t},"yes",512)]),"looped-1-looped-0-looped-3":c(({ref:t})=>[e("div",{ref:t},"The async directed acyclic graph to analyze.",512)]),_:1},16),e("p",null,[s(y),s(h)])])}const $=_(v,[["render",D]]);export{$ as default};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.