Search Results for "type"
Sort By:
Showing 29 open source projects for "type"
View related business solutions-
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.
-
$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
Zstandard
Zstandard - Fast real-time compression algorithm
Zstandard is a fast compression algorithm, providing high compression ratios. It also offers a special mode for small data, called dictionary compression. The reference library offers a very wide range of speed / compression trade-off, and is backed by an extremely fast decoder (see benchmarks below). Zstandard library is provided as open source software using a BSD license. Its format is stable and published as IETF RFC 8478. The negative compression levels, specified with --fast=#, offer... -
2
TextDistance
Compute distance between sequences
...For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). TextDistance show benchmarks results table for your system and saves libraries priorities into the libraries.json file in TextDistance's folder. ... -
3
Evolutionary Computation Framework
C++ framework for application of any type of evolutionary computation.
ECF is a framework intended for application of any type of evolutionary computation (GA/GP, DE, Clonalg, ES, PSO, ABC, GAn, local search...). It offers simplicity for the end-user (parameterless usage, tutorial) and customization for experienced EC practicioners. -
4
PetoronHash-System
PHASH | post-quantum XOF hashing algorithm | C++20
...Key Features No external dependencies — pure C++20 implementation. Extendable Output (XOF) — supports arbitrary output length (256–8192+ bits). Post-quantum oriented design — ARX-based sponge resistant to Grover-type attacks. Context and salt separation — unique hashing domains for each use-case. Optimized performance — ~120–130 MB/s Comprehensive verification — verify_all.sh performs KAT tests, determinism checks, and performance validation. Verification Script: chmod +x verify_all.sh ./verify_all.sh https://github.com/01alekseev/PetoronHash-System Ivan Alekseev | petoron.org -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
ringBufU
Ring-Buffer library in C, includes support of multithreading
A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only. -
6
DifferenceKit
A fast and flexible O(n) difference algorithm framework
...See also his paper A technique for isolating differences between files released in 1978. It allows all kind of diffs to be calculated in linear time O(n). RxDataSources and IGListKit are also implemented based on his algorithm. The type of the element that to take diffs must be conform to the Differentiable protocol. -
7
Fast stable sorting in Delphi
Routines to sort large arrays of various types, simple and Tobject.
Significant gains in processing times when sorting arrays with structure in the data. Pre-sorted arrays with relatively few modifications may be sorted 20-30 times faster than Delphi's default QuickSort. The project includes a test suite. -
8
StructPie
A set of C libraries to implement data structures and algorithms
...While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. The stack, the tree and the hash table accept int, float and char* data type To look at the python library : https://github.com/mnoorfawi/struct-pie -
9
DEBay
Deconvolutes qPCR data to estimate cell-type-specific gene expression
...The user manual of DEBay: https://sourceforge.net/projects/debay/files/UserManual.pdf Sample data: https://sourceforge.net/projects/debay/files/Test_data/ Citation Information: Vimalathithan Devaraj, Biplab Bose. DEBay: A computational tool for deconvolution of quantitative PCR data for estimation of cell type-specific gene expression in a mixed population. Heliyon, 2020, 6(7), e04489. https://doi.org/10.1016/j.heliyon.2020.e04489 -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
10
mssolutions
Makes magic squares.
...Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. The square type can be input as semimagic, magic, or associative. For successful solutions, CompleteSquareSteps shows the steps of the search. The number exchanges at each step and the intermediate squares are written to files. MagicSquares does not require an input file. MagicSquares (only) also supports concentric and pandiagonal. (Pandiagonal succeeds only for small orders.) ... -
11
Pygorithm
A Python module for learning all major algorithms
...If you are using Python 2.7 use pip instead. Depending on your permissions, you might need to use pip install, user pygorithm to install. To see all the available functions in a module, you can just type help() with the module name as an argument. -
12
√Math Xplorer
Phần mềm toán học dạng Nhập - Xuất | Math App I/O Type
VMath is a free math console. Currently the project is work only with Windows. For other OS please download Wine. -
13
Utah Raster Toolkit
The Utah Raster Toolkit 3.0, patchlevel 2
This is the Utah Raster Toolkit distribution version 3.0 of June, 1990. ~~~ librle.a, image.rle file type support, animation, rletogif, converters, many utilities. RLE format supports a great number of raw inner formats for applications to use, known together as .rle (ie, "stored windowing") ~~~ The Utah Raster toolkit is a collection of programs and C routines for dealing with raster images commonly encountered in computer graphics. -
14
Project CIF(Core Information Foundation)
c++ and c library to help build win32 software and others platforms
...EVS (Enhanced Visual Support) provide COpenFileDialog And CSaveFileDialog. JCM (Joint Core Module) used as base in project. Properly support for a class available TPT (Template Properly Type) and VTM (Value Type Macro). BTS,EVS,JCM,TOM,TPT,VTM are parts of project CIF. CIF5SDK used in project Bytes Counter. Project Core Information Foundation (CIF) is created by Muhammad Arshad Latti. -
15
The JAccumulator package brings the convenient type conversion and ad hoc composition capabilities of Javascript to Java programming structures. JAccumulator is dependent upon the Jupperware (http://jupperware.sf.net) to provide Javascript-like associative list capabilities and the convenience of easy hierarchical construction.
-
16
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over... -
17
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
18
Expressions parser and evaluator
C# classes for parsing and evaluation.
Set of C# classes for expression parsing and evaluation. Expressions may have user-defined operators, user-defined variables of any type, user-defined functions, user-defined classes with methods and properties, object constants, arrays and collections with indexes, assignment to variables and properties of objects. Supports Unicode. Name of variables, functions, methods and properties, string constants may have surrogates, diacritical combining marks. -
19
...This project is open to every Pascal/Delphi programmer who wishes to contribute to the global Pascal knowledge base. Current version (testing 0.9) features : - a reader program : allows users to browse through the code archives, organizes them by type and operating system and updates the archives from multiple XSWAG servers. - a server daemon : maintains a list of archives and provides updates to clients. - a creator program : to quickly make or modify an XSWAG archive file, add/remove sources and update sources info (os, compiler, architecture, contact info, author name, subject).
-
20
Sorting Algorithms
An educational demo of how sorting algorithms work.
This is a small Java swing application that shows different sorting algorithms working on the same set of data. The user can modify the speed of execution and the type of data to sort and execute it step by step. The tooltip of each algorithm's box shows the source code that is executed and a little explanation got from wikipedia. This application is aided to computer science students who want to better understand how the algorithms work. -
21
"UltraQueue" is a library (DLL) project, written in C++. This library is intended to be used for very fast temporary data storage, aquired by any possible source (File, Serial Port, ...). Users can create multiple queues of differrent sizes & types
-
22
ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.
-
23
clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.
-
24
...Its aim is to reduce the amount of similar lines of code needed to do every day tasks in our code by providing an operator chaining tool to perform easy iterations on lists, OGNL evaluation, data type conversion...
-
25
A base set of libraries. Boilerplate type code and algorithms. Currently skuttil (Java util & parsing code) and searKit (generic Java search framework).
