Awesome GitHub RepositoriesInfinite Sequence Processing

This project is a long context inference engine and optimizer designed to process infinite text streams using large language models without memory growth or performance degradation. It serves as a system for maintaining constant memory usage during the generation of text from arbitrarily long input sequences. The implementation utilizes a rolling key-value cache manager and attention sink mechanisms to stabilize the attention process during continuous stream processing. By retaining initial tokens and employing a sliding window of key-value pairs, the system enables constant-time inference an

Swift Algorithms is a library of sequence and collection algorithms for Swift, providing operations for splitting, cycling, combining, and sampling collections with lazy evaluation. It extends Swift's standard library with algorithms that work across all types conforming to Sequence and Collection protocols, enabling efficient data processing without intermediate storage. The library specializes in combinatorial enumeration, generating all possible permutations, combinations, and product sequences from collections for testing and exploration. It also includes utilities for splitting collectio

Lazy.js is a JavaScript library that implements a lazy evaluation model for processing collections and data streams. It defers all computation until iteration begins, building chains of transformations that execute only when values are consumed, avoiding intermediate arrays and buffering. The library wraps data sources into a uniform sequence interface, enabling operations like map and filter to be chained together without materializing intermediate results. The library extends lazy processing beyond simple collections to handle asynchronous data sources, DOM events, strings, and Node.js stre

Toolz is a Python library that implements functional programming utilities for iterable transformation, dictionary manipulation, function composition, and lazy evaluation. It provides a set of pure functions designed to work with Python's built-in data structures, enabling concise and composable data processing workflows. What distinguishes toolz is its support for curried partial application, allowing functions to be incrementally applied and reused. It includes dictionary-centric operations that handle nested structures, and offers iterable chain transformers that combine mapping, filtering

Koka este un limbaj de programare funcțional, tipizat static, care dispune de un sistem de efecte algebrice. Utilizează un sistem de tipuri puternic pentru a verifica corectitudinea programului și a urmări efectele secundare la momentul compilării. Limbajul se distinge printr-un compilator cu numărare de referințe care transformă codul sursă în cod C nativ, eliminând nevoia unui garbage collector de tip tracing. Utilizează actualizări in-place bazate pe percepție pentru a reduce overhead-ul de memorie și folosește recursivitatea pe coadă modulo cons pentru construcția structurilor de date cu spațiu constant. Sistemul oferă o bibliotecă standard cuprinzătoare care acoperă operațiuni numerice cu aritmetică de precizie arbitrară, procesarea șirurilor de caractere cu vizualizări eficiente și modelarea datelor co-inductive pentru structuri infinite. Include, de asemenea, suport integrat pentru profilarea execuției prin eșantionare hardware și un mecanism compozabil pentru gestionarea excepțiilor și a fluxurilor asincrone.