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 search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Uses a Mirage CLOCK to write timestamped log messages. It can also log only important messages to the console, while writing all received messages to a ring buffer which is displayed if an exception occurs. If tracing is enabled (via mirage-profile), it also writes each log message to the trace buffer.
Xmlm is a streaming codec to decode and encode the XML data format. It can process XML documents without a complete in-memory representation of the data.
This package can automatically generate runtime types from type definitions.
This OCaml library provides an implementation of a mutable doubly-linked list with Lwt iterators.
Ppx_optcomp stands for Optional Compilation. It is a tool used to handle optional compilations of pieces of code depending of the word size, the version of the compiler, ...
Implements arithmetic and logical operations over arbitrary-precision integers. It uses GMP to efficiently implement arithmetic over big integers. Small integers are represented as Caml unboxed integers, for speed and space economy.
Library to perform parallel fold or map taking advantage of multiple core architectures for OCaml programs. Drop-in replacement for these List operations are provided:
List.map->parmapList.map->parfoldList.mapfold->parmapfold
Also it allows specifying the number of cores to use with the optional parameter ncores.
This package generates S-expression conversion functions from type definitions.
Utilities for working with terminal output, such as color printing.
Dedukti is a proof-checker for the λΠ-calculus modulo theory. The λΠ-calculus is an extension of the simply typed λ-calculus with dependent types. The λΠ-calculus modulo theory is itself an extension of the λΠ-calculus where the context contains variable declaration as well as rewrite rules. This system is not designed to develop proofs, but to check proofs developed in other systems. In particular, it enjoys a minimalistic syntax.
Repository contents:
client library, a merge of the Mirage and XCP ones
server library
server instance which runs under Unix with libxc
server instance which runs on mirage.
The client and the server libraries have sets of unit-tests.
Ppx_sexp_message aims to ease the creation of s-expressions in OCaml. This is mainly motivated by writing error and debugging messages, where one needs to construct a s-expression based on various element of the context such as function arguments.
Mccs (Multi Criteria CUDF Solver) is a CUDF problem solver. Mccs take as input a CUDF problem and computes the best solution according to a set of criteria. It relies on a Integer Programming solver or a Pseudo Boolean solver to achieve its task. Mccs can use a wide set of underlying solvers like Cplex, Gurobi, Lpsolver, Glpk, CbC, SCIP or WBO.
Lexer generator for Unicode and OCaml.
This package provides types and operations over dates and times.
This package provides utilities for building unitary testing of interactive program. You can match the question using a regular expression or a timeout.
Ppx_yojson_conv_lib is the runtime library used by ppx_yojson_conv, a ppx rewriter that can be used to convert ocaml types to a Yojson.Safe value.
Pure OCaml regular expressions with:
Perl-style regular expressions (module Re_perl)
Posix extended regular expressions (module Re_posix)
Emacs-style regular expressions (module Re_emacs)
Shell-style file globbing (module Re_glob)
Compatibility layer for OCaml's built-in Str module (module Re_str)
Features:
MAC-48 (Ethernet) address support
Macaddris aMap.OrderedTypeAll types have sexplib serializers/deserializers optionally via the
Macaddr_sexplibrary
This package provides PCRE-based regular expressions support for Mparser.
This package provides two union-find data structure implementations for OCaml. Both implementations are based on disjoint sets forests, with path compression and linking-by-rank, so as to guarantee good asymptotic complexity: every operation requires a quasi-constant number of accesses to the store.
Timed references for imperative state. This module provides an alternative type for references (or mutable cells) supporting undo/redo operations. In particular, an abstract notion of time is used to capture the state of the references at any given point, so that it can be restored. Note that usual reference operations only have a constant time / memory overhead (compared to those of the standard library).
Moreover, we provide an alternative implementation based on the references of the standard library (Pervasives module). However, it is less efficient than the first one.
These libraries provides access to low-level compiler interfaces and the standard higher-level merlin protocol.
Uses the new result type defined in OCaml >= 4.03 while staying compatible with older version of OCaml should use the Result module defined in this library.