language-servers/roc
1
0
Fork 0
mirror of https://github.com/roc-lang/roc.git synced 2025-11-02 22:01:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 6

has -> implements

Browse source
This commit is contained in:
Bryce Miller 2023-05-21 19:54:58 -04:00
parent 8191c49ab0
commit 31c06ca979
No known key found for this signature in database
GPG key ID: F1E97BF8DF152350
1 changed files with 7 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

14
crates/compiler/solve/tests/solve_expr.rs
View file

@ -3411,7 +3411,7 @@ mod solve_expr {
infer_eq_without_problem( infer_eq_without_problem(
indoc!( indoc!(
r#" r#"
reconstructPath : Dict position position, position -> List position | position has Hash & Eq reconstructPath : Dict position position, position -> List position | position implements Hash & Eq
reconstructPath = \cameFrom, goal -> reconstructPath = \cameFrom, goal ->
when Dict.get cameFrom goal is when Dict.get cameFrom goal is
Err KeyNotFound -> Err KeyNotFound ->
@ -3458,7 +3458,7 @@ mod solve_expr {
Model position : { openSet : Set position } Model position : { openSet : Set position }
cheapestOpen : Model position -> Result position [KeyNotFound] | position has Hash & Eq cheapestOpen : Model position -> Result position [KeyNotFound] | position implements Hash & Eq
cheapestOpen = \model -> cheapestOpen = \model ->
folder = \resSmallestSoFar, position -> folder = \resSmallestSoFar, position ->
@ -3473,7 +3473,7 @@ mod solve_expr {
Set.walk model.openSet (Ok { position: boom {}, cost: 0.0 }) folder Set.walk model.openSet (Ok { position: boom {}, cost: 0.0 }) folder
|> Result.map (\x -> x.position) |> Result.map (\x -> x.position)
astar : Model position -> Result position [KeyNotFound] | position has Hash & Eq astar : Model position -> Result position [KeyNotFound] | position implements Hash & Eq
astar = \model -> cheapestOpen model astar = \model -> cheapestOpen model
main = main =
@ -4122,7 +4122,7 @@ mod solve_expr {
Key k : Num k Key k : Num k
removeHelpEQGT : Key k, RBTree (Key k) v -> RBTree (Key k) v | k has Hash & Eq removeHelpEQGT : Key k, RBTree (Key k) v -> RBTree (Key k) v | k implements Hash & Eq
removeHelpEQGT = \targetKey, dict -> removeHelpEQGT = \targetKey, dict ->
when dict is when dict is
Node color key value left right -> Node color key value left right ->
@ -4236,7 +4236,7 @@ mod solve_expr {
_ -> _ ->
Empty Empty
removeHelp : Key k, RBTree (Key k) v -> RBTree (Key k) v | k has Hash & Eq removeHelp : Key k, RBTree (Key k) v -> RBTree (Key k) v | k implements Hash & Eq
removeHelp = \targetKey, dict -> removeHelp = \targetKey, dict ->
when dict is when dict is
Empty -> Empty ->
@ -4324,7 +4324,7 @@ mod solve_expr {
RBTree k v : [Node NodeColor k v (RBTree k v) (RBTree k v), Empty] RBTree k v : [Node NodeColor k v (RBTree k v) (RBTree k v), Empty]
removeHelp : Num k, RBTree (Num k) v -> RBTree (Num k) v | k has Hash & Eq removeHelp : Num k, RBTree (Num k) v -> RBTree (Num k) v | k implements Hash & Eq
removeHelp = \targetKey, dict -> removeHelp = \targetKey, dict ->
when dict is when dict is
Empty -> Empty ->
@ -4359,7 +4359,7 @@ mod solve_expr {
removeHelpPrepEQGT : Key k, RBTree (Key k) v, NodeColor, (Key k), v, RBTree (Key k) v, RBTree (Key k) v -> RBTree (Key k) v removeHelpPrepEQGT : Key k, RBTree (Key k) v, NodeColor, (Key k), v, RBTree (Key k) v, RBTree (Key k) v -> RBTree (Key k) v
removeHelpEQGT : Key k, RBTree (Key k) v -> RBTree (Key k) v | k has Hash & Eq removeHelpEQGT : Key k, RBTree (Key k) v -> RBTree (Key k) v | k implements Hash & Eq
removeHelpEQGT = \targetKey, dict -> removeHelpEQGT = \targetKey, dict ->
when dict is when dict is
Node color key value left right -> Node color key value left right ->