Search Results for "translator algorithm java"
Sort By:
Showing 23 open source projects for "translator algorithm java"
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.
-
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
1
International Components for Unicode
The home of the ICU project source code
ICU is a mature, widely used set of C/C++ and Java libraries providing Unicode and Globalization support for software applications. ICU is widely portable and gives applications the same results on all platforms and between C/C++ and Java software. ICU is released under a nonrestrictive open-source license that is suitable for use with both commercial software and with other open-source or free software. Convert text data to or from Unicode and nearly any other character set or encoding. ICU's... -
2
SOFAJRaft
A production-grade java implementation of RAFT consensus algorithm
SOFAJRaft is a production-level, high-performance Java implementation based on the RAFT consistency algorithm that supports MULTI-RAFT-GROUP for high-load, low-latency scenarios. With SOFAJRaft you can focus on your business area. SOFAJRaft handles all RAFT-related technical challenges. SOFAJRaft is very user-friendly, which provides several examples, making it easy to understand and use. -
3
[OFFICIAL] tinyfiledialogs C C++ v3.20.1
inputbox password WIN OSX GTK QT Console VCPKG C# Lua R Fortran Pascal
... ASCII UTF-8 - applescript kdialog zenity … ° SSH console / X forwarding / waypipe Wayland ° the dialogs can be forced into console mode ° curses dialogs via Dialog.exe/Dialog (disabled by default) C89/C18 & C++98/C++23 compliant VisualStudio MinGW GCC Clang TinyCC IntelCC OWCC BCC SunCC on Windows Mac Linux Bsd Solaris Minix Raspbian Flatpak bindings: VCPKG C# R Lua Rust Haskell Java AllegroBasic Fortran Pascal D JavaScript Kotlin click tab 'Files' for prototypes -
4
Hashids
A small PHP library to generate YouTube-like IDs from numbers
... is also shuffled based on salt. We need ids to be nice and friendly especially if they end up being in the URL. Therefore, the algorithm tries to avoid generating most common English curse words by never placing the following letters (and their uppercase equivalents) next to each other. There are no collisions because the method is based on integer to hex conversion. As long as you don't change constructor arguments midway, the generated output will stay unique to your salt. -
Secure remote access solution to your private network, in the cloud or on-prem.OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
-
5
PWSLIB3
Password Safe encrypted databases, Java library
Java module to create, read and write Password Safe V3 encrypted databases. The package is a mature offspring from project JPasswords and can be used with Java 1.8. There is an API document available. -
6
QScript
Expression and algorithm evaluator (built with Java)
...-UNITL). All the commonly used functions found in Java's Math class are implemented and can easily be extended with user defined functions. Although the download is packaged as a Processing library it does not require Processing, in fact QScript has no third party software dependencies only needing Java. -
7
Jadecy
Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).
Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31... -
8
TengineKit
TengineKit - Free, Fast, Easy, Real-Time Face Detection
Free, Fast, Easy, Real-Time Face Detection & Face Landmarks & Face Attributes & Hand Detection & Hand Landmarks & Body Detection & Body Landmarks & Iris Landmarks & Yolov5 SDK On Mobile. TengineKit is an easy-to-integrate AI algorithm SDK. At present, it can run on various mobile phones at very low latency. We will continue to update this project for better results and better performance! -
9
AES Everywhere
Cross Language AES 256 Encryption Library
AES Everywhere is Cross Language Encryption Library that provides the ability to encrypt and decrypt data using a single algorithm in different programming languages and on different platforms. This is an implementation of the AES algorithm, specifically CBC mode, with 256-bit key length and PKCS7 padding. It implements OpenSSL-compatible cryptography with randomly generated salt. -
Sales CRM and Pipeline Management Software | PipedrivePipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
-
10
Javaluator
A java infix evaluator based on "Shunting Yard" algorithm.
Evaluate an arithmetic expression is as simple as: Double result = new DoubleEvaluator().evaluate("(e^3-1)*sin(pi/4)*ln(pi^2)"). But Javaluator provides you with much more ... Key features: - Functions support, including variable argument count. - Constants support: e, pi, etc ... - Variables support: Example sin(x) for x = pi/4. - Highly configurable: Reduce the built-in operator or function sets, define your own brackets. - Extensible: Define your own grammar, or extends the... -
11
Elements of Programming Interviews
Method stubs and test cases for Elements of Programming Interviews
This repository contains method stubs and tests of the problems from Elements Of Programming Interviews by Adnan Aziz, Tsung-Hsien Lee, and Amit Prakash. This book is also available in Python and C++. This repository contains solutions to problems from the book "Elements of Programming Interviews," focusing on interview preparation and algorithm practice. -
12
Java DSA extensions
Java datastructures and algorithms extensions
DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm. -
13
Jafaran
Fast and more random implementations of java.util.Random.
Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided... -
14
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 matrices... -
15
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
16
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
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
Java Random Numbers - Random.Org API
Offers Random numbers API for your programs written in Java.
Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service. Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota. It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all... -
19
A library help for signing data with PKCS11 token (certificates with SHA1withRSA Sign Algorithm) and create CMS packages. It uses Bouncy Castle Crypto API and SUNPKCS11. Also it verify the signed data and verify signing certificate's OCSP control.
-
20
The BalanceLine4j Project is an implementation of the Balance Line Algorithm for Java applications. The Balance Line is an algorithm used to make Coordinated Processing and Sequential Updates, that improves performance and saves machine resources.
-
21
LEA is a lightweight eyetracking algorithm library (hence the name) written in and for Java. LEA is able to track eye movements with an ordinary webcam and returns relative movements (up, down, ...). It is also able to compensate for slight head motions.
-
22
ooc is an object-oriented programming language which is implemented with a source-to-source translator to pure C99. It supports classes, abstract functions, foreach, ranges, etc. It intends to be modern, modular, extensible, yet simple and fast.
-
23
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
- Previous
- You're on page 1
- Next
