Search Results for "type"
Sort By:
Showing 22 open source projects for "type"
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.
-
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.
-
1
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. ... -
2
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. -
3
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 -
4
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. -
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.
-
5
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. -
6
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 -
7
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.) ... -
8
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. -
9
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. -
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.
-
10
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.
-
11
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... -
12
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
-
13
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. -
14
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.
-
15
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.
-
16
...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...
-
17
A base set of libraries. Boilerplate type code and algorithms. Currently skuttil (Java util & parsing code) and searKit (generic Java search framework).
-
18
-
19
This component is an easing animation value calculator. Easing types: BackEaseIn, backEaseOut, BackEaseInOut, BounceEaseIn, BounceEaseOut, CircEaseIn, CircEaseOut, CircEaseInOut, CubicEaseIn, CubicEaseOut, CubicEaseInOut, ElasticEaseIn, ElasticEaseOu
-
20
This small C package is made of an independent AVL tree library, and of an extension module for Python that builds upon it to provide objects of type 'avl_tree' in Python, which can behave as sorted containers or sequential lists.
-
21
Java Component created to persist and work with trees (it doesn't matter the type of persistence). Based on "Nested Set Model of Hierarchies" by Joe Celko. [Componente Java para persistir y trabajar con árboles (no importa el tipo de persistencia)]
-
22
JBooleanExpression is a simple Java API to evaluate a Boolean String Expression like "!true&&false||true" (parse a Boolean String Expression to a boolean primitive type)
- Previous
- You're on page 1
- Next
