def contains_value_loop
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1494
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1494def contains_value_loop(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, ~eq: V -> V -> Bool, +fuel: Nat, +wanted: V, +found: Bool, st: Cursor<K, V, cmp> & Maybe<&2, Entry<K, V>>) -> TreeMap<K, V, cmp> & Bool:
1495 match fuel found st:
1496 case _ True{} Tuple{cursor, item}:
1497 (iterator_finish(~K, ~V, ~cmp, cursor), True{})
1498 case 0n False{} Tuple{cursor, item}:
1499 (iterator_finish(~K, ~V, ~cmp, cursor), False{})
1500 case 1n+f False{} Tuple{cursor, None{}}:
1501 (iterator_finish(~K, ~V, ~cmp, cursor), False{})
1502 case 1n+f False{} Tuple{cursor, Some{Entry{k, v}}}:
1503 contains_value_loop(~K, ~V, ~cmp, ~eq, f, wanted, eq(v, wanted), iterator_next(~K, ~V, ~cmp, cursor))