static GazelleTree gazelle_searchTreeUpwards(F1<GazelleTree, Bool> pred, GazelleTree tree) { if (tree == null || tree.parent == null) null; L<GazelleTree> l = tree.parent.children; if (!tree.parent.isSplitNode) l = reversed(l); int i = indexOf(l, tree); ret gazelle_searchTree_breadthFirst_backwards(pred, takeFirst(l, i)); }
download show line numbers debug dex old transpilations
Travelled to 7 computer(s): bhatertpkbcr, cfunsshuasjs, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1021564 |
| Snippet name: | gazelle_searchTreeUpwards |
| Eternal ID of this version: | #1021564/7 |
| Text MD5: | 20b78e94c019a7e407a655065e3e567e |
| Author: | stefan |
| Category: | javax / a.i. |
| Type: | JavaX fragment (include) |
| Public (visible to everyone): | Yes |
| Archived (hidden from active list): | No |
| Created/modified: | 2019-02-18 17:14:33 |
| Source code size: | 341 bytes / 7 lines |
| Pitched / IR pitched: | No / No |
| Views / Downloads: | 1072 / 1102 |
| Version history: | 6 change(s) |
| Referenced in: | [show references] |