Get the longest item in an array.
Count the longest repeating streak of a substring
Compare items in two sequences to find a longest common subsequence
Compare items in two sequences to find a longest common subsequence
Find the longest common subsequence.
Get the longest value for the given property from an array of objects, or the longest value in an object. Useful for aligning values for text tables, CLI help, etc.
Zero dependency Metric Longest Common Subsequence implementation in js
Get the longest line length of a string.
Computes the longest prefix string that is common to each path, excluding the base component
A Karma plugin to report which specs take the longest
Left pad a string to align with the longest string in an array
Get the longest common subsequence of two strings as described in https://en.wikipedia.org/wiki/Longest_common_subsequence_problem
A simple utility to do fast longest prefix match in JS.
Implementations for the Longest Common Substring algorithm [O(nm) time]
Cross-browser longest transition getter
Compute the Longest Common Prefix from some strings
Implementation of the longest common subsequence (diff) algorithm.
A JavaScript library to diff two images. Uses the Longest-Common-Subsequence algorithm to allow content to shift.
an implementation of the longest common substring problem
Package implements longest repeated substring for finding the longest repeated string within a text body
This package exports the number `214` and it's name is also two hundred and fourteen characters long which is the longest name currently allowed by the npm registry to see how a name that long would look if you did it.
Get the length of the longest word in a string. It also correctly calculates the length of the words containing ANSI escape codes.
Sorts items in descending order of length.
Longest Common Subsequence in TypeScript
rustgym solutions
Group OpenStreetMap lines based on graph topology and OSM tags
Find a longest increasing subsequence of some input sequence
Random passphrase generator
Rapid checker for the prefix and suffix matching of domain names
Fast in-memory IP prefix routing tables for IPv4 and IPv6. Longest Prefix Match via stride-4 treebitmap, built on ipnetx.
High-performance Adaptive Radix Tree implementation with SIMD optimizations
Take two iterators and yield pairs until both are exhausted.
A compact radix trie for command-line tab completion and longest-prefix matching.
A collection of utility functions and data structures for rust.
Longest increasing subsequence algorithm
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes.
provides longest shortest shell commands
Diff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities to create a simple HTML diff output format and a standard diff-like tool. This is release 2.0, which has significant breaking changes (removal of deprecations and workarounds) and requires at least Ruby 3.2 or higher. See full details in the `CHANGELOG`, but users of diff-lcs should not notice any significant changes to the APIs. ==== To Install:
ORF Finder is a library that with a sequence of nucletotides it finds the all the possible ORFs in the sequence. It will look for a sequence that starts with a start codon and ends with a stop codon. It will default to the beggining of the sequence if it cannot find an ORF long enought with the start codons. It will also use the end of the sequence if no stop codons are present in the sequence reading frame.
Track jobs processed by queue, longest queue time
Checks if you already done today's commit
A RSpec 2.x formatter which shows longest time spec files.
this is the longest description
Consider the noble bamboo. This peculiar member of the Poaceae family has been known to grow to extraordinary lengths without yielding to (mostly) any obstacles. Not unlike bamboo, the i18n translations of a Rails app will continue to grow. As a tenacious stalk of bamboo breaks through a slab of sidewalk, so too will long translations break a UI. I18n:Bamboo monkey patches the Rails I18n module and will force all calls to I18n.translate (I18n.t) and I18n.localize (I18n.l) to return the longest translated or localized value from all available_locales. For obvious reasons, this gem is intended to be used for development purposes only to aid in UI and internationalization/localization testing.
A resonably fast diff algoritm using longest common substrings that can also detect text that has moved
Match strings approximately using multiple algorithms: Levenshtein edit distance, Damerau-Levenshtein with transpositions, Jaro-Winkler similarity, Dice coefficient, Hamming distance, and Longest Common Subsequence. Includes token-based matching, weighted scoring, Soundex and Metaphone phonetic matching, ranked search, and deduplication.
this gem capitalizes every word in a supplied string
Ever wondered which gem takes the longest to install? This plugin will tell you!
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.