Search Results for "data structures c" - Page 2
Sort By:
Showing 244 open source projects for "data structures c"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
$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
Depeche
Java database mapper
Depeche enables you to work with databases using data structures. It strives to be very simple and easy to use, avoiding both the tediousness of using JDBC directly and the heaviness of a full-blown ORM. It currently supports PostgreSQL, MySQL, H2, SQLite, MS SQL Server and FileMaker; support for other databases can be added easily. A simple ORM based on Depeche is also under development. -
2
ConceptBase.cc
A Database System for Metamodeling and Method Engineering
ConceptBase.cc is a multi-user deductive and object-oriented database system for metamodeling and method engineering. Includes a graphical client that builds upon the logic-based features of the ConceptBase.cc server. The data model is O-Telos. ConceptBase.cc can represent information at the data level (example data, traces of process executions etc.), the class level (schemas, process definitions etc.), the metaclass level (constructs of modeling languages), the meta-metaclass level... -
3
a sed like script language for parsing context free languages. the language implements a virtual machine which is appropriate for parsing and transforming context free languages. an implementation in c++ is nearing completion (apr07)
-
4
OpenDDS
OpenDDS is open source publish/subscribe middleware
OpenDDS is an open source implementation of the Object Management Group (OMG) Data Distribution Service (DDS), providing a publish/subscribe middleware solution for real-time distributed systems. OpenDDS includes development and run-time tools. Full product information, source code, documentation, build instructions, and license information are available from http://www.opendds.org. Commercial consulting, support, and training for OpenDDS are available. OpenDDS is in production use... -
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
-
5
eCxx
A C++ library for AVR and NodeMCU
NOTE: This project is marked with 'Status: Abandoned' on SourceForge because not enough time can be dedicated to this project. However it may still get sporadic commits to the repository. eCxx is a library for AVR and NodeMCU tailored for micro LED displays and lighting effects. eCxx is utilizing Makefile build system. Java and Python based applications/tools are also included to ease the development and debugging process using the host PC. On one side, eCxx supports the original... -
6
CloudI is an open-source private cloud computing framework for efficient, secure, and internal data processing. CloudI provides scaling for previously unscalable source code with efficient fault-tolerant execution of ATS, C/C++, Erlang/Elixir, Go, Haskell, Java, JavaScript/node.js, OCaml, Perl, PHP, Python, Ruby, or Rust services. The bare essentials for efficient fault-tolerant processing on a cloud!
-
7
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. -
8
The Related Values Processing Framework helps the integration of Process Control Data Historian Systems.
-
9
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. -
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.
-
10
Eclipse Portable [4.6–4.26]
Portable version of the multifunctional development platform Eclipse.
With this portable version of Eclipse, you can develop software directly from your removable mass storage device, even without admin rights. To get started, please visit the Eclipse Portable wiki: https://sourceforge.net/p/eclipse-neon-portable/wiki GitHub: https://github.com/Berny23/eclipse-portable Thank you for over 180,000 Downloads! Please note: A few months ago, I completely switched to Linux (now Arch btw). So, I'll be no longer active creating portable apps for Windows. -
11
Lnkdlst
Single sided linked list (kind of lib with test-code, C, C++ and java)
Use own (user) data section for each Linked-List-Element (LLEl) including a fix Identifier which is for search via basic Lnkdlst function (fast ID-part-search, e.g. to find all elements with a specific bit in the ID set). Main list-linkage-change functions: append, insert, delete. - Examples: use of flexible variable ArgList (OnePointerArg, optional valid if not NULL, Argument-Type by ID-Number is easy to get), key-value pairs, build FIFO{queue}/LIFO{stack}, auto-list with max.... -
12
Cyclops
An advanced platform for writing functional applications in Java 8
...Structural Pattern Matching API (deconstruct algebraic product and sum types). Improved type safety via the removal of unsafe APIs -- E.g. Unlike Optional, Option has no get method (which could throw a null pointer) -- New data structures do not support operations that would throw exceptions (you can't call head on an empty list for example). Eager and Lazy alternatives for most datastructures (Option is eager, Maybe is lazy + reactive). Improved naming of types (Function1-8 rather than Fn1-8, Either not Xor). Group id is changed to com.oath.cyclops. Versioning between cyclops-react and cyclops is merged on cyclops versioning scheme (version 10 = Cyclops X). -
13
CAT
CAT is the basic component of the server project
...In addition to metrics, it enables tracing—propagating context across RPC boundaries so problems like latency spikes or failed calls can be traced end-to-end. Alert rules and anomaly detection can be defined to notify teams proactively. The system supports multiple data backends and ingestion pipelines to collect data from JVM, C/C++, Python, and other ecosystems. With the collected data, Cat supports analysis of hotspots, trending anomalies, and capacity planning to drive continuous reliability improvements. -
14
Unified Code Generation
Open-source code generator for Simulink/Stateflow
This project provides an open-source framework for the generation of high quality source code which is suitable for safety-critical applications and certification (e.g DO-178B). Currently a Simulink and Stateflow front-end and a C-language back-end are included. Some of the strengths of UCGN: - Clearly readable source-code - Separation of functionality and parameters ("tunable parameters") - Robust data storage (compile-time static structures in favor of pointer run-time constructs) - Clear software architecture, direct correspondence to the model architecture - Separation of reusable library code - Simplicity and uniformity of software interfaces (for testing etc.) ... -
15
JWebAssembly
Java bytecode to WebAssembly compiler
...The project supports a subset of the Java standard library and focuses on enabling practical execution of Java programs in web contexts. It provides tools for handling memory management, method calls, and data structures within the constraints of the WebAssembly runtime. Developers can use JWebAssembly to port existing Java applications to the web or build new applications that leverage Java’s ecosystem while targeting Wasm. The compiler also supports integration with build tools and workflows, making it accessible for typical Java development pipelines. -
16
NestProfessor Programmer Edition
Nesting SDK, Library
This is a SDK which can nest/layout the part/geometry/polygon on the material or sheet intelligently, you can get the best utilization of the materials, this SDK also support read/write DXF/DWG files and part-in-part nesting. New nesting lagorithm is implenmented, more good to support true shape part or material. -
17
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. ... -
18
AWS Greengrass Core SDK for Java
Greengrass Java SDK
The AWS Greengrass Core SDK for Java enables Java developers to develop Lambda functions which will run within Greengrass. This document provides instructions for preparing your Greengrass Core environment to run Lambda functions written in Java. It also includes examples on how to develop a Lambda function in Java as well as packaging and running an example Hello World file in Java for your Greengrass core. Stream manager supports automatic data export to AWS S3 and AWS IoT SiteWise,... -
19
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. -
20
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. ... -
21
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, &... -
22
Makani
Makani was developed a commercial-scale airborne wind turbine
Makani was an ambitious Google X project that sought to harness wind energy using airborne wind turbines — autonomous kites capable of generating power while flying in crosswind patterns. This open-source repository contains the complete software stack that powered Makani’s research and flight systems, including the flight simulator, autopilot controller, avionics firmware, visualization tools, and ground control software. The software enables simulation, control, and analysis of the Makani... -
23
Pretty Damn Quick (PDQ) analytically solves queueing network models of computer and manufacturing systems, data networks, etc., written in conventional programming languages. Generic or customized reports of predicted performance measures are output.
-
24
ebfformat
An Efficient Binary data Format
EBF, which stands for Efficient Binary Format, is a binary file format for reading and writing binary data easily. Reading writing routines are currently available in C,C++,Fortran,Java, Python, IDL, MATLAB. A program called ebftkpy which has a set of utility functions to work with the .ebf files , e.g., viewing the contents and getting a summary, is also provided. The EBF specification is designed to be concise and easy to understand to make it easier for others to write their own code if needed. ... -
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. ...
