Search Results for "match"

YAPF is a Python code formatter that automatically rewrites source to match a chosen style, using a clang-format–inspired algorithm to search for the “best” layout under your rules. Instead of relying on a fixed set of heuristics, it explores formatting decisions and chooses the lowest-cost result, aiming to produce code a human would write when following a style guide. You can run it as a command-line tool or call it as a library via FormatCode / FormatFile, making it easy to embed in editors, CI, and custom tooling. ...

...Rather than being a single monolithic library, this repository provides a series of self-contained examples showing how different population-based search methods solve optimization problems and adapt candidate solutions over generations. Users can explore basic genetic algorithm setups, match phrase examples, pathfinding challenges, and microbial GA variants, as well as evolution strategy approaches like NES. The project also links classical evolutionary approaches with neural networks, illustrating how evolution can be used for model training in reinforcement learning and supervised contexts.

S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms.

...Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other.

A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

Let P be a 2D point expressed in a plane area defined by four 2D points A,B,C,D. The aim of our C++ class is to express the coordinates of P in order to match when A,B,C,D is rectified as a rectangle. A demo application shows the use of the C++ class.

Multi-platform regular expression (regex) creation. Highlights regex matches, and regex groups for quick regular expression creation. Save/load regular expression sessions. Create robust regex patterns on any major platform. Supports PCRE and wxRegEx.

A dictionary based compressor, that is is different from Lempel Ziv encoding that it doesn't use match lengths and does not need perfect matches.