Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch 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.
Start Free Trial
MongoDB Atlas runs apps anywhere
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB 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.
Tpl makes it easy to serialize your Cdata using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
Example how to use my class TPluginObject in C++Builder5 projects. Call *.bat, *.exe, *.vbs, *.hta, *.dll as plugins from application events or main menu. Create data base "PluginSampleDB" in MS SQL Server 2005 and Imort ActiveX : ScriptControl
The MemSL for C and C++ includes a complete datastructures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.
AI-powered service management for IT and enterprise teams
Enterprise-grade ITSM, for every business
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
Utility to validate, extract, show and create digital documents included in files with "pk7" and "fp7" extensions such as electronic bills provided by some phone companies in Spain like Movistar and Telefonica.
Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys
A library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a GUI for manipulating and editing of graphs.
Palex is a two-stage biological sequence searching system. Library will contain functions for searching patterns, palindromes and structures in DNA sequence.
New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.
Start 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.
This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.
An implementation of "k-Way Merging" as described in "Fundamentals of DataStructures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
The project will be looking at data (the intention is to begin looking at customer name/address data but this may widen over time) and ways to intelligently detect duplicates using fuzzy matching methods and algorithms.
The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array datastructures as well as some other methods.
The package implements a variety of tools for categorization of multivariate data such as boosted decision trees, bagging and random forest, bump hunting (PRIM), a multi-class learner and others.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and datastructures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
Easy To Use Collection Classes For C And C++
The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.
A LGPL library to handle xml documents in a DOM-like style. It's designed for LOW-performance systems (like embedded ones) and for lightly handle very large documents, automatically speeding up memory management in a user tunable style.
This library is meant to offer an array of general purpose datastructures and algorithms for a multitude of uses. Each structure must be examined for its specific usefulness to be determined. Please see the API documentation for more details.
libPPP is an advanced image compression library. Depending on the content of the image, it uses either PGF (Progressive Graphics File) or PNG (Portable Network Graphics) to compress the image.
Alternative approach to minimum redundancy coding (fixed-length) without using tree datastructures. The main advantages are simplicity and flexibility.
The Tomographic Image Reconstruction Interface of the Universite de Sherbrooke (TIRIUS) is a Qt-based user-interface software for reconstructing 3D images from data generated by real apparatus or generated by the GATE Monte Carlo simulator.