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.
This package contains type stubs and a mypy plugin to provide more precise static types and type inference for SQLAlchemy framework.
Tortoise ORM is an easy-to-use asyncio ORM (Object Relational Mapper) inspired by Django. Tortoise ORM was built with relations in mind and admiration for the excellent and popular Django ORM. It's engraved in its design that you are working not with just tables, you work with relational data.
Sequeler is a native Linux SQL client built in Vala and Gtk. It allows you to connect to your local and remote databases, write SQL in a handy text editor with language recognition, and visualize SELECT results in a Gtk.Grid Widget.
SQLAlchemy-utils provides various utility functions and custom data types for SQLAlchemy. SQLAlchemy is an SQL database abstraction library for Python.
You might also want to install the following optional dependencies:
python-passlibpython-babelpython-cryptographypython-pytzpython-psycopg2python-furlpython-flask-babel
This module provides connection pool implementations that can be used with the psycopg PostgreSQL driver.
TinyDB is a small document oriented database written in pure Python with no external dependencies. The targets are small apps that would be blown away by a SQL-DB or an external database server.
SOCI is an abstraction layer for several database backends, including PostreSQL, SQLite, ODBC and MySQL.
Vnlog (pronounced vanillog) is a toolkit for manipulating tabular ASCII data with labelled fields using regular command-line tools.
Perform basic numeric, textual and statistical operations on plain text files. Designed to work within standard pipelines without additional code.
The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions.
Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function.
Zix is a C library of portability wrappers and data structures. It provides the following components:
ZixAllocator A customizable allocator.ZixBumpAllocator A simple realtime-safe bump-pointer allocator.ZixBTree A page-allocated B-tree.ZixHash An open-addressing hash table.ZixRing A lock-free realtime-safe ring buffer.ZixSem A portable semaphore wrapper.ZixThread A portable thread wrapper.ZixTree A binary search tree.zixgest.h Digest functions suitable for hashing arbitrary data.zix/filesystem.h Functions for working with filesystems.
zix/path.h Functions for working with filesystem paths lexically.
uthash implements a hash table and a few other basic data structures as C preprocessor macros. It aims to be minimalistic and efficient: it's around 1,000 lines of code which, being macros, inline automatically.
Unlike function calls with fixed prototypes, macros operate on untyped arguments. Thus, they are able to work with any type of structure and key. Any C structure can be stored in a hash table by adding UT_hash_handle to the structure and choosing one or more fields to act as the key.
MARISA is a static and space-efficient trie data structure C++ library.
ssdeep computes and matches context triggered piecewise hashes (CTPH), also called fuzzy checksums. It can identify similar files that have sequences of identical bytes in the same order, even though bytes in between these sequences may be different in both content and length.
libcuckoo provides a high-performance, compact hash table that allows multiple concurrent reader and writer threads.
Coucal is an implementation of the Cuckoo hashing algorithm with a stash area using by default the MurmurHash hash function.
liburcu is a user-space Read-Copy-Update (RCU) data synchronisation library. It provides read-side access that scales linearly with the number of cores. liburcu-cds provides efficient data structures based on RCU and lock-free algorithms. These structures include hash tables, queues, stacks, and doubly-linked lists.
The Succinct Data Structure Library (SDSL) is a powerful and flexible C++11 library implementing succinct data structures. In total, the library contains the highlights of 40 research publications. Succinct data structures can represent an object (such as a bitvector or a tree) in space close to the information-theoretic lower bound of the object while supporting operations of the original object efficiently. The theoretical time complexity of an operation performed on the classical data structure and the equivalent succinct data structure are (most of the time) identical.
tllist is a typed linked list C header file only library implemented using pre-processor macros. It supports primitive data types as well as aggregated ones such as structs, enums and unions.
This library contains several hash-map implementations, similar in API to SGI's hash_map class, but with different performance characteristics. sparse_hash_map uses very little space overhead, 1-2 bits per entry. dense_hash_map is very fast, particularly on lookup. sparse_hash_set and dense_hash_set are the set versions of these routines. All these implementation use a hashtable with internal quadratic probing. This method is space-efficient -- there is no pointer overhead -- and time-efficient for good hash functions.
The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations and heaps.
libdivsufsort is a software library that implements a lightweight suffix array construction algorithm. This library provides a simple and an efficient C API to construct a suffix array and a Burrows-Wheeler transformed string from a given string over a constant-size alphabet. The algorithm runs in O(n log n) worst-case time using only 5n+O(1) bytes of memory space, where n is the length of the string.
Cadaver is a command-line client for WebDAV server operations. It supports a variety of WebDAV features and provides an interactive command-line environment with support for file manipulation on remote WebDAV servers.
Radicale is a CalDAV and CardDAV server for UNIX-like platforms. Calendars and address books are available for both local and remote access, possibly limited through authentication policies. They can be viewed and edited by calendar and contact clients on mobile phones or computers.
Radicale intentionally does not fully comply with the CalDAV and CardDAV RFCs. Instead, it supports the CalDAV and CardDAV implementations of popular clients.