Awesome GitHub RepositoriesHigh-Throughput Decompression

Zstandard is a lossless data compression library and archive format designed for high compression ratios and fast real-time processing. It functions as a real-time data compressor and multi-threaded compression engine capable of distributing workloads across multiple CPU cores to increase throughput. The system features a dictionary-based compressor that trains on sample data to improve the compression ratio and speed of small files. It also provides long distance pattern matching to identify repeated sequences across large files. The library covers a broad range of capabilities including st

This project provides a lossless compression algorithm and a byte-oriented compression library designed for high-speed data reduction and maximum decompression speed. It functions as a stream-oriented compression engine, a software library for encoding and decoding data blocks, and a command-line tool for managing interoperable compressed frames. The system distinguishes itself through the use of predefined pattern dictionaries to improve compression ratios for small data sets and small packets. It supports multiple processing modes, including high-speed block compression for minimal latency

Thumbor is a dynamic image processing service and proxy server that resizes, crops, and filters images on demand via URL parameters. It functions as a URL-based image manipulator that generates specific image versions from source assets to optimize web delivery. The system includes a smart cropping engine that uses facial feature detection and computer vision to automatically center thumbnails on the most relevant visual content. To prevent unauthorized parameter tampering and malicious requests, it employs signature-based request validation and domain-based source whitelisting. Broad capabi

Ristretto is a high-performance in-memory cache and concurrent key-value store for Go applications. It provides a thread-safe memory store that manages strict memory bounds and employs probabilistic set filters to reduce lookup overhead. The system is distinguished by an admission-policy cache that utilizes frequency sketches and cost-based eviction to maximize hit ratios. It minimizes contention and improves throughput through the use of striped ring buffers and concurrent map sharding. The project covers a broad range of data management capabilities, including time-based expiration, item f

Snappy is a high-performance lossless compression library implemented in C++. It provides data reduction methods that perfectly restore original information, focusing on system-level efficiency and processing velocity across different platforms. The library prioritizes high-speed data compression and decompression over achieving the maximum possible compression ratio. It is designed for real-time stream compression to reduce bandwidth usage without introducing significant processing latency. The implementation covers high-velocity data shrinking and rapid restoration. It includes resilient d

DiskLruCache is a disk-backed key-value cache library for Android and Java environments that stores data on the filesystem within a configurable byte limit. It uses a least-recently-used (LRU) eviction policy to automatically remove old entries when the cache exceeds its allocated size, and maintains a journal file to reconstruct its in-memory state after a process restart. The cache provides atomic write operations that first write new data to a temporary file before atomically renaming it, preventing partial or corrupted reads during concurrent access. It returns frozen snapshots of cache e

Mozjpeg est une bibliothèque C haute performance pour encoder, décoder et transcoder des images JPEG. Il sert de remplacement binaire compatible et « drop-in » pour les bibliothèques JPEG standard, conservant les signatures de fonction existantes pour améliorer l'efficacité de la compression sans nécessiter de changements dans la logique de l'application. La bibliothèque fonctionne comme un optimiseur d'image qui réduit la taille des fichiers via un encodage progressif sans perte et une optimisation des coefficients. Elle utilise une quantification basée sur le trellis et un traitement accéléré par SIMD pour optimiser le compromis entre la qualité visuelle et la taille du fichier. Ses capacités plus larges incluent un encodage et un décodage d'image complets, la conversion d'espace colorimétrique et le sous-échantillonnage des composants. L'architecture est conçue pour être réentrante et thread-safe, permettant le traitement simultané de plusieurs images. Elle dispose également d'une gestion spécialisée des métadonnées pour gérer les grands profils de couleur ICC via le fractionnement de marqueurs.

webfunny_monitor is an open-source frontend monitoring and analytics platform that tracks page load performance, JavaScript errors, and user behavior. It serves as a comprehensive tool for measuring page load speed, API response times, client-side errors, and custom user events, with real-time dashboards that stream aggregated metrics via WebSocket for sub-second updates. The project distinguishes itself through its architectural approach: events are collected asynchronously via lightweight HTTP beacons and batched before transmission, while a memory-bounded local storage buffer ensures relia

Il s'agit d'une bibliothèque de cache en mémoire thread-safe pour Go qui évince automatiquement les éléments les moins récemment utilisés (LRU) lorsque la capacité est atteinte. Elle fournit un cache mémoire de taille fixe conçu pour maintenir une empreinte mémoire constante en supprimant les entrées les plus anciennes à mesure que de nouvelles données arrivent. Le système inclut un gestionnaire d'éviction qui exécute des callbacks personnalisés lorsque les entrées sont purgées pour faciliter le nettoyage des ressources. Il prend également en charge l'expiration basée sur le temps, permettant la suppression automatique des éléments après une durée de vie spécifiée (TTL). La bibliothèque couvre les capacités générales de mise en cache, incluant l'inspection du cache pour vérifier l'existence de clés, la purge complète du cache et des stratégies pour optimiser les taux de succès en empêchant les nouvelles rafales de données de déplacer les éléments fréquemment consultés. Toutes les opérations de lecture et d'écriture sont synchronisées pour permettre un accès concurrent à travers plusieurs routines.