Search Results for "data structures" - Page 5
Sort By:
Showing 330 open source projects for "data structures"
View related business solutions-
Save Up to 91% on Cloud Compute With Spot VMsRun batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
1
BAScript
Scripting engine for Pascal compilers.
...Package includes two compilers that translates from a higher-level language to the BAScript language. You should note that BAScript is intended to be lightweight, so it has not mechanisms to handle complex data structures or large amounts of data or code. On the other hand, it has less need for memory and resources than other scripting interpreters. If you need more power you may try PascalScript. -
2
libfc4c
Fast containers for C language
C dynamic containers are missing in the standard, so almost every single project in C uses different implementations. This library is yet another implementation of few basic containers, optimized for speed. A simplified interface to libarchive allows to save the containers in a compressed form. All the containers are 32bit. This greatly improves the performance (up to ~32%) and reduces the memory consumption (up to 41%) on 64bit systems. All the containers are pre-allocating buffers to... -
3
Ring
Simple and flexible programming language for applications development
The Ring is a practical general-purpose multi-paradigm language. The supported programming paradigms are imperative, procedural, object-oriented, declarative using nested structures, functional, meta programming and natural programming. The language is portable (MS-DOS, Windows, Linux, macOS, Android, WebAssembly, Microcontrollers, etc.) and can be used to create Console, GUI, Web, Games and Mobile applications. The language is designed to be simple, small and flexible. Ring is... -
4
Simple components for Ada
A software components library
The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix expression parsing tools. Implementations of some lock-free shared data structures are provided. -
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
5
RDD! USB HID Report Descriptor Decoder
Create C structures from USB HID Report Descriptors
This will read a USB Human Interface Device (HID) report descriptor from the specified input file then attempt to decode it and, optionally, create a C language header file from it. It also does some minimal sanity checks to verify that the report descriptor is valid. The input file can be a binary file or a text file (for example, an existing C header file). If it is a text file, it will concatenate all the printable-hex-like text that it finds on each line (until the first non-hex... -
6
Dominate
Dominate is a Python library for creating and manipulating HTML docs
Dominate is a Python library for creating and manipulating HTML documents using an elegant DOM API. It allows you to write HTML pages in pure Python very concisely, which eliminates the need to learn another template language, and lets you take advantage of the more powerful features of Python. Dominate can also use keyword arguments to append attributes onto your tags. Most of the attributes are a direct copy from the HTML spec with a few variations. Through the use of the += operator and... -
7
towhee
Framework that is dedicated to making neural data processing
Towhee is an open-source machine-learning pipeline that helps you encode your unstructured data into embeddings. You can use our Python API to build a prototype of your pipeline and use Towhee to automatically optimize it for production-ready environments. From images to text to 3D molecular structures, Towhee supports data transformation for nearly 20 different unstructured data modalities. We provide end-to-end pipeline optimizations, covering everything from data decoding/encoding, to model inference, making your pipeline execution 10x faster. ... -
8
Laravel Vue Pagination
A Vue.js pagination component for Laravel paginators
Laravel Vue Pagination is a Vue.js pagination component for Laravel. It provides out-of-the-box components for Bootstrap 4/5 and Tailwind CSS. -
9
javascript-algorithms
JavaScript implementations of computer science algorithms
javascript-algorithms is a repository that implements a comprehensive collection of classic data structures and algorithmic solutions in JavaScript — including sorting, searching, graph algorithms, dynamic programming, and more. It serves as a learning and reference resource for developers wanting to understand how standard algorithms can be expressed in JavaScript, bridging the gap between theoretical algorithm knowledge and practical implementation usable in web or Node.js contexts. ... -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
corlpack
Ada Library for heterogenous vectors
Corlpack consists of a library and tools aiming to simplify and accelerate programming of small, scientific, computational applications. One of the planned features is the loading and saving of a variety of research data into a single generic data structure, that is much like the named list from R, thus removing the need to learn many data access APIs. -
11
Elementary Algorithms
Book of elementary algorithms and data structures
This book introduces elementary algorithms and data structure. It includes side-by-side comparison of purely functional realization and their imperative counterpart. From 2020/12, I started re-writing this book. The PDF can be downloaded for preview (EN, 中文). The 1st edition in Chinese (中文) was published in 2017. I recently switched my focus to the Mathematics of programming, the new book is also available in (github). To build the book in PDF format from the sources, you need the following... -
12
Voy
A WASM vector similarity search written in Rust
Voy is a lightweight WebAssembly-based vector similarity search engine written in Rust that enables semantic search capabilities directly in browser or edge environments. It is designed to operate on embeddings generated from text or other data, allowing applications to perform meaning-based search rather than simple keyword matching. The engine uses efficient data structures such as k-d trees to index vectors and perform fast nearest-neighbor queries, making it suitable for real-time search experiences. One of its key advantages is its extremely small footprint, allowing it to be deployed easily on CDNs or client-side applications without significant overhead. ... -
13
Closure Library
Google's common JavaScript library
...You can pull just what you need from a large set of reusable UI widgets and controls, and from lower-level utilities for DOM manipulation, server communication, animation, data structures, unit testing, rich-text editing, and more. The Closure Library is server-agnostic and is intended for use with the Closure Compiler. The Closure Library serves as the base JavaScript library for many Google products. Now that the Closure Library is open source, more and more developers outside Google are integrating the library in their own projects. ... -
14
Algebird
Abstract Algebra for Scala
Algebird is Twitter’s Apache‑licensed Scala library providing abstract algebra data structures and algorithms, especially for online/streaming aggregation. It includes Monoid, Approximate, HyperLogLog, CMS, BloomFilter, Min/Max, Averaged Value types, supporting efficient distributed aggregation and approximate analytics. -
15
hello-algorithm
Algorithm training for Xiaobai
hello-algorithm is an educational repository designed to teach data structures and algorithms through clear explanations, visualizations, and code examples. It provides a structured learning path that covers fundamental concepts such as arrays, linked lists, trees, graphs, sorting algorithms, and dynamic programming. The project emphasizes understanding over memorization by breaking down complex topics into intuitive explanations supported by diagrams and examples. -
16
Nunjucks
A rich and powerful templating language for JavaScript
A powerful templating engine with inheritance, asynchronous control, and more (jinja2 inspired). You've been looking for a more sophisticated templating engine for JavaScript. Here it is. Rich Powerful language with block inheritance, autoescaping, macros, asynchronous control, and more. Heavily inspired by jinja2. Fast & Lean High-performant. Small 8K gzipped runtime with precompiled templates in the browser. Crazy extensible with custom filters and extensions. Everywhere available in node... -
17
ldetool
Code generator for fast log file parsers
ldetool (Line Data Extraction Tool) is a command-line utility that generates Go code for fast log file parsing. By defining parsing rules, developers can produce efficient parsers tailored to specific log formats, outperforming traditional regex-based approaches. It's particularly useful for processing large volumes of log data. -
18
Fantasy Land Specification
Specification for interoperability of JavaScript algebraic structures
This project specifies interoperability of common algebraic structures like Setoid, Ord, Semigroupoid, Category, Semigroup, Monoid, Group, Filterable, Functor, Contravariant, Apply, Applicative, etc. An algebra is a set of values, a set of operators that it is closed under and some laws it must obey. Each Fantasy Land algebra is a separate specification. An algebra may have dependencies on other algebras which must be implemented. "Value" is any JavaScript value, including any which have the... -
19
Spatie Data Transfer Object
Data transfer objects with batteries included
Spatie Data Transfer Object is a PHP package that offers a strict and type-safe way to transfer data within applications. It ensures data consistency by enforcing declared types and immutability. DTOs are commonly used to encapsulate and validate data structures, especially in service layers and APIs, helping improve code clarity and reducing the risk of bugs from unexpected data shapes. -
20
Moelnir
Heap organised database service (Java library)
Moelnir is a basic database file, addressing variable record data through integer identifiers, which applies heap organisation of its data space. Advantage of Moelnir is that each record is stored in a continuous segment on the file while still record size is limit-less variable and modifiable. There are no data length limits other than the range of a 63-bit unsigned integer. Scalability is limited to 1 - 10 Mio. entries due to non-paging internal structures. -
21
libHX is a C library (with some C++ bindings available) that provides data structures and functions commonly needed, such as maps, deques, linked lists, string formatting and autoresizing, option and config file parsing, type checking casts and more.
-
22
Guide to Technical Interviews
Guided collection and roadmap for preparing technical interviews
This repository is a guided collection and roadmap for preparing technical interviews, covering the gamut from algorithmic challenges and data structures to system design and behavioral preparation. It consolidates resources like interview question lists, practice platforms, mock interview sites, and recommended books or blogs. For individuals targeting big-tech or rigorous interview processes, this acts as a structured study guide rather than a random list of links. The README breaks down preparation into categories — coding problems, system design, mock interview sites — so you can identify gap areas and allocate study time accordingly. ... -
23
JSON Parser
JSON Parser written in C that outputs JSON into D-List list objects
...The JSON data is returned to the caller as a set of hierarchical D-List list objects, that make the data very easy to manage, sort, search or use, and easy to remove when done. Package includes a JSON textural generator which will create JSON grammar data blocks from hierarchical D-List representations of JSON data. The package also includes a variety of support functions to allow C code to easily find, add, and modify JSON values and members in D-List hierarchical structures. -
24
CityHash
Automatically exported from Google code CityHash
...CityHash offers multiple hash sizes—32-bit, 64-bit, 128-bit, and 256-bit variants—with the CRC-based versions leveraging hardware acceleration on CPUs that support SSE4.2 CRC32 instructions. The library emphasizes hashing performance and uniformity rather than cryptographic security, making it ideal for use in data structures like hash tables and distributed systems requiring rapid key lookups. CityHash has been rigorously tested using tools like SMHasher to ensure high-quality mixing and collision resistance across a wide range of inputs. Its speed and portability have made it a popular choice for developers needing dependable, lightweight hash functions. -
25
GoDS
Implementation of various data structures and algorithms in Go
GoDS, which means "Go Data Structures", is an implementation of various data structures and algorithms in Go. It provides a wide variety of containers (Sets, Lists, Stacks, Maps, Trees), sets (HashSet, TreeSet, LinkedHashSet), lists (ArrayList, SinglyLinkedList, DoublyLinkedList), stacks (LinkedListStack, ArrayStack), maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), trees (RedBlackTree, AVLTree, BTree, BinaryHeap), comparators, and iterators. ...
