chak10/weather-converter
A library for weather-related conversions.
时间：2024-11-08 21:01
jcbontemps/phylogenetictree
Compute phylogenetic trees from distance matrix using BioNJ algorithm. It produce Newick file and Weighted newick if needed. There is also a render using Equal-angle algorithm and SVG output for testing. It's recommended to use a JS render like 'phylotree.js' (demo of phylotree.js here http://phylot
时间：2024-11-06 00:17
rustamalihussaini/weight-conversions
This is my package weight-conversions
时间：2024-11-03 07:05
evansmwenda/weight-conversions
This is my package weight-conversions written in PHP
时间：2024-10-14 18:34
adrian-cid/julian-converter
A PHP library for converting dates between the Gregorian calendar and Julian dates, with support for time precision down to seconds. Ideal for date manipulations, calendar conversions, and astronomical calculations.
时间：2024-10-03 15:07
lounisbou/php-distance
A PHP library for calculating the distance between two geographical points on Earth using various Earth radius values.
时间：2024-09-24 07:55
albertoroldanq/weight-conversions
PHP package to perform weight conversions
时间：2024-08-25 14:33
tok3/weight-conversions
Packagetest weight-conversions
时间：2024-08-16 10:28
bakhodirov/weight-conversions
Weight conversions app using php
时间：2024-08-04 11:56
internetguru/laravel-smart-redirect
A configurable Laravel 11 middleware package that handles URL redirection based on defined routes and uses Levenshtein distance to find the closest matching route for 404 errors.
时间：2024-07-31 06:38
alkauni/distance-coordinate-calculator
A Package to calculate the distance between two coordinate points
时间：2024-07-26 15:13
designbycode/fuzzy-search
The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.
时间：2024-07-20 18:30
designbycode/levenshtein-distance
The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.
时间：2024-07-20 18:14
iproat/helpers
Helper Snippets for simple math calculations and conversions.
时间：2024-07-15 05:05