Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?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 webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Package levenshtein is a Go implementation to calculate Levenshtein Distance. The library is fully capable of working with non-ascii strings. But the strings are not normalized. That is left as a user-dependant use case. Please normalize the strings before passing it to the library if you have such a requirement.
This package provides the mocking framework for the Golang. It integrates well with Golang's built-in testing package, but can be used in other contexts too.
This package implements a doubly linked list based on container/list.
This package provides a golang wrapper for parsing gocui keybindings.
Package str is a comprehensive set of string functions to build more Go awesomeness. Str complements Go's standard packages and does not duplicate functionality found in `strings` or `strconv`.
Litter is provided by
Package orderedmap implements an ordered map, i.e. a map that also keeps track of the order in which keys were inserted.
It offers the following features:
optimal runtime performance (all operations are constant time)
optimal memory usage (only one copy of values, no unnecessary memory allocation)
allows iterating from newest or oldest keys indifferently, without memory copy, allowing to break the iteration, and in time linear to the number of keys iterated over rather than the total length of the ordered map
supports any generic types for both keys and values. If you're running go < 1.18, you can use version 1 that takes and returns generic interfaces instead of using generics
idiomatic API, akin to that of container/list
support for JSON and YAML marshalling
This package provides a GraphQL client and code generator for Go.
This is a library for performing OAuth Device flow and Web application flow in Go client apps.
This package provides helpers such as map, find, contains and filter, it's an alternative implementation of standard reflect module.
Package jsonschema uses reflection to generate JSON Schemas from Go types.
Features:
supports arbitrarily complex types, including interface, maps, slices, etc.
supports json-schema features such as minLength, maxLength, pattern, format, etc.
supports simple string and numeric enums
supports custom property fields via the jsonschema_extras struct tag
This package is a modified clone of github.com/invopop/jsonschema for purpose of LazyGit project.
Package shlex provides a simple lexical analysis like Unix shell.
Package brenda is a boolean expression solver for Go AST
This package provides a Go module that provides a safer alternative to exec.LookPath() on Windows.
This package provides an alternative implementation of standard encoding/json with higher performance.
Package easyjson provides a fast and easy way to marshal/unmarshal Go structs to/from JSON without the use of reflection.
Package toml is a TOML parser and manipulation library.
Package xdg impelements the XDG standard for application file locations.
Package cobra is a commander providing a simple interface to create powerful modern CLI interfaces. In addition to providing an interface, Cobra simultaneously provides a controller to organize your application code.
Build Go code from arbitrary value in Go.
This package provides a git implementation in pure Go. It's a modified fork of original go-git/go-git project.
Package flaggy is a input flag parsing package that supports recursive subcommands, positional values, and any-position flags without unnecessary complexeties.
This package converts Markdown into Roff Man pages.
This package provides functionality for killing processes across different platforms. Handles killing children of processes as well as the process itself.