| /wasmtime-44.0.1/crates/environ/src/graphs/ |
| H A D | entity_graph.rs | 10 pub struct EntityGraph<Node>
12 Node: EntityRef,
19 edge_elems: Vec<Node>,
22 impl<Node> Debug for EntityGraph<Node>
24 Node: EntityRef + Debug,
27 struct Edges<'a, Node: EntityRef + Debug>(&'a EntityGraph<Node>); in fmt()
29 impl<'a, Node: EntityRef + Debug> Debug for Edges<'a, Node> { in fmt()
47 impl<Node> EntityGraph<Node>
54 mut successors: impl FnMut(Node, &mut Vec<Node>) -> Result<(), E>, in new() argument
77 impl<Node> Graph<Node> for EntityGraph<Node>
[all …]
|
| H A D | dfs.rs | 4 pub struct Dfs<Node> {
5 stack: Vec<DfsEvent<Node>>,
8 impl<Node> Default for Dfs<Node> {
16 impl<Node> Dfs<Node> {
38 pub enum DfsEvent<Node> {
40 Pre(Node),
43 AfterEdge(Node, Node),
46 Post(Node),
49 impl<Node> Dfs<Node>
51 Node: Copy,
[all …]
|
| H A D | scc.rs | 36 Node: EntityRef,
46 impl<Node> Debug for StronglyConnectedComponents<Node>
48 Node: EntityRef + Debug,
51 struct Map<'a, Node: EntityRef + Debug>(&'a StronglyConnectedComponents<Node>); in fmt()
53 impl<'a, Node> Debug for Map<'a, Node> in fmt()
68 impl<Node> StronglyConnectedComponents<Node>
70 Node: EntityRef + Debug,
75 G: Graph<Node>, in new()
306 G: Graph<Node>, in evaporation()
414 pub struct Node(u32); struct
[all …]
|
| /wasmtime-44.0.1/crates/environ/src/ |
| H A D | graphs.rs | 15 pub trait Graph<Node> {
17 type NodesIter<'a>: Iterator<Item = Node>
25 type SuccessorsIter<'a>: Iterator<Item = Node>
30 fn successors(&self, node: Node) -> Self::SuccessorsIter<'_>; in successors()
43 F: Fn(&Node) -> bool, in filter_nodes()
52 impl<T, Node> Graph<Node> for &'_ T
54 T: ?Sized + Graph<Node>,
70 fn successors(&self, node: Node) -> Self::SuccessorsIter<'_> { in successors()
95 impl<G, F, Node> Graph<Node> for FilterNodes<G, F>
97 G: Graph<Node>,
[all …]
|
| /wasmtime-44.0.1/cranelift/bforest/src/ |
| H A D | pool.rs | 5 use super::{Forest, Node, NodeData};
14 nodes: PrimaryMap<Node, NodeData<F>>,
15 freelist: Option<Node>,
34 pub fn alloc_node(&mut self, data: NodeData<F>) -> Result<Node, OutOfMemory> { in alloc_node() argument
55 pub fn free_node(&mut self, node: Node) { in free_node() argument
65 pub fn free_tree(&mut self, node: Node) { in free_tree() argument
82 pub fn verify_tree<C: Comparator<F::Key>>(&self, node: Node, comp: &C) in verify_tree() argument
209 impl<F: Forest> Index<Node> for NodePool<F> {
212 fn index(&self, index: Node) -> &Self::Output { in index()
217 impl<F: Forest> IndexMut<Node> for NodePool<F> {
[all …]
|
| H A D | node.rs | 29 tree: [Node; INNER_SIZE],
42 Free { next: Option<Node> },
76 pub fn inner(left: Node, key: F::Key, right: Node) -> Self { in inner() argument
610 let n1 = Node(1); in inner()
611 let n2 = Node(2); in inner()
612 let n3 = Node(3); in inner()
613 let n4 = Node(4); in inner()
734 let n1 = Node(1); in inner_balance()
735 let n2 = Node(2); in inner_balance()
736 let n3 = Node(3); in inner_balance()
[all …]
|
| H A D | path.rs | 17 node: [Node; MAX_PATH],
29 node: [Node(0); MAX_PATH], in default()
51 root: Node, in find() argument
166 fn next_node(&mut self, level: usize, pool: &NodePool<F>) -> Option<Node> { in next_node() argument
195 fn prev_leaf(&mut self, pool: &NodePool<F>) -> Option<Node> { in prev_leaf() argument
205 fn goto_subtree_last(&mut self, level: usize, root: Node, pool: &NodePool<F>) -> Node { in goto_subtree_last() argument
226 pub fn set_root_node(&mut self, root: Node) { in set_root_node() argument
233 pub fn leaf_pos(&self) -> Option<(Node, usize)> { in leaf_pos() argument
239 fn leaf_node(&self) -> Node { in leaf_node() argument
269 ) -> Result<Node, OutOfMemory> { in insert() argument
[all …]
|
| H A D | lib.rs | 108 struct Node(u32); struct
109 entity_impl!(Node, "node");
|
| H A D | map.rs | 81 root: PackedOption<Node>,
342 root: &PackedOption<Node>, in prev() argument
368 root: &PackedOption<Node>, in goto() argument
384 root: &PackedOption<Node>, in goto_first() argument
396 root: &mut PackedOption<Node>, in insert() argument
407 root: &mut PackedOption<Node>, in try_insert() argument
435 root: &mut PackedOption<Node>, in remove() argument
456 root: &'a PackedOption<Node>,
539 root: &'a mut PackedOption<Node>,
639 root: PackedOption<Node>,
[all …]
|
| H A D | set.rs | 3 use super::{Comparator, Forest, INNER_SIZE, Node, NodeData, NodePool, Path, SetValue};
73 root: PackedOption<Node>,
209 root: &'a mut PackedOption<Node>,
349 root: PackedOption<Node>,
|
| /wasmtime-44.0.1/crates/wasmtime/src/compile/ |
| H A D | stratify.rs | 64 pub struct Strata<Node> {
66 layer_elems: Vec<Node>,
69 impl<Node: Debug> Debug for Strata<Node> {
71 struct Layers<'a, Node>(&'a Strata<Node>); in fmt()
73 impl<'a, Node: Debug> Debug for Layers<'a, Node> { in fmt()
89 impl<Node> Strata<Node> {
94 Node: EntityRef + Debug, in new()
95 G: Debug + Graph<Node>, in new() argument
126 let mut layer_elems: Vec<Node> = Vec::with_capacity(cap); in new()
179 pub fn layers(&self) -> impl ExactSizeIterator<Item = &[Node]> { in layers()
|
| /wasmtime-44.0.1/docs/js/ |
| H A D | mermaid.min.11.6.0.js | 12 …Node\b)/,/^(?:Node_L\b)/,/^(?:Node_R\b)/,/^(?:Rel\b)/,/^(?:BiRel\b)/,/^(?:Rel_Up\b)/,/^(?:Rel_U\b)…
475 Node.id = `,y,`
804 …me(e));let a=this.astNodeLocator.getAstNodePath(e);if(!r)throw new Error(`Node at path ${a} has no…
|