The account book to record the match of order asks and bids.
Get the first path that exists on disk of multiple paths
A tiny, PEG-like system for building language grammars with regexes.
TradeStorage interface to persist trade records from order match engine
TradeStorage interface to persist trade records from order match engine
An easy-to-use wildcard globbing library.
Fast and tiny fuzzy-search utility
chai plugin to match objects and arrays deep equality with arrays (including nested ones) being in any order
Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.
Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.
Match balanced character pairs, like "{" and "}"
Crazy fast http radix based router
A helper to expand CSS selectors into PostHTML matcher objects
Platform byte order.
Platform float word order.
It's a very fast and efficient glob library for Node.js
TradeStorage interface to persist trade records from order match engine
Split a double-precision floating-point number into a higher order word and a lower order word.
Simple, expected, and deterministic best-match sorting of an array in JavaScript
A tiny, efficient fuzzy matcher that doesn't suck
Match balanced character pairs, like "{" and "}"
npm package for https://github.com/google/diff-match-patch
Parses well-formed HTML (meaning all tags closed) into an AST and back. quickly.
Match human-quality input to potential matches by edit distance.
Gekko is a bare-bones order matcher whose task is to accept orders and maintain an order book.
A gem that matches similar json and ignores order
A lightweight rule engine with a declarative DSL for defining conditions and actions. Supports priority-based ordering, rule tagging with selective evaluation, first-match and all-match modes, dry run, conflict detection, serialization, chaining, and per-rule execution statistics.
A improved TrueSkill with correct ranking order Now with Match Quality also fixed error with missing matrix
Dealing with Centra stuff, i.e reading export files, generating summaries, matching orders with Rule orders.
The Ruby 1.8 Enumerable.sort_by method was stable, in that items with matching conditions were preserved in the same order. That's not the case in Ruby 1.9. Some of my code depended on this behavior, and I'm sure I'm not the only one. So here's a stable_sort_by method that preserves the orders of items with matching sort_by values.
See how closely two long, multi-word phrases match each other. Something Like That is asymmetrical, meaning “Azkaban” will match “Harry Potter and the Prisoner of Azkaban” much more strongly than vice versa. Great for ordering search results gathered from diverse sources.
SeedList is designed for Rails-powered tournament engines that need to persist a 1-indexed ordered list of players (ranked low-to-high by skill or past performance) and then match them up appropriately in the first round of a bracket.
== FEATURES/PROBLEMS: * Partial string matching * The algorithm is not particularly performant == SYNOPSIS: require 'goto_string' s = %w(goto_string is a small library that implements a substring matching and ranking algorithm. The matching and ranking is similar to that found in Quicksilver or TextMate) GotoString::Matcher.match('string', s) #=> [["goto_string", "goto_string", 0.679259259259259, [["string", 5]]], ["substring", "substring", 0.461481481481481, [["s", 0], ["tring", 4]]]] An array is returned which contains one entry for each match. Matches are ordered by rank. Each match is itself an array, containing the following elements: [ "original candidate", "matched string", rank, [["substring_1", offset], ["substring_2", offset], ... ] ] You can optionally pass a block to the match method which will get each candidate passed to it. The return value of the block is what will be used for matching. This is so you can pass in arrays of complex objects as candidates: GotoString::Matcher.match( "goto", Project.find(:all) ) do |p| p.name end The resulting matches will contain a reference to the matched string (the project name) as well as the project (the original candidate) == REQUIREMENTS: * None
The test.ai image classification RPC server can listen for requests from this client in order to classify images and even use a Selenium client object to find elements in a webpage matching a certain label
Pure ruby implementation of binary search for Ruby arrays and similiar data structures. Supports ascending and descending sort order, searching for exact and nearest matches, and has a versatile API. Uses linear search for small arrays to make use of the internal cache of moden CPUs.
ssdeep is a program for computing context triggered piecewise hashes (CTPH). Also called fuzzy hashes, CTPH can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.
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.