3 مستودعات
Tools for automatic batch processing and broadcasting across multidimensional arrays.
Distinguishing note: Focuses on automatic axis mapping, distinct from manual loop-based array processing.
Explore 3 awesome GitHub repositories matching data & databases · Array Vectorization Utilities. Refine with filters or upvote what's useful.
This project is a high-performance numerical computing library designed for large-scale scientific and machine learning workloads. It functions as an automatic differentiation framework and a just-in-time compilation engine, transforming high-level Python code into optimized machine instructions. By enforcing pure functional programming patterns and immutable array semantics, the library ensures that mathematical functions remain compatible with automated graph transformations and symbolic differentiation. The platform distinguishes itself through its distributed array computing capabilities,
Maps operations over array axes automatically to enable efficient batch processing and broadcasting across multidimensional data structures.
Shapely is a geometric analysis library for the manipulation and analysis of planar geometric objects. It functions as a computational geometry toolkit, a spatial predicate engine for evaluating topological relationships, and a vectorized geometry processor. The library distinguishes itself through a vectorized geometry processor capable of executing operations across coordinate arrays with multi-threaded parallel processing. It utilizes prepared geometry optimization to accelerate repeated containment and intersection tests and implements R-tree spatial indexing for efficient nearest-neighbo
Provides a vectorized geometry processor that executes operations across coordinate arrays with multi-threaded parallel processing.
Shapely is a library for the manipulation and analysis of planar geometric objects, serving as a Python wrapper for the GEOS C++ engine. It provides a framework for calculating geometric properties, evaluating spatial relationships, and performing topological predicates within a Cartesian plane. The project distinguishes itself through a vectorized geometry processor capable of executing spatial operations across large arrays of shapes to increase throughput. It also includes a spatial indexing system based on R-trees to accelerate the retrieval of intersecting geometries and nearest neighbor
Executes spatial operations across contiguous blocks of memory to reduce interpreter overhead for large datasets.