Search Results for "data structures" - Page 7
Sort By:
Showing 388 open source projects for "data structures"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
$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
OpenAPI-to-GraphQL
Translate APIs described by OpenAPI Specifications (OAS) into GraphQL
...The Command Line Interface (CLI) provides a convenient way to start a GraphQL server wrapping an API for a given OpenAPI Specification. Use OpenAPI-to-GraphQL as a library in your application to generate GraphQL schemas. The GraphQL interface is created around the data definitions in the given OAS, not around the endpoints, leading to a natural use of GraphQL. Nested data Links defined in the OAS are used to create nested data structures, allowing for (deeply) nested queries. Automatic query resolution Automatically generated resolvers translate (nested) GraphQL queries to API requests. Request results are translated back to GraphQL responses. ... -
2
CCM (C# Collections Mapper)
The CCM is a mini ORM, working with the database and C# collections
CCM is a solution for the data management layer in the combination of Sql Server with a C # application. In whole this is a strongly typed entity mapper projecting the application's business logics onto database tables using T-SQL stored procedures. CCM allows you to implement fairly complex data structures in your application, without bothering about difficult and tedious questions of data acquisition and conversion issue, allowing you to pay more attention to the develop of business logic and UI. ... -
3
JS-Sorting-Algorithm
A GitBook online book on sorting algorithms
JS-Sorting-Algorithm is an educational repository and GitBook-style resource about classic sorting algorithms. It explains sorting as a core topic in data structures and algorithms, with attention to internal sorting, external sorting, time complexity, memory usage, and stability. The guide covers ten major sorting methods, including bubble sort, selection sort, insertion sort, shell sort, merge sort, quicksort, heap sort, counting sort, bucket sort, and radix sort. It compares algorithms by complexity classes such as quadratic time, linearithmic time, and linear time. ... -
4
PSD.js
A Photoshop PSD file parser for NodeJS and browsers
psd.js is an open-source JavaScript library (CoffeeScript/JS) for reading and parsing Adobe Photoshop PSD files in both Node.js and web browsers. It reconstructs the document into a DOM-like tree with layers, masks, text metadata, vector information, and pixel data. It enables developers to traverse layer structures, extract flattened or individual image buffers, and integrate PSD assets programmatically in web or backend applications. -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
Towel
Throw in the towel
A .NET library intended to make coding a bit more tolerable, data structures, algorithms, mathematics, metadata, extensions, consoles, and more. -
6
Wasmer PHP
WebAssembly runtime for PHP
...The runtime is designed to execute Wasm modules at near-native speeds while maintaining strong sandboxing guarantees to ensure safety and isolation. Developers can instantiate modules, call exported functions, and interact with memory and data structures from PHP code, enabling hybrid architectures that combine PHP with high-performance compiled languages. The project is particularly useful for extending PHP applications with performance-critical logic written in languages like Rust or C that compile to WebAssembly. It also enables experimentation with portable, secure execution environments within traditional web stacks. -
7
TableView for Android
Powerful Android library for displaying complex data structures
TableView is a powerful Android library for displaying complex data structures and rendering tabular data composed of rows, columns and cells. TableView relies on a separate model object to hold and represent the data it displays. This repository also contains a sample app that is designed to show you how to create your own TableView in your application. -
8
sc
Common libraries and data structures for C
Portable, stand-alone C libraries and data structures. Each folder is stand-alone with a single header/source pair in it. There is no build for libraries, just copy files you want. e.g If you want the logger, copy sc_log.h and sc_log.c to your project. High performance & minimal memory usage. Portability between many operating systems and architectures. Tests with 100% branch coverage and multiple sanitizers. -
9
A compact editor for building XSL templates and testing their transformation with XML documents. Very easy to use. No setup required, excellent tool for XSL authoring and debugging.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
AndroidOfferKiller
Help you get a better offer
AndroidOfferKiller is a curated collection of Android interview resources aimed at helping developers secure stronger job offers. It brings together notes and materials across topics such as Java and JVM basics, Android fundamentals, design patterns, data structures and algorithms, and LeetCode-style problem solutions. The repository also links to deep-dive articles on performance and common pitfalls, for example RecyclerView stutter and optimization strategies, making it a practical study companion rather than just a list of questions. It includes sections about referral channels and hiring information for certain companies, highlighting real-world hiring context in addition to theory. ... -
11
Plugin for secrets management in Helm
A helm plugin that help manage secrets with Git workflow
We store secrets and values in helm_vars dir structure just like in this repository example dir. All this data versioned in GIT. Working in teams on multiple projects/regions/envs and multiple secrets files at once. We have Makefile in our Helm charts repo to simplify install helm-secrets plugin with helm and other stuff we use. Same Makefile used to rebuild all helm charts with dependencies and some other everyday helpers. Encrypting, Decrypting, Editing secrets on local clones, making... -
12
StructPie
A set of C libraries to implement data structures and algorithms
Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision. -
13
BeaEngine 5
BeaEngine disasm project
BeaEngine is a C library designed to decode instructions from 16-bit, 32-bit and 64-bit intel architectures. It includes standard instructions set and instructions set from FPU, MMX, SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, VMX, CLMUL, AES, MPX, AVX, AVX2, AVX512 (VEX & EVEX prefixes), CET, BMI1, BMI2, SGX, UINTR, KL, TDX and AMX extensions. If you want to analyze malicious codes and more generally obfuscated codes, BeaEngine sends back a complex structure that describes precisely the... -
14
Mega Project List
List of practical projects that anyone can solve in any prog language
Mega Project List by Karan Goel is a massive list of practical programming project ideas that anyone can solve in any programming language, organized into logical categories (Numbers, Classic Algorithms, Data Structures, Text, Networking, Web, Files, Graphics & Multimedia, Security, etc.). The concept is simple but powerful: instead of just memorizing algorithms, you pick a project (for example “Binary to Decimal and Back Converter”), implement it in your favorite language, and gradually build a portfolio of varied programming tasks. The repository has been widely referenced as a go-to for developers looking for ideas to practice, build side-projects, or create interview-prep exercises. ... -
15
Essentials
General purpose utilities and hash functions for Android and Java
Essentials is a lightweight collection of high-performance utility classes designed to enhance standard Java and Android development without introducing heavy dependencies. The library focuses on providing efficient data structures and helper utilities that often outperform equivalent components in the standard Java API. It is intentionally minimalistic and is not positioned as a full framework, but rather as a focused toolkit that fills common gaps developers encounter in everyday projects. Essentials emphasizes speed and low footprint, with components such as LongHashMap delivering measurable performance improvements over standard implementations. ... -
16
CyC2018.github.io
Personal knowledge site built with GitHub Pages
This is a personal knowledge site built with GitHub Pages, organizing computer science notes and study materials in a browsable format. It aggregates content across algorithms, data structures, networking, operating systems, databases, and interview preparation into a coherent index. The presentation emphasizes succinct explanations paired with diagrams, tables, or code snippets to speed recall. Because the site is generated from a repository, it benefits from issue tracking, pull requests, and version history, making it easy to update and maintain. ... -
17
Evolutility-UI-jQuery
Model-driven Web UI for CRUD using REST or localStorage
Evolutility-UI-jQuery provides a set of generic Backbone Views to browse, edit, filter, export and chart Backbone models and collections of different structures. With it you can make web applications by configuring views with metadata instead of hand-coding templates, Javascript and CSS. -
18
XML Editor/Validator/Designer with CAMV
CAM XML Editor for XML+JSON+Hibernate+SQL Open-XDX sponsored by Oracle
The CAM editor is the leading open source XML Editor/Validation/Schema toolset for rapidly building / deploying XML /JSON /Hibernate /SQL data /Forms applications. Visual WYSIWYG data design, rule entry wizards + drag & drop dictionary components. Will import, analyze / refactor from XML Schema / JSON. Oracle is a proud enterprise sponsor; with NIEM.gov support. Do SQL data import/map+ Open Data API delivery+ Hibernate JPA + UI Forms/Pencil Makes XSD schema (default, flatten, NIEM, &... -
19
Flat file extractor can be used for reading and parsing different flat file structures and printing them in different formats. ffe is a command line tool developed in GNU/Linux environment and it is distributed under GPL. Project moved to https://github.com/igitur/ffe
-
20
interactive-coding-challenges
120+ interactive Python coding interview challenges
Interactive Coding Challenges is a collection of practice problems designed to strengthen data structures, algorithms, and problem-solving skills. The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. -
21
immutability-helper
Mutate a copy of data without changing the original source
...However, we've provided a simple immutability helper, update(), that makes dealing with this type of data much easier, without fundamentally changing how your data is represented. You can also take a look at Facebook's Immutable.js and React’s Using Immutable Data Structures section for more detail on Immutable.js. You have no way of determining which data has changed since the previous copy has been overwritten. Instead, you need to create a new copy of myData and change only the parts of it that need to be changed. -
22
Forms
An easy way to create, parse and validate forms in node.js
Forms is a Node.js library designed to simplify the creation, validation, and handling of web forms on the server side, providing a structured approach to managing user input. It allows developers to define form schemas using a declarative API, specifying fields, validation rules, and data transformations in a consistent format. The library supports a wide range of input types, including text, numbers, dates, and custom fields, making it adaptable to different application needs. It includes... -
23
Containers for C
ADTs and data structures for C programmers
Macro implementation of containers for C99 programmers, inspired by the STL containers from the C++ standard library. -
24
nodebook
Multi-Lang Web REPL
Useful to practice algorithms and data structures for coding interviews. Nodebook is an in-browser REPL supporting many programming languages. Code's on the left, Console's on the right. Click "Run" or press Ctrl+Enter or Cmd+Enter to run your code. Code is automatically persisted on the file system. You can also use Nodebook directly on the command line, running your notebooks upon change. -
25
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. ...