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.
Add the given TREE to the store on SERVER. TREE must be an entry such as:
("my-tree" directory ("a" regular (data "hello")) ("b" symlink "a") ("c" directory ("d" executable (file "/bin/sh"))))
This is a generalized version of 'add-to-store'. It allows you to reproduce an arbitrary directory layout in the store without creating a derivation.
Import the set of store paths read from PORT into SERVER's store. An error is raised if the set of paths read from PORT is not signed (as per 'export-path #:sign? #t'.) Return the list of store paths imported.
Assimilate PORT, an input/output port, and return a connection to the daemon, assuming the given protocol VERSION. If BUILT-IN-BUILDERS is provided, it should be a list of strings and this will be used instead of the builtin builders provided by the build daemon.
Warning: this procedure assumes that the initial handshake with the daemon has already taken place on PORT and that we're just continuing on this established connection. Use with care.
Return #t when PATH designates a valid store item and #f otherwise (an invalid item may exist on disk but still be invalid, for instance because it is the result of an aborted or failed build.)
An exception is raised if PATH is not prefixed by the store directory (/gnu/store).
Return an output path for the fixed output OUTPUT defined by HASH of type HASH-ALGO, of the derivation NAME. RECURSIVE? has the same meaning as for 'add-to-store'.
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.
Connect to the daemon at URI (a string), or, if PORT is not #f, use it as the I/O port over which to communicate to a build daemon.
When RESERVE-SPACE? is true, instruct it to reserve a little bit of extra space on the file system so that the garbage collector can still operate, should the disk become full. When CPU-AFFINITY is true, it must be an integer corresponding to an OS-level CPU number to which the daemon's worker process for this connection will be pinned. If NON-BLOCKING?, use a non-blocking socket when using the file, unix or guix URI schemes. If BUILT-IN-BUILDERS is provided, it should be a list of strings and this will be used instead of the builtin builders provided by the build daemon. A default BUFFER-SIZE of 8192 is used. Return a server object.
Return the names of the supported built-in derivation builders supported by STORE.
Return the package name part of PATH, a file name in the store.
Verify the integrity of the store and return false if errors remain, and true otherwise. When REPAIR? is true, repair any missing or altered store items by substituting them (this typically requires root privileges because it is not an atomic operation.) When CHECK-CONTENTS? is true, check the contents of store items; this can take a lot of time.
Return the list of live store paths---i.e., store paths still referenced, and thus not subject to being garbage-collected.
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.