{"action":"opened","issue":{"url":"https://api.github.com/repos/Marwes/gluon/issues/58","repository_url":"https://api.github.com/repos/Marwes/gluon","labels_url":"https://api.github.com/repos/Marwes/gluon/issues/58/labels{/name}","comments_url":"https://api.github.com/repos/Marwes/gluon/issues/58/comments","events_url":"https://api.github.com/repos/Marwes/gluon/issues/58/events","html_url":"https://github.com/Marwes/gluon/issues/58","id":167172618,"number":58,"title":"Type/identifier search in the repl","user":{"login":"bjz","id":695077,"avatar_url":"https://avatars.githubusercontent.com/u/695077?v=3","gravatar_id":"","url":"https://api.github.com/users/bjz","html_url":"https://github.com/bjz","followers_url":"https://api.github.com/users/bjz/followers","following_url":"https://api.github.com/users/bjz/following{/other_user}","gists_url":"https://api.github.com/users/bjz/gists{/gist_id}","starred_url":"https://api.github.com/users/bjz/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/bjz/subscriptions","organizations_url":"https://api.github.com/users/bjz/orgs","repos_url":"https://api.github.com/users/bjz/repos","events_url":"https://api.github.com/users/bjz/events{/privacy}","received_events_url":"https://api.github.com/users/bjz/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-07-23T07:26:31Z","updated_at":"2016-07-23T07:26:31Z","closed_at":null,"body":"Would be super groovy if you could search for functions in-scope with `:s`. Here is what you can do in the Idris repl:\r\n\r\n```\r\nIdris> :search Monad f => f a -> f b -> f a\r\n< Prelude.Applicative.(*>) : Applicative f => f a -> f b -> f b\r\n\r\n\r\n< Prelude.Applicative.(<*) : Applicative f => f a -> f b -> f a\r\n\r\n\r\n> Prelude.List.intercalate : List a -> List (List a) -> List a\r\nGiven a separator list and some more lists, produce a new list\r\nby placing the separator between each of the lists.\r\n\r\n> Prelude.List.(++) : List a -> List a -> List a\r\nAppend two lists\r\n\r\n> Language.Reflection.Elab.Prim__Try : Elab a ->\r\n                                       Elab a -> Elab a\r\n\r\n\r\n> Prelude.List.(\\\\) : Eq a => List a -> List a -> List a\r\nThe \\\\ function is list difference (non-associative). In the\r\nresult of xs \\\\ ys, the first occurrence of each element of ys\r\nin turn (if any) has been removed from xs, e.g.,\r\n\r\n> Prelude.List.merge : Ord a => List a -> List a -> List a\r\nMerge two sorted lists using the default ordering for the type\r\nof their elements.\r\n\r\n> Prelude.List.union : Eq a => List a -> List a -> List a\r\nCompute the union of two lists according to their Eq\r\nimplementation.\r\n\r\n> Prelude.while : IO' l Bool -> IO' l () -> IO' l ()\r\nLoop while some test is true\r\n```"}}
{"actor":{"display_login":"bjz"}}