Libraries tagged by distinct on

datajoe/postgresql-distinct-on

0 Favers
3126 Downloads

Provides support for the postgresql specific distinct on feature for Laravel. Compatible with versions 5 through 8.

Go to Download


larahook/distinct-on-pagination

4 Favers
325 Downloads

ORM Multiple distinct() with paginate()

Go to Download


dpolac/twig-only-once

0 Favers
19 Downloads

Twig test which returns true only once per value.

Go to Download


php-coord/php-coord

105 Favers
615062 Downloads

PHPCoord is a PHP library to aid in handling coordinates. It can convert coordinates for a point from one system to another and also calculate distance between points.

Go to Download


akuechler/laravel-geoly

42 Favers
39979 Downloads

Perform fast and efficient radius searches on your Laravel Eloquent models.

Go to Download


netsells/laravel-geoscope

11 Favers
16272 Downloads

GeoScope is a laravel package that allows you to easily perform distance queries and geofencing based on latitudes and longitudes.

Go to Download


tigo/recommendation

76 Favers
7679 Downloads

collaborative filtering recommender systems

Go to Download


fjw/color-compare

13 Favers
6707 Downloads

A library for converting colors (Hex, RGB, HSL, CIELAB (LAB), DIN-99) and calculating color distances based on DIN-99.

Go to Download


chris48s/cakephp-geodistance

5 Favers
7214 Downloads

CakePHP 3 model behavior for querying geocoded data based on distance

Go to Download


internetguru/laravel-smart-redirect

0 Favers
173 Downloads

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.

Go to Download


henrik9999/string-similarity

1 Favers
5018 Downloads

Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Go to Download


designbycode/levenshtein-distance

1 Favers
77 Downloads

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.

Go to Download


bdp-raymon/rhyme-suggester

6 Favers
49 Downloads

rhyme suggester based on phonetics, using edit-distance algorithm

Go to Download


naveed125/geo-distance

1 Favers
22 Downloads

Find distance between two points on earth. Find closest metro area.

Go to Download


vesic/distance-between

0 Favers
7 Downloads

Simple function to return distance between two or possibly one and more distances on the globe.

Go to Download


Next >>