algorithm icon indicating copy to clipboard operation
algorithm copied to clipboard

Boost.org algorithm module

Results 30 algorithm issues
Sort by recently updated
recently updated
newest added

In [this PR](https://github.com/boostorg/math/pull/255), I use `std::upper_bound` to calculate the empirical cumulative distribution function. However, the principle use of this function is in a quadrature, where each call to the function...

The issue comes from boostorg/compute#817 where `boost::trim()` is invoked to sanitize OpenCL kernel arguments from preprocessor-generated strings. One of the failing cases taken directly from the boost compute repo is...

A new algorithm: longest increasing subsequence that permits as well to find the longest decreasing/non-increasing/non-decreasing or differently ordered subsequence by defining comparison predicate. I have added tests for it using...

Hello. It's implementation of weighted_shuffle algorithm. I think it can be useful for users. Can review it please? And what do you think about shuffle_weighted?

I would add fuzzy search to Boost.Algorithm. First part is adding different cofficients(they are useful for developers). Second part, that will be added later, will contain approximate search algorithms.

Now in Boost.Algorithm we have only 3 algortihms for searching: Knuth-Morris-Prata, Boyer-Moore, Boyer-Moore-Horspool. I want to add more algorithms. Please, if you know something about string search algortihms, i want...

Hi, I have written a new search algorithm: longest increasing substring that permits as well to find the longest decreasing/non-increasing/non-decreasing or differently ordered substring by defining comparison predicate. I have...

This is part of the effort to make the Boost libraries "modular" for build and consumption. See https://lists.boost.org/Archives/boost/2024/01/255704.php and https://github.com/grafikrobot/boost-b2-modular/blob/b2-modular/README.adoc for more information. This PR depends on the following other...

``` std::vector nums = {6,7,8,10,11}; // lost 9 boost::find_gap(nums, 6); // will point to value 10 at index 3 ``` This function is useful for validating sorted data that are...