awesome-repositories.com
Blog
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektÜber unsRanking-MethodikPresseMCP-Server
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

37 Repos

Awesome GitHub RepositoriesArray Manipulations

Functions for modifying array contents, including sorting, repeating values, and extracting unique elements.

Distinct from Array Element Modifiers: None of the candidates describe general numerical array modifications; they focus on immutable updates, accessors, or specific language syntax.

Explore 37 awesome GitHub repositories matching scientific & mathematical computing · Array Manipulations. Refine with filters or upvote what's useful.

Awesome Array Manipulations GitHub Repositories

Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
  • exaloop/codonAvatar von exaloop

    exaloop/codon

    16,803Auf GitHub ansehen↗

    Codon is an LLVM-based Python compiler and statically typed implementation that translates source code into optimized machine instructions. It functions as a high-performance numerical backend and a GPU computing framework designed to remove runtime overhead. The project implements a compiled alternative to NumPy, translating array logic directly into machine code. It differentiates itself by generating specialized hardware kernels for graphics processors and utilizing static type inference to enable aggressive machine-code optimization. The system provides capabilities for parallel workload

    Implements a high-performance array backend that translates array logic directly into machine code.

    Python
    Auf GitHub ansehen↗16,803
  • adambard/learnxinyminutes-docsAvatar von adambard

    adambard/learnxinyminutes-docs

    12,287Auf GitHub ansehen↗

    This project is a collection of programming language references and syntax cheat sheets designed for rapid developer onboarding. It serves as a library of code-based documentation that uses valid source code files to provide whirlwind tours of various language specifications. The project focuses on programming language learning by providing concise, commented code examples that explain core features and syntax in place. This approach enables developers to quickly grasp language-specific patterns, data types, and execution flow through a consistent reference format. The content covers a broad

    Provides examples of array indexing, modification, and creation using language-specific syntax.

    Markdown
    Auf GitHub ansehen↗12,287
  • gcanti/fp-tsAvatar von gcanti

    gcanti/fp-ts

    11,523Auf GitHub ansehen↗

    fp-ts is a TypeScript library that brings pure functional programming patterns to the language through algebraic data types, type class abstractions, and composable combinators. It provides foundational data types like Option for optional values, Either for typed error handling, and Task for lazy asynchronous computations, all designed to make invalid states unrepresentable and side effects explicit. The library is built on category theory concepts, offering type classes such as Functor, Applicative, Monad, Semigroup, and Monoid with lawful instances for common data structures. The library di

    Converts a collection of effectful computations into a single computation returning a collection of results.

    TypeScriptalgebraic-data-typesfunctional-programmingtypescript
    Auf GitHub ansehen↗11,523
  • toss/es-toolkitAvatar von toss

    toss/es-toolkit

    11,154Auf GitHub ansehen↗

    es-toolkit is a JavaScript utility library and TypeScript data transformation toolset designed as a high-performance alternative to traditional utility suites. It serves as a tree-shakable module library and a compatibility layer for those migrating from legacy dependencies by mirroring established function signatures. The project is specifically optimized for AI code generation, providing structured documentation and specialized skill sets to improve the accuracy and discoverability of its functions for AI coding assistants. Its architecture focuses on a zero-dependency core and modular expo

    Implements functions to combine multiple arrays into one and remove duplicate values.

    TypeScript
    Auf GitHub ansehen↗11,154
  • chefyuan/algorithm-baseAvatar von chefyuan

    chefyuan/algorithm-base

    10,702Auf GitHub ansehen↗

    algorithm-base is an educational library and study guide designed for simulating algorithms and studying data structures. It functions as an execution visualizer that renders step-by-step state changes and pointer updates through animated simulations to illustrate how data movement works. The project distinguishes itself by mapping conceptual logic directly to multi-language source code implementations. It utilizes a comparative analysis framework to evaluate different algorithmic strategies based on stability, time complexity, and space complexity, while organizing problems by underlying mec

    Determines the longest sequence of consecutive ones in binary arrays using sliding window techniques.

    algorithmsbaseinterview-practice
    Auf GitHub ansehen↗10,702
  • lyhue1991/eat_tensorflow2_in_30_daysAvatar von lyhue1991

    lyhue1991/eat_tensorflow2_in_30_days

    9,933Auf GitHub ansehen↗

    This project is a structured learning curriculum and technical reference for mastering deep learning with TensorFlow. It provides a comprehensive guide for building, training, and deploying neural networks, combining theoretical fundamentals with practical implementation examples. The repository distinguishes itself by covering the end-to-end machine learning workflow, from low-level tensor mathematics and linear algebra to the creation of complex model architectures. It includes specific guidance on developing data pipelines for diverse data types, such as images, text, and time-series seque

    Implements merging of multiple tensors through concatenation, stacking, and other array combination methods.

    Pythontensorflowtensorflow-examplestensorflow-tutorial
    Auf GitHub ansehen↗9,933
  • iamseancheney/python_for_data_analysis_2nd_chinese_versionAvatar von iamseancheney

    iamseancheney/python_for_data_analysis_2nd_chinese_version

    8,937Auf GitHub ansehen↗

    This project is an educational resource and a collection of instructional materials for performing data manipulation and statistical analysis using Python. It provides a comprehensive set of guides and code examples for using the Pandas, NumPy, and Matplotlib libraries to analyze structured data. The resource includes a dedicated guide for reshaping, cleaning, and aggregating tabular data and time series via Pandas, alongside a reference for high-performance vectorized operations and linear algebra using NumPy. It also features tutorials for creating publication-quality charts, distribution p

    Extracts subsets of data from arrays using integer indices, slices, or recursive access.

    matplotlibnumpypandas
    Auf GitHub ansehen↗8,937
  • xianhu/learnpythonAvatar von xianhu

    xianhu/LearnPython

    8,484Auf GitHub ansehen↗

    LearnPython is a programming tutorial consisting of a collection of practical code examples used to demonstrate Python language features and programming patterns. It serves as a comprehensive learning resource that implements core language concepts through functional code. The project provides specialized guides and samples covering several key domains. These include asynchronous network programming with event loops and coroutines, data visualization using numerical datasets for 2D and 3D plots, and web scraping for fetching content and automating login flows. It also features instructions on

    Shows how to combine arrays through concatenation and stacking to manage data layouts.

    Jupyter Notebooklearning-pythonpythonpython-flask
    Auf GitHub ansehen↗8,484
  • teivah/100-go-mistakesAvatar von teivah

    teivah/100-go-mistakes

    7,915Auf GitHub ansehen↗

    100 Go Mistakes is a reference book and code review companion that catalogues frequent Go programming anti-patterns and provides corrected implementations for each one. It covers a wide range of common pitfalls, from range loop variable capture and interface nil handling to error wrapping and map iteration randomization, helping developers recognize and avoid these issues in their own code. The project distinguishes itself by offering a structured, example-driven approach to learning idiomatic Go. It covers core design decisions such as when to use pointer versus value receivers, how to apply

    Explains how slicing creates new views sharing the same backing array.

    Gobookchinesedocumentation
    Auf GitHub ansehen↗7,915
  • sharingsource/logicstack-leetcodeAvatar von SharingSource

    SharingSource/LogicStack-LeetCode

    7,495Auf GitHub ansehen↗

    LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

    Solves the equal-average subset partition problem using meet-in-the-middle search.

    algorithminterview-practiceinterview-questions
    Auf GitHub ansehen↗7,495
  • bblanchon/arduinojsonAvatar von bblanchon

    bblanchon/ArduinoJson

    7,176Auf GitHub ansehen↗

    ArduinoJson is a C++ library for parsing and manipulating JSON data and MessagePack binary streams on microcontrollers with limited memory and processing power. It provides the core primitives necessary for embedded data serialization and parsing, enabling devices to exchange structured data over serial or network interfaces. The library is distinguished by its focus on microcontroller memory management, employing strategies such as pool-based allocation, string deduplication, and non-owning string views to minimize RAM usage. It further optimizes for constrained environments by allowing cons

    Transfers values between C arrays and JSON arrays in either direction.

    C++arduinoarduino-libraryc-plus-plus
    Auf GitHub ansehen↗7,176
  • ecrmnn/collect.jsAvatar von ecrmnn

    ecrmnn/collect.js

    6,571Auf GitHub ansehen↗

    collect.js is a dependency-free JavaScript library that provides a fluent, chainable interface for manipulating arrays and objects. It mirrors the Laravel Collection API, offering a consistent set of methods for data transformation across JavaScript and Laravel backend environments. The library stores collection data as plain arrays internally and supports fluent method chaining, where each method returns a new collection instance. The library distinguishes itself by closely replicating the Laravel Collection API in JavaScript, mapping each PHP method to an equivalent JavaScript implementatio

    Implements a cross-join operation that produces the Cartesian product of two arrays.

    JavaScriptcollectionlaravellaravel-collections
    Auf GitHub ansehen↗6,571
  • ibis-project/ibisAvatar von ibis-project

    ibis-project/ibis

    6,574Auf GitHub ansehen↗

    Ibis is a portable Python dataframe library and multi-backend query engine that provides a unified interface for executing data transformations across diverse compute engines. It functions as a Python SQL expression compiler and dialect transpiler, allowing users to define data logic once and execute it across cloud warehouses, embedded databases, and distributed clusters without rewriting code. The project distinguishes itself through a database backend abstraction that decouples transformation logic from the underlying execution engine. It enables polyglot data workflows by mixing raw SQL s

    Allows extracting subsets of an array using index-based range syntax.

    Pythonbigqueryclickhousedatabase
    Auf GitHub ansehen↗6,574
  • processing/processingAvatar von processing

    processing/processing

    6,487Auf GitHub ansehen↗

    Processing is a creative coding environment and Java graphics library designed for writing visual sketches that produce interactive 2D and 3D graphics and animations. It runs on the Java Virtual Machine, using an OpenGL-based hardware-accelerated rendering pipeline, and operates on a sketch-based execution model where programs run as continuous loops of setup and draw functions with event-driven input handling for keyboard, mouse, and window interactions. The environment distinguishes itself as a cross-platform sketch tool that runs visual programs unchanged on desktop, web, Android, and Rasp

    Provides functions for appending, copying, concatenating, sorting, and splicing arrays.

    Java
    Auf GitHub ansehen↗6,487
  • lightbend/configAvatar von lightbend

    lightbend/config

    6,309Auf GitHub ansehen↗

    This is a configuration library for JVM applications that parses HOCON, JSON, and Java properties files into an immutable tree structure. It resolves ${...} placeholders by traversing the configuration tree and falling back to environment variables and system properties, and validates loaded configurations against a reference schema. The library loads configuration from classpath resources, files, URLs, system properties, and environment variables, merging them with priority-based override semantics. It provides typed value access with automatic type coercion, supports dot-path navigation,

    Merges adjacent arrays or objects separated by whitespace into a single structure.

    Javaconfiguration-libraryhoconsupported
    Auf GitHub ansehen↗6,309
  • angus-c/justAvatar von angus-c

    angus-c/just

    6,204Auf GitHub ansehen↗

    Just is a collection of JavaScript utility libraries designed for data manipulation, functional programming, performance optimization, statistical analysis, and string processing. It provides a set of tools for deep cloning, filtering, and transforming complex objects and arrays. The project is structured as a series of zero-dependency modules, allowing utilities to be used independently to minimize bundle size. It implements functional programming patterns including currying, piping, and partial application, and provides execution control through memoization, debouncing, and throttling. The

    Extracts all elements of an array except for the first one.

    JavaScript
    Auf GitHub ansehen↗6,204
  • mandliya/algorithms_and_data_structuresAvatar von mandliya

    mandliya/algorithms_and_data_structures

    6,145Auf GitHub ansehen↗

    Dieses Projekt ist eine umfassende Sammlung von C++-Bibliotheken und Toolkits, die Referenzimplementierungen für Datenstrukturen, Graphenalgorithmen und bitweise Logik bereitstellen. Es dient als C++-Algorithmen-Referenz mit über 180 gelösten Programmieraufgaben und einem spezialisierten Toolkit für Competitive Programming. Das Repository zeichnet sich durch umfangreiche Low-Level-Bibliotheken zur Bit-Manipulation für Paritätsprüfungen, Endianness-Erkennung und XOR-basierte Logik aus. Es bietet zudem eine breite Palette an Referenzlösungen für komplexe algorithmische Herausforderungen in den Bereichen Backtracking, Graphentheorie und dynamische Programmierung. Die Funktionalität umfasst grundlegende lineare und hierarchische Datenstrukturen, einschließlich verketteter Listen, Stacks, Queues und binärer Suchbäume. Es enthält eine vollständige Suite von Graphenalgorithmen für Pfadsuche und Spannbäume, verschiedene Sortier- und Suchmethoden, Matrix-Transformationen sowie Dienstprogramme zur String-Verarbeitung. Darüber hinaus deckt es mathematische Berechnungsfunktionen, verlustfreie Datenkompression und grundlegende kryptografische Chiffren ab.

    Implements array element shifting using a reversal-based algorithm to rotate the sequence.

    C++algorithmbit-manipulationc
    Auf GitHub ansehen↗6,145
  • apache/pinotAvatar von apache

    apache/pinot

    6,098Auf GitHub ansehen↗

    Pinot is a distributed, columnar analytical database designed for high-concurrency, low-latency query processing. It functions as a real-time OLAP datastore, enabling interactive, user-facing analytics by ingesting and querying massive datasets from both streaming and batch sources. The system architecture relies on a centralized controller for cluster coordination and a distributed segment-based storage model to ensure horizontal scalability. The platform distinguishes itself through a hybrid ingestion pipeline that unifies real-time event streams and historical batch data into a single quer

    Performs set operations, sorting, slicing, and element-wise modifications on array-typed data columns.

    Java
    Auf GitHub ansehen↗6,098
  • chainer/chainerAvatar von chainer

    chainer/chainer

    5,919Auf GitHub ansehen↗

    Chainer is an open-source deep learning framework built around define-by-run automatic differentiation, where computation graphs are constructed dynamically during forward execution. This imperative approach allows networks to be built using standard Python control flow, with gradients computed automatically through reverse-mode differentiation on the dynamically recorded graph. The framework supports GPU acceleration through a NumPy-compatible array backend with CUDA and cuDNN support, and provides a pluggable device abstraction that lets users switch between CPU and GPU computation without c

    Runs ndarray and autograd computations in native C++ with a thin Python binding.

    Python
    Auf GitHub ansehen↗5,919
  • teivah/algodeckAvatar von teivah

    teivah/algodeck

    5,819Auf GitHub ansehen↗

    Algodeck is an open-source collection of flash cards designed for reviewing algorithms, data structures, and system design concepts, specifically curated for technical interview preparation. The project organizes knowledge into atomic question-and-answer pairs and incorporates spaced repetition scheduling to optimize long-term memory retention. The flash card catalog covers a broad range of computer science topics, including classic sorting algorithms like quicksort and mergesort, data structure operations for arrays, trees, heaps, tries, and graphs, as well as bit manipulation techniques for

    Reverses the whole array then reverses two sub-sections to shift elements by a given number of positions.

    HTML
    Auf GitHub ansehen↗5,819
Vorherige12Nächste
  1. Home
  2. Scientific & Mathematical Computing
  3. Array Manipulations

Unter-Tags erkunden

  • Array Combinations2 Sub-TagsMerging multiple arrays through concatenation, stacking, or coordinate grid creation. **Distinct from Array Manipulations:** Focuses on combining multiple arrays into one, distinct from modifying the contents of a single array.
  • Array CompactingRemoval of all falsy values from an array to produce a cleaned copy. **Distinct from Array Manipulations:** Specifically focuses on falsy value removal, distinct from general array sorting or repeating values in Array Manipulations.
  • Array Concatenations2 Sub-TagsCombining multiple arrays into a single sequence using associative operations. **Distinct from Array Combinations:** Focuses specifically on concatenation rather than sorting or modification
  • Array DeduplicationRemoving duplicate elements from arrays using optimized algorithms. **Distinct from Array Manipulations:** General purpose deduplication for any array, unlike Duplicate Limiting which only allows up to two occurrences.
  • Array Organization UtilitiesUtilities for shuffling, splitting, and partitioning arrays based on predicates or positions. **Distinct from Array Splitting:** Broadly covers reorganization (shuffling/splitting) beyond just axis-based splitting
  • Array ReshapingChanging the dimensions of an array while preserving its elements. **Distinct from Array Manipulations:** Distinct from Array Manipulations: specifically targets the changing of dimensions (shape) rather than element modification
  • Array Rotations2 Sub-TagsRotating an array by 90-degree increments along a specified plane. **Distinct from Rotated Sorted Array Search:** Handles geometric rotation of the array structure, distinct from searching rotated sorted arrays.
  • Array Slicing1 Sub-TagExtracting subsets of an array based on start, end, or predicate boundaries. **Distinct from Array Manipulations:** Focuses specifically on slicing (subset extraction) as opposed to general content modifications like sorting.
  • Array Splitting4 Sub-TagsDividing an array into multiple sub-arrays along a chosen axis. **Distinct from Array Manipulations:** Focuses on partitioning a single array into multiple arrays, distinct from general content modification.
  • Boundary ExtensionsAdding padding or tiling to expand array dimensions using constants or mirrored values. **Distinct from Array Manipulations:** Focuses specifically on expanding array boundaries, distinct from general content modification like sorting.
  • C-Array SynchronizationBidirectional transfer of data between native C arrays and JSON arrays. **Distinct from Array Manipulations:** Distinct from Array Manipulations: focuses on the synchronization between different data representations (C array vs JSON array).
  • Consecutive Ones Streak DetectionAlgorithms that find the longest run of consecutive ones in a binary array. **Distinct from Array Manipulations:** Distinct from general Array Manipulations: focuses specifically on tracking local and global maxima of consecutive ones in binary arrays.
  • Consecutive Sequence DetectionsAlgorithms that find the longest run of consecutive integers in an unsorted array using set-based lookups. **Distinct from Array Manipulations:** Distinct from Array Manipulations: specifically targets consecutive integer sequences rather than general array modifications.
  • Dimension ExpansionsInserting new axes into an array to increase its dimensionality. **Distinct from Array Insertion Methods:** Specifically handles the addition of new axes (dimensionality), distinct from inserting elements into an existing axis.
  • Identity-Based Array MergingCombining arrays by matching elements based on a unique identity and updating existing records. **Distinct from Unique Array Merging:** Unlike unique array merging which deduplicates, this matches identities to update data from one list into another.
  • Minimum Word Distance Calculations1 Sub-TagAlgorithms for computing the smallest index gap between two specified values in an array. **Distinct from Array Manipulations:** Distinct from general Array Manipulations: specifically computes the smallest index gap between two target values in a linear scan.
  • Shape TransformationsOperations for altering the dimensions, axes, and structural layout of arrays. **Distinct from Array Manipulations:** Focuses specifically on reshaping and transposing rather than sorting or unique element extraction.
  • String and Array ConcatenationsJoining strings or arrays into a single combined result. **Distinct from Array Concatenations:** Combines both string and array joining, whereas the sibling focuses only on arrays
  • Tail ExtractionsUtilities for retrieving all elements of an array except for the first one. **Distinct from Array Manipulations:** Specifically handles the 'tail' operation, whereas Array Manipulations covers general modification and sorting.
  • Unique Array MergingCombining multiple arrays into a single collection while ensuring all elements are distinct. **Distinct from Array Manipulations:** Specific to merging multiple arrays with deduplication, distinct from general array modification.
  • Zero-Dimensional Array HandlingTreating scalars as 0-D arrays to ensure consistent dimensionality operations. **Distinct from Array Manipulations:** Focuses on the semantic treatment of scalars as tensors, distinct from general array modification.