Lines Matching refs:tree

8 by and lives in the Cranelift tree in
9 [cranelift/isle](https://github.com/bytecodealliance/wasmtime/tree/main/cranelift/isle).
56 generate a decision tree in Rust that can call into arbitrary
148 statements, i.e., resembles a very large decision tree, while
150 that, when composed and combined, become that more complex tree. This
156 A term-rewriting system typically operates on data that is in a *tree*
163       terms with balanced parentheses; then we have our tree.
174 which we can write more clearly as the tree:
282 different rules on different "shapes" of the tree of constructors in
449       [wasm-mutate](https://github.com/bytecodealliance/wasm-tools/tree/main/crates/wasm-mutate),
955 [RFC](https://github.com/bytecodealliance/rfcs/tree/main/accepted/isle-extended-patterns.md)
1169 bottoms out on the output side, the "term tree" is reified as a tree
1400 The decision trie is, as the name implies, a kind of decision tree, in
1401 the sense that we start at the root and move down the tree based on
1404 It is a "trie" (which is a kind of tree) because at each level, its
1405 edges are labeled with match operations; a trie is a tree where one
1409 Each node in the tree is either an internal decision node, or a leaf
1412 backtracking-based. We attempt to find some path down the tree through
1417 existing tree as we process rules) and each rule's right-hand side
1423 simply perform an in-order tree traversal and find the first