Search Results for "hash"

Essentials is a lightweight collection of high-performance utility classes designed to enhance standard Java and Android development without introducing heavy dependencies. The library focuses on providing efficient data structures and helper utilities that often outperform equivalent components in the standard Java API. It is intentionally minimalistic and is not positioned as a full framework, but rather as a focused toolkit that fills common gaps developers encounter in everyday projects....

Java library with Cryptographic algorithms. Easy to use Crypto algorithms. Works on Windows, Linux, Android. No external lib dependencies, no useless abstractions, no 'crypto provider'. Elliptic curves was borrowed from BouncyCastle and simplified a lot. Most of EC classes are custom algorithms for certain curves. Can be easily deleted if u dont need them. With couple of classes u can parse and construct those ugly ASN.1 structures, look at RSA and EC key formats for example. No...

The rubycollect4j implements all methods refer to Ruby Array, Hash and Enumerable. For further info, please visit http://ruby-doc.org website. For more documentation, please read JavaDoc. With Java 8: // Sort the characters by its frequency based on the word 'Mississippi' case-insensitively RubyArray<String> word = ra("Mississippi".split("(?!^)")); String result = word.map((c) -> { return c.toLowerCase(); }).sortBy((c) -> { return word.count(c); }).uniq().join(); p(result); // "mpis" With Java 6: // Sort the characters by its frequency based on the word 'Mississippi' case-insensitively final RubyArray<String> word = newRubyArray("Mississippi".split("(?!...

...The library includes a singly linked (cons/cddr style) list/stack, an integer trie based indexed list, a 2-3 tree based random access indexed list, a 2-3 tree based map, a hash trie based map, and hash and tree based sets, and sparse arrays. All collections provide immutable Cursor as well as standard Iterator classes for looping through all elements. A utility class provides functional style algorithmic processing of Cursors including foldLeft, foldRight, collect, select, and reject. The 2-3 tree and integer trie classes are optimized for performance and can be used alongside java.util Collections when immutability is needed for safe data sharing.