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.
Return the list of derivation-inputs required to build DRV, recursively.
CUT? is a predicate that is passed a derivation-input and returns true to eliminate the given input and its dependencies from the search. An example of such a predicate is 'valid-derivation-input?'; when it is used as CUT?, the result is the set of prerequisites of DRV not already in valid.
Return #t if DRV can be substituted.
Return true if INPUT is valid--i.e., if all the outputs it requests are in the store.
Given MAPPING, a list of pairs of derivations, return a derivation based on DRV where all the 'car's of MAPPING have been replaced by its 'cdr's, recursively.
Read the derivation in FILE, a '.drv' file, and return the corresponding <derivation> object.
Return the store path of its output OUTPUT. Raise a '&derivation-missing-output-error' condition if OUTPUT is not an output of DRV.
Return a <derivation-input> for the OUTPUTS of DRV.
Invalidate internal derivation caches. This is mostly useful for long-running processes that know what they're doing. Use with care!
Read the derivation from PATH (`/gnu/store/xxx.drv'), and return the store path of its output OUTPUT.
Perform a breadth-first traversal of INPUTS, calling PROC on each input with the current result, starting from SEED. Skip recursion on inputs that match CUT?.