Search Results for "data structures" - Page 10
Sort By:
Showing 388 open source projects for "data structures"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
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.
-
1
librfc
Public domain implementations of core RFC specifications for C/C++.
librfc is a C/C++ shared library containing public domain implementations of core RFC data structures and algorithms written in C++11. -
2
Software Engineering Environment(SEE) is a general frame to customize and manage information. The default information set is the data for software development. Users can manage tables like Problem Reports, Change Requests, Working Log and Plans, Testing Cases, etc. It is written in servlet and data are saved in XML. Any data structures can be added and customized.
-
3
The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel...
-
4
Core Analyzer
A power tool to debug core dump, memory corruption, optimized code.
The project is now hosted on github: https://github.com/yanqi27/core_analyzer.git Core analyzer is a power tool to debug memory issues. With ever increasing complexity and dataset size of application programs, it is very challenging to find the root cause of a memory bug. Programmers often use debugger to go through many contexts or data objects in order to hunt down a suspicious variable or object. However, the task is boring, prone to error and usually fruitless. By parsing a core dump... -
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.
-
5
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,... -
6
lib_data_io is a set of PHP libraries designed to easily move complex sets of data between PHP array data structures and a variety of sources and destinations including JSON, XML, ICAL, MySQL, HTML, Trac WIKI, text, LDIF, and plot images.
-
7
Algorithms & Data Structures in C++
Algorithms & Data structures in C++
An algorithm is represented by a .h file and placed under include. (one .header file per algorithm.) The demo program for the algorithm demonstration is placed under src. (one demo per algorithm.) After the program passes correctly, please initiate Pull Requests, the code is verified and stored in the library, and the new algorithm implementation is published in the README. TAB = 4 space. set ts=4 in vim. Graph output format is Graphviz Dot format. (the output format of the graph is in dot... -
8
libdry
Public domain implementations of useful data structures for C++14.
libdry is a C++44 shared library containing public domain implementations of data structures and algorithms. -
9
libcutils
Some Useful C-Utilities
Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks -
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
10
Data Structures
Simple library for generic data structures
A simple library containing data structures for C. The structures are designed using "generics"; C does not formally support generics however generics are emulated using a #define macro. -
11
XanLib is a Linux library which provides data structures like hash tables, lists, pipes etc.. Each data structure exposes both synchronized and not synchronized methods.
-
12
DigCC
A simple, easy-to-retarget, C compiler
DigCC is a simple, easy-to-retarget, C compiler. DigCC handles the main features of the C language, including: - complex data types (arrays, structs, and composition thereof) - dynamic structures (lists, trees, graphs, etc) The current version of DigCC targets the DigMIPS processor, and provides a runtime library with I/O and simplified heap handling (malloc/free). -
13
Daabli is a simple cross-platform serialization framework for C++.
-
14
JavaFeedParserCommon
Provides common classes, which can be used to parse news feeds
"JavaFeedParserCommon" is a Java-library, which provides common classes and interfaces, which can be used by projects, which should allow to parse XML-based news feeds, such like RSS- or Atom-feeds. -
15
libcontc
Container library in C.
About Collection of data structures and operations that have been (and will continue to be) implemented in response to need. Container interface, naming and behavior is similar to the STL containers. Algorithm interface is in the spirit of the C standard library search and sort functions. Compatibility ISO C99, ISO C++98, ISO C++11. Performance These are designed to be general purpose, and reasonably efficient in most circumstances. -
16
XML-Parser Library for BR-Automation PLC
Simple to use XML-Parser/Composer Library for B&R Automation PLC (SPS)
The Library xmlio is a simple to use non validating XML-Parser/Composer for B&R Industrial-Automation PLC (B&R SPS). It reads and writes Process-Variables including Structures from and to XML-Files. Easy to use: #include <xmlio.h> /* Write Variable to XML-File */ status = xmlWrite(strName, strFile, strDevice, 0); /* Read XML-File into Variables */ status = xmlRead(strFile, strDevice, ignoreUnknown, &line, &character); -
17
Calculates Natural Product(NP)-likeness of a molecule, i.e. the similarity of the molecule to the structure space covered by known natural products. NP-likeness is a useful criterion to screen compound libraries and to design new lead compounds. Maven dependancy: <dependency> <groupId>uk.ac.ebi.cheminformatics</groupId> <artifactId>NP-Likeness</artifactId> <version>2.1</version> </dependency> Required repository: <repositories> ...
-
18
Minids
Library implementing basic data structures like stacks, queues, etc
C library implementing basic data structures like stacks, queues, binary search trees, etc. -
19
All About Data Structures
Sorting Searching List Template All
This will help a new data structure learner to learn data structures quickly. -
20
Big Sack
Big Sack: A lightweight Java Key/Value store with undo and disk cache.
Big Sack is a Java persistence mechanism that allows storage of key value pairs following the popular Big Data paradigms. Its a very simple and straightforward way to bridge the gap between in-memory data structures and long-term storage. It has the convenience of Java SDK TreeMap and TreeSet classes and is used the same easy way, but it includes rollback through undo logging to checkpoint data so it does not wind up in an unknown state regardless of failures. ... -
21
data2bin
Create structured binary files from XML data.
Need to create binary files with data for Your program, game etc.? Tired of using hex-editor and editing the file manually with the risk of structure-mismatches? Too lazy to reedit complete file after changing structure members order or size? "data2bin" is a utility that takes: 1. Your structures description (you can use integers of different sizes and endiannesses, null-terminated text strings, fixed-size binary strings, structures, arrays...) 2. -
22
NCsvLib is a .NET library for writing 'structured' text files/streams. An example of structured file is CSV (comma separated values), but the library can handle more complex structures. Basically you define a 'schema' that describes size and format of various fields that the library then reads from a data source (ie. database) and writes their values to an output stream (ie. text file or http stream). Its architecture makes possible to use various methods for storing data (ie. on database) and define file schema (default is XML file). ...
-
23
SPARGEL
An opensource Java graph library. Abandoned, ignore.
...Because these maps are an individual implementation depending on the graph datastructure used, they are more memory efficient than using a Java HashMap. Currently spargel is in its early stages, but will soon support more tasks. As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3 -
24
Open Jungo
Open software persistence model
Open Jungo is a flexible entity persistence model that makes it easy to create object-centric components with minimal coding. Unlike most current entity frameworks, Jungo does not require developers to structure their code in any particular way or specify database structures. Open Jungo supports most major proprietary and open source databases as well as well as a built-in highly efficient zero-configuration object-oriented database systems. It requires no external dependencies and... -
25
Construct is a python module for bit-level, symmetrical parsing and building of data structures. Complex constructs are formed by a hierarchy of less-complex constructs, as well as user-defined constructs.