Morphoide [v0.3.9]
Morphoide It is a dynamic library open source that is easy to use and with good documentation that tries to achieve a more user-friendly experience when programming with the Java programming language.
<!-- https://mvnrepository.com/artifact/io.github.zelechos/Morphoide -->
<dependency>
<groupId>io.github.zelechos</groupId>
<artifactId>Morphoide</artifactId>
<version>0.3.9</version>
</dependency>// https://mvnrepository.com/artifact/io.github.zelechos/Morphoide
implementation group: 'io.github.zelechos', name: 'Morphoide', version: '0.3.9'Just import Morphoide and you are ready to use all the subroutines
import morphoide.Morphoide;
public class Main {
public static void main(String[] args) {
String text = "Morphoide";
// Reverse a string
String reversed = Morphoide.meta(text)
.reverseString()
.morph();
// Output: ediohproM
// Uppercase first character
String capitalized = Morphoide.meta("morphoide")
.upperCaseFirstCharacter()
.morph();
// Output: Morphoide
// Check if string is palindrome
Boolean isPalindrome = Morphoide.meta("radar")
.isCapicua()
.morph();
// Output: true
}
}All Morphoide subroutines use Chaining Method for fast and simple implementation
import morphoide.Morphoide;
import java.util.List;
public class Main {
public static void main(String[] args) {
// Complex string manipulation chain
String result = Morphoide.meta("Morphoide")
.stringDestructionToList() // [M, o, r, p, h, o, i, d, e]
.stringConstruction() // Morphoide
.reverseString() // ediohproM
.upperCaseFirstCharacter() // EdiohproM
.morph();
// Output: EdiohproM
}
}import morphoide.Morphoide;
import java.util.Arrays;
import java.util.List;
public class Main {
public static void main(String[] args) {
List<Integer> numbers = Arrays.asList(5, 2, 8, 1, 9);
// Bubble Sort
List<Integer> sorted = Morphoide.meta(numbers)
.bubbleSort()
.morph();
// Output: [1, 2, 5, 8, 9]
// Quick Sort
List<Integer> quickSorted = Morphoide.meta(numbers)
.quickSort()
.morph();
// Output: [1, 2, 5, 8, 9]
// Merge Sort
List<Integer> mergeSorted = Morphoide.meta(numbers)
.mergeSort()
.morph();
// Output: [1, 2, 5, 8, 9]
// Other available: insertionSort(), selectionSort(), heapSort()
}
}import morphoide.Morphoide;
import java.util.Arrays;
import java.util.List;
public class Main {
public static void main(String[] args) {
List<Integer> sortedList = Arrays.asList(1, 2, 5, 8, 9, 12, 15, 20);
// Binary Search (requires sorted list)
Integer index = Morphoide.meta(sortedList)
.binarySearch(9)
.morph();
// Output: 4 (index of element 9)
// Linear Search
Integer linearIndex = Morphoide.meta(Arrays.asList(5, 2, 8, 1, 9))
.linearSearch(8)
.morph();
// Output: 2
// Jump Search (for sorted lists)
Integer jumpIndex = Morphoide.meta(sortedList)
.jumpSearch(12)
.morph();
// Output: 5
// Interpolation Search (for sorted lists)
Integer interpolationIndex = Morphoide.meta(sortedList)
.interpolationSearch(15)
.morph();
// Output: 6
}
}import morphoide.Morphoide;
import java.util.List;
public class Main {
public static void main(String[] args) {
// Check if number is prime
Boolean isPrime = Morphoide.meta(17)
.isPrime()
.morph();
// Output: true
// Calculate GCD (Greatest Common Divisor)
Integer gcd = Morphoide.meta()
.gcd(48, 18)
.morph();
// Output: 6
// Calculate LCM (Least Common Multiple)
Integer lcm = Morphoide.meta()
.lcm(12, 18)
.morph();
// Output: 36
// Generate Fibonacci sequence
String fibonacci = Morphoide.meta()
.fibonacci(7)
.morph();
// Output: 0, 1, 1, 2, 3, 5, 8
// Prime factorization
List<Integer> factors = Morphoide.meta()
.primeFactorization(60)
.morph();
// Output: [2, 2, 3, 5]
// Sieve of Eratosthenes (find all primes up to n)
List<Integer> primes = Morphoide.meta()
.sieveOfEratosthenes(30)
.morph();
// Output: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
}
}import morphoide.Morphoide;
import java.util.Arrays;
import java.util.List;
public class Main {
public static void main(String[] args) {
// Kadane's Algorithm (maximum subarray sum)
Integer maxSum = Morphoide.meta(Arrays.asList(-2, 1, -3, 4, -1, 2, 1, -5, 4))
.kadaneAlgorithm()
.morph();
// Output: 6 (subarray: [4, -1, 2, 1])
// Collatz Sequence (3n+1 problem)
List<Integer> collatz = Morphoide.meta()
.collatzSequence(10)
.morph();
// Output: [10, 5, 16, 8, 4, 2, 1]
// Pascal's Triangle
List<List<Integer>> pascal = Morphoide.meta()
.pascalTriangle(5)
.morph();
// Output: [[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1]]
// Dutch National Flag Sort (sort 0s, 1s, 2s)
List<Integer> dutchSorted = Morphoide.meta(Arrays.asList(2, 0, 2, 1, 1, 0))
.dutchFlagSort()
.morph();
// Output: [0, 0, 1, 1, 2, 2]
}
}import morphoide.Morphoide;
public class Main {
public static void main(String[] args) {
// Validate password with requirements
Boolean isValid = Morphoide.meta()
.validatePassword("MyP@ssw0rd", 8, 20)
.morph();
// Output: true (has uppercase, lowercase, number, special char, and length 8-20)
// Check specific requirements
Boolean hasUpperAndLower = Morphoide.meta("Password123")
.containsUppercaseAndLowercase()
.morph();
// Output: true
Boolean hasAllRequirements = Morphoide.meta("Pass123!")
.hasUpperLowerNumberAndSpecial()
.morph();
// Output: true
}
}
| Date | Version | Description |
|---|---|---|
| 20/12/2021 | v0.1.4 | Create method separationByTwoPoints() |
| 26/03/2023 | v0.2.0 | Create different subrutines |
| 31/03/2023 | v0.2.2 | The pom.xml was created |
| 09/04/2023 | v0.2.3 | Restructuring the project |
| 17/05/2025 | v0.3.7 | Add new subrutines |
| 02/10/2025 | v0.3.8 | Add Idiom Chaning Subrutine |
| 23/01/2026 | v0.3.9 | Add Sorting, Search, Mathematical & Advanced Algorithms |