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.
Rewrite URI to a mirror:// URI if possible, or return URI unmodified.
Return the <upstream-source> for the latest version of PACKAGE or #f. PACKAGE must be the canonical name of a GNU package. Optionally include a VERSION string to fetch a specific version, which may be marked as partially specified via PARTIAL-VERSION?.
Return the package name and version number extracted from NAME+VERSION.
Like `gnupg-verify', but try downloading the public key if it's missing. Return two values: 'valid-signature and a fingerprint/name pair upon success, 'missing-key and a fingerprint if the key could not be found, and 'invalid-signature with a fingerprint if the signature is invalid.
KEY-DOWNLOAD specifies a download policy for missing OpenPGP keys; allowed values: 'auto', 'always', 'never', and 'interactive' The default policy is auto, which automatically selects the interactive policy when a TTY is connected to the standard input, or the always policy otherwise. Return a fingerprint/user name pair on success and #f otherwise.
If STATUS denotes a missing-key error, then return the fingerprint of the missing key or its key id if the fingerprint is unavailable.
Verify signature SIG for FILE against the keys in KEYRING. All the keys in KEYRING as assumed to be "trusted", whether or not they expired or were revoked. Return a status s-exp if GnuPG failed.
If STATUS, as returned by `gnupg-verify', denotes a good signature, return a fingerprint/user pair; return #f otherwise.
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.