Enter the query into the form above.
API method:
GET /api/symbols?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Apply GRAFTS to the OUTPUTS of DRV and all their dependencies, recursively. That is, if GRAFTS apply only indirectly to DRV, graft the dependencies of DRV, and graft DRV itself to refer to those grafted dependencies.
Return a derivation called NAME, which applies GRAFTS to the specified OUTPUTS of DRV. This procedure performs "shallow" grafting in that GRAFTS are not recursively applied to dependencies of DRV.
Do a depth-first traversal of NODES along NODE-EDGES, calling PROC with each node and the current result, and visiting each reachable node exactly once. NODES must be a list of nodes, and NODE-EDGES must be a one-argument procedure as returned by 'node-edges' or 'node-back-edges'.
Return the graph backend called NAME. Raise an error if it is not found.
Write to PORT the representation of the DAG with the given SINKS, using the given BACKEND. Use NODE-TYPE to traverse the DAG. When REVERSE-EDGES? is true, draw reverse arrows. Do not represent nodes whose distance to one of the SINKS is greater than MAX-DEPTH.
Return the list of nodes directly or indirectly connected to NODES according to the NODE-EDGES procedure. NODE-EDGES must be a one-argument procedure that, given a node, returns its list of direct dependents; it is typically returned by 'node-edges' or 'node-back-edges'.
Return, as a monadic value, a one-argument procedure that, given a node of TYPE, returns its back edges. NODES is taken to be the sinks of the global graph.