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 true if ITEM has a valid syntax as the basename of a store item.
Return the requisites of PATHS, including PATHS---i.e., their closures (all its references, recursively).
Return the name of FILE once interned in the store. Use NAME as its store name, or the basename of FILE if NAME is omitted.
When RECURSIVE? is true, the contents of FILE are added recursively; if FILE designates a flat file and RECURSIVE? is true, its contents are added, and its permission bits are kept.
When RECURSIVE? is true, call (SELECT? FILE STAT) for each directory entry, where FILE is the entry's absolute file name and STAT is the result of 'lstat'; exclude entries for which SELECT? does not return true.
Return as a monadic value the absolute file name in the store of the file containing TEXT, a string. REFERENCES is a list of store items that the resulting text file refers to; it defaults to the empty list.
Return the build log file for DRV, a derivation file name, or #f if it could not be found.
Make the symlink FILE-NAME an indirect root for the garbage collector: whatever store item FILE-NAME points to will not be collected. Return #t on success.
FILE-NAME can be anywhere on the file system, but it must be an absolute file name--it is the caller's responsibility to ensure that it is an absolute file name.
Add the contents of FILE-NAME under BASENAME to the store and return its store file name. When RECURSIVE? is false, FILE-NAME must designate a regular file--not a directory nor a symlink. When RECURSIVE? is true and FILE-NAME designates a directory, the contents of FILE-NAME are added recursively; if FILE-NAME designates a flat file and RECURSIVE? is true, its contents are added, and its permission bits are kept. HASH-ALGO must be a string such as "sha256".
When RECURSIVE? is true, call (SELECT? FILE STAT) for each directory entry, where FILE is the entry's absolute file name and STAT is the result of 'lstat'; exclude entries for which SELECT? does not return true.
Apply PROC over each element of LST, accumulating 'build-things' calls and coalescing them into a single call.
CUTOFF is the threshold above which we stop accumulating unresolved nodes.
Run MVAL, a monadic value in the store monad, in STORE, an open store connection, and return the result.
Return #t if PATH is a derivation path.
Export the store paths listed in PATHS to PORT, in topological order, signing them if SIGN? is true. When RECURSIVE? is true, export the closure of PATHS---i.e., PATHS and all their dependencies.
START, PROGRESS, and FINISH are used to track progress of the data transfer. START is a one-argument that is passed the list of store items that will be transferred; it returns values that are then used as the initial state threaded through PROGRESS calls. PROGRESS is passed the store item about to be sent, along with the values previously return by START or by PROGRESS itself. FINISH is called when the last store item has been called.
Close the connection to SERVER.
Return a procedure of two arguments to record cache lookups, hits, and misses for COMPONENT. The procedure must be passed a Boolean indicating whether the cache lookup was a hit, and the actual cache (a vhash).
Return an output path for OUTPUT (the name of the output as a string) of the derivation called NAME with hash HASH.
Remove the permanent garbage collector root pointing to TARGET. Raise an error if there is no such root.
Return the cache of STORE identified by CACHE, an identifier as returned by 'allocate-store-connection-cache'.